diff --git a/research/p104-reader-ceiling/CHECK.txt b/research/p104-reader-ceiling/CHECK.txt new file mode 100644 index 0000000000..57199e7012 --- /dev/null +++ b/research/p104-reader-ceiling/CHECK.txt @@ -0,0 +1,306 @@ +CHECK.txt: fresh build of the 274 new modules of the import closure of Nov15/CongestionReader.lean, Nov15/CongestionReaderW10.lean and Nov15/CongestionReaderW16.lean (324 modules in the closure; 50 are the unchanged modules of #7668 and #7678) +Toolchain leanprover/lean4:v4.33.0-rc1; Mathlib 55b7917b472489c7c56a0fa6393af05cfd536599 (an existing build of that commit, no download). + +METHOD + * Every new module compiled ALONE in dependency order, one lean process at a time: lean -j1 -o out/Nov15/X.olean Nov15/X.lean from lean/, under a 3.5 GB (3,500,000 KB) RSS watcher. + * An output directory holding only the 50 inherited oleans (copied from the builds of #7668 and #7678, sources byte-identical to this package) was FIRST on the module search path, then the pinned Mathlib packages. Each new module imports only modules built in this run or those 50. + * Axioms: the #print axioms lines inside the files (below). No Lean.ofReduceBool, no sorryAx, no error and no 'declaration uses sorry' in any of the 274 logs; no sorry or native_decide appears in a command of any new source (only in a comment saying so). + * lake build was not run (it would download Mathlib). + * The 50 inherited modules were NOT rebuilt for this package (their oleans are those of the builds of the same sources for #7668 and #7678; #7678's CHECK.txt records that the olean of CongestionI3Cfg came from an earlier build because the 3.5 GB guard stopped a rerun). + * Largest peak RSS of the 274 builds: 3166 MB. No module hit the guard. All 274: rc=0, errors=0, sorry warnings=0. + * The final modules differ from the working copy they were built from only in comments (docstring digits and module labels). + +AXIOMS (from the logs) +'CongestionReader.resid_V' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionReader.resid_Z' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionReader.beta_ge' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionReader.tied_rho' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionReader.sum_c2_pay' depends on axioms: [propext, Classical.choice, Quot.sound] +'CTree.tree_lower_reader' depends on axioms: [propext, Classical.choice, Quot.sound] +'CTree.reader_regs_lower' depends on axioms: [propext, Classical.choice, Quot.sound] +'CTree.reader_piece' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.corr_nonnegRD' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.hdelRD' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.ceiling_reader_GD' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.corr_nonnegRF' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.hdelRF' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.ceiling_reader_GD_w10' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.corr_nonnegRE' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.hdelRE' depends on axioms: [propext, Classical.choice, Quot.sound] +'CongestionNative.ceiling_reader_GD_w16' depends on axioms: [propext, Classical.choice, Quot.sound] + +COMPILE TABLE (module, rc, wall, peak RSS, errors, sorry warnings), build order +CongestionReaderCore rc=0 time=24s peak=2954MB errors=0 sorry=0 +CongestionReaderTree rc=0 time=12s peak=3001MB errors=0 sorry=0 +CongestionReaderPiece rc=0 time=9s peak=2935MB errors=0 sorry=0 +CTreerdaDefs rc=0 time=3s peak=444MB errors=0 sorry=0 +CTreerdaP0 rc=0 time=4s peak=636MB errors=0 sorry=0 +CTreerdaP1 rc=0 time=3s peak=573MB errors=0 sorry=0 +CTreerdaP2 rc=0 time=3s peak=594MB errors=0 sorry=0 +CTreerdaP3 rc=0 time=3s peak=596MB errors=0 sorry=0 +CTreerdaP4 rc=0 time=3s peak=510MB errors=0 sorry=0 +CTreerdaP5 rc=0 time=3s peak=502MB errors=0 sorry=0 +CTreerdaP6 rc=0 time=3s peak=495MB errors=0 sorry=0 +CTreerdaP7 rc=0 time=2s peak=492MB errors=0 sorry=0 +CTreerdaP8 rc=0 time=3s peak=478MB errors=0 sorry=0 +CTreerdaP9 rc=0 time=3s peak=497MB errors=0 sorry=0 +CTreerdaP10 rc=0 time=3s peak=439MB errors=0 sorry=0 +CTreerdaP11 rc=0 time=2s peak=441MB errors=0 sorry=0 +CTreerdaP12 rc=0 time=3s peak=442MB errors=0 sorry=0 +CTreerdaP13 rc=0 time=2s peak=435MB errors=0 sorry=0 +CTreerdaP14 rc=0 time=3s peak=432MB errors=0 sorry=0 +CTreerdaP15 rc=0 time=2s peak=426MB errors=0 sorry=0 +CTreerdaP16 rc=0 time=3s peak=436MB errors=0 sorry=0 +CTreerdaP17 rc=0 time=2s peak=415MB errors=0 sorry=0 +CTreerdaP18 rc=0 time=3s peak=416MB errors=0 sorry=0 +CTreerdaP19 rc=0 time=3s peak=430MB errors=0 sorry=0 +CTreerdaP20 rc=0 time=2s peak=425MB errors=0 sorry=0 +CTreerdaP21 rc=0 time=3s peak=438MB errors=0 sorry=0 +CTreerdaP22 rc=0 time=2s peak=426MB errors=0 sorry=0 +CTreerdaP23 rc=0 time=3s peak=428MB errors=0 sorry=0 +CTreerdaP24 rc=0 time=2s peak=434MB errors=0 sorry=0 +CTreerdaP25 rc=0 time=3s peak=393MB errors=0 sorry=0 +CTreerdaP26 rc=0 time=2s peak=388MB errors=0 sorry=0 +CTreerdaP27 rc=0 time=2s peak=385MB errors=0 sorry=0 +CTreerdaP28 rc=0 time=3s peak=371MB errors=0 sorry=0 +CTreeDataRDA rc=0 time=2s peak=390MB errors=0 sorry=0 +CTreerdiDefs rc=0 time=4s peak=487MB errors=0 sorry=0 +CTreerdiP0 rc=0 time=4s peak=634MB errors=0 sorry=0 +CTreerdiP1 rc=0 time=4s peak=571MB errors=0 sorry=0 +CTreerdiP2 rc=0 time=3s peak=546MB errors=0 sorry=0 +CTreerdiP3 rc=0 time=3s peak=555MB errors=0 sorry=0 +CTreerdiP4 rc=0 time=3s peak=475MB errors=0 sorry=0 +CTreerdiP5 rc=0 time=3s peak=503MB errors=0 sorry=0 +CTreerdiP6 rc=0 time=3s peak=492MB errors=0 sorry=0 +CTreerdiP7 rc=0 time=2s peak=499MB errors=0 sorry=0 +CTreerdiP8 rc=0 time=3s peak=470MB errors=0 sorry=0 +CTreerdiP9 rc=0 time=3s peak=461MB errors=0 sorry=0 +CTreerdiP10 rc=0 time=3s peak=430MB errors=0 sorry=0 +CTreerdiP11 rc=0 time=3s peak=469MB errors=0 sorry=0 +CTreerdiP12 rc=0 time=2s peak=448MB errors=0 sorry=0 +CTreerdiP13 rc=0 time=3s peak=435MB errors=0 sorry=0 +CTreerdiP14 rc=0 time=3s peak=391MB errors=0 sorry=0 +CTreerdiP15 rc=0 time=2s peak=456MB errors=0 sorry=0 +CTreerdiP16 rc=0 time=3s peak=435MB errors=0 sorry=0 +CTreerdiP17 rc=0 time=2s peak=455MB errors=0 sorry=0 +CTreerdiP18 rc=0 time=3s peak=450MB errors=0 sorry=0 +CTreerdiP19 rc=0 time=2s peak=453MB errors=0 sorry=0 +CTreerdiP20 rc=0 time=3s peak=447MB errors=0 sorry=0 +CTreerdiP21 rc=0 time=2s peak=371MB errors=0 sorry=0 +CTreerdiP22 rc=0 time=3s peak=381MB errors=0 sorry=0 +CTreerdiP23 rc=0 time=2s peak=381MB errors=0 sorry=0 +CTreerdiP24 rc=0 time=2s peak=369MB errors=0 sorry=0 +CTreerdiP25 rc=0 time=3s peak=338MB errors=0 sorry=0 +CTreerdiP26 rc=0 time=2s peak=378MB errors=0 sorry=0 +CTreerdiP27 rc=0 time=3s peak=390MB errors=0 sorry=0 +CTreerdiP28 rc=0 time=2s peak=395MB errors=0 sorry=0 +CTreeDataRDI rc=0 time=2s peak=402MB errors=0 sorry=0 +CongestionReaderCertRDDefs rc=0 time=13s peak=2315MB errors=0 sorry=0 +CongestionReaderCertRDWt0 rc=0 time=9s peak=3001MB errors=0 sorry=0 +CongestionReaderCertRDWt1 rc=0 time=6s peak=2954MB errors=0 sorry=0 +CongestionReaderCertRDWt2 rc=0 time=6s peak=2967MB errors=0 sorry=0 +CongestionReaderCertRDWt3 rc=0 time=6s peak=2951MB errors=0 sorry=0 +CongestionReaderCertRDWt4 rc=0 time=6s peak=2952MB errors=0 sorry=0 +CongestionReaderCertRDWt5 rc=0 time=6s peak=2928MB errors=0 sorry=0 +CongestionReaderCertRDWt6 rc=0 time=6s peak=2931MB errors=0 sorry=0 +CongestionReaderCertRDWt7 rc=0 time=6s peak=2947MB errors=0 sorry=0 +CongestionReaderCertRDWt8 rc=0 time=7s peak=2973MB errors=0 sorry=0 +CongestionReaderCertRDWt9 rc=0 time=6s peak=2917MB errors=0 sorry=0 +CongestionReaderCertRDWt10 rc=0 time=6s peak=2943MB errors=0 sorry=0 +CongestionReaderCertRDWt11 rc=0 time=6s peak=2951MB errors=0 sorry=0 +CongestionReaderCertRDWt12 rc=0 time=6s peak=2936MB errors=0 sorry=0 +CongestionReaderCertRDWt13 rc=0 time=6s peak=2949MB errors=0 sorry=0 +CongestionReaderCertRDWt rc=0 time=6s peak=2853MB errors=0 sorry=0 +CongestionReaderCertRDD rc=0 time=8s peak=2854MB errors=0 sorry=0 +CongestionReaderCertRDDl rc=0 time=6s peak=2940MB errors=0 sorry=0 +CongestionReaderCertRDS0 rc=0 time=7s peak=3158MB errors=0 sorry=0 +CongestionReaderCertRDT0 rc=0 time=8s peak=2871MB errors=0 sorry=0 +CongestionReaderCertRDU0 rc=0 time=5s peak=2318MB errors=0 sorry=0 +CongestionReaderCertRDL0 rc=0 time=7s peak=2969MB errors=0 sorry=0 +CongestionReaderCertRDS1 rc=0 time=8s peak=3158MB errors=0 sorry=0 +CongestionReaderCertRDT1 rc=0 time=7s peak=2869MB errors=0 sorry=0 +CongestionReaderCertRDU1 rc=0 time=4s peak=2322MB errors=0 sorry=0 +CongestionReaderCertRDL1 rc=0 time=7s peak=2967MB errors=0 sorry=0 +CongestionReaderCertRDS2 rc=0 time=7s peak=3156MB errors=0 sorry=0 +CongestionReaderCertRDT2 rc=0 time=7s peak=2872MB errors=0 sorry=0 +CongestionReaderCertRDU2 rc=0 time=5s peak=2307MB errors=0 sorry=0 +CongestionReaderCertRDL2 rc=0 time=6s peak=2968MB errors=0 sorry=0 +CongestionReader rc=0 time=7s peak=2915MB errors=0 sorry=0 +CTreerfaDefs rc=0 time=3s peak=473MB errors=0 sorry=0 +CTreerfaP0 rc=0 time=4s peak=608MB errors=0 sorry=0 +CTreerfaP1 rc=0 time=3s peak=620MB errors=0 sorry=0 +CTreerfaP2 rc=0 time=3s peak=580MB errors=0 sorry=0 +CTreerfaP3 rc=0 time=3s peak=593MB errors=0 sorry=0 +CTreerfaP4 rc=0 time=3s peak=524MB errors=0 sorry=0 +CTreerfaP5 rc=0 time=3s peak=555MB errors=0 sorry=0 +CTreerfaP6 rc=0 time=3s peak=514MB errors=0 sorry=0 +CTreerfaP7 rc=0 time=2s peak=508MB errors=0 sorry=0 +CTreerfaP8 rc=0 time=3s peak=521MB errors=0 sorry=0 +CTreerfaP9 rc=0 time=3s peak=443MB errors=0 sorry=0 +CTreerfaP10 rc=0 time=2s peak=440MB errors=0 sorry=0 +CTreerfaP11 rc=0 time=3s peak=445MB errors=0 sorry=0 +CTreerfaP12 rc=0 time=2s peak=444MB errors=0 sorry=0 +CTreerfaP13 rc=0 time=3s peak=430MB errors=0 sorry=0 +CTreerfaP14 rc=0 time=3s peak=446MB errors=0 sorry=0 +CTreerfaP15 rc=0 time=2s peak=450MB errors=0 sorry=0 +CTreerfaP16 rc=0 time=3s peak=447MB errors=0 sorry=0 +CTreerfaP17 rc=0 time=2s peak=447MB errors=0 sorry=0 +CTreerfaP18 rc=0 time=3s peak=456MB errors=0 sorry=0 +CTreerfaP19 rc=0 time=2s peak=453MB errors=0 sorry=0 +CTreerfaP20 rc=0 time=3s peak=447MB errors=0 sorry=0 +CTreerfaP21 rc=0 time=2s peak=381MB errors=0 sorry=0 +CTreerfaP22 rc=0 time=3s peak=378MB errors=0 sorry=0 +CTreerfaP23 rc=0 time=2s peak=387MB errors=0 sorry=0 +CTreerfaP24 rc=0 time=2s peak=391MB errors=0 sorry=0 +CTreerfaP25 rc=0 time=3s peak=393MB errors=0 sorry=0 +CTreerfaP26 rc=0 time=2s peak=381MB errors=0 sorry=0 +CTreerfaP27 rc=0 time=2s peak=381MB errors=0 sorry=0 +CTreerfaP28 rc=0 time=3s peak=365MB errors=0 sorry=0 +CTreeDataRFA rc=0 time=2s peak=370MB errors=0 sorry=0 +CTreerfiDefs rc=0 time=3s peak=471MB errors=0 sorry=0 +CTreerfiP0 rc=0 time=4s peak=640MB errors=0 sorry=0 +CTreerfiP1 rc=0 time=3s peak=530MB errors=0 sorry=0 +CTreerfiP2 rc=0 time=3s peak=552MB errors=0 sorry=0 +CTreerfiP3 rc=0 time=3s peak=512MB errors=0 sorry=0 +CTreerfiP4 rc=0 time=3s peak=505MB errors=0 sorry=0 +CTreerfiP5 rc=0 time=2s peak=507MB errors=0 sorry=0 +CTreerfiP6 rc=0 time=3s peak=505MB errors=0 sorry=0 +CTreerfiP7 rc=0 time=3s peak=438MB errors=0 sorry=0 +CTreerfiP8 rc=0 time=2s peak=450MB errors=0 sorry=0 +CTreerfiP9 rc=0 time=3s peak=440MB errors=0 sorry=0 +CTreerfiP10 rc=0 time=2s peak=436MB errors=0 sorry=0 +CTreerfiP11 rc=0 time=3s peak=446MB errors=0 sorry=0 +CTreerfiP12 rc=0 time=3s peak=450MB errors=0 sorry=0 +CTreerfiP13 rc=0 time=2s peak=446MB errors=0 sorry=0 +CTreerfiP14 rc=0 time=3s peak=439MB errors=0 sorry=0 +CTreerfiP15 rc=0 time=2s peak=448MB errors=0 sorry=0 +CTreerfiP16 rc=0 time=3s peak=445MB errors=0 sorry=0 +CTreerfiP17 rc=0 time=2s peak=446MB errors=0 sorry=0 +CTreerfiP18 rc=0 time=3s peak=449MB errors=0 sorry=0 +CTreerfiP19 rc=0 time=2s peak=452MB errors=0 sorry=0 +CTreerfiP20 rc=0 time=3s peak=372MB errors=0 sorry=0 +CTreerfiP21 rc=0 time=2s peak=377MB errors=0 sorry=0 +CTreerfiP22 rc=0 time=3s peak=378MB errors=0 sorry=0 +CTreerfiP23 rc=0 time=2s peak=433MB errors=0 sorry=0 +CTreerfiP24 rc=0 time=3s peak=364MB errors=0 sorry=0 +CTreerfiP25 rc=0 time=2s peak=393MB errors=0 sorry=0 +CTreerfiP26 rc=0 time=2s peak=431MB errors=0 sorry=0 +CTreerfiP27 rc=0 time=2s peak=381MB errors=0 sorry=0 +CTreerfiP28 rc=0 time=2s peak=381MB errors=0 sorry=0 +CTreeDataRFI rc=0 time=3s peak=352MB errors=0 sorry=0 +CongestionReaderCertRFDefs rc=0 time=5s peak=2254MB errors=0 sorry=0 +CongestionReaderCertRFWt0 rc=0 time=6s peak=2951MB errors=0 sorry=0 +CongestionReaderCertRFWt1 rc=0 time=6s peak=2957MB errors=0 sorry=0 +CongestionReaderCertRFWt2 rc=0 time=6s peak=2935MB errors=0 sorry=0 +CongestionReaderCertRFWt3 rc=0 time=6s peak=2944MB errors=0 sorry=0 +CongestionReaderCertRFWt4 rc=0 time=6s peak=2941MB errors=0 sorry=0 +CongestionReaderCertRFWt5 rc=0 time=7s peak=2952MB errors=0 sorry=0 +CongestionReaderCertRFWt6 rc=0 time=6s peak=2922MB errors=0 sorry=0 +CongestionReaderCertRFWt7 rc=0 time=6s peak=2947MB errors=0 sorry=0 +CongestionReaderCertRFWt8 rc=0 time=6s peak=2943MB errors=0 sorry=0 +CongestionReaderCertRFWt9 rc=0 time=7s peak=2947MB errors=0 sorry=0 +CongestionReaderCertRFWt10 rc=0 time=6s peak=2997MB errors=0 sorry=0 +CongestionReaderCertRFWt11 rc=0 time=6s peak=2946MB errors=0 sorry=0 +CongestionReaderCertRFWt12 rc=0 time=7s peak=2944MB errors=0 sorry=0 +CongestionReaderCertRFWt13 rc=0 time=6s peak=2956MB errors=0 sorry=0 +CongestionReaderCertRFWt rc=0 time=6s peak=2854MB errors=0 sorry=0 +CongestionReaderCertRFD rc=0 time=7s peak=2855MB errors=0 sorry=0 +CongestionReaderCertRFDl rc=0 time=6s peak=2913MB errors=0 sorry=0 +CongestionReaderCertRFS0 rc=0 time=7s peak=3166MB errors=0 sorry=0 +CongestionReaderCertRFT0 rc=0 time=8s peak=2868MB errors=0 sorry=0 +CongestionReaderCertRFU0 rc=0 time=5s peak=2321MB errors=0 sorry=0 +CongestionReaderCertRFL0 rc=0 time=6s peak=2967MB errors=0 sorry=0 +CongestionReaderCertRFS1 rc=0 time=7s peak=3156MB errors=0 sorry=0 +CongestionReaderCertRFT1 rc=0 time=8s peak=2903MB errors=0 sorry=0 +CongestionReaderCertRFU1 rc=0 time=5s peak=2307MB errors=0 sorry=0 +CongestionReaderCertRFL1 rc=0 time=6s peak=2967MB errors=0 sorry=0 +CongestionReaderW10 rc=0 time=6s peak=2899MB errors=0 sorry=0 +CTreereaDefs rc=0 time=3s peak=475MB errors=0 sorry=0 +CTreereaP0 rc=0 time=4s peak=637MB errors=0 sorry=0 +CTreereaP1 rc=0 time=4s peak=574MB errors=0 sorry=0 +CTreereaP2 rc=0 time=3s peak=589MB errors=0 sorry=0 +CTreereaP3 rc=0 time=3s peak=564MB errors=0 sorry=0 +CTreereaP4 rc=0 time=3s peak=560MB errors=0 sorry=0 +CTreereaP5 rc=0 time=2s peak=498MB errors=0 sorry=0 +CTreereaP6 rc=0 time=3s peak=507MB errors=0 sorry=0 +CTreereaP7 rc=0 time=3s peak=512MB errors=0 sorry=0 +CTreereaP8 rc=0 time=3s peak=512MB errors=0 sorry=0 +CTreereaP9 rc=0 time=2s peak=436MB errors=0 sorry=0 +CTreereaP10 rc=0 time=3s peak=434MB errors=0 sorry=0 +CTreereaP11 rc=0 time=2s peak=441MB errors=0 sorry=0 +CTreereaP12 rc=0 time=3s peak=447MB errors=0 sorry=0 +CTreereaP13 rc=0 time=3s peak=440MB errors=0 sorry=0 +CTreereaP14 rc=0 time=2s peak=451MB errors=0 sorry=0 +CTreereaP15 rc=0 time=3s peak=450MB errors=0 sorry=0 +CTreereaP16 rc=0 time=2s peak=451MB errors=0 sorry=0 +CTreereaP17 rc=0 time=3s peak=447MB errors=0 sorry=0 +CTreereaP18 rc=0 time=2s peak=454MB errors=0 sorry=0 +CTreereaP19 rc=0 time=3s peak=449MB errors=0 sorry=0 +CTreereaP20 rc=0 time=3s peak=456MB errors=0 sorry=0 +CTreereaP21 rc=0 time=2s peak=447MB errors=0 sorry=0 +CTreereaP22 rc=0 time=2s peak=393MB errors=0 sorry=0 +CTreereaP23 rc=0 time=3s peak=381MB errors=0 sorry=0 +CTreereaP24 rc=0 time=2s peak=384MB errors=0 sorry=0 +CTreereaP25 rc=0 time=2s peak=387MB errors=0 sorry=0 +CTreereaP26 rc=0 time=3s peak=366MB errors=0 sorry=0 +CTreereaP27 rc=0 time=2s peak=369MB errors=0 sorry=0 +CTreereaP28 rc=0 time=2s peak=113MB errors=0 sorry=0 +CTreeDataREA rc=0 time=2s peak=353MB errors=0 sorry=0 +CTreereiDefs rc=0 time=3s peak=478MB errors=0 sorry=0 +CTreereiP0 rc=0 time=4s peak=656MB errors=0 sorry=0 +CTreereiP1 rc=0 time=3s peak=520MB errors=0 sorry=0 +CTreereiP2 rc=0 time=3s peak=557MB errors=0 sorry=0 +CTreereiP3 rc=0 time=3s peak=571MB errors=0 sorry=0 +CTreereiP4 rc=0 time=3s peak=497MB errors=0 sorry=0 +CTreereiP5 rc=0 time=3s peak=494MB errors=0 sorry=0 +CTreereiP6 rc=0 time=2s peak=508MB errors=0 sorry=0 +CTreereiP7 rc=0 time=2s peak=437MB errors=0 sorry=0 +CTreereiP8 rc=0 time=3s peak=442MB errors=0 sorry=0 +CTreereiP9 rc=0 time=2s peak=437MB errors=0 sorry=0 +CTreereiP10 rc=0 time=3s peak=433MB errors=0 sorry=0 +CTreereiP11 rc=0 time=3s peak=438MB errors=0 sorry=0 +CTreereiP12 rc=0 time=2s peak=437MB errors=0 sorry=0 +CTreereiP13 rc=0 time=3s peak=438MB errors=0 sorry=0 +CTreereiP14 rc=0 time=2s peak=443MB errors=0 sorry=0 +CTreereiP15 rc=0 time=3s peak=432MB errors=0 sorry=0 +CTreereiP16 rc=0 time=2s peak=449MB errors=0 sorry=0 +CTreereiP17 rc=0 time=3s peak=448MB errors=0 sorry=0 +CTreereiP18 rc=0 time=3s peak=449MB errors=0 sorry=0 +CTreereiP19 rc=0 time=2s peak=444MB errors=0 sorry=0 +CTreereiP20 rc=0 time=2s peak=389MB errors=0 sorry=0 +CTreereiP21 rc=0 time=2s peak=381MB errors=0 sorry=0 +CTreereiP22 rc=0 time=2s peak=351MB errors=0 sorry=0 +CTreereiP23 rc=0 time=3s peak=378MB errors=0 sorry=0 +CTreereiP24 rc=0 time=2s peak=355MB errors=0 sorry=0 +CTreereiP25 rc=0 time=2s peak=378MB errors=0 sorry=0 +CTreereiP26 rc=0 time=3s peak=357MB errors=0 sorry=0 +CTreereiP27 rc=0 time=2s peak=351MB errors=0 sorry=0 +CTreereiP28 rc=0 time=2s peak=387MB errors=0 sorry=0 +CTreeDataREI rc=0 time=3s peak=353MB errors=0 sorry=0 +CongestionReaderCertREDefs rc=0 time=5s peak=2254MB errors=0 sorry=0 +CongestionReaderCertREWt0 rc=0 time=6s peak=2954MB errors=0 sorry=0 +CongestionReaderCertREWt1 rc=0 time=6s peak=2947MB errors=0 sorry=0 +CongestionReaderCertREWt2 rc=0 time=6s peak=2933MB errors=0 sorry=0 +CongestionReaderCertREWt3 rc=0 time=7s peak=2928MB errors=0 sorry=0 +CongestionReaderCertREWt4 rc=0 time=6s peak=2933MB errors=0 sorry=0 +CongestionReaderCertREWt5 rc=0 time=6s peak=2941MB errors=0 sorry=0 +CongestionReaderCertREWt6 rc=0 time=7s peak=2922MB errors=0 sorry=0 +CongestionReaderCertREWt7 rc=0 time=6s peak=2925MB errors=0 sorry=0 +CongestionReaderCertREWt8 rc=0 time=7s peak=2934MB errors=0 sorry=0 +CongestionReaderCertREWt9 rc=0 time=6s peak=2937MB errors=0 sorry=0 +CongestionReaderCertREWt10 rc=0 time=6s peak=2930MB errors=0 sorry=0 +CongestionReaderCertREWt11 rc=0 time=6s peak=2945MB errors=0 sorry=0 +CongestionReaderCertREWt12 rc=0 time=7s peak=2930MB errors=0 sorry=0 +CongestionReaderCertREWt13 rc=0 time=6s peak=2937MB errors=0 sorry=0 +CongestionReaderCertREWt rc=0 time=6s peak=2851MB errors=0 sorry=0 +CongestionReaderCertRED rc=0 time=8s peak=2854MB errors=0 sorry=0 +CongestionReaderCertREDl rc=0 time=6s peak=2943MB errors=0 sorry=0 +CongestionReaderCertRES0 rc=0 time=7s peak=3156MB errors=0 sorry=0 +CongestionReaderCertRET0 rc=0 time=8s peak=2869MB errors=0 sorry=0 +CongestionReaderCertREU0 rc=0 time=5s peak=2304MB errors=0 sorry=0 +CongestionReaderCertREL0 rc=0 time=6s peak=2968MB errors=0 sorry=0 +CongestionReaderCertRES1 rc=0 time=7s peak=3159MB errors=0 sorry=0 +CongestionReaderCertRET1 rc=0 time=8s peak=2870MB errors=0 sorry=0 +CongestionReaderCertREU1 rc=0 time=5s peak=2308MB errors=0 sorry=0 +CongestionReaderCertREL1 rc=0 time=6s peak=2968MB errors=0 sorry=0 +CongestionReaderW16 rc=0 time=7s peak=2941MB errors=0 sorry=0 diff --git a/research/p104-reader-ceiling/LICENSE b/research/p104-reader-ceiling/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/p104-reader-ceiling/LICENSE @@ -0,0 +1,201 @@ + Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS + + APPENDIX: How to apply the Apache License to your work. + + To apply the Apache License to your work, attach the following + boilerplate notice, with the fields enclosed by brackets "[]" + replaced with your own identifying information. (Don't include + the brackets!) The text should be enclosed in the appropriate + comment syntax for the file format. We also recommend that a + file or class name and description of purpose be included on the + same "printed page" as the copyright notice for easier + identification within third-party archives. + + Copyright [yyyy] [name of copyright owner] + + Licensed under the Apache License, Version 2.0 (the "License"); + you may not use this file except in compliance with the License. + You may obtain a copy of the License at + + http://www.apache.org/licenses/LICENSE-2.0 + + Unless required by applicable law or agreed to in writing, software + distributed under the License is distributed on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + See the License for the specific language governing permissions and + limitations under the License. diff --git a/research/p104-reader-ceiling/NATIVES.md b/research/p104-reader-ceiling/NATIVES.md new file mode 100644 index 0000000000..8b87d30f1d --- /dev/null +++ b/research/p104-reader-ceiling/NATIVES.md @@ -0,0 +1,54 @@ +# NATIVES: which word-level premises of the reader ceilings were computed on each word, and the script and method that computed it + +Five word files were checked against the word-level premises of `ceiling_reader_GD`, `ceiling_reader_GD_w10` and `ceiling_reader_GD_w16` (the inherited ones are those of `ceiling_native_J`, #7668, and of #7678; the new ones are the reader/tied-register facts, the owned-layer facts behind `omega`, and the paper figures): + +| name | word | file | +|---|---|---| +| st1 | the word of #7641 | `st1.json.gz` | +| w7637 | the #7637 word | `w7637.json.gz` | +| x1t2a | the x1t2a word | `x1t2a.json.gz` | +| e1 | the #7660 word | `e1.json.gz` | +| t7669 | our reproduction of the #7669 word (not the #7669 file itself) | `t7669.json.gz` | + +All five share one port set of 104 odd-weight vectors and are close to one data point for port-set-dependent facts. They differ in the owned layer: `t7669` has 23 rises / 23 descents (46 owned moves), the other four 23 / 24 (47); `w7637` has 233 INIT = CLEAR pairs, `t7669` 235, the other three 234; `w7637` holds G' tokens in 24 more owned CLEARs at dim 9 (42 token-bearing CLEARs against 18). **Lean treats every object in the three theorems as abstract; nothing in Lean ties a word to these hypotheses (in particular not `T`, `T.S`, `T.J`, `Q`, `Uo`, `π`, `ω`).** "Result" means the premise as computed, not a Lean fact. Not-run items are listed at the end. + +Scripts and methods (all are Python 3 with exact integer / rational arithmetic unless stated; one core each; none is part of this package, the word files are not either): +- `own.py WORD` (written for this package, independent of the lane scripts): public register chart sequences from the MOVE events; `hmono` (non-strict and strict), `hd9`; the mixed set (`1 <= d r 0` and `d r end <= 8`, the Lean `Mixed`); births and ends of X, X2, Y; the Lean `Tied` predicate on every public register; for each reader t the set of Tied registers whose chart list contains Y_t's final dim-8 chart, and a maximum bipartite matching (augmenting paths) of readers to such registers (the existence of the injective `π` of `hπinj`); registers visiting more than one dim-8 chart; the owned layer: INIT / CLEAR counts, last event of every owned register, owned moves by (source dim, target dim), moves from dim <= 7 to dim 9, moves into dim-8 charts. +- `f2chk.py WORD` (re-run; written for the F2* count): exact replay of G'-token rows modulo p (p = 2^61 - 1 and, as a copy with p = 2^64 - 59, both give identical output on all five words): G' = public helpers born at dim >= 2 (230); B-exit rows; `omega := |G'| - rank pi(G' and P exit rows)`; TL-b (no register ending below V holds a foreign G' token) and TL-a's public clause. A rank modulo p is at most the rank over Q, so `omega = 0` modulo p implies `omega = 0` over Q. Its last printed line is labelled "omega = rank pi(owned exit rows)" and shows 16 (35 on w7637); that label is misleading: the quantity that defines `omega` is the line before it ("rank pi(G' + P rows) 230 = |G'|", hence `omega = 0`); 16 and 35 are the ranks of the owned rows alone, which the argument for `omega <= 10` bounds differently (CLEAR rows contribute nothing). +- `a1.py` (re-run, word list extended by w7637): roles and births of every main, the mixed list, and per reader the registers tied to its final chart with `R = (sum of |beta| steps - beta(birth) - beta(end)) / 2 >= delta` (floating point, `delta = 7^s + 2^s - 8^s - 1` at s = 1 - .0118103 = .018734). +- `tp1.py WORD PRIME` (re-run, both primes 2^61 - 1 and 2^64 - 59; output identical): `J^arr` and the OUT-side tree premises of #7678 (Tr out-trees under `cgR`, `gaR`, `gbR`, `hnd`, `hcap`, `hMv`, `hdim`, `hcell`, `hxk`, `hJS`, `hfib`, `hScard`, `hB`, `hBcard`, `hMsub`, and the word side of `hP1`). The word side of `hP1` samples `Omega - sum of owned-rise c2` at points of the window; for the reader window (lower end `a0RD` = .0115262, i.e. s up to .9884738) a copy with the point set (.9881897, .98832, .98845, .9884738), spacing at most 1.3e-4, gives a minimum of 47.42 (47.38 on t7669) against a Lipschitz loss of at most .37. +- `a2.py t NMIX` and `c3f.py` (re-run; `c3f.py` = the master-LP script with `READER=1`, `NDL` as the allowance, `TREE=1 SIDE=two MODE=own56 M=5`, about 3 minutes each): at t = .0118103, OUT 29.7252, IN = sum H_t = 29.6542, delta .018734, c18 .035040, capv .020074, IN' = 31.5089 (5 allowances), 31.3215 (15), 31.2091 (21); the largest `H_t / (K_t min(c18, capv))` is .3109 and no reader is on the dim-1 branch. Ceiling for `NDL = 15, 25, 31`: .011525000780, .011541666284, .011551595956. These are float computations of the master problem (the paper figures); the Lean digits are the certified ones. + +## Premise x word + +| premise (Lean name) | st1 | w7637 | x1t2a | e1 (#7660) | t7669 (repro of #7669) | script | +|---|---|---|---|---|---|---| +| `hmono` (strict: no equal or falling dims), `hd9` | 0 violations | 0 | 0 | 0 | 0 | `own.py` | +| `hmix` (<= 5) | 5 (tight), all helpers | 5 | 5 | 5 | 5 | `own.py`, `a1.py` | +| mains X (104), X2 (96): born at dim 1, V-class (end 9) | yes | yes | yes | yes | yes | `own.py`, `a1.py` | +| Y (104): born at dim 0, end at dim 8 | yes | yes | yes | yes | yes | `own.py`, `a1.py` | +| Lean `Tied` registers (public) | 427 | 427 | 427 | 427 | 427 | `own.py` | +| each reader has a tied register on its final chart; injective choice (`hπR`, `hπinj`, `hTied`) | matching 104 / 104; 104 distinct final charts | 104 / 104 | 104 / 104 | 104 / 104 | 104 / 104 | `own.py` (matching), `a1.py` (payer with `R >= delta`) | +| every register visits at most one dim-8 chart | 0 exceptions | 0 | 0 | 0 | 0 | `own.py` | +| owned lifetimes end in CLEAR (INIT = CLEAR; last event of every owned register) | 234 = 234; 52 / 52 | 233 = 233; 52 / 52 | 234 = 234; 52 / 52 | 234 = 234; 52 / 52 | 235 = 235; 53 / 53 | `own.py` | +| owned moves from dim <= 7 to dim 9 (none needed for `omega <= 10`) | 0 | 0 | 0 | 0 | 0 | `own.py` | +| owned moves into dim-8 charts (`<= 10` owned last movers) | 8 (all from dim <= 7) | 8 | 8 | 8 | 8 | `own.py` | +| owned layer: rises / descents, mass up / down | 23 / 24, 56 / 56 | same | same | same | 23 / 23, 56 / 56 | `own.py` | +| `omega = |G'| - rank pi(G' and P exit rows)` (`hω : ω <= 0`) | 0 (rank 230 = \|G'\| = 230) | 0 | 0 | 0 | 0 | `f2chk.py` (both primes) | +| TL-b: no register ending below V holds a foreign G' token; all Y_t clean | 0 violations | 0 | 0 | 0 | 0 | `f2chk.py` | +| TL-a public clause | 0 violations | 0 | 0 | 0 | 0 | `f2chk.py` | +| TL-a "only public registers hold e_g" (NOT used) | fails: 15 owned registers hold tokens | fails: 28 | fails: 15 | fails: 15 | fails: 15 | `f2chk.py` | +| every high reader has a payer in S_t (a check of the false F2 form, for information) | 104 / 104 | 104 / 104 | 104 / 104 | 104 / 104 | 104 / 104 | `f2chk.py` | +| OUT-side tree premises of #7678 (`htreeA/B`, `hnd`, `hcap`, `hcell`, `hxk`, `hJS`, `hfib`, `hScard`, `hB`, `hBcard`, `hMsub`, `hdim`), \|J^arr\| = 4962 | PASS, trees valid under `cgR`, `gaR`, `gbR`: 104 / 104; max usage / n(A) = 1.0 | PASS | PASS | PASS | PASS | `tp1.py` (both primes) | +| word side of `hP1` on `[a0RD, tJ0]`: `Omega - sum c2(owned rises)` | >= 47.42 (loss <= .37) | same | same | same | >= 47.38 | `tp1.py` (point set extended) | +| `hcstLo`: `0 <= cstF` on the window | not a word fact | | | | | a paper statement, now a hypothesis (it follows from `cst(t) >= c2(7,8) > 0`) | +| `hP2` residue `0 <= cstF` | not a word fact (`Mun` empty on all five) | | | | | `tp1.py` | +| paper ceiling for NDL 15 / 25 / 31 | .011525000780 / .011541666284 / .011551595956 (word-independent master problem at the tabulated `K_t`, `H_t`) | | | | | `c3f.py` | + +Inherited premises (`hk`, `hmass`, `hmd`, `hmr`, `hY`, `hF`, `hEex`, `hst`, the Cap margin, `hcong`/`hdist` support, the 48-cells law, E48): taken from `NATIVES.md` of #7678 and #7668; not re-run here. + +## Not covered, not run +- The IN-side analogues of the tree premises (`T` for the readers, the I-class edge set of the 48-port readers, the reflection symmetry of the DP table): checked after the PR was opened: on st1, the #7637 word, x1t2a, the #7660 word and the #7669 reproduction (two primes), the reader IN-trees are valid for 104/104 readers under rfaR/rfiR with root (1,1,48), and hcap, hnd, hdim, hfib, hcell, hMsub and the word side of hP1 pass (hcap tight on about 1,475 of ~1,900 moves; two negative controls fail 0/104); hcase, hUc, hTied pass by a counting witness and in the semantic form (104/104). Not word-checkable: hcstLo, the class bound ω ≤ 10, the tie of T to J. Correction: the Lean-kernel IN table rfiR differs from gbR in the edge masks of 89 of 230 rows (dim, n, m agree in all 230; the numeric g/ge lists differ in 225 rows); rfaR and gaR have identical masks; an earlier version said 18 of 230. +- `omega <= 10` for the class: proved on paper only; on the five words `omega = 0`. A word with an owned rise from dim <= 7 into V, or an owned lifetime that does not end in a CLEAR, is outside the premises. +- Words other than these five; port sets other than the one 104-port set; decoders other than rank 8 with C = 56 (`ceiling_native_J` hard-codes `corrC <= 8 cH`, `capC >= unLo / 48`). +- `hmix = 5` is tight on all five words. diff --git a/research/p104-reader-ceiling/PROVED.md b/research/p104-reader-ceiling/PROVED.md new file mode 100644 index 0000000000..a09d851ba1 --- /dev/null +++ b/research/p104-reader-ceiling/PROVED.md @@ -0,0 +1,381 @@ +# PROVED: statements of the new theorems, copied from the Lean sources + +Generated by a script that copies each statement (everything before `:=`) verbatim from `lean/Nov15/*.lean`. The Lean text is authoritative; every hypothesis in a statement is a hypothesis. The three theorems print axioms [propext, Classical.choice, Quot.sound] (`CHECK.txt`). Nothing here is a statement about a particular word: `R, nR, dR, n, ks, mr, st, E, J, distF, spF, cstF`, the tree data `T`, the sets `Q`, `Uo` and the map `π` are abstract, and Lean does not tie any of them to a word, to each other, or to the junk set `J`. + +Each theorem concludes, for `t` in `[t0, 1]` (that is, `t0 ≤ t ≤ 1`): `Finv (1 - t) (invoice (caller 6 7) n 17) < 0`, with `t0 = a0RD` (omega ≤ 0), `a0RF` (omega ≤ 10, headline) or `a0RE` (omega ≤ 16). The caller is `caller 6 7` and the number of calls is `L = 17`. + +Binder bookkeeping (by script, text compared after whitespace normalisation): the 32 explicit binders of `ceiling_native_J` (#7668) are textually identical in all three theorems (32 names, in 31 binder groups); `R nR dR hmono hd9 hmix n ks mr st E J distF spF cstF hk hmass hmd hmr hF hY hst hEex hcong hdist hJ hspMono hcstMono hspTab hcstTab hspTabJ hcstTabJ`. The new binders over `ceiling_tree_GD` (#7678) are `hcstLo`, `hcst2` (only in the omega ≤ 0 theorem: three window pieces instead of two), `ω hω`, `Q Uo hUo hUc hQ hcase`, `π hπR hπinj hTied`; `T` now has the type `CTree.TreeData σ ρ μ CTree.rdaR CTree.rdiR CTree.rdar0 CTree.rdir0 48` (the readers' tables) and `hcstMonoT`, `hcst0`, `hcst1`, `hP1`, `hP2` are restated on the window `[a0, tJ0]`. The three theorems differ from each other only in the window constants (`a0RD/RF/RE`, `tRD*/tRF*/tRE*`, `cHRD*`, ...), in `hω : ω ≤ 0 / 10 / 16`, and in the module they sit in. + +## CongestionReader.ceiling_reader_GD +```lean +theorem ceiling_reader_GD + {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 4962 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hspTabJ : ((spFloJ0 : ℚ) : ℝ) ≤ spF ((tJ0 : ℚ) : ℝ) ∧ ((spFloJ1 : ℚ) : ℝ) ≤ spF ((tJ1 : ℚ) : ℝ) ∧ + ((spFloJ2 : ℚ) : ℝ) ≤ spF ((tJ2 : ℚ) : ℝ)) + (hcstTabJ : cstF ((tJ1 : ℚ) : ℝ) ≤ ((cHJ0 : ℚ) : ℝ) ∧ cstF ((tJ2 : ℚ) : ℝ) ≤ ((cHJ1 : ℚ) : ℝ) ∧ + cstF ((tC0 : ℚ) : ℝ) ≤ ((cHJ2 : ℚ) : ℝ)) + {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (T : CTree.TreeData σ ρ μ CTree.rdaR CTree.rdiR CTree.rdar0 CTree.rdir0 48) + (hcstLo : ∀ t : ℝ, ((a0RD : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) + (hcstMonoT : MonotoneOn cstF (Set.Icc ((a0RD : ℚ) : ℝ) (1 / 10))) + (hcst0 : cstF ((tRD1 : ℚ) : ℝ) ≤ ((cHRD0 : ℚ) : ℝ)) + (hcst1 : cstF ((tRD2 : ℚ) : ℝ) ≤ ((cHRD1 : ℚ) : ℝ)) + (hcst2 : cstF ((tRD3 : ℚ) : ℝ) ≤ ((cHRD2 : ℚ) : ℝ)) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (ω : ℕ) (hω : ω ≤ 0) (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ 15 + ω) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (π : σ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) (hTied : ∀ t ∈ Q, CongestionReader.Tied nR dR (π t)) : + ∀ t : ℝ, ((a0RD : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 +``` + +## CongestionReaderW10.ceiling_reader_GD_w10 +```lean +theorem ceiling_reader_GD_w10 + {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 4962 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hspTabJ : ((spFloJ0 : ℚ) : ℝ) ≤ spF ((tJ0 : ℚ) : ℝ) ∧ ((spFloJ1 : ℚ) : ℝ) ≤ spF ((tJ1 : ℚ) : ℝ) ∧ + ((spFloJ2 : ℚ) : ℝ) ≤ spF ((tJ2 : ℚ) : ℝ)) + (hcstTabJ : cstF ((tJ1 : ℚ) : ℝ) ≤ ((cHJ0 : ℚ) : ℝ) ∧ cstF ((tJ2 : ℚ) : ℝ) ≤ ((cHJ1 : ℚ) : ℝ) ∧ + cstF ((tC0 : ℚ) : ℝ) ≤ ((cHJ2 : ℚ) : ℝ)) + {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (T : CTree.TreeData σ ρ μ CTree.rfaR CTree.rfiR CTree.rfar0 CTree.rfir0 48) + (hcstLo : ∀ t : ℝ, ((a0RF : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) + (hcstMonoT : MonotoneOn cstF (Set.Icc ((a0RF : ℚ) : ℝ) (1 / 10))) + (hcst0 : cstF ((tRF1 : ℚ) : ℝ) ≤ ((cHRF0 : ℚ) : ℝ)) + (hcst1 : cstF ((tRF2 : ℚ) : ℝ) ≤ ((cHRF1 : ℚ) : ℝ)) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RF : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RF : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (ω : ℕ) (hω : ω ≤ 10) (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ 15 + ω) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (π : σ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) (hTied : ∀ t ∈ Q, CongestionReader.Tied nR dR (π t)) : + ∀ t : ℝ, ((a0RF : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 +``` + +## CongestionReaderW16.ceiling_reader_GD_w16 +```lean +theorem ceiling_reader_GD_w16 + {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 4962 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hspTabJ : ((spFloJ0 : ℚ) : ℝ) ≤ spF ((tJ0 : ℚ) : ℝ) ∧ ((spFloJ1 : ℚ) : ℝ) ≤ spF ((tJ1 : ℚ) : ℝ) ∧ + ((spFloJ2 : ℚ) : ℝ) ≤ spF ((tJ2 : ℚ) : ℝ)) + (hcstTabJ : cstF ((tJ1 : ℚ) : ℝ) ≤ ((cHJ0 : ℚ) : ℝ) ∧ cstF ((tJ2 : ℚ) : ℝ) ≤ ((cHJ1 : ℚ) : ℝ) ∧ + cstF ((tC0 : ℚ) : ℝ) ≤ ((cHJ2 : ℚ) : ℝ)) + {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (T : CTree.TreeData σ ρ μ CTree.reaR CTree.reiR CTree.rear0 CTree.reir0 48) + (hcstLo : ∀ t : ℝ, ((a0RE : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) + (hcstMonoT : MonotoneOn cstF (Set.Icc ((a0RE : ℚ) : ℝ) (1 / 10))) + (hcst0 : cstF ((tRE1 : ℚ) : ℝ) ≤ ((cHRE0 : ℚ) : ℝ)) + (hcst1 : cstF ((tRE2 : ℚ) : ℝ) ≤ ((cHRE1 : ℚ) : ℝ)) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RE : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RE : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (ω : ℕ) (hω : ω ≤ 16) (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ 15 + ω) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (π : σ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) (hTied : ∀ t ∈ Q, CongestionReader.Tied nR dR (π t)) : + ∀ t : ℝ, ((a0RE : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 +``` + +## CongestionReaderCore: `Tied`, `rho`, `deltaF` (a tied register has residual at least `deltaF`: `tied_rho`, proved) +```lean +def Tied {ι : Type*} (n : ι → ℕ) (d : ι → ℕ → ℕ) (r : ι) : Prop := + (d r 0 = 0 ∧ d r (n r) = 8 ∨ d r 0 = 1 ∧ d r (n r) = 9) ∧ ∃ j ≤ n r, 2 ≤ d r j ∧ d r j ≤ 7 + +noncomputable def rho {ι : Type*} (s : ℝ) (n : ι → ℕ) (d : ι → ℕ → ℕ) (r : ι) : ℝ := + ex (gs s) (lev d r) (n r) - ∑ i ∈ range (n r), c2 (gs s) (lev d r i) (lev d r (i + 1)) + +noncomputable def deltaF (s : ℝ) : ℝ := (7 : ℝ) ^ s + (2 : ℝ) ^ s - (8 : ℝ) ^ s - 1 +``` + +## CongestionReaderTree.lineOKR +```lean +def lineOKR (rA rB : Row) (capI dI lam gA gB : ℕ) : Bool := + (List.range 49).all (fun x => (List.range 49).all (fun r => + decide (lam * min 48 (x + r) ≤ gv rA r + x * capI + dI + gA) && + decide (lam * min 48 (x + r) ≤ gv rB r + x * capI + dI + gB))) + && decide (gB ≤ gA) && decide (lam ≤ capI) +``` + +## CongestionReaderCore and CongestionReaderTree: the proved lemmas the final theorems rest on +```lean +theorem tied_rho {ι : Type*} (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (n : ι → ℕ) (d : ι → ℕ → ℕ) (r : ι) + (h : Tied n d r) : deltaF s ≤ rho s n d r + +theorem sum_c2_pay {κ : Type*} [DecidableEq κ] (s : ℝ) (R : Finset ι) (n : ι → ℕ) (d : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < n r, d r i ≤ d r (i + 1)) (hd9 : ∀ r ∈ R, d r (n r) ≤ 9) + (m : ℕ) (hm : (R.filter fun r => Mixed d n r).card ≤ m) (σ : ℝ) (hσ0 : 0 ≤ σ) + (hσ : ∀ a b : ℕ, 1 ≤ a → a ≤ b → b ≤ 8 → c2 (gs s) (a : ℝ) (b : ℝ) ≤ σ) + (δ : ℝ) (hδ0 : 0 ≤ δ) (Q : Finset κ) (π : κ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) + (hπρ : ∀ t ∈ Q, δ ≤ rho s n d (π t)) : + ∑ r ∈ R, ∑ i ∈ range (n r), c2 (gs s) (lev d r i) (lev d r (i + 1)) + δ * Q.card ≤ + ∑ r ∈ R, ex (gs s) (lev d r) (n r) + m * σ + +theorem tree_lower_reader {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (W : List (List ℕ)) (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) (T : TreeData σ ρ μ rsA rsB rootA rootB nB) + (hcA : ∀ r ∈ rsA, Row.check W rsA r = true) (hcB : ∀ r ∈ rsB, Row.check W rsB r = true) + (hrA : rootA.m ≤ 48) (hrB : rootB.m ≤ 48) (capI dI lam gA gB NDL : ℕ) + (hline : lineOKR rootA rootB capI dI lam gA gB = true) + (w : μ → ℝ) + (hW : ∀ e, 1 ≤ T.dA e → T.dA e < T.dB e → T.dB e ≤ 8 → + (((W.getD (T.dA e) []).getD (T.dB e) 0 : ℕ) : ℝ) ≤ SCr * w e) + (hw0 : ∀ e ∈ T.Mv, 0 ≤ w e) (cap δ : ℝ) (hcap : (capI : ℝ) ≤ SCr * cap) (hδ : (dI : ℝ) ≤ SCr * δ) + (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ NDL) (hQ : Q ⊆ T.S) + (hcase : ∀ s ∈ T.S, s ∈ Q ∨ T.x s = (T.J.filter fun p => p.1 = s).card ∨ s ∈ Uo) : + (lam : ℝ) * 4962 - ((gA : ℝ) * 104 - ((gA : ℝ) - gB) * nB) - NDL * dI ≤ + SCr * (∑ e ∈ T.Mv, w e + cap * ∑ s ∈ T.S, (T.x s : ℝ) + δ * Q.card) + +``` + +## CongestionTreeCore.TreeData (inherited from #7678; here instantiated with the readers' tables, `T.S` = readers, `T.J` = (reader, source) cells; every field is a hypothesis) +```lean +structure TreeData (σ ρ μ : Type) [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) where + J : Finset (σ × ρ) + S : Finset σ + Bset : Finset σ + Mv : Finset μ + Mreg : Finset μ + Mun : Finset μ + dA : μ → ℕ + dB : μ → ℕ + nm : μ → ℕ + ms : σ → List μ + R : σ → Finset ρ + x : σ → ℕ + hJS : ∀ p ∈ J, p.1 ∈ S + hScard : S.card ≤ 104 + hfib : ∀ s ∈ S, (J.filter fun p => p.1 = s).card ≤ 48 + hJcard : 4962 ≤ J.card + hB : Bset ⊆ S + hBcard : nB ≤ Bset.card + hcell : ∀ s ∈ S, (J.filter fun p => p.1 = s).card ≤ x s + (R s).card + hxk : ∀ s ∈ S, x s ≤ (J.filter fun p => p.1 = s).card + htreeA : ∀ s ∈ S, s ∉ Bset → Tr rsA nm dA dB rootA (R s) (ms s) + htreeB : ∀ s ∈ Bset, Tr rsB nm dA dB rootB (R s) (ms s) + hnd : ∀ s ∈ S, (ms s).Nodup + hMv : ∀ s ∈ S, ∀ e ∈ ms s, e ∈ Mv + hcap : ∀ e ∈ Mv, (S.filter fun s => e ∈ ms s).card ≤ nm e + hMsub : Mv ⊆ Mreg ∪ Mun + hdim : ∀ e ∈ Mreg ∪ Mun, 1 ≤ dA e ∧ dA e < dB e ∧ dB e ≤ 8 +``` + +## Appendix: definitions and values (copied from the Lean sources) + +### Window breakpoints and brackets of the three variants (`CongestionReaderCert{RD,RF,RE}Defs.lean`); the t0 of the theorems are `a0RD`, `a0RF`, `a0RE`; `dI*` is the integer allowance, `cfDel*` the delta polynomial (`CongestionReaderCert*Dl.lean`) +```lean +def tTJ0RD : ℚ := 118103 / 10 ^ 7 +def a0RD : ℚ := (57631 : ℚ) / 5000000 +def dIRD : ℕ := 1829476964867 +def tRD0 : ℚ := (57631 : ℚ) / 5000000 +def tRD1 : ℚ := (14409 : ℚ) / 1250000 +def sgRD0 : ℚ := (1483 : ℚ) / 31250 +def cHRD0 : ℚ := (284941 : ℚ) / 10000000 +def lcpRD0 : ℚ := (6066973 : ℚ) / 200000 +def unLoRD0 : ℚ := (96439299869701 : ℚ) / 100000000000000 +def capIRD0 : ℕ := 2009152080618 +def lamRD0 : ℕ := 645764760052 +def gARD0 : ℕ := 2152870912751 +def gBRD0 : ℕ := 31 +def tRD2 : ℚ := (7267 : ℚ) / 625000 +def sgRD1 : ℚ := (48779 : ℚ) / 1000000 +def cHRD1 : ℚ := (287383 : ℚ) / 10000000 +def lcpRD1 : ℚ := (30332911 : ℚ) / 1000000 +def unLoRD1 : ℚ := (96408914818159 : ℚ) / 100000000000000 +def capIRD1 : ℕ := 2008519058711 +def lamRD1 : ℕ := 645764760052 +def gARD1 : ℕ := 2152870912751 +def gBRD1 : ℕ := 31 +def tRD3 : ℚ := (118103 : ℚ) / 10000000 +def sgRD2 : ℚ := (50289 : ℚ) / 1000000 +def cHRD2 : ℚ := (72963 : ℚ) / 2500000 +def lcpRD2 : ℚ := (3791167 : ℚ) / 125000 +def unLoRD2 : ℚ := (12044162755641 : ℚ) / 12500000000000 +def capIRD2 : ℕ := 2007360459273 +def lamRD2 : ℕ := 645764760052 +def gARD2 : ℕ := 2152870912751 +def gBRD2 : ℕ := 31 + +def tTJ0RF : ℚ := 118103 / 10 ^ 7 +def a0RF : ℚ := (28857 : ℚ) / 2500000 +def dIRF : ℕ := 1832044939017 +def tRF0 : ℚ := (28857 : ℚ) / 2500000 +def tRF1 : ℚ := (14441 : ℚ) / 1250000 +def sgRF0 : ℚ := (47643 : ℚ) / 1000000 +def cHRF0 : ℚ := (142783 : ℚ) / 5000000 +def lcpRF0 : ℚ := (15097357 : ℚ) / 500000 +def unLoRF0 : ℚ := (12053940059817 : ℚ) / 12500000000000 +def capIRF0 : ℕ := 2008990009969 +def lamRF0 : ℕ := 646684787048 +def gARF0 : ℕ := 2155930020953 +def gBRF0 : ℕ := 3 +def tRF2 : ℚ := (118103 : ℚ) / 10000000 +def sgRF1 : ℚ := (50979 : ℚ) / 1000000 +def cHRF1 : ℚ := (72963 : ℚ) / 2500000 +def lcpRF1 : ℚ := (6037937 : ℚ) / 200000 +def unLoRF1 : ℚ := (12044162755641 : ℚ) / 12500000000000 +def capIRF1 : ℕ := 2007360459273 +def lamRF1 : ℕ := 646684787048 +def gARF1 : ℕ := 2155930020953 +def gBRF1 : ℕ := 3 + +def tTJ0RE : ℚ := 118103 / 10 ^ 7 +def a0RE : ℚ := (14441 : ℚ) / 1250000 +def dIRE : ℕ := 1833591819603 +def tRE0 : ℚ := (14441 : ℚ) / 1250000 +def tRE1 : ℚ := (28907 : ℚ) / 2500000 +def sgRE0 : ℚ := (11921 : ℚ) / 250000 +def cHRE0 : ℚ := (28581 : ℚ) / 1000000 +def lcpRE0 : ℚ := (6022117 : ℚ) / 200000 +def unLoRE0 : ℚ := (96428481806759 : ℚ) / 100000000000000 +def capIRE0 : ℕ := 2008926704307 +def lamRE0 : ℕ := 647239006391 +def gARE0 : ℕ := 2157772800171 +def gBRE0 : ℕ := 1 +def tRE2 : ℚ := (118103 : ℚ) / 10000000 +def sgRE1 : ℚ := (50887 : ℚ) / 1000000 +def cHRE1 : ℚ := (72963 : ℚ) / 2500000 +def lcpRE1 : ℚ := (30105751 : ℚ) / 1000000 +def unLoRE1 : ℚ := (12044162755641 : ℚ) / 12500000000000 +def capIRE1 : ℕ := 2007360459273 +def lamRE1 : ℕ := 647239006391 +def gARE1 : ℕ := 2157772800171 +def gBRE1 : ℕ := 1 + +def cfDelRD : CF := [(7, 1), (2, 1), (8, -1), (1, -1)] +``` + +### T1 breakpoints, cst brackets and spF lower bounds (`CongestionNativeJDefs.lean`) +```lean +def tJ0 : ℚ := 118103 / 10 ^ 7 +def tJ1 : ℚ := 118123 / 10 ^ 7 +def tJ2 : ℚ := 120123 / 10 ^ 7 +def cHJ0 : ℚ := 291901 / 10 ^ 7 +def cHJ1 : ℚ := 296781 / 10 ^ 7 +def cHJ2 : ℚ := 336819 / 10 ^ 7 +def spFloJ0 : ℚ := 113518785551 / 20000000000000 +def spFloJ1 : ℚ := 17740285593 / 3125000000000 +def spFloJ2 : ℚ := 577208719357 / 100000000000000 +``` + +### C-class breakpoints (`CongestionI3DualConst.lean`) +```lean +def tC0 : ℚ := 136564 / 10 ^ 7 +def tC1 : ℚ := 136584 / 10 ^ 7 +def tC2 : ℚ := 137584 / 10 ^ 7 +def tC3 : ℚ := 237584 / 10 ^ 7 +``` + +### C-class brackets (T1 `hspTab`, `hcstTab`) (`CongestionNativeTab.lean`) +```lean +def spFloC0 : ℚ := 131069767447 / 20000000000000 +def spFloC1 : ℚ := 655443767027 / 100000000000000 +def spFloC2 : ℚ := 26407594739 / 4000000000000 +def spFloC3 : ℚ := 141372084217 / 12500000000000 +def cHC0 : ℚ := 84217 / 2500000 +def cHC1 : ℚ := 339299 / 10 ^ 7 +def cHC2 : ℚ := 579807 / 10 ^ 7 +def cHC3 : ℚ := 2255027 / 10 ^ 7 +``` + +### Invoice, caller and Finv +Namespaces: `CallerCost` (`Hist`, `Inv`, `scale`, `invoice`, `armT`, `armP`, `callerT`, `callerP`, `caller`), `JointCeiling` (`Fh`, `Finv`). + +```lean +abbrev Hist := List (ℕ × ℕ) +structure Inv where + T : Hist + P : Hist +def scale (L : ℕ) (l : Hist) : Hist := l.map fun p => (p.1, L * p.2) +def invoice (c n : Inv) (L : ℕ) : Inv := ⟨c.T ++ scale L n.T, c.P ++ scale L n.P⟩ +def armT (n c : ℕ) : Hist := (List.range n).map fun i => (8 * i + 9, c) +def armP (m c : ℕ) : Hist := (List.range m).map fun i => (8 * i + 16, c) +def callerT (a b : ℕ) : Hist := armT (a + 2) 208 ++ armT (b + 2) 208 ++ [(8 * (a + b + 4) + 1, 208)] +def callerP (a b : ℕ) : Hist := + armP a 208 ++ armP b 208 ++ [(8, 384), (1, 384), (8, 16 * (a + b + 4)), (9, 32)] +def caller (a b : ℕ) : Inv := ⟨callerT a b, callerP a b⟩ +noncomputable def Fh (s : ℝ) (l : Hist) : ℝ := (l.map fun p => (p.2 : ℝ) * (p.1 : ℝ) ^ s).sum +noncomputable def Finv (s : ℝ) (i : Inv) : ℝ := Fh s i.T - Fh s i.P +``` + +### Owned-surplus and cap definitions (`CongestionNative.lean`), price and register definitions +```lean +noncomputable def Omega (ks : List ℕ) (mr : ℕ) (s : ℝ) : ℝ := dprice ks s + mr - (6 * (9 : ℝ) ^ s + 10) +noncomputable def capC (s : ℝ) : ℝ := ((9 : ℝ) ^ s - (8 : ℝ) ^ s) / 48 +noncomputable def corrC (cstF : ℝ → ℝ) (s : ℝ) : ℝ := 8 * cstF (1 - s) +noncomputable def dprice (ks : List ℕ) (s : ℝ) : ℝ := (ks.map fun k : ℕ => ((k : ℕ) : ℝ) ^ s).sum +def h9 (g : ℝ → ℝ) (a b : ℝ) : ℝ := g (b - a) + g (9 - b) - g (9 - a) +def k0 (g : ℝ → ℝ) (a b : ℝ) : ℝ := g (b - a) + g a - g b +def c2 (g : ℝ → ℝ) (a b : ℝ) : ℝ := min (h9 g a b) (k0 g a b) +noncomputable def gs (s : ℝ) (x : ℝ) : ℝ := if 0 < x then x ^ s else 0 +def gsum (g : ℝ → ℝ) (d : ℕ → ℝ) (n : ℕ) : ℝ := ∑ i ∈ range n, g (d (i + 1) - d i) +def ex (g : ℝ → ℝ) (d : ℕ → ℝ) (n : ℕ) : ℝ := gsum g d n - g (d n - d 0) +def Mixed (d : ι → ℕ → ℕ) (n : ι → ℕ) (r : ι) : Prop := 1 ≤ d r 0 ∧ d r (n r) ≤ 8 +def lev (d : ι → ℕ → ℕ) (r : ι) : ℕ → ℝ := fun i => (d r i : ℝ) +``` + diff --git a/research/p104-reader-ceiling/PR_BODY.md b/research/p104-reader-ceiling/PR_BODY.md new file mode 100644 index 0000000000..988c444622 --- /dev/null +++ b/research/p104-reader-ceiling/PR_BODY.md @@ -0,0 +1,31 @@ +P104: per-reader endpoint charge, frontier-word ceiling κ ≤ .0115428 (Lean, conditional, no κ claim) + +Lean-only package, builds on #7678 (the tree ceiling, t0 = .0116750): the four #7678 modules the new files import (`CTreeCore`, `CongestionTreeCore`, `CongestionTreeW`, `CongestionTreePiece`) and the 46 modules of #7668 are included unchanged; 274 new modules. No κ claim and no word claim in Lean: every object in the three theorems is abstract, and nothing in Lean ties a word to the hypotheses. + +**Results.** Three theorems, each proving, for `t ∈ [t0, 1]` (that is, `t0 ≤ t ≤ 1`), `Finv (1 − t) (invoice (caller 6 7) n 17) < 0` (caller `caller 6 7`, L = 17) under the hypotheses listed in `PROVED.md` (copied from the Lean text). They differ in the bound on one named hypothesis, `ω ≤ w0` (the net G'-token rank that owned rows absorb), which sets the allowance `NDL = 15 + w0`: +- `ceiling_reader_GD_w10` (headline, `CongestionReaderW10`): `ω ≤ 10`, t0 = .0115428 (`a0RF` = 28857/2500000). +- `ceiling_reader_GD` (`CongestionReader`): `ω ≤ 0`, t0 = .0115262 (`a0RD`). +- `ceiling_reader_GD_w16` (`CongestionReaderW16`): `ω ≤ 16`, t0 = .0115528 (`a0RE`). +For comparison `ceiling_tree_GD` (#7678) is .0116750. On `[.0118103, 1]` each applies `ceiling_native_J` with its own hypotheses; on `[t0, .0118103]` it uses two or three kernel-certified `reader_piece`s. Certified digits are 1.1e-6 to 1.2e-6 above the paper digits (.0115417, .0115250, .0115516), because t is quantised to 1e-7 and the line constants and weights are rounded outward. The paper digits are reproduced by the master-LP script (.011541666, .011525001, .011551596). Lean proves: the register identity and `tied_rho` (a register tied to a reader has residual at least `delta = 7^s + 2^s − 8^s − 1`), the payer summation `sum_c2_pay`, the reader line bound `tree_lower_reader`, the piece lemma, soundness of six 230-row DP tables (one `decide +kernel` per row) and all per-piece numerics. All theorems print only propext, Classical.choice, Quot.sound; no `sorry`, no `native_decide`; every new module was compiled fresh (`CHECK.txt`). + +**What the charge is.** Each reader (104) that is tied to a distinct public register (Z-class, 0 → 8, or V-class born at dim 1, ending at 9, with a stop at a dim in [2, 7]) adds `delta` to the budget; the readers that are not tied and not fully transported (at most 5 mixed registers, at most 10 owned last movers, plus `ω`) are priced by an allowance of `delta` each. + +**Scope.** One 104-port set. Five word files share it (st1, #7637, x1t2a, #7660, and `t7669`, our reproduction of the word of #7669, not that file); the word-level numbers in `NATIVES.md` are for these five. + +**Hypotheses.** All in `PROVED.md`. The 32 explicit binders shared with `ceiling_native_J` are textually identical to that theorem and to `ceiling_tree_GD` (compared by script). New or changed: `T : TreeData` (now the readers' tables), `hcstLo`, `hcstMonoT`, `hcst0`, `hcst1` (and `hcst2` in `ceiling_reader_GD`), `hP1`, `hP2` on the new window, `ω`, `hω`, `Q`, `Uo`, `hUo`, `hUc`, `hQ`, `hcase`, `π`, `hπR`, `hπinj`, `hTied`. +- **`ω ≤ 10` is proved on paper but is a named hypothesis in Lean.** Premises of the paper proof: no owned register rises from dim ≤ 7 into V, every owned lifetime ends in a CLEAR; both hold on all five words, where `ω = 0` (exact replay modulo two primes). The CLEAR certificates are not wired into this package. +- **`hTied`, `hcase`, `hUc`: open (paper).** `tied_rho` is proved, so the residual bound is not a hypothesis; the existence and uniqueness of a tied register per tied reader is. On all five words every reader has a Lean-`Tied` register on its final chart and a maximum matching of readers to registers has size 104 / 104. +- **`T` (IN side) is open.** The IN DP table is the reflection of the OUT table (paper); the Lean-kernel IN table rfiR differs from gbR in the edge masks of 89 of 230 rows (dim, n, m agree in all 230; the numeric g/ge lists differ in 225 rows); rfaR and gaR have identical masks (corrected; an earlier version of this text said 18 of 230). After opening, the IN-side reader trees were extracted from all five words and every word-checkable IN-side premise passes (two primes; see `NATIVES.md`); the OUT-side tree premises of #7678 were re-checked on all five words (both primes). +- `hcstLo : 0 ≤ cstF` on `[a0, 1/10]` is a hypothesis; on paper it follows from `cst(t) ≥ c2(7, 8) > 0`. + +**Caveats, stated plainly.** +- The F2 lemma as first posed (a paying register inside the reader's visit set) is false: a five-register token-swap counterexample exists. The statements use the corrected count form (payers ≥ N_high − 15 − ω), proved on paper for the class; Lean uses only the existence of a tied register per tied reader and the count bound on `Uo`. The clause "only public registers hold G' tokens" is false on the natives (15 to 28 owned registers hold tokens) and is not used. +- The 5-allowance paper figure (.0115086) is not formalised: owned moves can end at dim-8 charts without a public payer, so 10 owned last movers are added (NDL = 15). +- The word-level premises are computed by scripts that are not in the package (`NATIVES.md`: premise × word table, methods, which were re-run). Nothing in Lean ties a word to the hypotheses. `hmix = 5` is tight on all five words; the five words are close to one data point (one port set). +- The Lean-certified digits are weaker than the paper digits by about 1.1e-6 to 1.2e-6. +- The docstrings of the final modules had a wrong digit for t0 in the working copy; corrected in this package (comments only). +- `CHECK.txt`: all 274 new modules were compiled fresh, one at a time under a 3.5 GB guard. The 50 inherited modules were not rebuilt; their oleans are those of the build of #7678's package (same sources). + +The premises under study are SYLforge's (#7616, #7620); the caller is rohanarun's (#7113). DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. + +🤖 Generated with [Claude Code](https://claude.com/claude-code) diff --git a/research/p104-reader-ceiling/README.md b/research/p104-reader-ceiling/README.md new file mode 100644 index 0000000000..796e6c9904 --- /dev/null +++ b/research/p104-reader-ceiling/README.md @@ -0,0 +1,86 @@ +# P104: per-reader endpoint charge, frontier-word ceiling kappa <= .0115428 (Lean, conditional, no kappa claim) + +Authors: DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. **No kappa claim.** Everything here is a Lean statement with named hypotheses; the reader hypotheses are open (paper statements, computed on five words but not proved in Lean). It builds on #7678 (the tree ceiling `ceiling_tree_GD`, t0 = .0116750) and through it on #7668 (`ceiling_native_J`, t0 = .0118103): the modules of #7678 that the new files import (`CTreeCore`, `CongestionTreeCore`, `CongestionTreeW`, `CongestionTreePiece`) and the 46 modules of #7668 are included unchanged. Lean proves nothing about the extracted data's fidelity, the word files, or the checker programs. + +## The three theorems +Each concludes `F(1 - t, invoice (caller 6 7) n 17) < 0` for `t` in `[t0, 1]` (that is, `t0 <= t <= 1`), i.e. kappa <= `t0` for any data meeting the hypotheses, on the 17-call invoice (`L = 17`) of the #7113 caller `caller 6 7` = C(8|9). On `[tJ0, 1]` they apply `ceiling_native_J` with its own hypotheses; on `[t0, tJ0]` they use two or three `reader_piece`s. + +| theorem | module | omega bound `hω` | allowance `NDL = 15 + omega` | `t0` (certified, Lean) | paper figure (script) | +|---|---|---|---|---|---| +| `ceiling_reader_GD` | `CongestionReader` | `ω ≤ 0` | 15 | .0115262 (`a0RD` = 57631/5000000) | .0115250 | +| **`ceiling_reader_GD_w10` (headline)** | `CongestionReaderW10` | `ω ≤ 10` | 25 | **.0115428** (`a0RF` = 28857/2500000) | .0115417 | +| `ceiling_reader_GD_w16` | `CongestionReaderW16` | `ω ≤ 16` | 31 | .0115528 (`a0RE` = 14441/1250000) | .0115516 | + +For comparison `ceiling_tree_GD` (#7678) is .0116750. The certified digit is 1.1e-6 to 1.2e-6 above the paper digit in each row: t is quantised to 1e-7 after piece margins of at least .002, the line constants are rounded down and the weights and delta rounded outward. "Certified" is what Lean proves; "paper" is the output of the (not included) master-LP script (`NATIVES.md`), reproduced here as .011525000780, .011541666284 and .011551595956 for NDL = 15, 25, 31. + +## What the new charge is +The tree bound of #7678 charges each source's moves; the reader side (IN) of the same master problem charges each of the 104 readers. A register's excess equals the sum of its move costs `c2` plus a residual `rho`, and a register that is TIED to a reader (a Z-class register, born at dim 0 and ending at dim 8, or a V-class register born at dim 1 and ending at 9, with a stop at a dim in [2, 7]) has `rho >= delta = beta(7) - beta(8) = 7^s + 2^s - 8^s - 1` (`tied_rho`, proved, from the concavity of x^s). Distinct readers tied to distinct registers therefore each add `delta` to the budget, additively (`sum_c2_pay`, proved). The readers that are not tied and not fully transported are absorbed by an allowance: at most 5 mixed registers, at most 10 owned last movers, and `omega` (the net G'-token rank that owned rows absorb), each costing one `delta` (`tree_lower_reader`, proved; `lineOKR`). + +## What Lean proves +`resid_V`, `resid_Z` (the register identity, inequality form), `beta_ge` and `tied_rho` (a tied register has `rho >= delta`), `sum_c2_pay` (payer summation), `tree_lower_reader` (the Lagrange line bound with the per-reader allowance `dI <= SC delta` for tied readers and the allowance `NDL * dI` subtracted for the untied), `reader_regs_lower` and `reader_piece` (a piece lemma in the shape of `tree_piece`: the `delta |Q|` term cancels, so `|Q|` is never bounded below), soundness of two 230-row DP tables per variant, the A-class and the I-class one (six in all, `CTree{rda,rdi,rfa,rfi,rea,rei}`, one `decide +kernel` per row), the per-piece numeric certificates (weights, delta enclosure `hdel*`, line, sigma, point, unit) and the sign `0 <= corrC cstF s` given `hcstLo` (`corr_nonneg*`). All theorems print only propext, Classical.choice, Quot.sound; no `sorry`, no `native_decide` (`CHECK.txt`). One draft statement was false and was caught by Lean: the first draft allowed a negative `gB`, which is unsound for readers with no cells (caught by the `ℕ` typing); the final statements use `gamma = max(0, ...)`. + +## Hypotheses (generated from the Lean binders) +`PROVED.md` has the three statements verbatim, generated by script (`gendocs_rd.py`, not included) from the Lean text. The 32 explicit binders shared with `ceiling_native_J` (#7668) (`R`, `nR`, `dR`, `hmono`, `hd9`, `hmix`, `n`, `ks`, `mr`, `st`, `E`, `J`, `distF`, `spF`, `cstF`, `hk`, `hmass`, `hmd`, `hmr`, `hF`, `hY`, `hst`, `hEex`, `hcong`, `hdist`, `hJ`, `hspMono`, `hcstMono`, `hspTab`, `hcstTab`, `hspTabJ`, `hcstTabJ`; after the implicit `{ι : Type*} [DecidableEq ι]`) are textually identical to that theorem and to `ceiling_tree_GD` (compared by script); their status is that of #7668 and #7678. In particular `hcong`, `hdist` and `hJ` are used only on `[tJ0, 1]`. New or changed binders (types abbreviated at 700 characters; `σ ρ μ : Type` with `DecidableEq`): + +| hypothesis | in | Lean type (shown for `ceiling_reader_GD`, omega ≤ 0) | +|---|---|---| +| `T` | all three; the readers' tables (IN side) | `CTree.TreeData σ ρ μ CTree.rdaR CTree.rdiR CTree.rdar0 CTree.rdir0 48` | +| `hcstLo` | all three (bound at `a0RD` / `a0RF` / `a0RE`) | `∀ t : ℝ, ((a0RD : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t` | +| `hcstMonoT` | all three (same window constants) | `MonotoneOn cstF (Set.Icc ((a0RD : ℚ) : ℝ) (1 / 10))` | +| `hcst0` | all three | `cstF ((tRD1 : ℚ) : ℝ) ≤ ((cHRD0 : ℚ) : ℝ)` | +| `hcst1` | all three | `cstF ((tRD2 : ℚ) : ℝ) ≤ ((cHRD1 : ℚ) : ℝ)` | +| `hcst2` | `ceiling_reader_GD` only (three window pieces; the other two have two) | `cstF ((tRD3 : ℚ) : ℝ) ≤ ((cHRD2 : ℚ) : ℝ)` | +| `hP1` | all three (window constant) | `∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s` | +| `hP2` | all three (window constant) | `∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s` | +| `ω` | all three | `ℕ` | +| `hω` | `ω ≤ 0` / `ω ≤ 10` / `ω ≤ 16` | `ω ≤ 0` | +| `Q Uo` | all three | `Finset σ` | +| `hUo` | all three | `Uo ⊆ T.S` | +| `hUc` | all three | `Uo.card ≤ 15 + ω` | +| `hQ` | all three | `Q ⊆ T.S` | +| `hcase` | all three | `∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo` | +| `π` | all three | `σ → ι` | +| `hπR` | all three | `∀ t ∈ Q, π t ∈ R` | +| `hπinj` | all three | `Set.InjOn π Q` | +| `hTied` | all three | `∀ t ∈ Q, CongestionReader.Tied nR dR (π t)` | + +All fields of `T : TreeData` (`J S Bset Mv Mreg Mun dA dB nm ms R x`, `hJS hScard hfib hJcard hB hBcard hcell hxk htreeA htreeB hnd hMv hcap hMsub hdim`; definition in `PROVED.md`) are hypotheses, as in #7678, but `T` is now the READERS' tree data (see the first item below). + +Reading of the new hypotheses (status): +1. `T` (IN side): `T.S` = readers, `T.J` = (reader, source) cells, `T.R` = sources of non-transported cells; the IN DP table is the reflection of the OUT table (paper: the root value is equal at every k, c2 is reflection symmetric) and the reflection is folded into `T.dA`, `T.dB`. The restricted-edge set of the 48 readers is the I-class set (tables `rdi`, `rfi`, `rei`; the Lean-kernel IN table rfiR differs from gbR in the edge masks of 89 of 230 rows (dim, n, m agree in all 230; the numeric g/ge lists differ in 225 rows); rfaR and gaR have identical masks (corrected from an earlier "18 of 230"); the table that Lean checks is the IN one). Open (paper) as a class statement; on the five words the IN-side trees were extracted and checked (`NATIVES.md`). The OUT-side counterparts were (`NATIVES.md`). +2. `Q, Uo, hUo, hQ, hcase`: every reader is tied (`Q`), or all-transported (`x = k`, needing only `lam <= capI`), or in `Uo`. This is the dichotomy: cells on dim-1 moves carry at most one cell each at cost at least `min(c18, capv)`, else a register dedicated to the reader pays. Open (paper). Numerics: on the natives the dim-1 branch never binds (its cost is at least 3.2 times the reader's tree cost). +3. `ω`, `hω`, `hUc : Uo.card <= 15 + ω`: `|Uo| <= 5` mixed `+ 10` owned last movers `+ ω`. **`ω <= 10` is proved on paper (a rank-count argument whose premises are: no owned register rises from dim <= 7 into V, and every owned lifetime ends in a CLEAR) but is a named hypothesis in Lean**; the CLEAR certificates are not wired into this package. `ω = 0` on all five words (`NATIVES.md`), which is the `ω <= 0` theorem's hypothesis; the headline `ω <= 10` is the variant whose bound is proved on paper for the class. `ω <= 16` is kept as the wide variant (the owned token rank if none of it were redundant). +4. `π, hπR, hπinj, hTied`: each tied reader has a distinct public register `π t` with `Tied` (as defined in `PROVED.md`). `tied_rho` is proved, so `rho >= delta` is not a hypothesis; the existence and uniqueness of the tied register is. Paper premises: the cell paths of #7678's tree, at most 5 mixed registers, the owned-surplus accounting of #7668 (`Omega ks mr s = dprice ks s + mr - (6 * 9^s + 10)`, appendix of `PROVED.md`), mains X, X2 born at dim 1 (audited as a restriction on the class, not a class fact; it holds on all five words), and the lineage step below. Uniqueness uses "every register visits at most one dim-8 chart". +5. `hcstLo : 0 <= cstF t` on `[a0, 1/10]`: makes the sign `0 <= corrC cstF s` (needed for `hP2`) a Lean fact. `cstF` is a free function in the Lean text with upper brackets only; the lower bracket follows on paper from `cst(t) = max c2(p,q)/(q-p) >= c2(7,8) > 0`. `hcstMonoT`, `hcst0`, `hcst1` (and `hcst2` in `ceiling_reader_GD`) are the monotonicity and the outward-rounded brackets on the new window. + +## Caveats, stated plainly +- The F2 (lineage) lemma as first posed ("some register in S_t pays") is FALSE: a five-register token-swap counterexample (a payer outside S_t, none inside) exists, and `TL-a`'s clause "only public registers hold e_g" is false on the natives (15 to 28 owned registers hold G' tokens, depending on the word). Neither is used. The statements use the count form F2* (payers `>= N_high - 15 - omega`), proved on paper for the class under the premises of item 3; Lean uses only the existence of a tied register per tied reader (item 4) and the count bound on `Uo` (item 3). +- The paper figure with 5 allowances (.0115086) is not formalised; an audit showed owned moves can end at dim-8 charts without a public payer, hence NDL = 15 (5 mixed + 10 owned last movers), and, for `omega`, up to 10 more. +- Digits: the Lean-certified digits are weaker than the paper digits by 1.1e-6 to 1.2e-6 (above); a different rounding of t is not claimed. The window of each piece is `[a0, tJ0]`, `tJ0 = .0118103`, and the conclusion is for `t` in `[t0, 1]`. +- The tree premises of #7678 (`Tr` out-trees, `hcap`, `hnd`, `hP1`, `hP2`, `hcell`) were re-checked here on five words (OUT side, both primes; the word side of `hP1` also at the lower end of the new window; `NATIVES.md`): they are not proved in Lean and the IN-side analogues are open. +- Word-level facts (`NATIVES.md`) are computed by scripts that are not part of the package: five words, one port set of 104 odd-weight vectors (close to a single data point for port-set-dependent facts); `hmix = 5` is tight. Nothing in Lean ties a word to the hypotheses. +- The docstrings of the three final modules stated a wrong digit for `t0` in the working copy; they were corrected in this package (comments only; the numeric definitions are those compiled). + +## Files +| file | content | +|---|---| +| PROVED.md | the three statements, `Tied`, `rho`, `lineOKR`, the proved lemmas and `TreeData`, copied by script from the Lean text; definitions appendix | +| NATIVES.md | premise x word table (st1, #7637, x1t2a, #7660 word, our reproduction of the #7669 word), scripts and methods | +| CHECK.txt | fresh compile table of the new modules with the axiom lines | +| PR_BODY.md | draft PR description | +| LICENSE | Apache-2.0 | +| lean/ | Lean subproject; sources in `lean/Nov15/` (324 modules: the import closure), notes in `lean/Nov15/CongestionReader.md` | + +New modules (274): `CongestionReaderCore`, `CongestionReaderTree`, `CongestionReaderPiece`; `CTree{rda,rdi,rfa,rfi,rea,rei}{Defs,P0..P28}` with `CTreeData{RD,RF,RE}{A,I}` (the DP row tables); `CongestionReaderCert{RD,RF,RE}{Defs,Wt0..Wt13,Wt,D,Dl,S0,T0,U0,L0,...}` (weights, delta, line, sigma, point, unit certificates); the finals `CongestionReader`, `CongestionReaderW10`, `CongestionReaderW16`. The 50 inherited modules are unchanged: 46 of #7668 and `CTreeCore`, `CongestionTreeCore`, `CongestionTreeW`, `CongestionTreePiece` of #7678. + +## Pins and build +Toolchain `leanprover/lean4:v4.33.0-rc1` (`lean/lean-toolchain`); Mathlib commit `55b7917b472489c7c56a0fa6393af05cfd536599` (`lean/lakefile.toml`, `lean/lake-manifest.json`). +``` +cd lean +lake exe cache get +lake build +``` +`CHECK.txt` was produced file by file with `lean -j1 -o` in dependency order against an existing build of the pinned Mathlib, with an output directory first on the search path. `lake build` itself was not run. + +## Not included +The programs that compute the word-level premises, the DP tables and the certificate generators, the word files, and the working notes the per-file `.md` cites (the labels CG2, AUD, F1, F2, F2b, TL-a/b/c, EP3 are labels of those notes). diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreeCore.lean b/research/p104-reader-ceiling/lean/Nov15/CTreeCore.lean new file mode 100644 index 0000000000..87f43ef470 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreeCore.lean @@ -0,0 +1,39 @@ +/-! CTreeCore: Row structure and kernel-checkable DP certificate conditions (Lean core only). +Data and kernel check for the CongestionTree DP certificates (no imports; Lean core only). -/ +namespace CTree + +/-- one shape (dim, n, m) of the 230-shape DAG with its certificate rows; `i` is the shape's label in `shapes.txt`, +`mask` the bit-set of allowed child labels, `g` the table G(x, k), `ge` the table Ge(x, j) (min over allowed children). -/ +structure Row where + i : Nat + dim : Nat + n : Nat + m : Nat + mask : Nat + g : List Nat + ge : List Nat + +def Row.ok (r r' : Row) : Bool := + decide (r.dim < r'.dim) && decide (r.n ≤ r'.n) && decide (r'.m ≤ r.m) && ((r.mask >>> r'.i) % 2 == 1) + +def ew (W : List (List Nat)) (r r' : Row) : Nat := ((W.getD r.dim []).getD r'.dim 0) / r.n + +def rowLe : List Nat → List Nat → Nat → Bool + | a :: as, b :: bs, w => decide (a ≤ w + b) && rowLe as bs w + | _, _, _ => true + +def monoB : List Nat → Bool + | a :: b :: t => decide (a ≤ b) && monoB (b :: t) + | _ => true + +def Row.c4 (r : Row) : Bool := + (List.range r.m).all (fun k => (List.range (k + 1)).all (fun j => + decide (r.g.getD (k + 1) 0 ≤ r.ge.getD (j + 1) 0 + r.g.getD (k - j) 0))) + +def Row.check (W : List (List Nat)) (rs : List Row) (r : Row) : Bool := + decide (1 ≤ r.dim) && decide (r.dim ≤ 8) && decide (1 ≤ r.n) && (r.g.length == r.m + 1) && (r.ge.length == r.m + 1) + && (r.g.getD 0 0 == 0) && monoB r.g + && (if r.dim == 8 then decide (r.m ≤ 1) && r.g.all (fun v => v == 0) + else rs.all (fun r' => !(r.ok r') || rowLe (r.ge.drop 1) (r'.g.drop 1) (ew W r r')) && r.c4) + +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreeDataRDA.lean b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRDA.lean new file mode 100644 index 0000000000..0dabe1b9a6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRDA.lean @@ -0,0 +1,35 @@ +import Nov15.CTreerdaP0 +import Nov15.CTreerdaP1 +import Nov15.CTreerdaP2 +import Nov15.CTreerdaP3 +import Nov15.CTreerdaP4 +import Nov15.CTreerdaP5 +import Nov15.CTreerdaP6 +import Nov15.CTreerdaP7 +import Nov15.CTreerdaP8 +import Nov15.CTreerdaP9 +import Nov15.CTreerdaP10 +import Nov15.CTreerdaP11 +import Nov15.CTreerdaP12 +import Nov15.CTreerdaP13 +import Nov15.CTreerdaP14 +import Nov15.CTreerdaP15 +import Nov15.CTreerdaP16 +import Nov15.CTreerdaP17 +import Nov15.CTreerdaP18 +import Nov15.CTreerdaP19 +import Nov15.CTreerdaP20 +import Nov15.CTreerdaP21 +import Nov15.CTreerdaP22 +import Nov15.CTreerdaP23 +import Nov15.CTreerdaP24 +import Nov15.CTreerdaP25 +import Nov15.CTreerdaP26 +import Nov15.CTreerdaP27 +import Nov15.CTreerdaP28 +namespace CTree +set_option maxRecDepth 100000 in +theorem rda_all : ∀ r ∈ rdaR, Row.check rdaW rdaR r = true := by + unfold rdaR + exact List.forall_mem_cons.2 ⟨rdac0, List.forall_mem_cons.2 ⟨rdac1, List.forall_mem_cons.2 ⟨rdac2, List.forall_mem_cons.2 ⟨rdac3, List.forall_mem_cons.2 ⟨rdac4, List.forall_mem_cons.2 ⟨rdac5, List.forall_mem_cons.2 ⟨rdac6, List.forall_mem_cons.2 ⟨rdac7, List.forall_mem_cons.2 ⟨rdac8, List.forall_mem_cons.2 ⟨rdac9, List.forall_mem_cons.2 ⟨rdac10, List.forall_mem_cons.2 ⟨rdac11, List.forall_mem_cons.2 ⟨rdac12, List.forall_mem_cons.2 ⟨rdac13, List.forall_mem_cons.2 ⟨rdac14, List.forall_mem_cons.2 ⟨rdac15, List.forall_mem_cons.2 ⟨rdac16, List.forall_mem_cons.2 ⟨rdac17, List.forall_mem_cons.2 ⟨rdac18, List.forall_mem_cons.2 ⟨rdac19, List.forall_mem_cons.2 ⟨rdac20, List.forall_mem_cons.2 ⟨rdac21, List.forall_mem_cons.2 ⟨rdac22, List.forall_mem_cons.2 ⟨rdac23, List.forall_mem_cons.2 ⟨rdac24, List.forall_mem_cons.2 ⟨rdac25, List.forall_mem_cons.2 ⟨rdac26, List.forall_mem_cons.2 ⟨rdac27, List.forall_mem_cons.2 ⟨rdac28, List.forall_mem_cons.2 ⟨rdac29, List.forall_mem_cons.2 ⟨rdac30, List.forall_mem_cons.2 ⟨rdac31, List.forall_mem_cons.2 ⟨rdac32, List.forall_mem_cons.2 ⟨rdac33, List.forall_mem_cons.2 ⟨rdac34, List.forall_mem_cons.2 ⟨rdac35, List.forall_mem_cons.2 ⟨rdac36, List.forall_mem_cons.2 ⟨rdac37, List.forall_mem_cons.2 ⟨rdac38, List.forall_mem_cons.2 ⟨rdac39, List.forall_mem_cons.2 ⟨rdac40, List.forall_mem_cons.2 ⟨rdac41, List.forall_mem_cons.2 ⟨rdac42, List.forall_mem_cons.2 ⟨rdac43, List.forall_mem_cons.2 ⟨rdac44, List.forall_mem_cons.2 ⟨rdac45, List.forall_mem_cons.2 ⟨rdac46, List.forall_mem_cons.2 ⟨rdac47, List.forall_mem_cons.2 ⟨rdac48, List.forall_mem_cons.2 ⟨rdac49, List.forall_mem_cons.2 ⟨rdac50, List.forall_mem_cons.2 ⟨rdac51, List.forall_mem_cons.2 ⟨rdac52, List.forall_mem_cons.2 ⟨rdac53, List.forall_mem_cons.2 ⟨rdac54, List.forall_mem_cons.2 ⟨rdac55, List.forall_mem_cons.2 ⟨rdac56, List.forall_mem_cons.2 ⟨rdac57, List.forall_mem_cons.2 ⟨rdac58, List.forall_mem_cons.2 ⟨rdac59, List.forall_mem_cons.2 ⟨rdac60, List.forall_mem_cons.2 ⟨rdac61, List.forall_mem_cons.2 ⟨rdac62, List.forall_mem_cons.2 ⟨rdac63, List.forall_mem_cons.2 ⟨rdac64, List.forall_mem_cons.2 ⟨rdac65, List.forall_mem_cons.2 ⟨rdac66, List.forall_mem_cons.2 ⟨rdac67, List.forall_mem_cons.2 ⟨rdac68, List.forall_mem_cons.2 ⟨rdac69, List.forall_mem_cons.2 ⟨rdac70, List.forall_mem_cons.2 ⟨rdac71, List.forall_mem_cons.2 ⟨rdac72, List.forall_mem_cons.2 ⟨rdac73, List.forall_mem_cons.2 ⟨rdac74, List.forall_mem_cons.2 ⟨rdac75, List.forall_mem_cons.2 ⟨rdac76, List.forall_mem_cons.2 ⟨rdac77, List.forall_mem_cons.2 ⟨rdac78, List.forall_mem_cons.2 ⟨rdac79, List.forall_mem_cons.2 ⟨rdac80, List.forall_mem_cons.2 ⟨rdac81, List.forall_mem_cons.2 ⟨rdac82, List.forall_mem_cons.2 ⟨rdac83, List.forall_mem_cons.2 ⟨rdac84, List.forall_mem_cons.2 ⟨rdac85, List.forall_mem_cons.2 ⟨rdac86, List.forall_mem_cons.2 ⟨rdac87, List.forall_mem_cons.2 ⟨rdac88, List.forall_mem_cons.2 ⟨rdac89, List.forall_mem_cons.2 ⟨rdac90, List.forall_mem_cons.2 ⟨rdac91, List.forall_mem_cons.2 ⟨rdac92, List.forall_mem_cons.2 ⟨rdac93, List.forall_mem_cons.2 ⟨rdac94, List.forall_mem_cons.2 ⟨rdac95, List.forall_mem_cons.2 ⟨rdac96, List.forall_mem_cons.2 ⟨rdac97, List.forall_mem_cons.2 ⟨rdac98, List.forall_mem_cons.2 ⟨rdac99, List.forall_mem_cons.2 ⟨rdac100, List.forall_mem_cons.2 ⟨rdac101, List.forall_mem_cons.2 ⟨rdac102, List.forall_mem_cons.2 ⟨rdac103, List.forall_mem_cons.2 ⟨rdac104, List.forall_mem_cons.2 ⟨rdac105, List.forall_mem_cons.2 ⟨rdac106, List.forall_mem_cons.2 ⟨rdac107, List.forall_mem_cons.2 ⟨rdac108, List.forall_mem_cons.2 ⟨rdac109, List.forall_mem_cons.2 ⟨rdac110, List.forall_mem_cons.2 ⟨rdac111, List.forall_mem_cons.2 ⟨rdac112, List.forall_mem_cons.2 ⟨rdac113, List.forall_mem_cons.2 ⟨rdac114, List.forall_mem_cons.2 ⟨rdac115, List.forall_mem_cons.2 ⟨rdac116, List.forall_mem_cons.2 ⟨rdac117, List.forall_mem_cons.2 ⟨rdac118, List.forall_mem_cons.2 ⟨rdac119, List.forall_mem_cons.2 ⟨rdac120, List.forall_mem_cons.2 ⟨rdac121, List.forall_mem_cons.2 ⟨rdac122, List.forall_mem_cons.2 ⟨rdac123, List.forall_mem_cons.2 ⟨rdac124, List.forall_mem_cons.2 ⟨rdac125, List.forall_mem_cons.2 ⟨rdac126, List.forall_mem_cons.2 ⟨rdac127, List.forall_mem_cons.2 ⟨rdac128, List.forall_mem_cons.2 ⟨rdac129, List.forall_mem_cons.2 ⟨rdac130, List.forall_mem_cons.2 ⟨rdac131, List.forall_mem_cons.2 ⟨rdac132, List.forall_mem_cons.2 ⟨rdac133, List.forall_mem_cons.2 ⟨rdac134, List.forall_mem_cons.2 ⟨rdac135, List.forall_mem_cons.2 ⟨rdac136, List.forall_mem_cons.2 ⟨rdac137, List.forall_mem_cons.2 ⟨rdac138, List.forall_mem_cons.2 ⟨rdac139, List.forall_mem_cons.2 ⟨rdac140, List.forall_mem_cons.2 ⟨rdac141, List.forall_mem_cons.2 ⟨rdac142, List.forall_mem_cons.2 ⟨rdac143, List.forall_mem_cons.2 ⟨rdac144, List.forall_mem_cons.2 ⟨rdac145, List.forall_mem_cons.2 ⟨rdac146, List.forall_mem_cons.2 ⟨rdac147, List.forall_mem_cons.2 ⟨rdac148, List.forall_mem_cons.2 ⟨rdac149, List.forall_mem_cons.2 ⟨rdac150, List.forall_mem_cons.2 ⟨rdac151, List.forall_mem_cons.2 ⟨rdac152, List.forall_mem_cons.2 ⟨rdac153, List.forall_mem_cons.2 ⟨rdac154, List.forall_mem_cons.2 ⟨rdac155, List.forall_mem_cons.2 ⟨rdac156, List.forall_mem_cons.2 ⟨rdac157, List.forall_mem_cons.2 ⟨rdac158, List.forall_mem_cons.2 ⟨rdac159, List.forall_mem_cons.2 ⟨rdac160, List.forall_mem_cons.2 ⟨rdac161, List.forall_mem_cons.2 ⟨rdac162, List.forall_mem_cons.2 ⟨rdac163, List.forall_mem_cons.2 ⟨rdac164, List.forall_mem_cons.2 ⟨rdac165, List.forall_mem_cons.2 ⟨rdac166, List.forall_mem_cons.2 ⟨rdac167, List.forall_mem_cons.2 ⟨rdac168, List.forall_mem_cons.2 ⟨rdac169, List.forall_mem_cons.2 ⟨rdac170, List.forall_mem_cons.2 ⟨rdac171, List.forall_mem_cons.2 ⟨rdac172, List.forall_mem_cons.2 ⟨rdac173, List.forall_mem_cons.2 ⟨rdac174, List.forall_mem_cons.2 ⟨rdac175, List.forall_mem_cons.2 ⟨rdac176, List.forall_mem_cons.2 ⟨rdac177, List.forall_mem_cons.2 ⟨rdac178, List.forall_mem_cons.2 ⟨rdac179, List.forall_mem_cons.2 ⟨rdac180, List.forall_mem_cons.2 ⟨rdac181, List.forall_mem_cons.2 ⟨rdac182, List.forall_mem_cons.2 ⟨rdac183, List.forall_mem_cons.2 ⟨rdac184, List.forall_mem_cons.2 ⟨rdac185, List.forall_mem_cons.2 ⟨rdac186, List.forall_mem_cons.2 ⟨rdac187, List.forall_mem_cons.2 ⟨rdac188, List.forall_mem_cons.2 ⟨rdac189, List.forall_mem_cons.2 ⟨rdac190, List.forall_mem_cons.2 ⟨rdac191, List.forall_mem_cons.2 ⟨rdac192, List.forall_mem_cons.2 ⟨rdac193, List.forall_mem_cons.2 ⟨rdac194, List.forall_mem_cons.2 ⟨rdac195, List.forall_mem_cons.2 ⟨rdac196, List.forall_mem_cons.2 ⟨rdac197, List.forall_mem_cons.2 ⟨rdac198, List.forall_mem_cons.2 ⟨rdac199, List.forall_mem_cons.2 ⟨rdac200, List.forall_mem_cons.2 ⟨rdac201, List.forall_mem_cons.2 ⟨rdac202, List.forall_mem_cons.2 ⟨rdac203, List.forall_mem_cons.2 ⟨rdac204, List.forall_mem_cons.2 ⟨rdac205, List.forall_mem_cons.2 ⟨rdac206, List.forall_mem_cons.2 ⟨rdac207, List.forall_mem_cons.2 ⟨rdac208, List.forall_mem_cons.2 ⟨rdac209, List.forall_mem_cons.2 ⟨rdac210, List.forall_mem_cons.2 ⟨rdac211, List.forall_mem_cons.2 ⟨rdac212, List.forall_mem_cons.2 ⟨rdac213, List.forall_mem_cons.2 ⟨rdac214, List.forall_mem_cons.2 ⟨rdac215, List.forall_mem_cons.2 ⟨rdac216, List.forall_mem_cons.2 ⟨rdac217, List.forall_mem_cons.2 ⟨rdac218, List.forall_mem_cons.2 ⟨rdac219, List.forall_mem_cons.2 ⟨rdac220, List.forall_mem_cons.2 ⟨rdac221, List.forall_mem_cons.2 ⟨rdac222, List.forall_mem_cons.2 ⟨rdac223, List.forall_mem_cons.2 ⟨rdac224, List.forall_mem_cons.2 ⟨rdac225, List.forall_mem_cons.2 ⟨rdac226, List.forall_mem_cons.2 ⟨rdac227, List.forall_mem_cons.2 ⟨rdac228, List.forall_mem_cons.2 ⟨rdac229, fun _ h => nomatch h⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩ +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreeDataRDI.lean b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRDI.lean new file mode 100644 index 0000000000..47092a829d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRDI.lean @@ -0,0 +1,35 @@ +import Nov15.CTreerdiP0 +import Nov15.CTreerdiP1 +import Nov15.CTreerdiP2 +import Nov15.CTreerdiP3 +import Nov15.CTreerdiP4 +import Nov15.CTreerdiP5 +import Nov15.CTreerdiP6 +import Nov15.CTreerdiP7 +import Nov15.CTreerdiP8 +import Nov15.CTreerdiP9 +import Nov15.CTreerdiP10 +import Nov15.CTreerdiP11 +import Nov15.CTreerdiP12 +import Nov15.CTreerdiP13 +import Nov15.CTreerdiP14 +import Nov15.CTreerdiP15 +import Nov15.CTreerdiP16 +import Nov15.CTreerdiP17 +import Nov15.CTreerdiP18 +import Nov15.CTreerdiP19 +import Nov15.CTreerdiP20 +import Nov15.CTreerdiP21 +import Nov15.CTreerdiP22 +import Nov15.CTreerdiP23 +import Nov15.CTreerdiP24 +import Nov15.CTreerdiP25 +import Nov15.CTreerdiP26 +import Nov15.CTreerdiP27 +import Nov15.CTreerdiP28 +namespace CTree +set_option maxRecDepth 100000 in +theorem rdi_all : ∀ r ∈ rdiR, Row.check rdiW rdiR r = true := by + unfold rdiR + exact List.forall_mem_cons.2 ⟨rdic0, List.forall_mem_cons.2 ⟨rdic1, List.forall_mem_cons.2 ⟨rdic2, List.forall_mem_cons.2 ⟨rdic3, List.forall_mem_cons.2 ⟨rdic4, List.forall_mem_cons.2 ⟨rdic5, List.forall_mem_cons.2 ⟨rdic6, List.forall_mem_cons.2 ⟨rdic7, List.forall_mem_cons.2 ⟨rdic8, List.forall_mem_cons.2 ⟨rdic9, List.forall_mem_cons.2 ⟨rdic10, List.forall_mem_cons.2 ⟨rdic11, List.forall_mem_cons.2 ⟨rdic12, List.forall_mem_cons.2 ⟨rdic13, List.forall_mem_cons.2 ⟨rdic14, List.forall_mem_cons.2 ⟨rdic15, List.forall_mem_cons.2 ⟨rdic16, List.forall_mem_cons.2 ⟨rdic17, List.forall_mem_cons.2 ⟨rdic18, List.forall_mem_cons.2 ⟨rdic19, List.forall_mem_cons.2 ⟨rdic20, List.forall_mem_cons.2 ⟨rdic21, List.forall_mem_cons.2 ⟨rdic22, List.forall_mem_cons.2 ⟨rdic23, List.forall_mem_cons.2 ⟨rdic24, List.forall_mem_cons.2 ⟨rdic25, List.forall_mem_cons.2 ⟨rdic26, List.forall_mem_cons.2 ⟨rdic27, List.forall_mem_cons.2 ⟨rdic28, List.forall_mem_cons.2 ⟨rdic29, List.forall_mem_cons.2 ⟨rdic30, List.forall_mem_cons.2 ⟨rdic31, List.forall_mem_cons.2 ⟨rdic32, List.forall_mem_cons.2 ⟨rdic33, List.forall_mem_cons.2 ⟨rdic34, List.forall_mem_cons.2 ⟨rdic35, List.forall_mem_cons.2 ⟨rdic36, List.forall_mem_cons.2 ⟨rdic37, List.forall_mem_cons.2 ⟨rdic38, List.forall_mem_cons.2 ⟨rdic39, List.forall_mem_cons.2 ⟨rdic40, List.forall_mem_cons.2 ⟨rdic41, List.forall_mem_cons.2 ⟨rdic42, List.forall_mem_cons.2 ⟨rdic43, List.forall_mem_cons.2 ⟨rdic44, List.forall_mem_cons.2 ⟨rdic45, List.forall_mem_cons.2 ⟨rdic46, List.forall_mem_cons.2 ⟨rdic47, List.forall_mem_cons.2 ⟨rdic48, List.forall_mem_cons.2 ⟨rdic49, List.forall_mem_cons.2 ⟨rdic50, List.forall_mem_cons.2 ⟨rdic51, List.forall_mem_cons.2 ⟨rdic52, List.forall_mem_cons.2 ⟨rdic53, List.forall_mem_cons.2 ⟨rdic54, List.forall_mem_cons.2 ⟨rdic55, List.forall_mem_cons.2 ⟨rdic56, List.forall_mem_cons.2 ⟨rdic57, List.forall_mem_cons.2 ⟨rdic58, List.forall_mem_cons.2 ⟨rdic59, List.forall_mem_cons.2 ⟨rdic60, List.forall_mem_cons.2 ⟨rdic61, List.forall_mem_cons.2 ⟨rdic62, List.forall_mem_cons.2 ⟨rdic63, List.forall_mem_cons.2 ⟨rdic64, List.forall_mem_cons.2 ⟨rdic65, List.forall_mem_cons.2 ⟨rdic66, List.forall_mem_cons.2 ⟨rdic67, List.forall_mem_cons.2 ⟨rdic68, List.forall_mem_cons.2 ⟨rdic69, List.forall_mem_cons.2 ⟨rdic70, List.forall_mem_cons.2 ⟨rdic71, List.forall_mem_cons.2 ⟨rdic72, List.forall_mem_cons.2 ⟨rdic73, List.forall_mem_cons.2 ⟨rdic74, List.forall_mem_cons.2 ⟨rdic75, List.forall_mem_cons.2 ⟨rdic76, List.forall_mem_cons.2 ⟨rdic77, List.forall_mem_cons.2 ⟨rdic78, List.forall_mem_cons.2 ⟨rdic79, List.forall_mem_cons.2 ⟨rdic80, List.forall_mem_cons.2 ⟨rdic81, List.forall_mem_cons.2 ⟨rdic82, List.forall_mem_cons.2 ⟨rdic83, List.forall_mem_cons.2 ⟨rdic84, List.forall_mem_cons.2 ⟨rdic85, List.forall_mem_cons.2 ⟨rdic86, List.forall_mem_cons.2 ⟨rdic87, List.forall_mem_cons.2 ⟨rdic88, List.forall_mem_cons.2 ⟨rdic89, List.forall_mem_cons.2 ⟨rdic90, List.forall_mem_cons.2 ⟨rdic91, List.forall_mem_cons.2 ⟨rdic92, List.forall_mem_cons.2 ⟨rdic93, List.forall_mem_cons.2 ⟨rdic94, List.forall_mem_cons.2 ⟨rdic95, List.forall_mem_cons.2 ⟨rdic96, List.forall_mem_cons.2 ⟨rdic97, List.forall_mem_cons.2 ⟨rdic98, List.forall_mem_cons.2 ⟨rdic99, List.forall_mem_cons.2 ⟨rdic100, List.forall_mem_cons.2 ⟨rdic101, List.forall_mem_cons.2 ⟨rdic102, List.forall_mem_cons.2 ⟨rdic103, List.forall_mem_cons.2 ⟨rdic104, List.forall_mem_cons.2 ⟨rdic105, List.forall_mem_cons.2 ⟨rdic106, List.forall_mem_cons.2 ⟨rdic107, List.forall_mem_cons.2 ⟨rdic108, List.forall_mem_cons.2 ⟨rdic109, List.forall_mem_cons.2 ⟨rdic110, List.forall_mem_cons.2 ⟨rdic111, List.forall_mem_cons.2 ⟨rdic112, List.forall_mem_cons.2 ⟨rdic113, List.forall_mem_cons.2 ⟨rdic114, List.forall_mem_cons.2 ⟨rdic115, List.forall_mem_cons.2 ⟨rdic116, List.forall_mem_cons.2 ⟨rdic117, List.forall_mem_cons.2 ⟨rdic118, List.forall_mem_cons.2 ⟨rdic119, List.forall_mem_cons.2 ⟨rdic120, List.forall_mem_cons.2 ⟨rdic121, List.forall_mem_cons.2 ⟨rdic122, List.forall_mem_cons.2 ⟨rdic123, List.forall_mem_cons.2 ⟨rdic124, List.forall_mem_cons.2 ⟨rdic125, List.forall_mem_cons.2 ⟨rdic126, List.forall_mem_cons.2 ⟨rdic127, List.forall_mem_cons.2 ⟨rdic128, List.forall_mem_cons.2 ⟨rdic129, List.forall_mem_cons.2 ⟨rdic130, List.forall_mem_cons.2 ⟨rdic131, List.forall_mem_cons.2 ⟨rdic132, List.forall_mem_cons.2 ⟨rdic133, List.forall_mem_cons.2 ⟨rdic134, List.forall_mem_cons.2 ⟨rdic135, List.forall_mem_cons.2 ⟨rdic136, List.forall_mem_cons.2 ⟨rdic137, List.forall_mem_cons.2 ⟨rdic138, List.forall_mem_cons.2 ⟨rdic139, List.forall_mem_cons.2 ⟨rdic140, List.forall_mem_cons.2 ⟨rdic141, List.forall_mem_cons.2 ⟨rdic142, List.forall_mem_cons.2 ⟨rdic143, List.forall_mem_cons.2 ⟨rdic144, List.forall_mem_cons.2 ⟨rdic145, List.forall_mem_cons.2 ⟨rdic146, List.forall_mem_cons.2 ⟨rdic147, List.forall_mem_cons.2 ⟨rdic148, List.forall_mem_cons.2 ⟨rdic149, List.forall_mem_cons.2 ⟨rdic150, List.forall_mem_cons.2 ⟨rdic151, List.forall_mem_cons.2 ⟨rdic152, List.forall_mem_cons.2 ⟨rdic153, List.forall_mem_cons.2 ⟨rdic154, List.forall_mem_cons.2 ⟨rdic155, List.forall_mem_cons.2 ⟨rdic156, List.forall_mem_cons.2 ⟨rdic157, List.forall_mem_cons.2 ⟨rdic158, List.forall_mem_cons.2 ⟨rdic159, List.forall_mem_cons.2 ⟨rdic160, List.forall_mem_cons.2 ⟨rdic161, List.forall_mem_cons.2 ⟨rdic162, List.forall_mem_cons.2 ⟨rdic163, List.forall_mem_cons.2 ⟨rdic164, List.forall_mem_cons.2 ⟨rdic165, List.forall_mem_cons.2 ⟨rdic166, List.forall_mem_cons.2 ⟨rdic167, List.forall_mem_cons.2 ⟨rdic168, List.forall_mem_cons.2 ⟨rdic169, List.forall_mem_cons.2 ⟨rdic170, List.forall_mem_cons.2 ⟨rdic171, List.forall_mem_cons.2 ⟨rdic172, List.forall_mem_cons.2 ⟨rdic173, List.forall_mem_cons.2 ⟨rdic174, List.forall_mem_cons.2 ⟨rdic175, List.forall_mem_cons.2 ⟨rdic176, List.forall_mem_cons.2 ⟨rdic177, List.forall_mem_cons.2 ⟨rdic178, List.forall_mem_cons.2 ⟨rdic179, List.forall_mem_cons.2 ⟨rdic180, List.forall_mem_cons.2 ⟨rdic181, List.forall_mem_cons.2 ⟨rdic182, List.forall_mem_cons.2 ⟨rdic183, List.forall_mem_cons.2 ⟨rdic184, List.forall_mem_cons.2 ⟨rdic185, List.forall_mem_cons.2 ⟨rdic186, List.forall_mem_cons.2 ⟨rdic187, List.forall_mem_cons.2 ⟨rdic188, List.forall_mem_cons.2 ⟨rdic189, List.forall_mem_cons.2 ⟨rdic190, List.forall_mem_cons.2 ⟨rdic191, List.forall_mem_cons.2 ⟨rdic192, List.forall_mem_cons.2 ⟨rdic193, List.forall_mem_cons.2 ⟨rdic194, List.forall_mem_cons.2 ⟨rdic195, List.forall_mem_cons.2 ⟨rdic196, List.forall_mem_cons.2 ⟨rdic197, List.forall_mem_cons.2 ⟨rdic198, List.forall_mem_cons.2 ⟨rdic199, List.forall_mem_cons.2 ⟨rdic200, List.forall_mem_cons.2 ⟨rdic201, List.forall_mem_cons.2 ⟨rdic202, List.forall_mem_cons.2 ⟨rdic203, List.forall_mem_cons.2 ⟨rdic204, List.forall_mem_cons.2 ⟨rdic205, List.forall_mem_cons.2 ⟨rdic206, List.forall_mem_cons.2 ⟨rdic207, List.forall_mem_cons.2 ⟨rdic208, List.forall_mem_cons.2 ⟨rdic209, List.forall_mem_cons.2 ⟨rdic210, List.forall_mem_cons.2 ⟨rdic211, List.forall_mem_cons.2 ⟨rdic212, List.forall_mem_cons.2 ⟨rdic213, List.forall_mem_cons.2 ⟨rdic214, List.forall_mem_cons.2 ⟨rdic215, List.forall_mem_cons.2 ⟨rdic216, List.forall_mem_cons.2 ⟨rdic217, List.forall_mem_cons.2 ⟨rdic218, List.forall_mem_cons.2 ⟨rdic219, List.forall_mem_cons.2 ⟨rdic220, List.forall_mem_cons.2 ⟨rdic221, List.forall_mem_cons.2 ⟨rdic222, List.forall_mem_cons.2 ⟨rdic223, List.forall_mem_cons.2 ⟨rdic224, List.forall_mem_cons.2 ⟨rdic225, List.forall_mem_cons.2 ⟨rdic226, List.forall_mem_cons.2 ⟨rdic227, List.forall_mem_cons.2 ⟨rdic228, List.forall_mem_cons.2 ⟨rdic229, fun _ h => nomatch h⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩ +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreeDataREA.lean b/research/p104-reader-ceiling/lean/Nov15/CTreeDataREA.lean new file mode 100644 index 0000000000..be07e7b288 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreeDataREA.lean @@ -0,0 +1,35 @@ +import Nov15.CTreereaP0 +import Nov15.CTreereaP1 +import Nov15.CTreereaP2 +import Nov15.CTreereaP3 +import Nov15.CTreereaP4 +import Nov15.CTreereaP5 +import Nov15.CTreereaP6 +import Nov15.CTreereaP7 +import Nov15.CTreereaP8 +import Nov15.CTreereaP9 +import Nov15.CTreereaP10 +import Nov15.CTreereaP11 +import Nov15.CTreereaP12 +import Nov15.CTreereaP13 +import Nov15.CTreereaP14 +import Nov15.CTreereaP15 +import Nov15.CTreereaP16 +import Nov15.CTreereaP17 +import Nov15.CTreereaP18 +import Nov15.CTreereaP19 +import Nov15.CTreereaP20 +import Nov15.CTreereaP21 +import Nov15.CTreereaP22 +import Nov15.CTreereaP23 +import Nov15.CTreereaP24 +import Nov15.CTreereaP25 +import Nov15.CTreereaP26 +import Nov15.CTreereaP27 +import Nov15.CTreereaP28 +namespace CTree +set_option maxRecDepth 100000 in +theorem rea_all : ∀ r ∈ reaR, Row.check reaW reaR r = true := by + unfold reaR + exact List.forall_mem_cons.2 ⟨reac0, List.forall_mem_cons.2 ⟨reac1, List.forall_mem_cons.2 ⟨reac2, List.forall_mem_cons.2 ⟨reac3, List.forall_mem_cons.2 ⟨reac4, List.forall_mem_cons.2 ⟨reac5, List.forall_mem_cons.2 ⟨reac6, List.forall_mem_cons.2 ⟨reac7, List.forall_mem_cons.2 ⟨reac8, List.forall_mem_cons.2 ⟨reac9, List.forall_mem_cons.2 ⟨reac10, List.forall_mem_cons.2 ⟨reac11, List.forall_mem_cons.2 ⟨reac12, List.forall_mem_cons.2 ⟨reac13, List.forall_mem_cons.2 ⟨reac14, List.forall_mem_cons.2 ⟨reac15, List.forall_mem_cons.2 ⟨reac16, List.forall_mem_cons.2 ⟨reac17, List.forall_mem_cons.2 ⟨reac18, List.forall_mem_cons.2 ⟨reac19, List.forall_mem_cons.2 ⟨reac20, List.forall_mem_cons.2 ⟨reac21, List.forall_mem_cons.2 ⟨reac22, List.forall_mem_cons.2 ⟨reac23, List.forall_mem_cons.2 ⟨reac24, List.forall_mem_cons.2 ⟨reac25, List.forall_mem_cons.2 ⟨reac26, List.forall_mem_cons.2 ⟨reac27, List.forall_mem_cons.2 ⟨reac28, List.forall_mem_cons.2 ⟨reac29, List.forall_mem_cons.2 ⟨reac30, List.forall_mem_cons.2 ⟨reac31, List.forall_mem_cons.2 ⟨reac32, List.forall_mem_cons.2 ⟨reac33, List.forall_mem_cons.2 ⟨reac34, List.forall_mem_cons.2 ⟨reac35, List.forall_mem_cons.2 ⟨reac36, List.forall_mem_cons.2 ⟨reac37, List.forall_mem_cons.2 ⟨reac38, List.forall_mem_cons.2 ⟨reac39, List.forall_mem_cons.2 ⟨reac40, List.forall_mem_cons.2 ⟨reac41, List.forall_mem_cons.2 ⟨reac42, List.forall_mem_cons.2 ⟨reac43, List.forall_mem_cons.2 ⟨reac44, List.forall_mem_cons.2 ⟨reac45, List.forall_mem_cons.2 ⟨reac46, List.forall_mem_cons.2 ⟨reac47, List.forall_mem_cons.2 ⟨reac48, List.forall_mem_cons.2 ⟨reac49, List.forall_mem_cons.2 ⟨reac50, List.forall_mem_cons.2 ⟨reac51, List.forall_mem_cons.2 ⟨reac52, List.forall_mem_cons.2 ⟨reac53, List.forall_mem_cons.2 ⟨reac54, List.forall_mem_cons.2 ⟨reac55, List.forall_mem_cons.2 ⟨reac56, List.forall_mem_cons.2 ⟨reac57, List.forall_mem_cons.2 ⟨reac58, List.forall_mem_cons.2 ⟨reac59, List.forall_mem_cons.2 ⟨reac60, List.forall_mem_cons.2 ⟨reac61, List.forall_mem_cons.2 ⟨reac62, List.forall_mem_cons.2 ⟨reac63, List.forall_mem_cons.2 ⟨reac64, List.forall_mem_cons.2 ⟨reac65, List.forall_mem_cons.2 ⟨reac66, List.forall_mem_cons.2 ⟨reac67, List.forall_mem_cons.2 ⟨reac68, List.forall_mem_cons.2 ⟨reac69, List.forall_mem_cons.2 ⟨reac70, List.forall_mem_cons.2 ⟨reac71, List.forall_mem_cons.2 ⟨reac72, List.forall_mem_cons.2 ⟨reac73, List.forall_mem_cons.2 ⟨reac74, List.forall_mem_cons.2 ⟨reac75, List.forall_mem_cons.2 ⟨reac76, List.forall_mem_cons.2 ⟨reac77, List.forall_mem_cons.2 ⟨reac78, List.forall_mem_cons.2 ⟨reac79, List.forall_mem_cons.2 ⟨reac80, List.forall_mem_cons.2 ⟨reac81, List.forall_mem_cons.2 ⟨reac82, List.forall_mem_cons.2 ⟨reac83, List.forall_mem_cons.2 ⟨reac84, List.forall_mem_cons.2 ⟨reac85, List.forall_mem_cons.2 ⟨reac86, List.forall_mem_cons.2 ⟨reac87, List.forall_mem_cons.2 ⟨reac88, List.forall_mem_cons.2 ⟨reac89, List.forall_mem_cons.2 ⟨reac90, List.forall_mem_cons.2 ⟨reac91, List.forall_mem_cons.2 ⟨reac92, List.forall_mem_cons.2 ⟨reac93, List.forall_mem_cons.2 ⟨reac94, List.forall_mem_cons.2 ⟨reac95, List.forall_mem_cons.2 ⟨reac96, List.forall_mem_cons.2 ⟨reac97, List.forall_mem_cons.2 ⟨reac98, List.forall_mem_cons.2 ⟨reac99, List.forall_mem_cons.2 ⟨reac100, List.forall_mem_cons.2 ⟨reac101, List.forall_mem_cons.2 ⟨reac102, List.forall_mem_cons.2 ⟨reac103, List.forall_mem_cons.2 ⟨reac104, List.forall_mem_cons.2 ⟨reac105, List.forall_mem_cons.2 ⟨reac106, List.forall_mem_cons.2 ⟨reac107, List.forall_mem_cons.2 ⟨reac108, List.forall_mem_cons.2 ⟨reac109, List.forall_mem_cons.2 ⟨reac110, List.forall_mem_cons.2 ⟨reac111, List.forall_mem_cons.2 ⟨reac112, List.forall_mem_cons.2 ⟨reac113, List.forall_mem_cons.2 ⟨reac114, List.forall_mem_cons.2 ⟨reac115, List.forall_mem_cons.2 ⟨reac116, List.forall_mem_cons.2 ⟨reac117, List.forall_mem_cons.2 ⟨reac118, List.forall_mem_cons.2 ⟨reac119, List.forall_mem_cons.2 ⟨reac120, List.forall_mem_cons.2 ⟨reac121, List.forall_mem_cons.2 ⟨reac122, List.forall_mem_cons.2 ⟨reac123, List.forall_mem_cons.2 ⟨reac124, List.forall_mem_cons.2 ⟨reac125, List.forall_mem_cons.2 ⟨reac126, List.forall_mem_cons.2 ⟨reac127, List.forall_mem_cons.2 ⟨reac128, List.forall_mem_cons.2 ⟨reac129, List.forall_mem_cons.2 ⟨reac130, List.forall_mem_cons.2 ⟨reac131, List.forall_mem_cons.2 ⟨reac132, List.forall_mem_cons.2 ⟨reac133, List.forall_mem_cons.2 ⟨reac134, List.forall_mem_cons.2 ⟨reac135, List.forall_mem_cons.2 ⟨reac136, List.forall_mem_cons.2 ⟨reac137, List.forall_mem_cons.2 ⟨reac138, List.forall_mem_cons.2 ⟨reac139, List.forall_mem_cons.2 ⟨reac140, List.forall_mem_cons.2 ⟨reac141, List.forall_mem_cons.2 ⟨reac142, List.forall_mem_cons.2 ⟨reac143, List.forall_mem_cons.2 ⟨reac144, List.forall_mem_cons.2 ⟨reac145, List.forall_mem_cons.2 ⟨reac146, List.forall_mem_cons.2 ⟨reac147, List.forall_mem_cons.2 ⟨reac148, List.forall_mem_cons.2 ⟨reac149, List.forall_mem_cons.2 ⟨reac150, List.forall_mem_cons.2 ⟨reac151, List.forall_mem_cons.2 ⟨reac152, List.forall_mem_cons.2 ⟨reac153, List.forall_mem_cons.2 ⟨reac154, List.forall_mem_cons.2 ⟨reac155, List.forall_mem_cons.2 ⟨reac156, List.forall_mem_cons.2 ⟨reac157, List.forall_mem_cons.2 ⟨reac158, List.forall_mem_cons.2 ⟨reac159, List.forall_mem_cons.2 ⟨reac160, List.forall_mem_cons.2 ⟨reac161, List.forall_mem_cons.2 ⟨reac162, List.forall_mem_cons.2 ⟨reac163, List.forall_mem_cons.2 ⟨reac164, List.forall_mem_cons.2 ⟨reac165, List.forall_mem_cons.2 ⟨reac166, List.forall_mem_cons.2 ⟨reac167, List.forall_mem_cons.2 ⟨reac168, List.forall_mem_cons.2 ⟨reac169, List.forall_mem_cons.2 ⟨reac170, List.forall_mem_cons.2 ⟨reac171, List.forall_mem_cons.2 ⟨reac172, List.forall_mem_cons.2 ⟨reac173, List.forall_mem_cons.2 ⟨reac174, List.forall_mem_cons.2 ⟨reac175, List.forall_mem_cons.2 ⟨reac176, List.forall_mem_cons.2 ⟨reac177, List.forall_mem_cons.2 ⟨reac178, List.forall_mem_cons.2 ⟨reac179, List.forall_mem_cons.2 ⟨reac180, List.forall_mem_cons.2 ⟨reac181, List.forall_mem_cons.2 ⟨reac182, List.forall_mem_cons.2 ⟨reac183, List.forall_mem_cons.2 ⟨reac184, List.forall_mem_cons.2 ⟨reac185, List.forall_mem_cons.2 ⟨reac186, List.forall_mem_cons.2 ⟨reac187, List.forall_mem_cons.2 ⟨reac188, List.forall_mem_cons.2 ⟨reac189, List.forall_mem_cons.2 ⟨reac190, List.forall_mem_cons.2 ⟨reac191, List.forall_mem_cons.2 ⟨reac192, List.forall_mem_cons.2 ⟨reac193, List.forall_mem_cons.2 ⟨reac194, List.forall_mem_cons.2 ⟨reac195, List.forall_mem_cons.2 ⟨reac196, List.forall_mem_cons.2 ⟨reac197, List.forall_mem_cons.2 ⟨reac198, List.forall_mem_cons.2 ⟨reac199, List.forall_mem_cons.2 ⟨reac200, List.forall_mem_cons.2 ⟨reac201, List.forall_mem_cons.2 ⟨reac202, List.forall_mem_cons.2 ⟨reac203, List.forall_mem_cons.2 ⟨reac204, List.forall_mem_cons.2 ⟨reac205, List.forall_mem_cons.2 ⟨reac206, List.forall_mem_cons.2 ⟨reac207, List.forall_mem_cons.2 ⟨reac208, List.forall_mem_cons.2 ⟨reac209, List.forall_mem_cons.2 ⟨reac210, List.forall_mem_cons.2 ⟨reac211, List.forall_mem_cons.2 ⟨reac212, List.forall_mem_cons.2 ⟨reac213, List.forall_mem_cons.2 ⟨reac214, List.forall_mem_cons.2 ⟨reac215, List.forall_mem_cons.2 ⟨reac216, List.forall_mem_cons.2 ⟨reac217, List.forall_mem_cons.2 ⟨reac218, List.forall_mem_cons.2 ⟨reac219, List.forall_mem_cons.2 ⟨reac220, List.forall_mem_cons.2 ⟨reac221, List.forall_mem_cons.2 ⟨reac222, List.forall_mem_cons.2 ⟨reac223, List.forall_mem_cons.2 ⟨reac224, List.forall_mem_cons.2 ⟨reac225, List.forall_mem_cons.2 ⟨reac226, List.forall_mem_cons.2 ⟨reac227, List.forall_mem_cons.2 ⟨reac228, List.forall_mem_cons.2 ⟨reac229, fun _ h => nomatch h⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩ +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreeDataREI.lean b/research/p104-reader-ceiling/lean/Nov15/CTreeDataREI.lean new file mode 100644 index 0000000000..56f3b86aec --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreeDataREI.lean @@ -0,0 +1,35 @@ +import Nov15.CTreereiP0 +import Nov15.CTreereiP1 +import Nov15.CTreereiP2 +import Nov15.CTreereiP3 +import Nov15.CTreereiP4 +import Nov15.CTreereiP5 +import Nov15.CTreereiP6 +import Nov15.CTreereiP7 +import Nov15.CTreereiP8 +import Nov15.CTreereiP9 +import Nov15.CTreereiP10 +import Nov15.CTreereiP11 +import Nov15.CTreereiP12 +import Nov15.CTreereiP13 +import Nov15.CTreereiP14 +import Nov15.CTreereiP15 +import Nov15.CTreereiP16 +import Nov15.CTreereiP17 +import Nov15.CTreereiP18 +import Nov15.CTreereiP19 +import Nov15.CTreereiP20 +import Nov15.CTreereiP21 +import Nov15.CTreereiP22 +import Nov15.CTreereiP23 +import Nov15.CTreereiP24 +import Nov15.CTreereiP25 +import Nov15.CTreereiP26 +import Nov15.CTreereiP27 +import Nov15.CTreereiP28 +namespace CTree +set_option maxRecDepth 100000 in +theorem rei_all : ∀ r ∈ reiR, Row.check reiW reiR r = true := by + unfold reiR + exact List.forall_mem_cons.2 ⟨reic0, List.forall_mem_cons.2 ⟨reic1, List.forall_mem_cons.2 ⟨reic2, List.forall_mem_cons.2 ⟨reic3, List.forall_mem_cons.2 ⟨reic4, List.forall_mem_cons.2 ⟨reic5, List.forall_mem_cons.2 ⟨reic6, List.forall_mem_cons.2 ⟨reic7, List.forall_mem_cons.2 ⟨reic8, List.forall_mem_cons.2 ⟨reic9, List.forall_mem_cons.2 ⟨reic10, List.forall_mem_cons.2 ⟨reic11, List.forall_mem_cons.2 ⟨reic12, List.forall_mem_cons.2 ⟨reic13, List.forall_mem_cons.2 ⟨reic14, List.forall_mem_cons.2 ⟨reic15, List.forall_mem_cons.2 ⟨reic16, List.forall_mem_cons.2 ⟨reic17, List.forall_mem_cons.2 ⟨reic18, List.forall_mem_cons.2 ⟨reic19, List.forall_mem_cons.2 ⟨reic20, List.forall_mem_cons.2 ⟨reic21, List.forall_mem_cons.2 ⟨reic22, List.forall_mem_cons.2 ⟨reic23, List.forall_mem_cons.2 ⟨reic24, List.forall_mem_cons.2 ⟨reic25, List.forall_mem_cons.2 ⟨reic26, List.forall_mem_cons.2 ⟨reic27, List.forall_mem_cons.2 ⟨reic28, List.forall_mem_cons.2 ⟨reic29, List.forall_mem_cons.2 ⟨reic30, List.forall_mem_cons.2 ⟨reic31, List.forall_mem_cons.2 ⟨reic32, List.forall_mem_cons.2 ⟨reic33, List.forall_mem_cons.2 ⟨reic34, List.forall_mem_cons.2 ⟨reic35, List.forall_mem_cons.2 ⟨reic36, List.forall_mem_cons.2 ⟨reic37, List.forall_mem_cons.2 ⟨reic38, List.forall_mem_cons.2 ⟨reic39, List.forall_mem_cons.2 ⟨reic40, List.forall_mem_cons.2 ⟨reic41, List.forall_mem_cons.2 ⟨reic42, List.forall_mem_cons.2 ⟨reic43, List.forall_mem_cons.2 ⟨reic44, List.forall_mem_cons.2 ⟨reic45, List.forall_mem_cons.2 ⟨reic46, List.forall_mem_cons.2 ⟨reic47, List.forall_mem_cons.2 ⟨reic48, List.forall_mem_cons.2 ⟨reic49, List.forall_mem_cons.2 ⟨reic50, List.forall_mem_cons.2 ⟨reic51, List.forall_mem_cons.2 ⟨reic52, List.forall_mem_cons.2 ⟨reic53, List.forall_mem_cons.2 ⟨reic54, List.forall_mem_cons.2 ⟨reic55, List.forall_mem_cons.2 ⟨reic56, List.forall_mem_cons.2 ⟨reic57, List.forall_mem_cons.2 ⟨reic58, List.forall_mem_cons.2 ⟨reic59, List.forall_mem_cons.2 ⟨reic60, List.forall_mem_cons.2 ⟨reic61, List.forall_mem_cons.2 ⟨reic62, List.forall_mem_cons.2 ⟨reic63, List.forall_mem_cons.2 ⟨reic64, List.forall_mem_cons.2 ⟨reic65, List.forall_mem_cons.2 ⟨reic66, List.forall_mem_cons.2 ⟨reic67, List.forall_mem_cons.2 ⟨reic68, List.forall_mem_cons.2 ⟨reic69, List.forall_mem_cons.2 ⟨reic70, List.forall_mem_cons.2 ⟨reic71, List.forall_mem_cons.2 ⟨reic72, List.forall_mem_cons.2 ⟨reic73, List.forall_mem_cons.2 ⟨reic74, List.forall_mem_cons.2 ⟨reic75, List.forall_mem_cons.2 ⟨reic76, List.forall_mem_cons.2 ⟨reic77, List.forall_mem_cons.2 ⟨reic78, List.forall_mem_cons.2 ⟨reic79, List.forall_mem_cons.2 ⟨reic80, List.forall_mem_cons.2 ⟨reic81, List.forall_mem_cons.2 ⟨reic82, List.forall_mem_cons.2 ⟨reic83, List.forall_mem_cons.2 ⟨reic84, List.forall_mem_cons.2 ⟨reic85, List.forall_mem_cons.2 ⟨reic86, List.forall_mem_cons.2 ⟨reic87, List.forall_mem_cons.2 ⟨reic88, List.forall_mem_cons.2 ⟨reic89, List.forall_mem_cons.2 ⟨reic90, List.forall_mem_cons.2 ⟨reic91, List.forall_mem_cons.2 ⟨reic92, List.forall_mem_cons.2 ⟨reic93, List.forall_mem_cons.2 ⟨reic94, List.forall_mem_cons.2 ⟨reic95, List.forall_mem_cons.2 ⟨reic96, List.forall_mem_cons.2 ⟨reic97, List.forall_mem_cons.2 ⟨reic98, List.forall_mem_cons.2 ⟨reic99, List.forall_mem_cons.2 ⟨reic100, List.forall_mem_cons.2 ⟨reic101, List.forall_mem_cons.2 ⟨reic102, List.forall_mem_cons.2 ⟨reic103, List.forall_mem_cons.2 ⟨reic104, List.forall_mem_cons.2 ⟨reic105, List.forall_mem_cons.2 ⟨reic106, List.forall_mem_cons.2 ⟨reic107, List.forall_mem_cons.2 ⟨reic108, List.forall_mem_cons.2 ⟨reic109, List.forall_mem_cons.2 ⟨reic110, List.forall_mem_cons.2 ⟨reic111, List.forall_mem_cons.2 ⟨reic112, List.forall_mem_cons.2 ⟨reic113, List.forall_mem_cons.2 ⟨reic114, List.forall_mem_cons.2 ⟨reic115, List.forall_mem_cons.2 ⟨reic116, List.forall_mem_cons.2 ⟨reic117, List.forall_mem_cons.2 ⟨reic118, List.forall_mem_cons.2 ⟨reic119, List.forall_mem_cons.2 ⟨reic120, List.forall_mem_cons.2 ⟨reic121, List.forall_mem_cons.2 ⟨reic122, List.forall_mem_cons.2 ⟨reic123, List.forall_mem_cons.2 ⟨reic124, List.forall_mem_cons.2 ⟨reic125, List.forall_mem_cons.2 ⟨reic126, List.forall_mem_cons.2 ⟨reic127, List.forall_mem_cons.2 ⟨reic128, List.forall_mem_cons.2 ⟨reic129, List.forall_mem_cons.2 ⟨reic130, List.forall_mem_cons.2 ⟨reic131, List.forall_mem_cons.2 ⟨reic132, List.forall_mem_cons.2 ⟨reic133, List.forall_mem_cons.2 ⟨reic134, List.forall_mem_cons.2 ⟨reic135, List.forall_mem_cons.2 ⟨reic136, List.forall_mem_cons.2 ⟨reic137, List.forall_mem_cons.2 ⟨reic138, List.forall_mem_cons.2 ⟨reic139, List.forall_mem_cons.2 ⟨reic140, List.forall_mem_cons.2 ⟨reic141, List.forall_mem_cons.2 ⟨reic142, List.forall_mem_cons.2 ⟨reic143, List.forall_mem_cons.2 ⟨reic144, List.forall_mem_cons.2 ⟨reic145, List.forall_mem_cons.2 ⟨reic146, List.forall_mem_cons.2 ⟨reic147, List.forall_mem_cons.2 ⟨reic148, List.forall_mem_cons.2 ⟨reic149, List.forall_mem_cons.2 ⟨reic150, List.forall_mem_cons.2 ⟨reic151, List.forall_mem_cons.2 ⟨reic152, List.forall_mem_cons.2 ⟨reic153, List.forall_mem_cons.2 ⟨reic154, List.forall_mem_cons.2 ⟨reic155, List.forall_mem_cons.2 ⟨reic156, List.forall_mem_cons.2 ⟨reic157, List.forall_mem_cons.2 ⟨reic158, List.forall_mem_cons.2 ⟨reic159, List.forall_mem_cons.2 ⟨reic160, List.forall_mem_cons.2 ⟨reic161, List.forall_mem_cons.2 ⟨reic162, List.forall_mem_cons.2 ⟨reic163, List.forall_mem_cons.2 ⟨reic164, List.forall_mem_cons.2 ⟨reic165, List.forall_mem_cons.2 ⟨reic166, List.forall_mem_cons.2 ⟨reic167, List.forall_mem_cons.2 ⟨reic168, List.forall_mem_cons.2 ⟨reic169, List.forall_mem_cons.2 ⟨reic170, List.forall_mem_cons.2 ⟨reic171, List.forall_mem_cons.2 ⟨reic172, List.forall_mem_cons.2 ⟨reic173, List.forall_mem_cons.2 ⟨reic174, List.forall_mem_cons.2 ⟨reic175, List.forall_mem_cons.2 ⟨reic176, List.forall_mem_cons.2 ⟨reic177, List.forall_mem_cons.2 ⟨reic178, List.forall_mem_cons.2 ⟨reic179, List.forall_mem_cons.2 ⟨reic180, List.forall_mem_cons.2 ⟨reic181, List.forall_mem_cons.2 ⟨reic182, List.forall_mem_cons.2 ⟨reic183, List.forall_mem_cons.2 ⟨reic184, List.forall_mem_cons.2 ⟨reic185, List.forall_mem_cons.2 ⟨reic186, List.forall_mem_cons.2 ⟨reic187, List.forall_mem_cons.2 ⟨reic188, List.forall_mem_cons.2 ⟨reic189, List.forall_mem_cons.2 ⟨reic190, List.forall_mem_cons.2 ⟨reic191, List.forall_mem_cons.2 ⟨reic192, List.forall_mem_cons.2 ⟨reic193, List.forall_mem_cons.2 ⟨reic194, List.forall_mem_cons.2 ⟨reic195, List.forall_mem_cons.2 ⟨reic196, List.forall_mem_cons.2 ⟨reic197, List.forall_mem_cons.2 ⟨reic198, List.forall_mem_cons.2 ⟨reic199, List.forall_mem_cons.2 ⟨reic200, List.forall_mem_cons.2 ⟨reic201, List.forall_mem_cons.2 ⟨reic202, List.forall_mem_cons.2 ⟨reic203, List.forall_mem_cons.2 ⟨reic204, List.forall_mem_cons.2 ⟨reic205, List.forall_mem_cons.2 ⟨reic206, List.forall_mem_cons.2 ⟨reic207, List.forall_mem_cons.2 ⟨reic208, List.forall_mem_cons.2 ⟨reic209, List.forall_mem_cons.2 ⟨reic210, List.forall_mem_cons.2 ⟨reic211, List.forall_mem_cons.2 ⟨reic212, List.forall_mem_cons.2 ⟨reic213, List.forall_mem_cons.2 ⟨reic214, List.forall_mem_cons.2 ⟨reic215, List.forall_mem_cons.2 ⟨reic216, List.forall_mem_cons.2 ⟨reic217, List.forall_mem_cons.2 ⟨reic218, List.forall_mem_cons.2 ⟨reic219, List.forall_mem_cons.2 ⟨reic220, List.forall_mem_cons.2 ⟨reic221, List.forall_mem_cons.2 ⟨reic222, List.forall_mem_cons.2 ⟨reic223, List.forall_mem_cons.2 ⟨reic224, List.forall_mem_cons.2 ⟨reic225, List.forall_mem_cons.2 ⟨reic226, List.forall_mem_cons.2 ⟨reic227, List.forall_mem_cons.2 ⟨reic228, List.forall_mem_cons.2 ⟨reic229, fun _ h => nomatch h⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩ +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreeDataRFA.lean b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRFA.lean new file mode 100644 index 0000000000..ca95bdc3c5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRFA.lean @@ -0,0 +1,35 @@ +import Nov15.CTreerfaP0 +import Nov15.CTreerfaP1 +import Nov15.CTreerfaP2 +import Nov15.CTreerfaP3 +import Nov15.CTreerfaP4 +import Nov15.CTreerfaP5 +import Nov15.CTreerfaP6 +import Nov15.CTreerfaP7 +import Nov15.CTreerfaP8 +import Nov15.CTreerfaP9 +import Nov15.CTreerfaP10 +import Nov15.CTreerfaP11 +import Nov15.CTreerfaP12 +import Nov15.CTreerfaP13 +import Nov15.CTreerfaP14 +import Nov15.CTreerfaP15 +import Nov15.CTreerfaP16 +import Nov15.CTreerfaP17 +import Nov15.CTreerfaP18 +import Nov15.CTreerfaP19 +import Nov15.CTreerfaP20 +import Nov15.CTreerfaP21 +import Nov15.CTreerfaP22 +import Nov15.CTreerfaP23 +import Nov15.CTreerfaP24 +import Nov15.CTreerfaP25 +import Nov15.CTreerfaP26 +import Nov15.CTreerfaP27 +import Nov15.CTreerfaP28 +namespace CTree +set_option maxRecDepth 100000 in +theorem rfa_all : ∀ r ∈ rfaR, Row.check rfaW rfaR r = true := by + unfold rfaR + exact List.forall_mem_cons.2 ⟨rfac0, List.forall_mem_cons.2 ⟨rfac1, List.forall_mem_cons.2 ⟨rfac2, List.forall_mem_cons.2 ⟨rfac3, List.forall_mem_cons.2 ⟨rfac4, List.forall_mem_cons.2 ⟨rfac5, List.forall_mem_cons.2 ⟨rfac6, List.forall_mem_cons.2 ⟨rfac7, List.forall_mem_cons.2 ⟨rfac8, List.forall_mem_cons.2 ⟨rfac9, List.forall_mem_cons.2 ⟨rfac10, List.forall_mem_cons.2 ⟨rfac11, List.forall_mem_cons.2 ⟨rfac12, List.forall_mem_cons.2 ⟨rfac13, List.forall_mem_cons.2 ⟨rfac14, List.forall_mem_cons.2 ⟨rfac15, List.forall_mem_cons.2 ⟨rfac16, List.forall_mem_cons.2 ⟨rfac17, List.forall_mem_cons.2 ⟨rfac18, List.forall_mem_cons.2 ⟨rfac19, List.forall_mem_cons.2 ⟨rfac20, List.forall_mem_cons.2 ⟨rfac21, List.forall_mem_cons.2 ⟨rfac22, List.forall_mem_cons.2 ⟨rfac23, List.forall_mem_cons.2 ⟨rfac24, List.forall_mem_cons.2 ⟨rfac25, List.forall_mem_cons.2 ⟨rfac26, List.forall_mem_cons.2 ⟨rfac27, List.forall_mem_cons.2 ⟨rfac28, List.forall_mem_cons.2 ⟨rfac29, List.forall_mem_cons.2 ⟨rfac30, List.forall_mem_cons.2 ⟨rfac31, List.forall_mem_cons.2 ⟨rfac32, List.forall_mem_cons.2 ⟨rfac33, List.forall_mem_cons.2 ⟨rfac34, List.forall_mem_cons.2 ⟨rfac35, List.forall_mem_cons.2 ⟨rfac36, List.forall_mem_cons.2 ⟨rfac37, List.forall_mem_cons.2 ⟨rfac38, List.forall_mem_cons.2 ⟨rfac39, List.forall_mem_cons.2 ⟨rfac40, List.forall_mem_cons.2 ⟨rfac41, List.forall_mem_cons.2 ⟨rfac42, List.forall_mem_cons.2 ⟨rfac43, List.forall_mem_cons.2 ⟨rfac44, List.forall_mem_cons.2 ⟨rfac45, List.forall_mem_cons.2 ⟨rfac46, List.forall_mem_cons.2 ⟨rfac47, List.forall_mem_cons.2 ⟨rfac48, List.forall_mem_cons.2 ⟨rfac49, List.forall_mem_cons.2 ⟨rfac50, List.forall_mem_cons.2 ⟨rfac51, List.forall_mem_cons.2 ⟨rfac52, List.forall_mem_cons.2 ⟨rfac53, List.forall_mem_cons.2 ⟨rfac54, List.forall_mem_cons.2 ⟨rfac55, List.forall_mem_cons.2 ⟨rfac56, List.forall_mem_cons.2 ⟨rfac57, List.forall_mem_cons.2 ⟨rfac58, List.forall_mem_cons.2 ⟨rfac59, List.forall_mem_cons.2 ⟨rfac60, List.forall_mem_cons.2 ⟨rfac61, List.forall_mem_cons.2 ⟨rfac62, List.forall_mem_cons.2 ⟨rfac63, List.forall_mem_cons.2 ⟨rfac64, List.forall_mem_cons.2 ⟨rfac65, List.forall_mem_cons.2 ⟨rfac66, List.forall_mem_cons.2 ⟨rfac67, List.forall_mem_cons.2 ⟨rfac68, List.forall_mem_cons.2 ⟨rfac69, List.forall_mem_cons.2 ⟨rfac70, List.forall_mem_cons.2 ⟨rfac71, List.forall_mem_cons.2 ⟨rfac72, List.forall_mem_cons.2 ⟨rfac73, List.forall_mem_cons.2 ⟨rfac74, List.forall_mem_cons.2 ⟨rfac75, List.forall_mem_cons.2 ⟨rfac76, List.forall_mem_cons.2 ⟨rfac77, List.forall_mem_cons.2 ⟨rfac78, List.forall_mem_cons.2 ⟨rfac79, List.forall_mem_cons.2 ⟨rfac80, List.forall_mem_cons.2 ⟨rfac81, List.forall_mem_cons.2 ⟨rfac82, List.forall_mem_cons.2 ⟨rfac83, List.forall_mem_cons.2 ⟨rfac84, List.forall_mem_cons.2 ⟨rfac85, List.forall_mem_cons.2 ⟨rfac86, List.forall_mem_cons.2 ⟨rfac87, List.forall_mem_cons.2 ⟨rfac88, List.forall_mem_cons.2 ⟨rfac89, List.forall_mem_cons.2 ⟨rfac90, List.forall_mem_cons.2 ⟨rfac91, List.forall_mem_cons.2 ⟨rfac92, List.forall_mem_cons.2 ⟨rfac93, List.forall_mem_cons.2 ⟨rfac94, List.forall_mem_cons.2 ⟨rfac95, List.forall_mem_cons.2 ⟨rfac96, List.forall_mem_cons.2 ⟨rfac97, List.forall_mem_cons.2 ⟨rfac98, List.forall_mem_cons.2 ⟨rfac99, List.forall_mem_cons.2 ⟨rfac100, List.forall_mem_cons.2 ⟨rfac101, List.forall_mem_cons.2 ⟨rfac102, List.forall_mem_cons.2 ⟨rfac103, List.forall_mem_cons.2 ⟨rfac104, List.forall_mem_cons.2 ⟨rfac105, List.forall_mem_cons.2 ⟨rfac106, List.forall_mem_cons.2 ⟨rfac107, List.forall_mem_cons.2 ⟨rfac108, List.forall_mem_cons.2 ⟨rfac109, List.forall_mem_cons.2 ⟨rfac110, List.forall_mem_cons.2 ⟨rfac111, List.forall_mem_cons.2 ⟨rfac112, List.forall_mem_cons.2 ⟨rfac113, List.forall_mem_cons.2 ⟨rfac114, List.forall_mem_cons.2 ⟨rfac115, List.forall_mem_cons.2 ⟨rfac116, List.forall_mem_cons.2 ⟨rfac117, List.forall_mem_cons.2 ⟨rfac118, List.forall_mem_cons.2 ⟨rfac119, List.forall_mem_cons.2 ⟨rfac120, List.forall_mem_cons.2 ⟨rfac121, List.forall_mem_cons.2 ⟨rfac122, List.forall_mem_cons.2 ⟨rfac123, List.forall_mem_cons.2 ⟨rfac124, List.forall_mem_cons.2 ⟨rfac125, List.forall_mem_cons.2 ⟨rfac126, List.forall_mem_cons.2 ⟨rfac127, List.forall_mem_cons.2 ⟨rfac128, List.forall_mem_cons.2 ⟨rfac129, List.forall_mem_cons.2 ⟨rfac130, List.forall_mem_cons.2 ⟨rfac131, List.forall_mem_cons.2 ⟨rfac132, List.forall_mem_cons.2 ⟨rfac133, List.forall_mem_cons.2 ⟨rfac134, List.forall_mem_cons.2 ⟨rfac135, List.forall_mem_cons.2 ⟨rfac136, List.forall_mem_cons.2 ⟨rfac137, List.forall_mem_cons.2 ⟨rfac138, List.forall_mem_cons.2 ⟨rfac139, List.forall_mem_cons.2 ⟨rfac140, List.forall_mem_cons.2 ⟨rfac141, List.forall_mem_cons.2 ⟨rfac142, List.forall_mem_cons.2 ⟨rfac143, List.forall_mem_cons.2 ⟨rfac144, List.forall_mem_cons.2 ⟨rfac145, List.forall_mem_cons.2 ⟨rfac146, List.forall_mem_cons.2 ⟨rfac147, List.forall_mem_cons.2 ⟨rfac148, List.forall_mem_cons.2 ⟨rfac149, List.forall_mem_cons.2 ⟨rfac150, List.forall_mem_cons.2 ⟨rfac151, List.forall_mem_cons.2 ⟨rfac152, List.forall_mem_cons.2 ⟨rfac153, List.forall_mem_cons.2 ⟨rfac154, List.forall_mem_cons.2 ⟨rfac155, List.forall_mem_cons.2 ⟨rfac156, List.forall_mem_cons.2 ⟨rfac157, List.forall_mem_cons.2 ⟨rfac158, List.forall_mem_cons.2 ⟨rfac159, List.forall_mem_cons.2 ⟨rfac160, List.forall_mem_cons.2 ⟨rfac161, List.forall_mem_cons.2 ⟨rfac162, List.forall_mem_cons.2 ⟨rfac163, List.forall_mem_cons.2 ⟨rfac164, List.forall_mem_cons.2 ⟨rfac165, List.forall_mem_cons.2 ⟨rfac166, List.forall_mem_cons.2 ⟨rfac167, List.forall_mem_cons.2 ⟨rfac168, List.forall_mem_cons.2 ⟨rfac169, List.forall_mem_cons.2 ⟨rfac170, List.forall_mem_cons.2 ⟨rfac171, List.forall_mem_cons.2 ⟨rfac172, List.forall_mem_cons.2 ⟨rfac173, List.forall_mem_cons.2 ⟨rfac174, List.forall_mem_cons.2 ⟨rfac175, List.forall_mem_cons.2 ⟨rfac176, List.forall_mem_cons.2 ⟨rfac177, List.forall_mem_cons.2 ⟨rfac178, List.forall_mem_cons.2 ⟨rfac179, List.forall_mem_cons.2 ⟨rfac180, List.forall_mem_cons.2 ⟨rfac181, List.forall_mem_cons.2 ⟨rfac182, List.forall_mem_cons.2 ⟨rfac183, List.forall_mem_cons.2 ⟨rfac184, List.forall_mem_cons.2 ⟨rfac185, List.forall_mem_cons.2 ⟨rfac186, List.forall_mem_cons.2 ⟨rfac187, List.forall_mem_cons.2 ⟨rfac188, List.forall_mem_cons.2 ⟨rfac189, List.forall_mem_cons.2 ⟨rfac190, List.forall_mem_cons.2 ⟨rfac191, List.forall_mem_cons.2 ⟨rfac192, List.forall_mem_cons.2 ⟨rfac193, List.forall_mem_cons.2 ⟨rfac194, List.forall_mem_cons.2 ⟨rfac195, List.forall_mem_cons.2 ⟨rfac196, List.forall_mem_cons.2 ⟨rfac197, List.forall_mem_cons.2 ⟨rfac198, List.forall_mem_cons.2 ⟨rfac199, List.forall_mem_cons.2 ⟨rfac200, List.forall_mem_cons.2 ⟨rfac201, List.forall_mem_cons.2 ⟨rfac202, List.forall_mem_cons.2 ⟨rfac203, List.forall_mem_cons.2 ⟨rfac204, List.forall_mem_cons.2 ⟨rfac205, List.forall_mem_cons.2 ⟨rfac206, List.forall_mem_cons.2 ⟨rfac207, List.forall_mem_cons.2 ⟨rfac208, List.forall_mem_cons.2 ⟨rfac209, List.forall_mem_cons.2 ⟨rfac210, List.forall_mem_cons.2 ⟨rfac211, List.forall_mem_cons.2 ⟨rfac212, List.forall_mem_cons.2 ⟨rfac213, List.forall_mem_cons.2 ⟨rfac214, List.forall_mem_cons.2 ⟨rfac215, List.forall_mem_cons.2 ⟨rfac216, List.forall_mem_cons.2 ⟨rfac217, List.forall_mem_cons.2 ⟨rfac218, List.forall_mem_cons.2 ⟨rfac219, List.forall_mem_cons.2 ⟨rfac220, List.forall_mem_cons.2 ⟨rfac221, List.forall_mem_cons.2 ⟨rfac222, List.forall_mem_cons.2 ⟨rfac223, List.forall_mem_cons.2 ⟨rfac224, List.forall_mem_cons.2 ⟨rfac225, List.forall_mem_cons.2 ⟨rfac226, List.forall_mem_cons.2 ⟨rfac227, List.forall_mem_cons.2 ⟨rfac228, List.forall_mem_cons.2 ⟨rfac229, fun _ h => nomatch h⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩ +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreeDataRFI.lean b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRFI.lean new file mode 100644 index 0000000000..7a0af711e6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreeDataRFI.lean @@ -0,0 +1,35 @@ +import Nov15.CTreerfiP0 +import Nov15.CTreerfiP1 +import Nov15.CTreerfiP2 +import Nov15.CTreerfiP3 +import Nov15.CTreerfiP4 +import Nov15.CTreerfiP5 +import Nov15.CTreerfiP6 +import Nov15.CTreerfiP7 +import Nov15.CTreerfiP8 +import Nov15.CTreerfiP9 +import Nov15.CTreerfiP10 +import Nov15.CTreerfiP11 +import Nov15.CTreerfiP12 +import Nov15.CTreerfiP13 +import Nov15.CTreerfiP14 +import Nov15.CTreerfiP15 +import Nov15.CTreerfiP16 +import Nov15.CTreerfiP17 +import Nov15.CTreerfiP18 +import Nov15.CTreerfiP19 +import Nov15.CTreerfiP20 +import Nov15.CTreerfiP21 +import Nov15.CTreerfiP22 +import Nov15.CTreerfiP23 +import Nov15.CTreerfiP24 +import Nov15.CTreerfiP25 +import Nov15.CTreerfiP26 +import Nov15.CTreerfiP27 +import Nov15.CTreerfiP28 +namespace CTree +set_option maxRecDepth 100000 in +theorem rfi_all : ∀ r ∈ rfiR, Row.check rfiW rfiR r = true := by + unfold rfiR + exact List.forall_mem_cons.2 ⟨rfic0, List.forall_mem_cons.2 ⟨rfic1, List.forall_mem_cons.2 ⟨rfic2, List.forall_mem_cons.2 ⟨rfic3, List.forall_mem_cons.2 ⟨rfic4, List.forall_mem_cons.2 ⟨rfic5, List.forall_mem_cons.2 ⟨rfic6, List.forall_mem_cons.2 ⟨rfic7, List.forall_mem_cons.2 ⟨rfic8, List.forall_mem_cons.2 ⟨rfic9, List.forall_mem_cons.2 ⟨rfic10, List.forall_mem_cons.2 ⟨rfic11, List.forall_mem_cons.2 ⟨rfic12, List.forall_mem_cons.2 ⟨rfic13, List.forall_mem_cons.2 ⟨rfic14, List.forall_mem_cons.2 ⟨rfic15, List.forall_mem_cons.2 ⟨rfic16, List.forall_mem_cons.2 ⟨rfic17, List.forall_mem_cons.2 ⟨rfic18, List.forall_mem_cons.2 ⟨rfic19, List.forall_mem_cons.2 ⟨rfic20, List.forall_mem_cons.2 ⟨rfic21, List.forall_mem_cons.2 ⟨rfic22, List.forall_mem_cons.2 ⟨rfic23, List.forall_mem_cons.2 ⟨rfic24, List.forall_mem_cons.2 ⟨rfic25, List.forall_mem_cons.2 ⟨rfic26, List.forall_mem_cons.2 ⟨rfic27, List.forall_mem_cons.2 ⟨rfic28, List.forall_mem_cons.2 ⟨rfic29, List.forall_mem_cons.2 ⟨rfic30, List.forall_mem_cons.2 ⟨rfic31, List.forall_mem_cons.2 ⟨rfic32, List.forall_mem_cons.2 ⟨rfic33, List.forall_mem_cons.2 ⟨rfic34, List.forall_mem_cons.2 ⟨rfic35, List.forall_mem_cons.2 ⟨rfic36, List.forall_mem_cons.2 ⟨rfic37, List.forall_mem_cons.2 ⟨rfic38, List.forall_mem_cons.2 ⟨rfic39, List.forall_mem_cons.2 ⟨rfic40, List.forall_mem_cons.2 ⟨rfic41, List.forall_mem_cons.2 ⟨rfic42, List.forall_mem_cons.2 ⟨rfic43, List.forall_mem_cons.2 ⟨rfic44, List.forall_mem_cons.2 ⟨rfic45, List.forall_mem_cons.2 ⟨rfic46, List.forall_mem_cons.2 ⟨rfic47, List.forall_mem_cons.2 ⟨rfic48, List.forall_mem_cons.2 ⟨rfic49, List.forall_mem_cons.2 ⟨rfic50, List.forall_mem_cons.2 ⟨rfic51, List.forall_mem_cons.2 ⟨rfic52, List.forall_mem_cons.2 ⟨rfic53, List.forall_mem_cons.2 ⟨rfic54, List.forall_mem_cons.2 ⟨rfic55, List.forall_mem_cons.2 ⟨rfic56, List.forall_mem_cons.2 ⟨rfic57, List.forall_mem_cons.2 ⟨rfic58, List.forall_mem_cons.2 ⟨rfic59, List.forall_mem_cons.2 ⟨rfic60, List.forall_mem_cons.2 ⟨rfic61, List.forall_mem_cons.2 ⟨rfic62, List.forall_mem_cons.2 ⟨rfic63, List.forall_mem_cons.2 ⟨rfic64, List.forall_mem_cons.2 ⟨rfic65, List.forall_mem_cons.2 ⟨rfic66, List.forall_mem_cons.2 ⟨rfic67, List.forall_mem_cons.2 ⟨rfic68, List.forall_mem_cons.2 ⟨rfic69, List.forall_mem_cons.2 ⟨rfic70, List.forall_mem_cons.2 ⟨rfic71, List.forall_mem_cons.2 ⟨rfic72, List.forall_mem_cons.2 ⟨rfic73, List.forall_mem_cons.2 ⟨rfic74, List.forall_mem_cons.2 ⟨rfic75, List.forall_mem_cons.2 ⟨rfic76, List.forall_mem_cons.2 ⟨rfic77, List.forall_mem_cons.2 ⟨rfic78, List.forall_mem_cons.2 ⟨rfic79, List.forall_mem_cons.2 ⟨rfic80, List.forall_mem_cons.2 ⟨rfic81, List.forall_mem_cons.2 ⟨rfic82, List.forall_mem_cons.2 ⟨rfic83, List.forall_mem_cons.2 ⟨rfic84, List.forall_mem_cons.2 ⟨rfic85, List.forall_mem_cons.2 ⟨rfic86, List.forall_mem_cons.2 ⟨rfic87, List.forall_mem_cons.2 ⟨rfic88, List.forall_mem_cons.2 ⟨rfic89, List.forall_mem_cons.2 ⟨rfic90, List.forall_mem_cons.2 ⟨rfic91, List.forall_mem_cons.2 ⟨rfic92, List.forall_mem_cons.2 ⟨rfic93, List.forall_mem_cons.2 ⟨rfic94, List.forall_mem_cons.2 ⟨rfic95, List.forall_mem_cons.2 ⟨rfic96, List.forall_mem_cons.2 ⟨rfic97, List.forall_mem_cons.2 ⟨rfic98, List.forall_mem_cons.2 ⟨rfic99, List.forall_mem_cons.2 ⟨rfic100, List.forall_mem_cons.2 ⟨rfic101, List.forall_mem_cons.2 ⟨rfic102, List.forall_mem_cons.2 ⟨rfic103, List.forall_mem_cons.2 ⟨rfic104, List.forall_mem_cons.2 ⟨rfic105, List.forall_mem_cons.2 ⟨rfic106, List.forall_mem_cons.2 ⟨rfic107, List.forall_mem_cons.2 ⟨rfic108, List.forall_mem_cons.2 ⟨rfic109, List.forall_mem_cons.2 ⟨rfic110, List.forall_mem_cons.2 ⟨rfic111, List.forall_mem_cons.2 ⟨rfic112, List.forall_mem_cons.2 ⟨rfic113, List.forall_mem_cons.2 ⟨rfic114, List.forall_mem_cons.2 ⟨rfic115, List.forall_mem_cons.2 ⟨rfic116, List.forall_mem_cons.2 ⟨rfic117, List.forall_mem_cons.2 ⟨rfic118, List.forall_mem_cons.2 ⟨rfic119, List.forall_mem_cons.2 ⟨rfic120, List.forall_mem_cons.2 ⟨rfic121, List.forall_mem_cons.2 ⟨rfic122, List.forall_mem_cons.2 ⟨rfic123, List.forall_mem_cons.2 ⟨rfic124, List.forall_mem_cons.2 ⟨rfic125, List.forall_mem_cons.2 ⟨rfic126, List.forall_mem_cons.2 ⟨rfic127, List.forall_mem_cons.2 ⟨rfic128, List.forall_mem_cons.2 ⟨rfic129, List.forall_mem_cons.2 ⟨rfic130, List.forall_mem_cons.2 ⟨rfic131, List.forall_mem_cons.2 ⟨rfic132, List.forall_mem_cons.2 ⟨rfic133, List.forall_mem_cons.2 ⟨rfic134, List.forall_mem_cons.2 ⟨rfic135, List.forall_mem_cons.2 ⟨rfic136, List.forall_mem_cons.2 ⟨rfic137, List.forall_mem_cons.2 ⟨rfic138, List.forall_mem_cons.2 ⟨rfic139, List.forall_mem_cons.2 ⟨rfic140, List.forall_mem_cons.2 ⟨rfic141, List.forall_mem_cons.2 ⟨rfic142, List.forall_mem_cons.2 ⟨rfic143, List.forall_mem_cons.2 ⟨rfic144, List.forall_mem_cons.2 ⟨rfic145, List.forall_mem_cons.2 ⟨rfic146, List.forall_mem_cons.2 ⟨rfic147, List.forall_mem_cons.2 ⟨rfic148, List.forall_mem_cons.2 ⟨rfic149, List.forall_mem_cons.2 ⟨rfic150, List.forall_mem_cons.2 ⟨rfic151, List.forall_mem_cons.2 ⟨rfic152, List.forall_mem_cons.2 ⟨rfic153, List.forall_mem_cons.2 ⟨rfic154, List.forall_mem_cons.2 ⟨rfic155, List.forall_mem_cons.2 ⟨rfic156, List.forall_mem_cons.2 ⟨rfic157, List.forall_mem_cons.2 ⟨rfic158, List.forall_mem_cons.2 ⟨rfic159, List.forall_mem_cons.2 ⟨rfic160, List.forall_mem_cons.2 ⟨rfic161, List.forall_mem_cons.2 ⟨rfic162, List.forall_mem_cons.2 ⟨rfic163, List.forall_mem_cons.2 ⟨rfic164, List.forall_mem_cons.2 ⟨rfic165, List.forall_mem_cons.2 ⟨rfic166, List.forall_mem_cons.2 ⟨rfic167, List.forall_mem_cons.2 ⟨rfic168, List.forall_mem_cons.2 ⟨rfic169, List.forall_mem_cons.2 ⟨rfic170, List.forall_mem_cons.2 ⟨rfic171, List.forall_mem_cons.2 ⟨rfic172, List.forall_mem_cons.2 ⟨rfic173, List.forall_mem_cons.2 ⟨rfic174, List.forall_mem_cons.2 ⟨rfic175, List.forall_mem_cons.2 ⟨rfic176, List.forall_mem_cons.2 ⟨rfic177, List.forall_mem_cons.2 ⟨rfic178, List.forall_mem_cons.2 ⟨rfic179, List.forall_mem_cons.2 ⟨rfic180, List.forall_mem_cons.2 ⟨rfic181, List.forall_mem_cons.2 ⟨rfic182, List.forall_mem_cons.2 ⟨rfic183, List.forall_mem_cons.2 ⟨rfic184, List.forall_mem_cons.2 ⟨rfic185, List.forall_mem_cons.2 ⟨rfic186, List.forall_mem_cons.2 ⟨rfic187, List.forall_mem_cons.2 ⟨rfic188, List.forall_mem_cons.2 ⟨rfic189, List.forall_mem_cons.2 ⟨rfic190, List.forall_mem_cons.2 ⟨rfic191, List.forall_mem_cons.2 ⟨rfic192, List.forall_mem_cons.2 ⟨rfic193, List.forall_mem_cons.2 ⟨rfic194, List.forall_mem_cons.2 ⟨rfic195, List.forall_mem_cons.2 ⟨rfic196, List.forall_mem_cons.2 ⟨rfic197, List.forall_mem_cons.2 ⟨rfic198, List.forall_mem_cons.2 ⟨rfic199, List.forall_mem_cons.2 ⟨rfic200, List.forall_mem_cons.2 ⟨rfic201, List.forall_mem_cons.2 ⟨rfic202, List.forall_mem_cons.2 ⟨rfic203, List.forall_mem_cons.2 ⟨rfic204, List.forall_mem_cons.2 ⟨rfic205, List.forall_mem_cons.2 ⟨rfic206, List.forall_mem_cons.2 ⟨rfic207, List.forall_mem_cons.2 ⟨rfic208, List.forall_mem_cons.2 ⟨rfic209, List.forall_mem_cons.2 ⟨rfic210, List.forall_mem_cons.2 ⟨rfic211, List.forall_mem_cons.2 ⟨rfic212, List.forall_mem_cons.2 ⟨rfic213, List.forall_mem_cons.2 ⟨rfic214, List.forall_mem_cons.2 ⟨rfic215, List.forall_mem_cons.2 ⟨rfic216, List.forall_mem_cons.2 ⟨rfic217, List.forall_mem_cons.2 ⟨rfic218, List.forall_mem_cons.2 ⟨rfic219, List.forall_mem_cons.2 ⟨rfic220, List.forall_mem_cons.2 ⟨rfic221, List.forall_mem_cons.2 ⟨rfic222, List.forall_mem_cons.2 ⟨rfic223, List.forall_mem_cons.2 ⟨rfic224, List.forall_mem_cons.2 ⟨rfic225, List.forall_mem_cons.2 ⟨rfic226, List.forall_mem_cons.2 ⟨rfic227, List.forall_mem_cons.2 ⟨rfic228, List.forall_mem_cons.2 ⟨rfic229, fun _ h => nomatch h⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩⟩ +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaDefs.lean new file mode 100644 index 0000000000..48a899bbc1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaDefs.lean @@ -0,0 +1,235 @@ +import Nov15.CTreeCore +namespace CTree +def rdaW : List (List Nat) := [[0,0,0,0,0,0,0,0,0],[0,0,1591504595045,2183392024855,2565792891519,2849159501375,3074380358977,3261274106403,3420981559912],[0,0,0,2183392024855,3157680321329,3823447797849,4332035265307,4744149870335,3261274106403],[0,0,0,0,2565792891519,3823447797849,4714436131971,4332035265307,3074380358977],[0,0,0,0,0,2849159501375,3823447797849,3823447797849,2849159501375],[0,0,0,0,0,0,2565792891519,3157680321329,2565792891519],[0,0,0,0,0,0,0,2183392024855,2183392024855],[0,0,0,0,0,0,0,0,1591504595045],[0,0,0,0,0,0,0,0,0]] +def rdar0 : Row := ⟨0,1,1,48,1725436586697640946858688965569256363112777243042596638790631055949822,[0,2921937829190,3176349249170,3467468185816,3672873302898,4119757160901,4326368472548,4893169247015,5098574364097,6126216810056,6340303124145,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,10731664007192,10938275318839,11454352770337,11660964081984,12583863246370,12822638016062,13300568990792,13507180302439,15094381571420,15372663231187,15803612313400,16646258730124,17077207812337,17508156894550,18399143354889,18605754666536,19633397112495,19847483426584,20350102856917,20556714168564,21576716463337,21830309667501,22261258749714,23321928163968,24126741678462,24445455621278,24961533072776,25168144384423,26091043548809,26329818318501,26807749293231,27014360604878],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4119757160901,4326368472548,4893169247015,5098574364097,6126216810056,6340303124145,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,10731664007192,10938275318839,11454352770337,11660964081984,12583863246370,12822638016062,13300568990792,13507180302439,16710574622068,16964167826232,17395116908445,18237763325169,18668712407382,19099661489595,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar1 : Row := ⟨1,2,1,20,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,11459385499968,11665996811615,12200544274790,12407155586437],[1000000000000000000000000000000,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,13415658201450,13622269513097,14657386961498,14863998273145]⟩ +def rdar2 : Row := ⟨2,2,1,22,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,11459385499968,11665996811615,12200544274790,12407155586437,13175750676181,13414525445873],[1000000000000000000000000000000,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,13415658201450,13622269513097,14657386961498,14863998273145,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar3 : Row := ⟨3,2,1,24,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,11459385499968,11665996811615,12200544274790,12407155586437,13175750676181,13414525445873,13892456420603,14099067732250],[1000000000000000000000000000000,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,13415658201450,13622269513097,14657386961498,14863998273145,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar4 : Row := ⟨4,2,1,26,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,11459385499968,11665996811615,12200544274790,12407155586437,13175750676181,13414525445873,13892456420603,14099067732250,15119070027023,15372663231187],[1000000000000000000000000000000,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,13415658201450,13622269513097,14657386961498,14863998273145,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar5 : Row := ⟨5,2,1,28,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,11459385499968,11665996811615,12200544274790,12407155586437,13175750676181,13414525445873,13892456420603,14099067732250,15119070027023,15372663231187,15803612313400,16646258730124],[1000000000000000000000000000000,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,13415658201450,13622269513097,14657386961498,14863998273145,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar6 : Row := ⟨6,2,1,30,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,11459385499968,11665996811615,12200544274790,12407155586437,13175750676181,13414525445873,13892456420603,14099067732250,15119070027023,15372663231187,15803612313400,16646258730124,17077207812337,17508156894550],[1000000000000000000000000000000,2951987114599,3399026224101,3726515542031,3931920659113,4409851633843,4616462945490,5152216603230,5357621720312,6126216810056,6364991579748,6842922554478,7049533866125,8116518053415,8323129365062,8754078447275,9814747861529,13415658201450,13622269513097,14657386961498,14863998273145,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar7 : Row := ⟨7,2,2,18,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8223243266484,9140159412147,9346770723794],[1000000000000000000000000000000,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8723051849101,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar8 : Row := ⟨8,2,2,20,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8223243266484,9140159412147,9346770723794,9862848175292,10069459486939],[1000000000000000000000000000000,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8723051849101,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar9 : Row := ⟨9,2,2,22,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8223243266484,9140159412147,9346770723794,9862848175292,10069459486939,10992358651325,11231133421017],[1000000000000000000000000000000,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8723051849101,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar10 : Row := ⟨10,2,2,24,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8223243266484,9140159412147,9346770723794,9862848175292,10069459486939,10992358651325,11231133421017,11709064395747,11915675707394],[1000000000000000000000000000000,1630637053201,2189396518315,2480515454961,2685920572043,3182321558450,3388932870097,3906216516160,4111621633242,5034520797628,5273295567320,5751226542050,5957837853697,7024822040987,7231433352634,7662382434847,8723051849101,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar11 : Row := ⟨11,3,1,8,1725436586697640946858688965569256363112769808131088451570363873099776,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097]⟩ +def rdar12 : Row := ⟨12,3,1,10,1725436586697640946858688965569256363112777243028422585784197460262912,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145]⟩ +def rdar13 : Row := ⟨13,3,1,11,1725436586697640946858688965569256363112777243033147258110076319170560,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592]⟩ +def rdar14 : Row := ⟨14,3,1,12,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239]⟩ +def rdar15 : Row := ⟨15,3,1,13,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000]⟩ +def rdar16 : Row := ⟨16,3,1,14,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800,9616436143684],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar17 : Row := ⟨17,3,1,15,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800,9616436143684,9991743611112],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar18 : Row := ⟨18,3,1,16,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800,9616436143684,9991743611112,10197148728194],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar19 : Row := ⟨19,3,1,17,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800,9616436143684,9991743611112,10197148728194,11232266176595],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar20 : Row := ⟨20,3,1,18,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800,9616436143684,9991743611112,10197148728194,11232266176595,11438877488242],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar21 : Row := ⟨21,3,1,19,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800,9616436143684,9991743611112,10197148728194,11232266176595,11438877488242,12473994936643],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar22 : Row := ⟨22,3,1,20,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,9405617908800,9616436143684,9991743611112,10197148728194,11232266176595,11438877488242,12473994936643,12680606248290],[1000000000000000000000000000000,2921937829190,3176349249170,3467468185816,3672873302898,4307043544703,4517861779587,4893169247015,5098574364097,6133691812498,6340303124145,8162759023592,8369370335239,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar23 : Row := ⟨23,3,2,6,1725436586697640946858688964519793351043731158960419414395210547855360,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827]⟩ +def rdar24 : Row := ⟨24,3,2,7,1725436586697640946858688964869614258143869349367193180740345082675200,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255]⟩ +def rdar25 : Row := ⟨25,3,2,8,1725436586697640946858688965569256072344145730180740713430614152314880,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337]⟩ +def rdar26 : Row := ⟨26,3,2,9,1725436586697640946858688965569256072344148208479851515041139711279104,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738]⟩ +def rdar27 : Row := ⟨27,3,2,10,1725436586697640946858688965569256072344153165078073118262190829207552,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385]⟩ +def rdar28 : Row := ⟨28,3,2,11,1725436586697640946858688965569256072344153165082795484745060474421248,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6000249658393],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6879862577832]⟩ +def rdar29 : Row := ⟨29,3,2,12,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6000249658393,6205654775475],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6879862577832,7086473889479]⟩ +def rdar30 : Row := ⟨30,3,2,13,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6000249658393,6205654775475,6839825017280],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6879862577832,7086473889479,1000000000000000000000000000000]⟩ +def rdar31 : Row := ⟨31,3,2,14,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6000249658393,6205654775475,6839825017280,7050643252164],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6879862577832,7086473889479,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar32 : Row := ⟨32,3,2,15,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6000249658393,6205654775475,6839825017280,7050643252164,7425950719592],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6879862577832,7086473889479,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar33 : Row := ⟨33,3,2,16,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6000249658393,6205654775475,6839825017280,7050643252164,7425950719592,7631355836674],[1000000000000000000000000000000,1537190179488,1893452803410,2184571740056,2389976857138,3024147098943,3234965333827,3610272801255,3815677918337,4850795366738,5057406678385,6879862577832,7086473889479,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar34 : Row := ⟨34,3,3,4,1725436586697640946849780764332283298176074888370600511503471000682496,[0,1024793452992,1465820654824,1756939591470,1962344708552],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552]⟩ +def rdar35 : Row := ⟨35,3,3,6,1725436586697640946858688964519783049526763825862118485357350877134848,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456]⟩ +def rdar36 : Row := ⟨36,3,3,7,1725436586697640946858688964869593322802935736941613873340823816372224,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669]⟩ +def rdar37 : Row := ⟨37,3,3,8,1725436586697640946858688965569213869355279559100604649307769694846976,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751]⟩ +def rdar38 : Row := ⟨38,3,3,9,1725436586697640946858688965569213869355282037398534859297577842507776,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4412839222743],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4423163218152]⟩ +def rdar39 : Row := ⟨39,3,3,10,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4412839222743,4629774529799],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4423163218152,4629774529799]⟩ +def rdar40 : Row := ⟨40,3,3,11,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4412839222743,4629774529799,5144985361221],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4423163218152,4629774529799,1000000000000000000000000000000]⟩ +def rdar41 : Row := ⟨41,3,3,12,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4412839222743,4629774529799,5144985361221,5350390478303],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4423163218152,4629774529799,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar42 : Row := ⟨42,3,3,13,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4412839222743,4629774529799,5144985361221,5350390478303,5933126028560],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4423163218152,4629774529799,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar43 : Row := ⟨43,3,3,14,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4412839222743,4629774529799,5144985361221,5350390478303,5933126028560,6139737340207],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4423163218152,4629774529799,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar44 : Row := ⟨44,3,3,15,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4412839222743,4629774529799,5144985361221,5350390478303,5933126028560,6139737340207,6570686422420],[1000000000000000000000000000000,1024793452992,1465820654824,1756939591470,1962344708552,2545080258809,2751691570456,3182640652669,3388045769751,4423163218152,4629774529799,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar45 : Row := ⟨45,3,4,3,1725436572984891677951467423971062446496094382868200824551407605514240,[0,768595089744,1215634199246,1543123517176],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176]⟩ +def rdar46 : Row := ⟨46,3,4,4,1725436586697640898959295112272958727406674468635681809116020569276416,[0,768595089744,1215634199246,1543123517176,1748528634258],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258]⟩ +def rdar47 : Row := ⟨47,3,4,5,1725436586697640898962264512335118362156649842518275365008053446377472,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988]⟩ +def rdar48 : Row := ⟨48,3,4,6,1725436586697640898968203312459437631656600590283462476792119200579584,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635]⟩ +def rdar49 : Row := ⟨49,3,4,7,1725436586697640898968203312807886775465088746904641456538550479618048,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375]⟩ +def rdar50 : Row := ⟨50,3,4,8,1725436586697640898968203313504785063082065060146999416031413037694976,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457]⟩ +def rdar51 : Row := ⟨51,3,4,9,1725436586697640898968203313504785063082067536027077986791962835943424,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,3942824785201],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,4209347143858]⟩ +def rdar52 : Row := ⟨52,3,4,10,1725436586697640898968203313504785063082072487787235128313062432440320,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,3942824785201,4181599554893],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,4209347143858,4415958455505]⟩ +def rdar53 : Row := ⟨53,3,4,11,1725436586697640898968203313504785063082072487787235128313062432440320,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,3942824785201,4181599554893,4659530529623],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,4209347143858,4415958455505,1000000000000000000000000000000]⟩ +def rdar54 : Row := ⟨54,3,4,12,1725436586697640898968203313504785063082072487787235128313062432440320,[0,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,3942824785201,4181599554893,4659530529623,4866141841270],[1000000000000000000000000000000,768595089744,1215634199246,1543123517176,1748528634258,2226459608988,2433070920635,2968824578375,3174229695457,4209347143858,4415958455505,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar55 : Row := ⟨55,4,1,4,1725436586697640946849780764332285624630501836782856782355286582099968,[0,2849159501375,3244924911072,3529483110092,3734888227174],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174]⟩ +def rdar56 : Row := ⟨56,4,1,6,1725436586697640946858688964519793434364829842347494516881757994745856,[0,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548]⟩ +def rdar57 : Row := ⟨57,4,1,7,1725436586697640946858688964869614341383520862114826843778097958879232,[0,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347]⟩ +def rdar58 : Row := ⟨58,4,1,8,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429]⟩ +def rdar59 : Row := ⟨59,4,1,9,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,7854645388075],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,1000000000000000000000000000000]⟩ +def rdar60 : Row := ⟨60,4,1,10,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,7854645388075,8061256699722],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar61 : Row := ⟨61,4,1,11,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,7854645388075,8061256699722,8446125633449],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar62 : Row := ⟨62,4,1,12,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,7854645388075,8061256699722,8446125633449,8652736945096],[1000000000000000000000000000000,2849159501375,3244924911072,3529483110092,3734888227174,4119757160901,4326368472548,5184949703347,5390354820429,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar63 : Row := ⟨63,4,2,2,1725429058513974481006928856009369042408591087781735667604368899702784,[0,1424579750687,1820345160384],[1000000000000000000000000000000,1424579750687,1820345160384]⟩ +def rdar64 : Row := ⟨64,4,2,3,1725436572984891677951467423971191030149188575169341034321976229888000,[0,1424579750687,1820345160384,2104903359404],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404]⟩ +def rdar65 : Row := ⟨65,4,2,4,1725436586697640946849780764332285583092126968504235754111315948339200,[0,1424579750687,1820345160384,2104903359404,2310308476486],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486]⟩ +def rdar66 : Row := ⟨66,4,2,5,1725436586697640946852750164394788158644653058173367646790825996713984,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213]⟩ +def rdar67 : Row := ⟨67,4,2,6,1725436586697640946858688964519793309749705237511631432149846093463552,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860]⟩ +def rdar68 : Row := ⟨68,4,2,7,1725436586697640946858688964869614216768396257278963759046186057596928,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659]⟩ +def rdar69 : Row := ⟨69,4,2,8,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741]⟩ +def rdar70 : Row := ⟨70,4,2,9,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,5005485886699],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,1000000000000000000000000000000]⟩ +def rdar71 : Row := ⟨71,4,2,10,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,5005485886699,5212097198346],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar72 : Row := ⟨72,4,2,11,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,5005485886699,5212097198346,5596966132073],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar73 : Row := ⟨73,4,2,12,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,5005485886699,5212097198346,5596966132073,5803577443720],[1000000000000000000000000000000,1424579750687,1820345160384,2104903359404,2310308476486,2695177410213,2901788721860,3760369952659,3965775069741,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar74 : Row := ⟨74,4,3,2,1725429058513974481006928856009368710101592141552767441652603829616640,[0,949719833791,1345485243488],[1000000000000000000000000000000,949719833791,1345485243488]⟩ +def rdar75 : Row := ⟨75,4,3,3,1725436572984891677951467423971190033228191736482436356466681019629568,[0,949719833791,1345485243488,1630043442508],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508]⟩ +def rdar76 : Row := ⟨76,4,3,4,1725436586697640946849780764332283256943134344901458172448960457736192,[0,949719833791,1345485243488,1630043442508,1835448559590],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508,1835448559590]⟩ +def rdar77 : Row := ⟨77,4,3,5,1725436586697640946852750164394783174039668864738844257514349945421824,[0,949719833791,1345485243488,1630043442508,1835448559590,2220317493317],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508,1835448559590,2220317493317]⟩ +def rdar78 : Row := ⟨78,4,3,6,1725436586697640946858688964519783008232737904413616427645128920793088,[0,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964]⟩ +def rdar79 : Row := ⟨79,4,3,7,1725436586697640946858688964869593281427462644853965524084986642169856,[0,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763]⟩ +def rdar80 : Row := ⟨80,4,3,8,1725436586697640946858688965569213827816912125734663716964702084923392,[0,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763,3490915152845],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763,3490915152845]⟩ +def rdar81 : Row := ⟨81,4,3,9,1725436586697640946858688965569213827816912125734663716964702084923392,[0,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763,3490915152845,4055766052907],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763,3490915152845,1000000000000000000000000000000]⟩ +def rdar82 : Row := ⟨82,4,3,10,1725436586697640946858688965569213827816912125734663716964702084923392,[0,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763,3490915152845,4055766052907,4262377364554],[1000000000000000000000000000000,949719833791,1345485243488,1630043442508,1835448559590,2220317493317,2426928804964,3285510035763,3490915152845,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar83 : Row := ⟨83,4,4,1,1653786614870979874242332953218776295840243179859395196846919280230400,[0,712289875343],[1000000000000000000000000000000,712289875343]⟩ +def rdar84 : Row := ⟨84,4,4,2,1725429058513974481006928856009326174805727024244834519826674858590208,[0,712289875343,1088487332382],[1000000000000000000000000000000,712289875343,1088487332382]⟩ +def rdar85 : Row := ⟨85,4,4,3,1725436572984891677951467423971062427340596384558637590988894106550272,[0,712289875343,1088487332382,1379606269028],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028]⟩ +def rdar86 : Row := ⟨86,4,4,4,1725436586697640898959295112272958686173733925298765731581860092313600,[0,712289875343,1088487332382,1379606269028,1585011386110],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1585011386110]⟩ +def rdar87 : Row := ⟨87,4,4,5,1725436586697640898962264512335118320903347506672688442039817811787776,[0,712289875343,1088487332382,1379606269028,1585011386110,1982887534869],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1585011386110,1982887534869]⟩ +def rdar88 : Row := ⟨88,4,4,6,1725436586697640898968203312459437590362574669420533862955733250736128,[0,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516]⟩ +def rdar89 : Row := ⟨89,4,4,7,1725436586697640898968203312807886734089615656007029460965863899267072,[0,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,2901788721859],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,3048080077315]⟩ +def rdar90 : Row := ⟨90,4,4,8,1725436586697640898968203313504785021543697629180020656986125196328960,[0,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,2901788721859,3170022772220],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,3048080077315,3253485194397]⟩ +def rdar91 : Row := ⟨91,4,4,9,1725436586697640898968203313504785021543697629180020656986125196328960,[0,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,2901788721859,3170022772220,3567898920979],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,3048080077315,3253485194397,1000000000000000000000000000000]⟩ +def rdar92 : Row := ⟨92,4,4,10,1725436586697640898968203313504785021543697629180020656986125196328960,[0,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,2901788721859,3170022772220,3567898920979,3774510232626],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1585011386110,1982887534869,2189498846516,3048080077315,3253485194397,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar93 : Row := ⟨93,4,5,2,1725429058513974481006928855992992621193521977998592538669949984440320,[0,569831900275,897314942489],[1000000000000000000000000000000,569831900275,897314942489]⟩ +def rdar94 : Row := ⟨94,4,5,3,1725436572984891582170496119814897154848762079756415658785340930392064,[0,569831900275,897314942489,1188433879135],[1000000000000000000000000000000,569831900275,897314942489,1188433879135]⟩ +def rdar95 : Row := ⟨95,4,5,4,1725436586697640611616381199837129975922641103384583897284650312138752,[0,569831900275,897314942489,1188433879135,1393838996217],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1393838996217]⟩ +def rdar96 : Row := ⟨96,4,5,5,1725436586697640611619350599812177324720494438111882708240075369480192,[0,569831900275,897314942489,1188433879135,1393838996217,1840429559801],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1393838996217,1840429559801]⟩ +def rdar97 : Row := ⟨97,4,5,6,1725436586697640611625289399762272022316201107566480330150925484163072,[0,569831900275,897314942489,1188433879135,1393838996217,1840429559801,2047040871448],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1393838996217,1840429559801,2047040871448]⟩ +def rdar98 : Row := ⟨98,4,5,7,1725436586697640611625289399762272022316201107566480330150925484163072,[0,569831900275,897314942489,1188433879135,1393838996217,1840429559801,2047040871448,2582272875352],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1393838996217,1840429559801,2047040871448,1000000000000000000000000000000]⟩ +def rdar99 : Row := ⟨99,4,5,8,1725436586697640611625289399762272022316201107566480330150925484163072,[0,569831900275,897314942489,1188433879135,1393838996217,1840429559801,2047040871448,2582272875352,2787677992434],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1393838996217,1840429559801,2047040871448,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar100 : Row := ⟨100,4,6,1,1653786614870979874242332953213331777969508164443981203128010988847104,[0,474859916895],[1000000000000000000000000000000,474859916895]⟩ +def rdar101 : Row := ⟨101,4,6,2,1725429058513974481006928854599196046285358031652610146629427390316544,[0,474859916895,769866682561],[1000000000000000000000000000000,474859916895,769866682561]⟩ +def rdar102 : Row := ⟨102,4,6,3,1725436572984891582170496115633507430124270240718468482663773148020736,[0,474859916895,769866682561,1060985619207],[1000000000000000000000000000000,474859916895,769866682561,1060985619207]⟩ +def rdar103 : Row := ⟨103,4,6,4,1725436586697640228492495973608339361978736691385411248316211607371776,[0,474859916895,769866682561,1060985619207,1266390736289],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1266390736289]⟩ +def rdar104 : Row := ⟨104,4,6,5,1725436586697640228495465362433014111511278455344850922947455911723008,[0,474859916895,769866682561,1060985619207,1266390736289,1741250653184],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1266390736289,1745457576421]⟩ +def rdar105 : Row := ⟨105,4,6,6,1725436586697640228501404140082363610576361983263730272209944520425472,[0,474859916895,769866682561,1060985619207,1266390736289,1741250653184,1952068888068],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1266390736289,1745457576421,1952068888068]⟩ +def rdar106 : Row := ⟨106,4,6,7,1725436586697640228501404140082363610576361983263730272209944520425472,[0,474859916895,769866682561,1060985619207,1266390736289,1741250653184,1952068888068,2327376355496],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1266390736289,1745457576421,1952068888068,1000000000000000000000000000000]⟩ +def rdar107 : Row := ⟨107,4,6,8,1725436586697640228501404140082363610576361983263730272209944520425472,[0,474859916895,769866682561,1060985619207,1266390736289,1741250653184,1952068888068,2327376355496,2532781472578],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1266390736289,1745457576421,1952068888068,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar108 : Row := ⟨108,4,7,2,1725429058513973714759158287850295675928105607283708701369697262632960,[0,407022785910,678832211184],[1000000000000000000000000000000,407022785910,678832211184]⟩ +def rdar109 : Row := ⟨109,4,7,3,1725436572984889283427184504589787113175005533754637237478028788891648,[0,407022785910,678832211184,969951147830],[1000000000000000000000000000000,407022785910,678832211184,969951147830]⟩ +def rdar110 : Row := ⟨110,4,7,4,1725436586697634864758102273974979151845447419231720403278438785351680,[0,407022785910,678832211184,969951147830,1175356264912],[1000000000000000000000000000000,407022785910,678832211184,969951147830,1175356264912]⟩ +def rdar111 : Row := ⟨111,4,8,1,1653786614870979874242330054116455968988499764800605758841015211393024,[0,356144937671],[1000000000000000000000000000000,356144937671]⟩ +def rdar112 : Row := ⟨112,4,8,2,1725429058513967584776986260808706006780710656331157529442390231744512,[0,356144937671,610556357651],[1000000000000000000000000000000,356144937671,610556357651]⟩ +def rdar113 : Row := ⟨113,4,8,3,1725436572984870893480674132455788929572344914040861519676653227212800,[0,356144937671,610556357651,901675294297],[1000000000000000000000000000000,356144937671,610556357651,901675294297]⟩ +def rdar114 : Row := ⟨114,4,8,4,1725436586697591954882915211656163939332255461995495593728926162092032,[0,356144937671,610556357651,901675294297,1107080411379],[1000000000000000000000000000000,356144937671,610556357651,901675294297,1107080411379]⟩ +def rdar115 : Row := ⟨115,5,1,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2565792891519,2834880275992,2989537211085,3194942328167],[1000000000000000000000000000000,2565792891519,2834880275992,2989537211085,3194942328167]⟩ +def rdar116 : Row := ⟨116,5,1,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2565792891519,2834880275992,2989537211085,3194942328167,5760735219686,5979074422170],[1000000000000000000000000000000,2565792891519,2834880275992,2989537211085,3194942328167,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar117 : Row := ⟨117,5,1,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2565792891519,2834880275992,2989537211085,3194942328167,5760735219686,5979074422170,6184479539252,6389884656334],[1000000000000000000000000000000,2565792891519,2834880275992,2989537211085,3194942328167,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar118 : Row := ⟨118,5,2,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,1282896445759,1551983830232],[1000000000000000000000000000000,1282896445759,1551983830232]⟩ +def rdar119 : Row := ⟨119,5,2,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,1282896445759,1551983830232,1706640765325],[1000000000000000000000000000000,1282896445759,1551983830232,1706640765325]⟩ +def rdar120 : Row := ⟨120,5,2,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1282896445759,1551983830232,1706640765325,1912045882407],[1000000000000000000000000000000,1282896445759,1551983830232,1706640765325,1912045882407]⟩ +def rdar121 : Row := ⟨121,5,2,5,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1282896445759,1551983830232,1706640765325,1912045882407,3194942328166],[1000000000000000000000000000000,1282896445759,1551983830232,1706640765325,1912045882407,1000000000000000000000000000000]⟩ +def rdar122 : Row := ⟨122,5,2,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1282896445759,1551983830232,1706640765325,1912045882407,3194942328166,3413281530650],[1000000000000000000000000000000,1282896445759,1551983830232,1706640765325,1912045882407,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar123 : Row := ⟨123,5,2,7,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1282896445759,1551983830232,1706640765325,1912045882407,3194942328166,3413281530650,3618686647732],[1000000000000000000000000000000,1282896445759,1551983830232,1706640765325,1912045882407,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar124 : Row := ⟨124,5,2,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1282896445759,1551983830232,1706640765325,1912045882407,3194942328166,3413281530650,3618686647732,3824091764814],[1000000000000000000000000000000,1282896445759,1551983830232,1706640765325,1912045882407,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar125 : Row := ⟨125,5,3,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,855264297173,1124351681646],[1000000000000000000000000000000,855264297173,1124351681646]⟩ +def rdar126 : Row := ⟨126,5,3,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,855264297173,1124351681646,1279008616739],[1000000000000000000000000000000,855264297173,1124351681646,1279008616739]⟩ +def rdar127 : Row := ⟨127,5,3,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,855264297173,1124351681646,1279008616739,1484413733821],[1000000000000000000000000000000,855264297173,1124351681646,1279008616739,1484413733821]⟩ +def rdar128 : Row := ⟨128,5,3,5,1725436586697640898968203313510229539414432644595434650705033487712256,[0,855264297173,1124351681646,1279008616739,1484413733821,2339678030994],[1000000000000000000000000000000,855264297173,1124351681646,1279008616739,1484413733821,1000000000000000000000000000000]⟩ +def rdar129 : Row := ⟨129,5,3,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,855264297173,1124351681646,1279008616739,1484413733821,2339678030994,2558017233478],[1000000000000000000000000000000,855264297173,1124351681646,1279008616739,1484413733821,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar130 : Row := ⟨130,5,3,7,1725436586697640898968203313510229539414432644595434650705033487712256,[0,855264297173,1124351681646,1279008616739,1484413733821,2339678030994,2558017233478,2763422350560],[1000000000000000000000000000000,855264297173,1124351681646,1279008616739,1484413733821,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar131 : Row := ⟨131,5,3,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,855264297173,1124351681646,1279008616739,1484413733821,2339678030994,2558017233478,2763422350560,2968827467642],[1000000000000000000000000000000,855264297173,1124351681646,1279008616739,1484413733821,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar132 : Row := ⟨132,5,4,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,641448222879],[1000000000000000000000000000000,641448222879]⟩ +def rdar133 : Row := ⟨133,5,4,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,641448222879,910535607352],[1000000000000000000000000000000,641448222879,910535607352]⟩ +def rdar134 : Row := ⟨134,5,4,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,641448222879,910535607352,1065192542445],[1000000000000000000000000000000,641448222879,910535607352,1065192542445]⟩ +def rdar135 : Row := ⟨135,5,4,4,1725436586697640851077717661451202715716088046148272662619435919474688,[0,641448222879,910535607352,1065192542445,1270597659527],[1000000000000000000000000000000,641448222879,910535607352,1065192542445,1270597659527]⟩ +def rdar136 : Row := ⟨136,5,4,5,1725436586697640851077717661451202715716088046148272662619435919474688,[0,641448222879,910535607352,1065192542445,1270597659527,1912045882406],[1000000000000000000000000000000,641448222879,910535607352,1065192542445,1270597659527,1000000000000000000000000000000]⟩ +def rdar137 : Row := ⟨137,5,4,6,1725436586697640851077717661451202715716088046148272662619435919474688,[0,641448222879,910535607352,1065192542445,1270597659527,1912045882406,2130385084890],[1000000000000000000000000000000,641448222879,910535607352,1065192542445,1270597659527,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar138 : Row := ⟨138,5,4,7,1725436586697640851077717661451202715716088046148272662619435919474688,[0,641448222879,910535607352,1065192542445,1270597659527,1912045882406,2130385084890,2335790201972],[1000000000000000000000000000000,641448222879,910535607352,1065192542445,1270597659527,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar139 : Row := ⟨139,5,4,8,1725436586697640851077717661451202715716088046148272662619435919474688,[0,641448222879,910535607352,1065192542445,1270597659527,1912045882406,2130385084890,2335790201972,2541195319054],[1000000000000000000000000000000,641448222879,910535607352,1065192542445,1270597659527,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar140 : Row := ⟨140,5,5,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,513158578303,764161447185],[1000000000000000000000000000000,513158578303,764161447185]⟩ +def rdar141 : Row := ⟨141,5,5,3,1725436572984891535880517150478355001856677197196097826469908263731200,[0,513158578303,764161447185,936902897869],[1000000000000000000000000000000,513158578303,764161447185,936902897869]⟩ +def rdar142 : Row := ⟨142,5,5,4,1725436586697640563734803749097041773526020455465300734105850510049280,[0,513158578303,764161447185,936902897869,1142308014951],[1000000000000000000000000000000,513158578303,764161447185,936902897869,1142308014951]⟩ +def rdar143 : Row := ⟨143,5,5,5,1725436586697640563734803749097041773526020455465300734105850510049280,[0,513158578303,764161447185,936902897869,1142308014951,1655466593254],[1000000000000000000000000000000,513158578303,764161447185,936902897869,1142308014951,1000000000000000000000000000000]⟩ +def rdar144 : Row := ⟨144,5,5,6,1725436586697640563734803749097041773526020455465300734105850510049280,[0,513158578303,764161447185,936902897869,1142308014951,1655466593254,1873805795738],[1000000000000000000000000000000,513158578303,764161447185,936902897869,1142308014951,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar145 : Row := ⟨145,5,6,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,427632148586],[1000000000000000000000000000000,427632148586]⟩ +def rdar146 : Row := ⟨146,5,6,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,427632148586,658905436474],[1000000000000000000000000000000,427632148586,658905436474]⟩ +def rdar147 : Row := ⟨147,5,6,3,1725436572984891535880517150478355001856677197196097826469908263731200,[0,427632148586,658905436474,851376468152],[1000000000000000000000000000000,427632148586,658905436474,851376468152]⟩ +def rdar148 : Row := ⟨148,5,6,4,1725436586697640180610918532624827183939263667888004829421069964148736,[0,427632148586,658905436474,851376468152,1056781585234],[1000000000000000000000000000000,427632148586,658905436474,851376468152,1056781585234]⟩ +def rdar149 : Row := ⟨149,5,6,5,1725436586697640180610918532624827183939263667888004829421069964148736,[0,427632148586,658905436474,851376468152,1056781585234,1484413733820],[1000000000000000000000000000000,427632148586,658905436474,851376468152,1056781585234,1000000000000000000000000000000]⟩ +def rdar150 : Row := ⟨150,5,6,6,1725436586697640180610918532624827183939263667888004829421069964148736,[0,427632148586,658905436474,851376468152,1056781585234,1484413733820,1702752936304],[1000000000000000000000000000000,427632148586,658905436474,851376468152,1056781585234,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar151 : Row := ⟨151,5,7,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,366541841645],[1000000000000000000000000000000,366541841645]⟩ +def rdar152 : Row := ⟨152,5,7,2,1725429058513973669264978694413794313730191402963165562416639793692672,[0,366541841645,583722571681],[1000000000000000000000000000000,366541841645,583722571681]⟩ +def rdar153 : Row := ⟨153,5,7,3,1725436572984889237137205851645067464336136471732322398361224988327936,[0,366541841645,583722571681,790286161211],[1000000000000000000000000000000,366541841645,583722571681,790286161211]⟩ +def rdar154 : Row := ⟨154,5,7,4,1725436586697634816876525502013822929724668641805862163834142321541120,[0,366541841645,583722571681,790286161211,995691278293],[1000000000000000000000000000000,366541841645,583722571681,790286161211,995691278293]⟩ +def rdar155 : Row := ⟨155,5,7,5,1725436586697634816876525502013822929724668641805862163834142321541120,[0,366541841645,583722571681,790286161211,995691278293,1362233119938],[1000000000000000000000000000000,366541841645,583722571681,790286161211,995691278293,1000000000000000000000000000000]⟩ +def rdar156 : Row := ⟨156,5,7,6,1725436586697634816876525502013822929724668641805862163834142321541120,[0,366541841645,583722571681,790286161211,995691278293,1362233119938,1579413849974],[1000000000000000000000000000000,366541841645,583722571681,790286161211,995691278293,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar157 : Row := ⟨157,5,8,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,320724111439],[1000000000000000000000000000000,320724111439]⟩ +def rdar158 : Row := ⟨158,5,8,2,1725429058513967539282815230858360880342082801726431087460151059283968,[0,320724111439,527335423086],[1000000000000000000000000000000,320724111439,527335423086]⟩ +def rdar159 : Row := ⟨159,5,8,3,1725436572984870847190715460978767164171810668022118973491758785101824,[0,320724111439,527335423086,744468431005],[1000000000000000000000000000000,320724111439,527335423086,744468431005]⟩ +def rdar160 : Row := ⟨160,5,8,4,1725436586697591907001381257125788896007908433148720839138721180680192,[0,320724111439,527335423086,744468431005,949873548087],[1000000000000000000000000000000,320724111439,527335423086,744468431005,949873548087]⟩ +def rdar161 : Row := ⟨161,5,8,5,1725436586697591907001381257125788896007908433148720839138721180680192,[0,320724111439,527335423086,744468431005,949873548087,1270597659526],[1000000000000000000000000000000,320724111439,527335423086,744468431005,949873548087,1000000000000000000000000000000]⟩ +def rdar162 : Row := ⟨162,5,8,6,1725436586697591907001381257125788896007908433148720839138721180680192,[0,320724111439,527335423086,744468431005,949873548087,1270597659526,1477208971173],[1000000000000000000000000000000,320724111439,527335423086,744468431005,949873548087,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar163 : Row := ⟨163,5,9,1,1653786614870930819220298669022873459737421670038487811861692278636544,[0,285088099057],[1000000000000000000000000000000,285088099057]⟩ +def rdar164 : Row := ⟨164,5,9,2,1725429058513820419710892105527958479027476372044803688504421433475072,[0,285088099057,483478751956],[1000000000000000000000000000000,285088099057,483478751956]⟩ +def rdar165 : Row := ⟨165,5,9,3,1725436572984527568189561501874494894437728998764988375928389658214400,[0,285088099057,483478751956,708832418623],[1000000000000000000000000000000,285088099057,483478751956,708832418623]⟩ +def rdar166 : Row := ⟨166,5,9,4,1725436586696856309141765630473776889434876284740583844360073051635712,[0,285088099057,483478751956,708832418623,914237535705],[1000000000000000000000000000000,285088099057,483478751956,708832418623,914237535705]⟩ +def rdar167 : Row := ⟨167,5,10,1,1653786614870930819220298669022873459737421670038487811861692278636544,[0,256579289151],[1000000000000000000000000000000,256579289151]⟩ +def rdar168 : Row := ⟨168,5,10,2,1725429058513035781993968770432479005349575413742790894073863429160960,[0,256579289151,448393415052],[1000000000000000000000000000000,256579289151,448393415052]⟩ +def rdar169 : Row := ⟨169,5,10,3,1725436572982173655038791496588056473404026123858949992636715645272064,[0,256579289151,448393415052,680323608717],[1000000000000000000000000000000,256579289151,448393415052,680323608717]⟩ +def rdar170 : Row := ⟨170,5,10,4,1725436586691363845123302284805420573689569576626494283346167021436928,[0,256579289151,448393415052,680323608717,885728725799],[1000000000000000000000000000000,256579289151,448393415052,680323608717,885728725799]⟩ +def rdar171 : Row := ⟨171,5,11,1,1653786614864653717484911988259037670314214003622385456417228244123648,[0,233253899229],[1000000000000000000000000000000,233253899229]⟩ +def rdar172 : Row := ⟨172,5,11,2,1725429058494204476787808728140971637079952414494483827740471325622272,[0,233253899229,419687230313],[1000000000000000000000000000000,233253899229,419687230313]⟩ +def rdar173 : Row := ⟨173,5,12,1,1653786614764220089718725096037665039542891340964747769305803691917312,[0,213816074293],[1000000000000000000000000000000,213816074293]⟩ +def rdar174 : Row := ⟨174,5,12,2,1725429058192903593489248051476853744765984426521570766406197669003264,[0,213816074293,395765409697],[1000000000000000000000000000000,213816074293,395765409697]⟩ +def rdar175 : Row := ⟨175,6,3,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,727797341618,860422724538,1588220066156,1720845449076],[1000000000000000000000000000000,727797341618,860422724538,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar176 : Row := ⟨176,6,4,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,545848006213,678473389133,1224321395346],[1000000000000000000000000000000,545848006213,678473389133,1000000000000000000000000000000]⟩ +def rdar177 : Row := ⟨177,6,4,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,545848006213,678473389133,1224321395346,1356946778266],[1000000000000000000000000000000,545848006213,678473389133,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar178 : Row := ⟨178,6,5,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,436678404971,569303787891,1005982192862,1138607575782],[1000000000000000000000000000000,436678404971,569303787891,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar179 : Row := ⟨179,6,6,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,363898670809,496524053729],[1000000000000000000000000000000,363898670809,496524053729]⟩ +def rdar180 : Row := ⟨180,6,6,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,363898670809,496524053729,860422724538],[1000000000000000000000000000000,363898670809,496524053729,1000000000000000000000000000000]⟩ +def rdar181 : Row := ⟨181,6,6,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,363898670809,496524053729,860422724538,993048107458],[1000000000000000000000000000000,363898670809,496524053729,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar182 : Row := ⟨182,6,7,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,311913146407,444538529327],[1000000000000000000000000000000,311913146407,444538529327]⟩ +def rdar183 : Row := ⟨183,6,7,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,311913146407,444538529327,756451675734],[1000000000000000000000000000000,311913146407,444538529327,1000000000000000000000000000000]⟩ +def rdar184 : Row := ⟨184,6,7,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,311913146407,444538529327,756451675734,889077058654],[1000000000000000000000000000000,311913146407,444538529327,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar185 : Row := ⟨185,6,8,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,272924003106],[1000000000000000000000000000000,272924003106]⟩ +def rdar186 : Row := ⟨186,6,8,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,272924003106,405549386026],[1000000000000000000000000000000,272924003106,405549386026]⟩ +def rdar187 : Row := ⟨187,6,8,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,272924003106,405549386026,678473389132],[1000000000000000000000000000000,272924003106,405549386026,1000000000000000000000000000000]⟩ +def rdar188 : Row := ⟨188,6,8,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,272924003106,405549386026,678473389132,811098772052],[1000000000000000000000000000000,272924003106,405549386026,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar189 : Row := ⟨189,6,9,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,242599113872,375224496792],[1000000000000000000000000000000,242599113872,375224496792]⟩ +def rdar190 : Row := ⟨190,6,9,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,242599113872,375224496792,617823610664],[1000000000000000000000000000000,242599113872,375224496792,1000000000000000000000000000000]⟩ +def rdar191 : Row := ⟨191,6,9,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,242599113872,375224496792,617823610664,750448993584],[1000000000000000000000000000000,242599113872,375224496792,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar192 : Row := ⟨192,6,10,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,218339202485],[1000000000000000000000000000000,218339202485]⟩ +def rdar193 : Row := ⟨193,6,10,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218339202485,350964585405],[1000000000000000000000000000000,218339202485,350964585405]⟩ +def rdar194 : Row := ⟨194,6,10,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218339202485,350964585405,569303787890],[1000000000000000000000000000000,218339202485,350964585405,1000000000000000000000000000000]⟩ +def rdar195 : Row := ⟨195,6,10,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218339202485,350964585405,569303787890,701929170810],[1000000000000000000000000000000,218339202485,350964585405,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar196 : Row := ⟨196,6,11,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,198490184077],[1000000000000000000000000000000,198490184077]⟩ +def rdar197 : Row := ⟨197,6,11,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198490184077,331115566997],[1000000000000000000000000000000,198490184077,331115566997]⟩ +def rdar198 : Row := ⟨198,6,11,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198490184077,331115566997,529605751074],[1000000000000000000000000000000,198490184077,331115566997,1000000000000000000000000000000]⟩ +def rdar199 : Row := ⟨199,6,11,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198490184077,331115566997,529605751074,662231133994],[1000000000000000000000000000000,198490184077,331115566997,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar200 : Row := ⟨200,6,12,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,181949335404],[1000000000000000000000000000000,181949335404]⟩ +def rdar201 : Row := ⟨201,6,12,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,181949335404,314574718324],[1000000000000000000000000000000,181949335404,314574718324]⟩ +def rdar202 : Row := ⟨202,6,12,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,181949335404,314574718324,496524053728],[1000000000000000000000000000000,181949335404,314574718324,1000000000000000000000000000000]⟩ +def rdar203 : Row := ⟨203,6,12,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,181949335404,314574718324,496524053728,629149436648],[1000000000000000000000000000000,181949335404,314574718324,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdar204 : Row := ⟨204,6,13,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,167953232681],[1000000000000000000000000000000,167953232681]⟩ +def rdar205 : Row := ⟨205,6,13,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,167953232681,300578615601],[1000000000000000000000000000000,167953232681,300578615601]⟩ +def rdar206 : Row := ⟨206,6,13,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,167953232681,300578615601,468531848282],[1000000000000000000000000000000,167953232681,300578615601,1000000000000000000000000000000]⟩ +def rdar207 : Row := ⟨207,6,14,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,155956573203],[1000000000000000000000000000000,155956573203]⟩ +def rdar208 : Row := ⟨208,6,14,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,155956573203,288581956123],[1000000000000000000000000000000,155956573203,288581956123]⟩ +def rdar209 : Row := ⟨209,6,14,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,155956573203,288581956123,444538529326],[1000000000000000000000000000000,155956573203,288581956123,1000000000000000000000000000000]⟩ +def rdar210 : Row := ⟨210,6,15,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,145559468323],[1000000000000000000000000000000,145559468323]⟩ +def rdar211 : Row := ⟨211,6,15,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,145559468323,278184851243],[1000000000000000000000000000000,145559468323,278184851243]⟩ +def rdar212 : Row := ⟨212,6,15,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,145559468323,278184851243,423744319566],[1000000000000000000000000000000,145559468323,278184851243,1000000000000000000000000000000]⟩ +def rdar213 : Row := ⟨213,6,16,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,136462001553],[1000000000000000000000000000000,136462001553]⟩ +def rdar214 : Row := ⟨214,6,16,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,136462001553,269087384473],[1000000000000000000000000000000,136462001553,269087384473]⟩ +def rdar215 : Row := ⟨215,6,17,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,128434824991],[1000000000000000000000000000000,128434824991]⟩ +def rdar216 : Row := ⟨216,6,18,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,121299556936],[1000000000000000000000000000000,121299556936]⟩ +def rdar217 : Row := ⟨217,6,19,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,114915369729],[1000000000000000000000000000000,114915369729]⟩ +def rdar218 : Row := ⟨218,6,20,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,109169601242],[1000000000000000000000000000000,109169601242]⟩ +def rdar219 : Row := ⟨219,7,18,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,88416921946,176833843892],[1000000000000000000000000000000,88416921946,1000000000000000000000000000000]⟩ +def rdar220 : Row := ⟨220,7,20,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,79575229752],[1000000000000000000000000000000,79575229752]⟩ +def rdar221 : Row := ⟨221,7,20,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,79575229752,159150459504],[1000000000000000000000000000000,79575229752,1000000000000000000000000000000]⟩ +def rdar222 : Row := ⟨222,7,22,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,72341117956],[1000000000000000000000000000000,72341117956]⟩ +def rdar223 : Row := ⟨223,7,22,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,72341117956,144682235912],[1000000000000000000000000000000,72341117956,1000000000000000000000000000000]⟩ +def rdar224 : Row := ⟨224,7,24,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,66312691460],[1000000000000000000000000000000,66312691460]⟩ +def rdar225 : Row := ⟨225,7,24,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,66312691460,132625382920],[1000000000000000000000000000000,66312691460,1000000000000000000000000000000]⟩ +def rdar226 : Row := ⟨226,7,26,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,61211715194],[1000000000000000000000000000000,61211715194]⟩ +def rdar227 : Row := ⟨227,7,28,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,56839449823],[1000000000000000000000000000000,56839449823]⟩ +def rdar228 : Row := ⟨228,7,30,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,53050153168],[1000000000000000000000000000000,53050153168]⟩ +def rdar229 : Row := ⟨229,8,48,1,0,[0,0],[1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdaR : List Row := [rdar0, rdar1, rdar2, rdar3, rdar4, rdar5, rdar6, rdar7, rdar8, rdar9, rdar10, rdar11, rdar12, rdar13, rdar14, rdar15, rdar16, rdar17, rdar18, rdar19, rdar20, rdar21, rdar22, rdar23, rdar24, rdar25, rdar26, rdar27, rdar28, rdar29, rdar30, rdar31, rdar32, rdar33, rdar34, rdar35, rdar36, rdar37, rdar38, rdar39, rdar40, rdar41, rdar42, rdar43, rdar44, rdar45, rdar46, rdar47, rdar48, rdar49, rdar50, rdar51, rdar52, rdar53, rdar54, rdar55, rdar56, rdar57, rdar58, rdar59, rdar60, rdar61, rdar62, rdar63, rdar64, rdar65, rdar66, rdar67, rdar68, rdar69, rdar70, rdar71, rdar72, rdar73, rdar74, rdar75, rdar76, rdar77, rdar78, rdar79, rdar80, rdar81, rdar82, rdar83, rdar84, rdar85, rdar86, rdar87, rdar88, rdar89, rdar90, rdar91, rdar92, rdar93, rdar94, rdar95, rdar96, rdar97, rdar98, rdar99, rdar100, rdar101, rdar102, rdar103, rdar104, rdar105, rdar106, rdar107, rdar108, rdar109, rdar110, rdar111, rdar112, rdar113, rdar114, rdar115, rdar116, rdar117, rdar118, rdar119, rdar120, rdar121, rdar122, rdar123, rdar124, rdar125, rdar126, rdar127, rdar128, rdar129, rdar130, rdar131, rdar132, rdar133, rdar134, rdar135, rdar136, rdar137, rdar138, rdar139, rdar140, rdar141, rdar142, rdar143, rdar144, rdar145, rdar146, rdar147, rdar148, rdar149, rdar150, rdar151, rdar152, rdar153, rdar154, rdar155, rdar156, rdar157, rdar158, rdar159, rdar160, rdar161, rdar162, rdar163, rdar164, rdar165, rdar166, rdar167, rdar168, rdar169, rdar170, rdar171, rdar172, rdar173, rdar174, rdar175, rdar176, rdar177, rdar178, rdar179, rdar180, rdar181, rdar182, rdar183, rdar184, rdar185, rdar186, rdar187, rdar188, rdar189, rdar190, rdar191, rdar192, rdar193, rdar194, rdar195, rdar196, rdar197, rdar198, rdar199, rdar200, rdar201, rdar202, rdar203, rdar204, rdar205, rdar206, rdar207, rdar208, rdar209, rdar210, rdar211, rdar212, rdar213, rdar214, rdar215, rdar216, rdar217, rdar218, rdar219, rdar220, rdar221, rdar222, rdar223, rdar224, rdar225, rdar226, rdar227, rdar228, rdar229] +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP0.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP0.lean new file mode 100644 index 0000000000..e7f718aa27 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP0.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac0 : Row.check rdaW rdaR rdar0 = true := by decide +kernel +theorem rdac1 : Row.check rdaW rdaR rdar1 = true := by decide +kernel +theorem rdac2 : Row.check rdaW rdaR rdar2 = true := by decide +kernel +theorem rdac3 : Row.check rdaW rdaR rdar3 = true := by decide +kernel +theorem rdac4 : Row.check rdaW rdaR rdar4 = true := by decide +kernel +theorem rdac5 : Row.check rdaW rdaR rdar5 = true := by decide +kernel +theorem rdac6 : Row.check rdaW rdaR rdar6 = true := by decide +kernel +theorem rdac7 : Row.check rdaW rdaR rdar7 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP1.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP1.lean new file mode 100644 index 0000000000..06f8e1e009 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP1.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac8 : Row.check rdaW rdaR rdar8 = true := by decide +kernel +theorem rdac9 : Row.check rdaW rdaR rdar9 = true := by decide +kernel +theorem rdac10 : Row.check rdaW rdaR rdar10 = true := by decide +kernel +theorem rdac11 : Row.check rdaW rdaR rdar11 = true := by decide +kernel +theorem rdac12 : Row.check rdaW rdaR rdar12 = true := by decide +kernel +theorem rdac13 : Row.check rdaW rdaR rdar13 = true := by decide +kernel +theorem rdac14 : Row.check rdaW rdaR rdar14 = true := by decide +kernel +theorem rdac15 : Row.check rdaW rdaR rdar15 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP10.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP10.lean new file mode 100644 index 0000000000..5900ed1487 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP10.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac80 : Row.check rdaW rdaR rdar80 = true := by decide +kernel +theorem rdac81 : Row.check rdaW rdaR rdar81 = true := by decide +kernel +theorem rdac82 : Row.check rdaW rdaR rdar82 = true := by decide +kernel +theorem rdac83 : Row.check rdaW rdaR rdar83 = true := by decide +kernel +theorem rdac84 : Row.check rdaW rdaR rdar84 = true := by decide +kernel +theorem rdac85 : Row.check rdaW rdaR rdar85 = true := by decide +kernel +theorem rdac86 : Row.check rdaW rdaR rdar86 = true := by decide +kernel +theorem rdac87 : Row.check rdaW rdaR rdar87 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP11.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP11.lean new file mode 100644 index 0000000000..f5806d8182 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP11.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac88 : Row.check rdaW rdaR rdar88 = true := by decide +kernel +theorem rdac89 : Row.check rdaW rdaR rdar89 = true := by decide +kernel +theorem rdac90 : Row.check rdaW rdaR rdar90 = true := by decide +kernel +theorem rdac91 : Row.check rdaW rdaR rdar91 = true := by decide +kernel +theorem rdac92 : Row.check rdaW rdaR rdar92 = true := by decide +kernel +theorem rdac93 : Row.check rdaW rdaR rdar93 = true := by decide +kernel +theorem rdac94 : Row.check rdaW rdaR rdar94 = true := by decide +kernel +theorem rdac95 : Row.check rdaW rdaR rdar95 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP12.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP12.lean new file mode 100644 index 0000000000..562a79dda3 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP12.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac96 : Row.check rdaW rdaR rdar96 = true := by decide +kernel +theorem rdac97 : Row.check rdaW rdaR rdar97 = true := by decide +kernel +theorem rdac98 : Row.check rdaW rdaR rdar98 = true := by decide +kernel +theorem rdac99 : Row.check rdaW rdaR rdar99 = true := by decide +kernel +theorem rdac100 : Row.check rdaW rdaR rdar100 = true := by decide +kernel +theorem rdac101 : Row.check rdaW rdaR rdar101 = true := by decide +kernel +theorem rdac102 : Row.check rdaW rdaR rdar102 = true := by decide +kernel +theorem rdac103 : Row.check rdaW rdaR rdar103 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP13.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP13.lean new file mode 100644 index 0000000000..8117771ae5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP13.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac104 : Row.check rdaW rdaR rdar104 = true := by decide +kernel +theorem rdac105 : Row.check rdaW rdaR rdar105 = true := by decide +kernel +theorem rdac106 : Row.check rdaW rdaR rdar106 = true := by decide +kernel +theorem rdac107 : Row.check rdaW rdaR rdar107 = true := by decide +kernel +theorem rdac108 : Row.check rdaW rdaR rdar108 = true := by decide +kernel +theorem rdac109 : Row.check rdaW rdaR rdar109 = true := by decide +kernel +theorem rdac110 : Row.check rdaW rdaR rdar110 = true := by decide +kernel +theorem rdac111 : Row.check rdaW rdaR rdar111 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP14.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP14.lean new file mode 100644 index 0000000000..ad0f04895f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP14.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac112 : Row.check rdaW rdaR rdar112 = true := by decide +kernel +theorem rdac113 : Row.check rdaW rdaR rdar113 = true := by decide +kernel +theorem rdac114 : Row.check rdaW rdaR rdar114 = true := by decide +kernel +theorem rdac115 : Row.check rdaW rdaR rdar115 = true := by decide +kernel +theorem rdac116 : Row.check rdaW rdaR rdar116 = true := by decide +kernel +theorem rdac117 : Row.check rdaW rdaR rdar117 = true := by decide +kernel +theorem rdac118 : Row.check rdaW rdaR rdar118 = true := by decide +kernel +theorem rdac119 : Row.check rdaW rdaR rdar119 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP15.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP15.lean new file mode 100644 index 0000000000..5589d56886 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP15.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac120 : Row.check rdaW rdaR rdar120 = true := by decide +kernel +theorem rdac121 : Row.check rdaW rdaR rdar121 = true := by decide +kernel +theorem rdac122 : Row.check rdaW rdaR rdar122 = true := by decide +kernel +theorem rdac123 : Row.check rdaW rdaR rdar123 = true := by decide +kernel +theorem rdac124 : Row.check rdaW rdaR rdar124 = true := by decide +kernel +theorem rdac125 : Row.check rdaW rdaR rdar125 = true := by decide +kernel +theorem rdac126 : Row.check rdaW rdaR rdar126 = true := by decide +kernel +theorem rdac127 : Row.check rdaW rdaR rdar127 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP16.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP16.lean new file mode 100644 index 0000000000..23132a4fc8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP16.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac128 : Row.check rdaW rdaR rdar128 = true := by decide +kernel +theorem rdac129 : Row.check rdaW rdaR rdar129 = true := by decide +kernel +theorem rdac130 : Row.check rdaW rdaR rdar130 = true := by decide +kernel +theorem rdac131 : Row.check rdaW rdaR rdar131 = true := by decide +kernel +theorem rdac132 : Row.check rdaW rdaR rdar132 = true := by decide +kernel +theorem rdac133 : Row.check rdaW rdaR rdar133 = true := by decide +kernel +theorem rdac134 : Row.check rdaW rdaR rdar134 = true := by decide +kernel +theorem rdac135 : Row.check rdaW rdaR rdar135 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP17.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP17.lean new file mode 100644 index 0000000000..8e13dd1035 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP17.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac136 : Row.check rdaW rdaR rdar136 = true := by decide +kernel +theorem rdac137 : Row.check rdaW rdaR rdar137 = true := by decide +kernel +theorem rdac138 : Row.check rdaW rdaR rdar138 = true := by decide +kernel +theorem rdac139 : Row.check rdaW rdaR rdar139 = true := by decide +kernel +theorem rdac140 : Row.check rdaW rdaR rdar140 = true := by decide +kernel +theorem rdac141 : Row.check rdaW rdaR rdar141 = true := by decide +kernel +theorem rdac142 : Row.check rdaW rdaR rdar142 = true := by decide +kernel +theorem rdac143 : Row.check rdaW rdaR rdar143 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP18.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP18.lean new file mode 100644 index 0000000000..7d98923bcd --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP18.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac144 : Row.check rdaW rdaR rdar144 = true := by decide +kernel +theorem rdac145 : Row.check rdaW rdaR rdar145 = true := by decide +kernel +theorem rdac146 : Row.check rdaW rdaR rdar146 = true := by decide +kernel +theorem rdac147 : Row.check rdaW rdaR rdar147 = true := by decide +kernel +theorem rdac148 : Row.check rdaW rdaR rdar148 = true := by decide +kernel +theorem rdac149 : Row.check rdaW rdaR rdar149 = true := by decide +kernel +theorem rdac150 : Row.check rdaW rdaR rdar150 = true := by decide +kernel +theorem rdac151 : Row.check rdaW rdaR rdar151 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP19.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP19.lean new file mode 100644 index 0000000000..f091054db1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP19.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac152 : Row.check rdaW rdaR rdar152 = true := by decide +kernel +theorem rdac153 : Row.check rdaW rdaR rdar153 = true := by decide +kernel +theorem rdac154 : Row.check rdaW rdaR rdar154 = true := by decide +kernel +theorem rdac155 : Row.check rdaW rdaR rdar155 = true := by decide +kernel +theorem rdac156 : Row.check rdaW rdaR rdar156 = true := by decide +kernel +theorem rdac157 : Row.check rdaW rdaR rdar157 = true := by decide +kernel +theorem rdac158 : Row.check rdaW rdaR rdar158 = true := by decide +kernel +theorem rdac159 : Row.check rdaW rdaR rdar159 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP2.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP2.lean new file mode 100644 index 0000000000..ee1fec4cf1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP2.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac16 : Row.check rdaW rdaR rdar16 = true := by decide +kernel +theorem rdac17 : Row.check rdaW rdaR rdar17 = true := by decide +kernel +theorem rdac18 : Row.check rdaW rdaR rdar18 = true := by decide +kernel +theorem rdac19 : Row.check rdaW rdaR rdar19 = true := by decide +kernel +theorem rdac20 : Row.check rdaW rdaR rdar20 = true := by decide +kernel +theorem rdac21 : Row.check rdaW rdaR rdar21 = true := by decide +kernel +theorem rdac22 : Row.check rdaW rdaR rdar22 = true := by decide +kernel +theorem rdac23 : Row.check rdaW rdaR rdar23 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP20.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP20.lean new file mode 100644 index 0000000000..cc46ce21e7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP20.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac160 : Row.check rdaW rdaR rdar160 = true := by decide +kernel +theorem rdac161 : Row.check rdaW rdaR rdar161 = true := by decide +kernel +theorem rdac162 : Row.check rdaW rdaR rdar162 = true := by decide +kernel +theorem rdac163 : Row.check rdaW rdaR rdar163 = true := by decide +kernel +theorem rdac164 : Row.check rdaW rdaR rdar164 = true := by decide +kernel +theorem rdac165 : Row.check rdaW rdaR rdar165 = true := by decide +kernel +theorem rdac166 : Row.check rdaW rdaR rdar166 = true := by decide +kernel +theorem rdac167 : Row.check rdaW rdaR rdar167 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP21.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP21.lean new file mode 100644 index 0000000000..c53347cc99 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP21.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac168 : Row.check rdaW rdaR rdar168 = true := by decide +kernel +theorem rdac169 : Row.check rdaW rdaR rdar169 = true := by decide +kernel +theorem rdac170 : Row.check rdaW rdaR rdar170 = true := by decide +kernel +theorem rdac171 : Row.check rdaW rdaR rdar171 = true := by decide +kernel +theorem rdac172 : Row.check rdaW rdaR rdar172 = true := by decide +kernel +theorem rdac173 : Row.check rdaW rdaR rdar173 = true := by decide +kernel +theorem rdac174 : Row.check rdaW rdaR rdar174 = true := by decide +kernel +theorem rdac175 : Row.check rdaW rdaR rdar175 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP22.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP22.lean new file mode 100644 index 0000000000..f3faf8130a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP22.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac176 : Row.check rdaW rdaR rdar176 = true := by decide +kernel +theorem rdac177 : Row.check rdaW rdaR rdar177 = true := by decide +kernel +theorem rdac178 : Row.check rdaW rdaR rdar178 = true := by decide +kernel +theorem rdac179 : Row.check rdaW rdaR rdar179 = true := by decide +kernel +theorem rdac180 : Row.check rdaW rdaR rdar180 = true := by decide +kernel +theorem rdac181 : Row.check rdaW rdaR rdar181 = true := by decide +kernel +theorem rdac182 : Row.check rdaW rdaR rdar182 = true := by decide +kernel +theorem rdac183 : Row.check rdaW rdaR rdar183 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP23.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP23.lean new file mode 100644 index 0000000000..f67e3c6977 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP23.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac184 : Row.check rdaW rdaR rdar184 = true := by decide +kernel +theorem rdac185 : Row.check rdaW rdaR rdar185 = true := by decide +kernel +theorem rdac186 : Row.check rdaW rdaR rdar186 = true := by decide +kernel +theorem rdac187 : Row.check rdaW rdaR rdar187 = true := by decide +kernel +theorem rdac188 : Row.check rdaW rdaR rdar188 = true := by decide +kernel +theorem rdac189 : Row.check rdaW rdaR rdar189 = true := by decide +kernel +theorem rdac190 : Row.check rdaW rdaR rdar190 = true := by decide +kernel +theorem rdac191 : Row.check rdaW rdaR rdar191 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP24.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP24.lean new file mode 100644 index 0000000000..3f6c51d95e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP24.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac192 : Row.check rdaW rdaR rdar192 = true := by decide +kernel +theorem rdac193 : Row.check rdaW rdaR rdar193 = true := by decide +kernel +theorem rdac194 : Row.check rdaW rdaR rdar194 = true := by decide +kernel +theorem rdac195 : Row.check rdaW rdaR rdar195 = true := by decide +kernel +theorem rdac196 : Row.check rdaW rdaR rdar196 = true := by decide +kernel +theorem rdac197 : Row.check rdaW rdaR rdar197 = true := by decide +kernel +theorem rdac198 : Row.check rdaW rdaR rdar198 = true := by decide +kernel +theorem rdac199 : Row.check rdaW rdaR rdar199 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP25.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP25.lean new file mode 100644 index 0000000000..56c0249130 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP25.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac200 : Row.check rdaW rdaR rdar200 = true := by decide +kernel +theorem rdac201 : Row.check rdaW rdaR rdar201 = true := by decide +kernel +theorem rdac202 : Row.check rdaW rdaR rdar202 = true := by decide +kernel +theorem rdac203 : Row.check rdaW rdaR rdar203 = true := by decide +kernel +theorem rdac204 : Row.check rdaW rdaR rdar204 = true := by decide +kernel +theorem rdac205 : Row.check rdaW rdaR rdar205 = true := by decide +kernel +theorem rdac206 : Row.check rdaW rdaR rdar206 = true := by decide +kernel +theorem rdac207 : Row.check rdaW rdaR rdar207 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP26.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP26.lean new file mode 100644 index 0000000000..3f7daefeea --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP26.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac208 : Row.check rdaW rdaR rdar208 = true := by decide +kernel +theorem rdac209 : Row.check rdaW rdaR rdar209 = true := by decide +kernel +theorem rdac210 : Row.check rdaW rdaR rdar210 = true := by decide +kernel +theorem rdac211 : Row.check rdaW rdaR rdar211 = true := by decide +kernel +theorem rdac212 : Row.check rdaW rdaR rdar212 = true := by decide +kernel +theorem rdac213 : Row.check rdaW rdaR rdar213 = true := by decide +kernel +theorem rdac214 : Row.check rdaW rdaR rdar214 = true := by decide +kernel +theorem rdac215 : Row.check rdaW rdaR rdar215 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP27.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP27.lean new file mode 100644 index 0000000000..4ba8aab8ef --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP27.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac216 : Row.check rdaW rdaR rdar216 = true := by decide +kernel +theorem rdac217 : Row.check rdaW rdaR rdar217 = true := by decide +kernel +theorem rdac218 : Row.check rdaW rdaR rdar218 = true := by decide +kernel +theorem rdac219 : Row.check rdaW rdaR rdar219 = true := by decide +kernel +theorem rdac220 : Row.check rdaW rdaR rdar220 = true := by decide +kernel +theorem rdac221 : Row.check rdaW rdaR rdar221 = true := by decide +kernel +theorem rdac222 : Row.check rdaW rdaR rdar222 = true := by decide +kernel +theorem rdac223 : Row.check rdaW rdaR rdar223 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP28.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP28.lean new file mode 100644 index 0000000000..6105da2b67 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP28.lean @@ -0,0 +1,9 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac224 : Row.check rdaW rdaR rdar224 = true := by decide +kernel +theorem rdac225 : Row.check rdaW rdaR rdar225 = true := by decide +kernel +theorem rdac226 : Row.check rdaW rdaR rdar226 = true := by decide +kernel +theorem rdac227 : Row.check rdaW rdaR rdar227 = true := by decide +kernel +theorem rdac228 : Row.check rdaW rdaR rdar228 = true := by decide +kernel +theorem rdac229 : Row.check rdaW rdaR rdar229 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP3.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP3.lean new file mode 100644 index 0000000000..62691a27cd --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP3.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac24 : Row.check rdaW rdaR rdar24 = true := by decide +kernel +theorem rdac25 : Row.check rdaW rdaR rdar25 = true := by decide +kernel +theorem rdac26 : Row.check rdaW rdaR rdar26 = true := by decide +kernel +theorem rdac27 : Row.check rdaW rdaR rdar27 = true := by decide +kernel +theorem rdac28 : Row.check rdaW rdaR rdar28 = true := by decide +kernel +theorem rdac29 : Row.check rdaW rdaR rdar29 = true := by decide +kernel +theorem rdac30 : Row.check rdaW rdaR rdar30 = true := by decide +kernel +theorem rdac31 : Row.check rdaW rdaR rdar31 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP4.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP4.lean new file mode 100644 index 0000000000..9f2f4505b1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP4.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac32 : Row.check rdaW rdaR rdar32 = true := by decide +kernel +theorem rdac33 : Row.check rdaW rdaR rdar33 = true := by decide +kernel +theorem rdac34 : Row.check rdaW rdaR rdar34 = true := by decide +kernel +theorem rdac35 : Row.check rdaW rdaR rdar35 = true := by decide +kernel +theorem rdac36 : Row.check rdaW rdaR rdar36 = true := by decide +kernel +theorem rdac37 : Row.check rdaW rdaR rdar37 = true := by decide +kernel +theorem rdac38 : Row.check rdaW rdaR rdar38 = true := by decide +kernel +theorem rdac39 : Row.check rdaW rdaR rdar39 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP5.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP5.lean new file mode 100644 index 0000000000..6362c2d97e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP5.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac40 : Row.check rdaW rdaR rdar40 = true := by decide +kernel +theorem rdac41 : Row.check rdaW rdaR rdar41 = true := by decide +kernel +theorem rdac42 : Row.check rdaW rdaR rdar42 = true := by decide +kernel +theorem rdac43 : Row.check rdaW rdaR rdar43 = true := by decide +kernel +theorem rdac44 : Row.check rdaW rdaR rdar44 = true := by decide +kernel +theorem rdac45 : Row.check rdaW rdaR rdar45 = true := by decide +kernel +theorem rdac46 : Row.check rdaW rdaR rdar46 = true := by decide +kernel +theorem rdac47 : Row.check rdaW rdaR rdar47 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP6.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP6.lean new file mode 100644 index 0000000000..ffeb9acd69 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP6.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac48 : Row.check rdaW rdaR rdar48 = true := by decide +kernel +theorem rdac49 : Row.check rdaW rdaR rdar49 = true := by decide +kernel +theorem rdac50 : Row.check rdaW rdaR rdar50 = true := by decide +kernel +theorem rdac51 : Row.check rdaW rdaR rdar51 = true := by decide +kernel +theorem rdac52 : Row.check rdaW rdaR rdar52 = true := by decide +kernel +theorem rdac53 : Row.check rdaW rdaR rdar53 = true := by decide +kernel +theorem rdac54 : Row.check rdaW rdaR rdar54 = true := by decide +kernel +theorem rdac55 : Row.check rdaW rdaR rdar55 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP7.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP7.lean new file mode 100644 index 0000000000..fa12d3bddf --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP7.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac56 : Row.check rdaW rdaR rdar56 = true := by decide +kernel +theorem rdac57 : Row.check rdaW rdaR rdar57 = true := by decide +kernel +theorem rdac58 : Row.check rdaW rdaR rdar58 = true := by decide +kernel +theorem rdac59 : Row.check rdaW rdaR rdar59 = true := by decide +kernel +theorem rdac60 : Row.check rdaW rdaR rdar60 = true := by decide +kernel +theorem rdac61 : Row.check rdaW rdaR rdar61 = true := by decide +kernel +theorem rdac62 : Row.check rdaW rdaR rdar62 = true := by decide +kernel +theorem rdac63 : Row.check rdaW rdaR rdar63 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP8.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP8.lean new file mode 100644 index 0000000000..5205c8a4a4 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP8.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac64 : Row.check rdaW rdaR rdar64 = true := by decide +kernel +theorem rdac65 : Row.check rdaW rdaR rdar65 = true := by decide +kernel +theorem rdac66 : Row.check rdaW rdaR rdar66 = true := by decide +kernel +theorem rdac67 : Row.check rdaW rdaR rdar67 = true := by decide +kernel +theorem rdac68 : Row.check rdaW rdaR rdar68 = true := by decide +kernel +theorem rdac69 : Row.check rdaW rdaR rdar69 = true := by decide +kernel +theorem rdac70 : Row.check rdaW rdaR rdar70 = true := by decide +kernel +theorem rdac71 : Row.check rdaW rdaR rdar71 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdaP9.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP9.lean new file mode 100644 index 0000000000..cb9d555ef5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdaP9.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdaDefs +namespace CTree +theorem rdac72 : Row.check rdaW rdaR rdar72 = true := by decide +kernel +theorem rdac73 : Row.check rdaW rdaR rdar73 = true := by decide +kernel +theorem rdac74 : Row.check rdaW rdaR rdar74 = true := by decide +kernel +theorem rdac75 : Row.check rdaW rdaR rdar75 = true := by decide +kernel +theorem rdac76 : Row.check rdaW rdaR rdar76 = true := by decide +kernel +theorem rdac77 : Row.check rdaW rdaR rdar77 = true := by decide +kernel +theorem rdac78 : Row.check rdaW rdaR rdar78 = true := by decide +kernel +theorem rdac79 : Row.check rdaW rdaR rdar79 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiDefs.lean new file mode 100644 index 0000000000..085684afba --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiDefs.lean @@ -0,0 +1,235 @@ +import Nov15.CTreeCore +namespace CTree +def rdiW : List (List Nat) := [[0,0,0,0,0,0,0,0,0],[0,0,1591504595045,2183392024855,2565792891519,2849159501375,3074380358977,3261274106403,3420981559912],[0,0,0,2183392024855,3157680321329,3823447797849,4332035265307,4744149870335,3261274106403],[0,0,0,0,2565792891519,3823447797849,4714436131971,4332035265307,3074380358977],[0,0,0,0,0,2849159501375,3823447797849,3823447797849,2849159501375],[0,0,0,0,0,0,2565792891519,3157680321329,2565792891519],[0,0,0,0,0,0,0,2183392024855,2183392024855],[0,0,0,0,0,0,0,0,1591504595045],[0,0,0,0,0,0,0,0,0]] +def rdir0 : Row := ⟨0,1,1,48,1725436573842136544890435102625209188850057808257732186958073375490046,[0,2921937829190,3188406102162,3498124678543,3736611492971,4120963355466,4429731823797,4926250944361,5419634278645,6158963326400,6467731794731,6947492100292,7893501868265,8254169296575,8614836724885,9108220059169,10456867690625,10939596904255,11386598896415,11879982230699,12529445497639,12916271134206,13303096770773,14040710189576,14583615758799,15562328825177,16055712159461,16869006021460,17229673449770,17723056784054,18216440118338,19384002928937,19770828565504,20250588871065,20988202289868,21531107859091,21917933495658,22411316829942,23148930248745,23691835817968,24670548884346,25163932218630,25832542268412,26219367904979,26606193541546,27324660177507,27886712529572,28624325948375,29167231517598],[1000000000000000000000000000000,2921937829190,3188406102162,3498124678543,3736611492971,4120963355466,4429731823797,4926250944361,5419634278645,6158963326400,6467731794731,6947492100292,7893501868265,8254169296575,8614836724885,9108220059169,10456867690625,10939596904255,11386598896415,11879982230699,12529445497639,12916271134206,13303096770773,14040710189576,14583615758799,17640319879454,18099843188195,18460510616505,18821178044815,19314561379099,19807944713383,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir1 : Row := ⟨1,2,1,20,1725015324675462002517084071354633591292683456439700743677216293214208,[0,3208185477847,3729545386204,4099641941235,4338128755663,4831883357030,5147693475040,5693708931542,6256809732922,6986620087838,7302430205848,8672252456731,8967259222397,10841402406582,11387417863084,11950518664464,12450123680888,12996139137390,13559239938770,14289050293686,14604860411696],[1000000000000000000000000000000,3208185477847,3729545386204,4099641941235,4338128755663,4831883357030,5147693475040,5693708931542,6256809732922,6986620087838,7302430205848,8672252456731,8967259222397,12080736603288,12319223417716,12784173767717,13022660582145,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir2 : Row := ⟨2,2,1,22,1725436573842136256050943512598856188173734310570540763622829158037504,[0,3208185477847,3729545386204,4099641941235,4338128755663,4831883357030,5147693475040,5693708931542,6256809732922,6750850756210,7302430205848,7796184807215,8856306740201,9165075208532,9470101022057,11898544231250,12444559687752,12943878282255,13489893738757,14052994540137,14547035563425,15098615013063,15592369614430],[1000000000000000000000000000000,3208185477847,3729545386204,4099641941235,4338128755663,4831883357030,5147693475040,5693708931542,6256809732922,6750850756210,7302430205848,7796184807215,8856306740201,9165075208532,9470101022057,12784173767717,13022660582145,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir3 : Row := ⟨3,2,1,24,1725436573842136544890435102625208983754331896122596109027616915716096,[0,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6750850756210,7059619224541,7553851105678,7893501868265,9165075208532,9470101022057,9963484356341,11784995418308,12458733599411,12931948814825,13292616243135,13785999577419,14613470330219,14953121092806,15447352973943,15787003736530],[1000000000000000000000000000000,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6750850756210,7059619224541,7553851105678,7893501868265,9165075208532,9470101022057,9963484356341,13022660582145,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir4 : Row := ⟨4,2,1,26,1725436573842136544890435102625209149907831359575118398056611880890368,[0,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6631826756909,7059619224541,7553851105678,7893501868265,8254169296575,9470101022057,9963484356341,10456867690625,12458733599411,12931948814825,13292616243135,13653283671445,14146667005729,14885996053484,15313788521116,15787003736530,16147671164840,16508338593150],[1000000000000000000000000000000,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6631826756909,7059619224541,7553851105678,7893501868265,8254169296575,9470101022057,9963484356341,10456867690625,14126301653668,14435070121999,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir5 : Row := ⟨5,2,1,28,1725436573842136449109463798507155500239512287015111266501574392791040,[0,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6631826756909,6940595225240,7553851105678,7893501868265,8254169296575,8614836724885,9963484356341,10456867690625,12339709600110,12833092934394,13292616243135,13653283671445,14013951099755,14507334434039,15194764521815,15555431950125,16147671164840,16508338593150,16869006021460,17229673449770],[1000000000000000000000000000000,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6631826756909,6940595225240,7553851105678,7893501868265,8254169296575,8614836724885,9963484356341,10456867690625,14126301653668,14435070121999,14810087145986,15118855614317,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir6 : Row := ⟨6,2,1,30,1725015324675462028800729473553375950327607832226055896745478848970752,[0,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6631826756909,6940595225240,7553851105678,7893501868265,8254169296575,8614836724885,9108220059169,10456867690625,12339709600110,12833092934394,13292616243135,13653283671445,14013951099755,14507334434039,15000717768323,15555431950125,16048815284409,16508338593150,16869006021460,17229673449770,17723056784054,18216440118338],[1000000000000000000000000000000,3208185477847,3729545386204,4099641941235,4338128755663,4729678478229,5038446946560,5399114374870,5892497709154,6631826756909,6940595225240,7553851105678,7893501868265,8254169296575,8614836724885,9108220059169,10456867690625,14126301653668,14435070121999,14810087145986,15118855614317,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir7 : Row := ⟨7,2,2,18,1725429991823894998508765754469743057491304461710640024346824886190080,[0,1630637053201,2201453371307,2557598308978,2828248766647,3409692462432,3614476835228,4353375532404,4654916675635,5274215474347,6210734193420,7024169297660,7228953670456,7967852367632,8269393510863,8871788343913,9309833351270,9929132149982,10548430948694],[1000000000000000000000000000000,1630637053201,2201453371307,2557598308978,2828248766647,3409692462432,3614476835228,4353375532404,4654916675635,5274215474347,6210734193420,7280375838551,7589144306882,8073379196104,8378405009629,8871788343913,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir8 : Row := ⟨8,2,2,20,1725436573842136449106449451380146306440222793220369896478428312371200,[0,1630637053201,2201453371307,2557598308978,2808510729028,3285732631816,3614476835228,4093602288148,4519082612670,5160201982966,5468970451297,6462155093250,6801805855837,7708079123376,8133559447898,8612684900818,9038165225340,9562572739445,9988053063967,10629172434263,10937940902594],[1000000000000000000000000000000,1630637053201,2201453371307,2557598308978,2808510729028,3285732631816,3614476835228,4093602288148,4519082612670,5160201982966,5468970451297,6462155093250,6801805855837,8073379196104,8378405009629,8871788343913,9365171678197,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir9 : Row := ⟨9,2,2,22,1725436573842135874423635973797346292484320015926037067947319207395328,[0,1630637053201,2201453371307,2557598308978,2808510729028,3183527753015,3492296221346,3939298213506,4432681547790,5160201982966,5468970451297,5855796087864,6801805855837,7162473284147,7523140712457,8371979761296,8865363095580,9348092309210,9795094301370,10288477635654,10937940902594,11324766539161,11711592175728],[1000000000000000000000000000000,1630637053201,2201453371307,2557598308978,2808510729028,3183527753015,3492296221346,3939298213506,4432681547790,5160201982966,5468970451297,5855796087864,6801805855837,7162473284147,7523140712457,8871788343913,9365171678197,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir10 : Row := ⟨10,2,2,24,1725436573842136257547521189216008126471978509806327231887960319197184,[0,1630637053201,2201453371307,2557598308978,2808510729028,3183527753015,3492296221346,3939298213506,4432681547790,5160201982966,5468970451297,5855796087864,6801805855837,7162473284147,7523140712457,8016524046741,8865363095580,9348092309210,9795094301370,10288477635654,10937940902594,11324766539161,11711592175728,12449205594531,12992111163754],[1000000000000000000000000000000,1630637053201,2201453371307,2557598308978,2808510729028,3183527753015,3492296221346,3939298213506,4432681547790,5160201982966,5468970451297,5855796087864,6801805855837,7162473284147,7523140712457,8016524046741,9365171678197,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir11 : Row := ⟨11,3,1,8,1724691879332226163255842105515269237569795001124286938345380071342080,[0,3074380358977,3463107834008,3775020980414,3992713585082,4889521458202,5389318521048,7767734565496,7985427170164],[1000000000000000000000000000000,3074380358977,3463107834008,3775020980414,3992713585082,4889521458202,5389318521048,10083171031119,10321657845547]⟩ +def rdir12 : Row := ⟨12,3,1,10,1725015324675461991289735722275867791881061165080929906339321888112640,[0,3074380358977,3463107834008,3775020980414,3992713585082,4549886620953,4980835703166,6045804881523,6399147566925,8542600206035,8973549288248],[1000000000000000000000000000000,3074380358977,3463107834008,3775020980414,3992713585082,4549886620953,4980835703166,6045804881523,6399147566925,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir13 : Row := ⟨13,3,1,11,1725015324675461991289737127222815216233559422391912940518374073434112,[0,3074380358977,3463107834008,3775020980414,3992713585082,4549886620953,4980835703166,6045804881523,6399147566925,8542600206035,8973549288248,9530722324119],[1000000000000000000000000000000,3074380358977,3463107834008,3775020980414,3992713585082,4549886620953,4980835703166,6045804881523,6399147566925,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir14 : Row := ⟨14,3,1,12,1725015324675462280222856187148823347661927116336088114357438305533952,[0,3074380358977,3463107834008,3754226770654,3992713585082,4549886620953,4858655089284,5554475865994,6399147566925,7669711492417,7958560101075,9408541710237,9717310178568],[1000000000000000000000000000000,3074380358977,3463107834008,3754226770654,3992713585082,4549886620953,4858655089284,5554475865994,6399147566925,7669711492417,7958560101075,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir15 : Row := ⟨15,3,1,13,1725436573842136212647130871363085760565117322918546857094666522722304,[0,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,6399147566925,7669711492417,7958560101075,9408541710237,9717310178568,10413130955278],[1000000000000000000000000000000,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,6399147566925,7669711492417,7958560101075,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir16 : Row := ⟨16,3,1,14,1725436573842136508972570862884040742246718255018739783786170559758336,[0,3074380358977,3463107834008,3754226770654,3992713585082,4509633524686,4838377728098,5220845501033,5783946302413,6754637300146,7958560101075,9213559086115,9676755456196,10059223229131,10441691002066],[1000000000000000000000000000000,3074380358977,3463107834008,3754226770654,3992713585082,4509633524686,4838377728098,5220845501033,5783946302413,6754637300146,7958560101075,11218692949583,11425256539113,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir17 : Row := ⟨17,3,1,15,1725436573842136508972570862884040742246718259854406168756539839479808,[0,3074380358977,3463107834008,3754226770654,3992713585082,4509633524686,4838377728098,5220845501033,5783946302413,6754637300146,7012762385435,9213559086115,9676755456196,10059223229131,10441691002066,11004791803446],[1000000000000000000000000000000,3074380358977,3463107834008,3754226770654,3992713585082,4509633524686,4838377728098,5220845501033,5783946302413,6754637300146,7012762385435,11218692949583,11425256539113,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir18 : Row := ⟨18,3,1,16,1725436573842136410198441351708280540826957078208233419559579429109760,[0,3074380358977,3463107834008,3754226770654,3992713585082,4509633524686,4716197114216,5181147464217,5419634278645,6754637300146,7012762385435,8267328569406,9412347863727,9897344578433,10135831392861,10600781742862,10839268557290],[1000000000000000000000000000000,3074380358977,3463107834008,3754226770654,3992713585082,4509633524686,4716197114216,5181147464217,5419634278645,6754637300146,7012762385435,8267328569406,11425256539113,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir19 : Row := ⟨19,3,1,17,1725436573842136212650188036964751983929217180609891469519930766917632,[0,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6158963326400,7012762385435,8267328569406,8576097037737,10333832923366,10642601391697,11017618415684,11567892604826,11942909628813],[1000000000000000000000000000000,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6158963326400,7012762385435,8267328569406,8576097037737,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir20 : Row := ⟨20,3,1,18,1725436573842087172792880283908902425565645283999362124232370465800192,[0,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6158963326400,6467731794731,8267328569406,8576097037737,10333832923366,10642601391697,11017618415684,11326386884015,11942909628813,12251678097144],[1000000000000000000000000000000,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6158963326400,6467731794731,8267328569406,8576097037737,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir21 : Row := ⟨21,3,1,19,1725015324675406047815971936975081915591629661211475837569764750786560,[0,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6158963326400,6467731794731,8267328569406,8576097037737,10333832923366,10642601391697,11017618415684,11326386884015,11942909628813,12251678097144,12626695121131],[1000000000000000000000000000000,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6158963326400,6467731794731,8267328569406,8576097037737,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir22 : Row := ⟨22,3,1,20,1291753974625909894242973195510263877508117383371071955542159524888576,[0,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6238261358312,6467731794731,8369533448207,8576097037737,10333832923366,10642601391697,11017618415684,11326386884015,12022207660725,12251678097144,12705993153043,12935463589462],[1000000000000000000000000000000,3074380358977,3654280223901,3945399160547,4174869596966,4549886620953,4858655089284,5554475865994,5783946302413,6238261358312,6467731794731,8369533448207,8576097037737,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir23 : Row := ⟨23,3,2,6,1724797191619175783735400944853108397594210146492606303761713470636032,[0,1537190179488,2052763128320,2656192329929,2900989529215,3369195053994,4879449700856],[1000000000000000000000000000000,1537190179488,2052763128320,2656192329929,2900989529215,3369195053994,4879449700856]⟩ +def rdir24 : Row := ⟨24,3,2,7,1724797191622314717726979501882151003100027857202348574221783047077888,[0,1537190179488,2052763128320,2364676274726,2709817139322,3266990175193,3697939257406,5074493414048],[1000000000000000000000000000000,1537190179488,2052763128320,2364676274726,2709817139322,3266990175193,3697939257406,5797269571916]⟩ +def rdir25 : Row := ⟨25,3,2,8,1725015323871992974351448694926653041798694169110054950243558309756928,[0,1537190179488,2052763128320,2343882064966,2582368879394,3266990175193,3575758643524,4271579420234,5164737758788],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3266990175193,3575758643524,4271579420234,5881375132062]⟩ +def rdir26 : Row := ⟨26,3,2,9,1725436573038667209084596767771996548138967675657632542441433269796864,[0,1537190179488,2052763128320,2364676274726,2709817139322,3266990175193,3575758643524,4271579420234,5116251121165,5940434918250],[1000000000000000000000000000000,1537190179488,2052763128320,2364676274726,2709817139322,3266990175193,3575758643524,4271579420234,5116251121165,1000000000000000000000000000000]⟩ +def rdir27 : Row := ⟨27,3,2,10,1725436573842136543393766081445028143566739526816309557546538017751040,[0,1537190179488,2052763128320,2343882064966,2582368879394,3113748747527,3575758643524,4271579420234,4501049856653,5696117626921,6158127522918],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3113748747527,3575758643524,4271579420234,4501049856653,6489019925458,1000000000000000000000000000000]⟩ +def rdir28 : Row := ⟨28,3,2,11,1725436573842136543393857425300104519275586814216737465834959754231808,[0,1537190179488,2052763128320,2343882064966,2582368879394,3113748747527,3492296221346,4271579420234,4501049856653,5696117626921,6074665100740,6606044968873],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3113748747527,3492296221346,4271579420234,4501049856653,6386815046657,6675663655315,1000000000000000000000000000000]⟩ +def rdir29 : Row := ⟨29,3,2,12,1725436573842136449109463798507155209388800400214593303980251402993664,[0,1537190179488,2052763128320,2343882064966,2582368879394,3096926833105,3391933598771,4271579420234,4501049856653,5471740854386,5974302478165,6488860431876,6783867197542],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3096926833105,3391933598771,4271579420234,4501049856653,5471740854386,6675663655315,6984432123646,1000000000000000000000000000000]⟩ +def rdir30 : Row := ⟨30,3,2,13,1725436573842136257547521190271047582288742434229410757899061808857088,[0,1537190179488,2052763128320,2343882064966,2582368879394,3096926833105,3391933598771,3937949055273,4501049856653,4876066880640,5729865939675,6488860431876,6783867197542,7329882654044],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3096926833105,3391933598771,3937949055273,4501049856653,4876066880640,5729865939675,6984432123646,7293200591977,1000000000000000000000000000000]⟩ +def rdir31 : Row := ⟨31,3,2,14,1725436573842136257547521190265600738349505617879854593347310655111168,[0,1537190179488,2052763128320,2343882064966,2582368879394,3029560216745,3338328685076,3643354498601,4136737832885,4876066880640,5184835348971,6225723377995,6672914715346,6981683183677,7286708997202],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3029560216745,3338328685076,3643354498601,4136737832885,4876066880640,5184835348971,6984432123646,7293200591977,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir32 : Row := ⟨32,3,2,15,1725436573842136257547521190265557870744086368655058101620043316985856,[0,1537190179488,2052763128320,2343882064966,2582368879394,3029560216745,3338328685076,3643354498601,4136737832885,4876066880640,5184835348971,6225723377995,6672914715346,6981683183677,7286708997202,7780092331486],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3029560216745,3338328685076,3643354498601,4136737832885,4876066880640,5184835348971,6984432123646,7293200591977,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir33 : Row := ⟨33,3,2,16,1725015324675399180520058799817792954304926641149443805838890019848192,[0,1537190179488,2052763128320,2343882064966,2582368879394,3096926833105,3391933598771,3898251018457,4136737832885,4955364912552,5184835348971,6480619897851,6719106712279,7233664665990,7528671431656,8034988851342,8273475665770],[1000000000000000000000000000000,1537190179488,2052763128320,2343882064966,2582368879394,3096926833105,3391933598771,3898251018457,4136737832885,4955364912552,5184835348971,7086637002447,7293200591977,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir34 : Row := ⟨34,3,3,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir35 : Row := ⟨35,3,3,6,1724981481704708208044660068023339766542834024824556934860489376137216,[0,1024793452992,1576637138022,2064492386068,2282184990736,3178992863856,3678789926702],[1000000000000000000000000000000,1024793452992,1576637138022,2064492386068,2282184990736,3178992863856,3678789926702]⟩ +def rdir36 : Row := ⟨36,3,3,7,1724138983421241331034605756681957787456231791428861707420782005583872,[0,1024793452992,1560621584941,1916249916380,2154736730808,3178992863856,3507737067268,4070986647188],[1000000000000000000000000000000,1024793452992,1560621584941,1916249916380,2154736730808,3178992863856,3507737067268,4216546115513]⟩ +def rdir37 : Row := ⟨37,3,3,8,1725008742657215501060263516936682169514748965718045571558240033964032,[0,1024793452992,1546153361349,1916249916380,2154736730808,2784764503909,2977235535587,3843947271648,4309473461616],[1000000000000000000000000000000,1024793452992,1546153361349,1916249916380,2154736730808,2784764503909,2977235535587,3843947271648,4309473461617]⟩ +def rdir38 : Row := ⟨38,3,3,9,1725436573841695280455999333928870854608338608384770828651301510840320,[0,1024793452992,1576637138022,1916249916380,2154736730808,2686116598941,2977235535587,3843947271648,4073417708067,4840853329749],[1000000000000000000000000000000,1024793452992,1576637138022,1916249916380,2154736730808,2686116598941,2977235535587,3843947271648,4073417708067,1000000000000000000000000000000]⟩ +def rdir39 : Row := ⟨39,3,3,10,1725436573842136257544506842001895497334175015961362696906908438102016,[0,1024793452992,1546153361349,1916249916380,2154736730808,2648491332175,2964301450185,3510316906687,4073417708067,4803228062983,5119038180993],[1000000000000000000000000000000,1024793452992,1546153361349,1916249916380,2154736730808,2648491332175,2964301450185,3510316906687,4073417708067,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir40 : Row := ⟨40,3,3,11,1725436573842136257544506842001895497007111257582165228278559818121216,[0,1024793452992,1546153361349,1916249916380,2154736730808,2648491332175,2964301450185,3510316906687,4073417708067,4803228062983,5119038180993,5612792782360],[1000000000000000000000000000000,1024793452992,1546153361349,1916249916380,2154736730808,2648491332175,2964301450185,3510316906687,4073417708067,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir41 : Row := ⟨41,3,3,12,1725436573842122081963765325226559189160748860002050336828123661729792,[0,1024793452992,1546153361349,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,4701023184182,5009791652513,5370459080823,5710109843410],[1000000000000000000000000000000,1024793452992,1546153361349,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,5044108705800,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir42 : Row := ⟨42,3,3,13,1725436573842063080885441988494453214577201261746743827380562359746560,[0,1024793452992,1576637138022,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,4448434732054,5009791652513,5370459080823,5710109843410,6070777271720],[1000000000000000000000000000000,1024793452992,1576637138022,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,4448434732054,5302233791089,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir43 : Row := ⟨43,3,3,14,1725436573842063080885441943892962817510849559210789463157620997095424,[0,1024793452992,1576637138022,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,4448434732054,4757203200385,5370459080823,5710109843410,6070777271720,6431444700030],[1000000000000000000000000000000,1024793452992,1576637138022,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,4448434732054,4757203200385,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir44 : Row := ⟨44,3,3,15,1724172826241386087509120555855898733662906190388245142363929468469248,[0,1024793452992,1576637138022,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,4448434732054,4757203200385,5370459080823,5710109843410,6070777271720,6431444700030,6924828034314],[1000000000000000000000000000000,1024793452992,1576637138022,1916249916380,2154736730808,2546286453374,2855054921705,3215722350015,3709105684299,4448434732054,4757203200385,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir45 : Row := ⟨45,3,4,3,1215740115285145407006307736394970646240717885393841048537395210747904,[0,768595089744,1259842660218,2028437749962],[1000000000000000000000000000000,768595089744,1259842660218,2093834226069]⟩ +def rdir46 : Row := ⟨46,3,4,4,1711261187066247890813363025679948986197761369184792094843736221024256,[0,768595089744,1215634199246,1700330380467,2299239343151],[1000000000000000000000000000000,768595089744,1215634199246,1700330380467,2299239343151]⟩ +def rdir47 : Row := ⟨47,3,4,5,1711949085610381755412222851521837156972125571415050677602692446027776,[0,768595089744,1215634199246,1700330380467,1929058026576,2697653116320],[1000000000000000000000000000000,768595089744,1215634199246,1700330380467,1929058026576,2727746831114]⟩ +def rdir48 : Row := ⟨48,3,4,6,1725429065421934135775443279377013739081480447434081339858259225346048,[0,768595089744,1215634199246,1675133086720,1880538203802,2625541952313,3056491034526],[1000000000000000000000000000000,768595089744,1215634199246,1675133086720,1880538203802,2625541952313,3056491034526]⟩ +def rdir49 : Row := ⟨49,3,4,7,1725429991822320455121495916335180487343303910962716634609037191675904,[0,768595089744,1215634199246,1620206371193,1840840166986,2466143854088,2829667745200,3397513582942],[1000000000000000000000000000000,768595089744,1215634199246,1620206371193,1840840166986,2466143854088,2829667745200,3397513582942]⟩ +def rdir50 : Row := ⟨50,3,4,8,1725436573840551274031366283120767677749658095272466878308865361838080,[0,768595089744,1215634199246,1602353352558,1840840166986,2329870682354,2658614885766,3296500832393,3563220663208],[1000000000000000000000000000000,768595089744,1215634199246,1602353352558,1840840166986,2329870682354,2658614885766,3296500832393,3563220663208]⟩ +def rdir51 : Row := ⟨51,3,4,9,1725436573038666469167241256029755228080640410543054049851597920403456,[0,768595089744,1215634199246,1602353352558,1852648779566,2329870682354,2658614885766,3296500832393,3705297559132,4182519461920],[1000000000000000000000000000000,768595089744,1215634199246,1602353352558,1852648779566,2329870682354,2658614885766,3296500832393,3859601633773,1000000000000000000000000000000]⟩ +def rdir52 : Row := ⟨52,3,4,10,1725436573842078405840852706019897410967521518242578966598401317142528,[0,768595089744,1215634199246,1602353352558,1840840166986,2227665803553,2536434271884,3001906275721,3495289610005,4068505970539,4377274438870],[1000000000000000000000000000000,768595089744,1215634199246,1602353352558,1840840166986,2227665803553,2536434271884,3001906275721,3495289610005,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir53 : Row := ⟨53,3,4,11,1725436573838041812586162001054180667492084376406608905998688462045184,[0,768595089744,1215634199246,1602353352558,1840840166986,2227665803553,2536434271884,3001906275721,3495289610005,4068505970539,4377274438870,4764100075437],[1000000000000000000000000000000,768595089744,1215634199246,1602353352558,1840840166986,2227665803553,2536434271884,3001906275721,3495289610005,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir54 : Row := ⟨54,3,4,12,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir55 : Row := ⟨55,4,1,4,1239316981823147026693528421085722635592843543290395622062911442124800,[0,2849159501375,3432882073056,3830849927960,4112767073262],[1000000000000000000000000000000,2849159501375,3432882073056,3830849927960,4112767073262]⟩ +def rdir56 : Row := ⟨56,4,1,6,1293306507428935247685885916830646565345887176951247491355334076792832,[0,2849159501375,3432882073056,3639445662586,3877932477014,5221919229715,5496751792285],[1000000000000000000000000000000,2849159501375,3432882073056,3639445662586,3877932477014,5221919229715,5496751792285]⟩ +def rdir57 : Row := ⟨57,4,1,7,1724599724699482344649655364594831117126166680771311008975668048297984,[0,2849159501375,3432882073056,3639445662586,3877932477014,5221919229715,5496751792285,7517378139600],[1000000000000000000000000000000,2849159501375,3432882073056,3639445662586,3877932477014,5221919229715,5496751792285,1000000000000000000000000000000]⟩ +def rdir58 : Row := ⟨58,4,1,8,1724771790000978729764805480468511514507227008689791213199677395566592,[0,2849159501375,3432882073056,3639445662586,3877932477014,4537707791975,4722965297113,7517378139600,7755864954028],[1000000000000000000000000000000,2849159501375,3432882073056,3639445662586,3877932477014,4537707791975,4722965297113,9349017888661,9481643271581]⟩ +def rdir59 : Row := ⟨59,4,1,9,1724988996602545128962364136802128780867495548430487288691761470242816,[0,2849159501375,3432882073056,3639445662586,3877932477014,4537707791975,4722965297113,7517378139600,7755864954028,8362410959699],[1000000000000000000000000000000,2849159501375,3432882073056,3639445662586,3877932477014,4537707791975,4722965297113,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir60 : Row := ⟨60,4,1,10,1724988996602495993324130793361514504127325670349064725969671993425920,[0,2849159501375,3432882073056,3639445662586,3877932477014,4223168234267,4722965297113,5751524980789,5884150363709,8101100711281,8446336468534],[1000000000000000000000000000000,2849159501375,3432882073056,3639445662586,3877932477014,4223168234267,4722965297113,5751524980789,5884150363709,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir61 : Row := ⟨61,4,1,11,1724607212227243633327641078765802060389195591744496360417669716901888,[0,2849159501375,3432882073056,3639445662586,3877932477014,4223168234267,4551912437679,5751524980789,5884150363709,8101100711281,8429844914693,8775080671946],[1000000000000000000000000000000,2849159501375,3432882073056,3639445662586,3877932477014,4223168234267,4551912437679,5751524980789,5884150363709,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir62 : Row := ⟨62,4,1,12,1724605360927892125009436352783555288042517265488812713331387059404800,[0,2849159501375,3432882073056,3639445662586,3877932477014,4223168234267,4429731823797,5751524980789,5884150363709,8069177486383,8307664300811,8652900058064,8859463647594],[1000000000000000000000000000000,2849159501375,3432882073056,3639445662586,3877932477014,4223168234267,4429731823797,5751524980789,5884150363709,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir63 : Row := ⟨63,4,2,2,1657209653241867727754277428799190269559553157320145843044180880785408,[0,1424579750687,2070874358428],[1000000000000000000000000000000,1424579750687,2070874358428]⟩ +def rdir64 : Row := ⟨64,4,2,3,1670689703910324887239747707941152989547198337172229464391125076803584,[0,1424579750687,1951915173773,2296750428599],[1000000000000000000000000000000,1424579750687,1951915173773,2296750428599]⟩ +def rdir65 : Row := ⟨65,4,2,4,1724691879329089144474434918536799264960592040516900777262263646027776,[0,1424579750687,1951915173773,2169048181692,2514443033267],[1000000000000000000000000000000,1424579750687,1951915173773,2169048181692,2514443033267]⟩ +def rdir66 : Row := ⟨66,4,2,5,1724798117217071194839542966803644998336291209630814422947367143604224,[0,1424579750687,1951915173773,2169048181692,2514443033267,3369707330439],[1000000000000000000000000000000,1424579750687,1951915173773,2169048181692,2514443033267,3369707330439]⟩ +def rdir67 : Row := ⟨67,4,2,6,1724798118073895869251296075549290374355175151902179595608009612460032,[0,1424579750687,1951915173773,2169048181692,2407534996120,2934861655313,3596553255097],[1000000000000000000000000000000,1424579750687,1951915173773,2169048181692,2407534996120,2934861655313,3596553255097]⟩ +def rdir68 : Row := ⟨68,4,2,7,1725015324675462268846388999136149038420825622169005486649463959191552,[0,1424579750687,1872973165739,2169048181692,2407534996120,2934861655313,3298385546425,4576583177812],[1000000000000000000000000000000,1424579750687,1872973165739,2169048181692,2407534996120,2934861655313,3298385546425,5310125423679]⟩ +def rdir69 : Row := ⟨69,4,2,8,1725436573842136401625135686044189019204858291154506333438337095827456,[0,1424579750687,1872973165739,2169048181692,2407534996120,2934861655313,3127332686991,3866231384167,4815069992240],[1000000000000000000000000000000,1424579750687,1872973165739,2169048181692,2407534996120,2934861655313,3127332686991,3866231384167,5394230983825]⟩ +def rdir70 : Row := ⟨70,4,2,9,1725436573842136209665710213776658375779200421344055905004233156460544,[0,1424579750687,1951915173773,2169048181692,2407534996120,2798588483579,3127332686991,3866231384167,4459570613021,5206123479699],[1000000000000000000000000000000,1424579750687,1951915173773,2169048181692,2407534996120,2798588483579,3127332686991,3866231384167,4459570613021,1000000000000000000000000000000]⟩ +def rdir71 : Row := ⟨71,4,2,10,1725436573842136209668450527234008085266194310161291877811834528464896,[0,1424579750687,1951915173773,2169048181692,2407534996120,2696383604778,3127332686991,3866231384167,4031938464433,5103918600898,5392767209556],[1000000000000000000000000000000,1424579750687,1951915173773,2169048181692,2407534996120,2696383604778,3127332686991,3866231384167,4031938464433,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir72 : Row := ⟨72,4,2,11,1724646705943459306822234965357863655674844939633377566875201763803136,[0,1424579750687,1951915173773,2169048181692,2407534996120,2696383604778,3005152073109,3866231384167,4031938464433,5103918600898,5392767209556,5701535677887],[1000000000000000000000000000000,1424579750687,1951915173773,2169048181692,2407534996120,2696383604778,3005152073109,3866231384167,4031938464433,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir73 : Row := ⟨73,4,2,12,1722946692333229248764981672107714498145507701326248865345787811332096,[0,1424579750687,1951915173773,2169048181692,2407534996120,2798588483579,3005152073109,3899313081513,4031938464433,5174200254801,5412687069229,5803740556688,6010304146218],[1000000000000000000000000000000,1424579750687,1951915173773,2169048181692,2407534996120,2798588483579,3005152073109,3899313081513,4031938464433,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir74 : Row := ⟨74,4,3,2,1653826573206650435937118788600311048813541693181571612125795117432832,[0,949719833791,1451316443175],[1000000000000000000000000000000,949719833791,1451316443175]⟩ +def rdir75 : Row := ⟨75,4,3,3,1656357359215864854421665288239140158184582560514623040981482828988416,[0,949719833791,1433633058787,1740005995002],[1000000000000000000000000000000,949719833791,1433633058787,1740005995002]⟩ +def rdir76 : Row := ⟨76,4,3,4,1724770857123213143770702344688275565012014400973079842846731279532032,[0,949719833791,1407107982203,1740005995002,1978492809430],[1000000000000000000000000000000,949719833791,1407107982203,1740005995002,1978492809430]⟩ +def rdir77 : Row := ⟨77,4,3,5,1724988995745286375412850804557021486473316662175488330656117929541632,[0,949719833791,1407107982203,1698226918849,1978492809430,2928212643221],[1000000000000000000000000000000,949719833791,1407107982203,1698226918849,1978492809430,1000000000000000000000000000000]⟩ +def rdir78 : Row := ⟨78,4,3,6,1724988996602544851243310189014585396252394554884441345102226038718464,[0,949719833791,1381463917096,1679346462174,1936713733277,2323728566683,2823525629529],[1000000000000000000000000000000,949719833791,1381463917096,1679346462174,1936713733277,2323728566683,2823525629529]⟩ +def rdir79 : Row := ⟨79,4,3,7,1724988996602544851338309222853525992781114460921175422697902822129664,[0,949719833791,1381463917096,1658552252414,1916677337703,2323728566683,2652472770095,3575229590117],[1000000000000000000000000000000,949719833791,1381463917096,1658552252414,1916677337703,2323728566683,2652472770095,3891783350021]⟩ +def rdir80 : Row := ⟨80,4,3,8,1724988996602531055686428321789310712077331459104628773102849422786560,[0,949719833791,1381463917096,1658552252414,1916677337703,2323728566683,2530292156213,3480011990004,3833354675406],[1000000000000000000000000000000,949719833791,1381463917096,1658552252414,1916677337703,2323728566683,2530292156213,3852085313205,3984710696125]⟩ +def rdir81 : Row := ⟨81,4,3,9,1724988996601588947668470689708921509844255690125611938086509212598272,[0,949719833791,1407107982203,1658552252414,1916677337703,2323728566683,2530292156213,3480011990004,3833354675406,4188844408627],[1000000000000000000000000000000,949719833791,1407107982203,1658552252414,1916677337703,2323728566683,2530292156213,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir82 : Row := ⟨82,4,3,10,1723303999934695873204516371103176940114976684751502084778490427604992,[0,949719833791,1407107982203,1658552252414,1916677337703,2323728566683,2530292156213,3480011990004,3833354675406,4188844408627,4446969493916],[1000000000000000000000000000000,949719833791,1407107982203,1658552252414,1916677337703,2323728566683,2530292156213,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir83 : Row := ⟨83,4,4,1,1652996772683465680177557579065700088316417642379738466562555881979904,[0,712289875343],[1000000000000000000000000000000,712289875343]⟩ +def rdir84 : Row := ⟨84,4,4,2,1670771979137993255628778445903802405933548475601221959393066723835904,[0,712289875343,1100544185374],[1000000000000000000000000000000,712289875343,1100544185374]⟩ +def rdir85 : Row := ⟨85,4,4,3,1725007816203674625135576811143372345919495893227407661780756580007936,[0,712289875343,1088487332382,1452386003190],[1000000000000000000000000000000,712289875343,1088487332382,1452386003190]⟩ +def rdir86 : Row := ⟨86,4,4,4,1725015323871980902955908308906566683699909250269833413292692613365760,[0,712289875343,1088487332382,1379606269028,1657791120272],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1657791120272]⟩ +def rdir87 : Row := ⟨87,4,4,5,1725436573842136226022838078417684694330497254121867829285424767959040,[0,712289875343,1088487332382,1379606269028,1618093083456,2086298608235],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1618093083456,2086298608235]⟩ +def rdir88 : Row := ⟨88,4,4,6,1725436573842136257547429845362478598467268773511614090693544641560576,[0,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2415042811647],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2415042811647]⟩ +def rdir89 : Row := ⟨89,4,4,7,1725436573842136257547521188158575312977063513223344076914064608985088,[0,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2292862197765,2988682974475],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2292862197765,3153941508823]⟩ +def rdir90 : Row := ⟨90,4,4,8,1725436573842066513835685033601645491242898389591000490536156667052032,[0,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2292862197765,2988682974475,3218153410894],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2292862197765,3187023206169,3319648589089]⟩ +def rdir91 : Row := ⟨91,4,4,9,1722909078734203536619517881827344946293541769869686838314199173562368,[0,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2292862197765,2988682974475,3218153410894,3593170434881],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1609076705447,1984093729434,2292862197765,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir92 : Row := ⟨92,4,4,10,1715747841078812868429306904584027269507503040386422520868983296491520,[0,712289875343,1088487332382,1379606269028,1609076705447,2086298608235,2292862197765,2988682974475,3218153410894,3672468466793,3901938903212],[1000000000000000000000000000000,712289875343,1088487332382,1379606269028,1609076705447,2086298608235,2292862197765,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir93 : Row := ⟨93,4,5,2,1220847838564979176479569252607127231657536889195429319619070096572416,[0,569831900275,941523403461],[1000000000000000000000000000000,569831900275,941523403461]⟩ +def rdir94 : Row := ⟨94,4,5,3,1724138983367772555627460989543758557592359108128053136223854682701824,[0,569831900275,897314942489,1294295310643],[1000000000000000000000000000000,569831900275,897314942489,1294295310643]⟩ +def rdir95 : Row := ⟨95,4,5,4,1724982414155665836171579288444025490833843043768833864449683389153280,[0,569831900275,897314942489,1209228088895,1426920693563],[1000000000000000000000000000000,569831900275,897314942489,1209228088895,1426920693563]⟩ +def rdir96 : Row := ⟨96,4,5,5,1724988995744347731577246642412515358398450033233404779897166013399040,[0,569831900275,897314942489,1188433879135,1536789404187,2085748821624],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1536789404187,1000000000000000000000000000000]⟩ +def rdir97 : Row := ⟨97,4,5,6,1724988995748785835471480329621223963651551170192056402995928432115712,[0,569831900275,897314942489,1188433879135,1515138553153,2084970453428,2376867758270],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1515138553153,2258380190875,2443637696013]⟩ +def rdir98 : Row := ⟨98,4,5,7,1724146470145819408131724123916146396753076339079351992630569756262400,[0,569831900275,897314942489,1188433879135,1466618730379,1943840633167,2272584836579,2655052609514],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1466618730379,1943840633167,2272584836579,1000000000000000000000000000000]⟩ +def rdir99 : Row := ⟨99,4,5,8,1720776477078025442084861927323261590543872593788115347628848702291968,[0,569831900275,897314942489,1188433879135,1426920693563,1943840633167,2150404222697,2615354572698,2853841387126],[1000000000000000000000000000000,569831900275,897314942489,1188433879135,1426920693563,1943840633167,2150404222697,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir100 : Row := ⟨100,4,6,1,1653154741020485848532871223618558363173908517733387401430128689938432,[0,474859916895],[1000000000000000000000000000000,474859916895]⟩ +def rdir101 : Row := ⟨101,4,6,2,1711527836013669720619157512792911780928988661216424104463838847434752,[0,474859916895,769866682561],[1000000000000000000000000000000,474859916895,769866682561]⟩ +def rdir102 : Row := ⟨102,4,6,3,1725429990964883811577620967393716633027783442393098501486389437136896,[0,474859916895,769866682561,1081779828967],[1000000000000000000000000000000,474859916895,769866682561,1081779828967]⟩ +def rdir103 : Row := ⟨103,4,6,4,1725436573841453146160354573951895631317498147231800176795916389318656,[0,474859916895,769866682561,1060985619207,1299472433635],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1299472433635]⟩ +def rdir104 : Row := ⟨104,4,6,5,1725436572887060899672066136790405951426881921540979176519780593041408,[0,474859916895,769866682561,1060985619207,1371646746999,1830852301768],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1371646746999,1985141821521]⟩ +def rdir105 : Row := ⟨105,4,6,6,1725436573031409719458399527908506746479372275175274555290329492226048,[0,474859916895,769866682561,1060985619207,1339170470451,1814030387346,2109037153012],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1339170470451,1848868649787,2177612853199]⟩ +def rdir106 : Row := ⟨106,4,6,7,1721224055912000688755552777459026530638507064502999122273681698455552,[0,474859916895,769866682561,1060985619207,1299472433635,1746663770986,2055432239317,2360458052842],[1000000000000000000000000000000,474859916895,769866682561,1060985619207,1299472433635,1746663770986,2055432239317,1000000000000000000000000000000]⟩ +def rdir107 : Row := ⟨107,4,6,8,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir108 : Row := ⟨108,4,7,2,1625563359492006241466637959256470788314009648950061637980398318256128,[0,407022785910,723040672156],[1000000000000000000000000000000,407022785910,723040672156]⟩ +def rdir109 : Row := ⟨109,4,7,3,1655054091967455770603934705049722619749297750199283555005517250166784,[0,407022785910,705357287768,1112380073678],[1000000000000000000000000000000,407022785910,705357287768,1197308947121]⟩ +def rdir110 : Row := ⟨110,4,7,4,1662636577168471400362669369746055916862950995153991160341436062236672,[0,407022785910,690889064176,1097911850086,1381778128352],[1000000000000000000000000000000,407022785910,690889064176,1197308947121,1435795761549]⟩ +def rdir111 : Row := ⟨111,4,8,1,1626826642386109796790553044274187217316101172287346979122090189258752,[0,356144937671],[1000000000000000000000000000000,356144937671]⟩ +def rdir112 : Row := ⟨112,4,8,2,1658025874805001768620179514986218103668981537441437880955886131740672,[0,356144937671,637081434235],[1000000000000000000000000000000,356144937671,637081434235]⟩ +def rdir113 : Row := ⟨113,4,8,3,1671509139147789810644578124764360693646098616120370104414898367758336,[0,356144937671,622613210643,978758148314],[1000000000000000000000000000000,356144937671,622613210643,1100613368676]⟩ +def rdir114 : Row := ⟨114,4,8,4,1635279858014437252081819232104619459510690731591968370908035150774272,[0,356144937671,622613210643,978758148314,1245226421286],[1000000000000000000000000000000,356144937671,622613210643,1100613368676,1289029746783]⟩ +def rdir115 : Row := ⟨115,5,1,4,902315715017087972413119526148179874144310719450291367972144582492160,[0,2565792891519,2967542464895,3598300160965,3757450620469],[1000000000000000000000000000000,2565792891519,2967542464895,3598300160965,3757450620469]⟩ +def rdir116 : Row := ⟨116,5,1,6,969715581689500758700750094886469658028768495690154266976567070556160,[0,2565792891519,2941017388311,3183616502183,3316241885103,5882034776622,6257259273414],[1000000000000000000000000000000,2565792891519,2941017388311,3183616502183,3316241885103,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir117 : Row := ⟨117,5,1,8,934330651686995133162622820233130030222982791276963094496493495648256,[0,2565792891519,2941017388311,3183616502183,3316241885103,5882034776622,6257259273414,6499858387286,6632483770206],[1000000000000000000000000000000,2565792891519,2941017388311,3183616502183,3316241885103,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir118 : Row := ⟨118,5,2,2,1006785508370385895857949945222228281726380116113775778249895766392832,[0,1282896445759,1633861031164],[1000000000000000000000000000000,1282896445759,1633861031164]⟩ +def rdir119 : Row := ⟨119,5,2,3,1010155501704572026026910986647877000973621469014524237936202639998976,[0,1282896445759,1633861031164,2169844246881],[1000000000000000000000000000000,1282896445759,1633861031164,2169844246881]⟩ +def rdir120 : Row := ⟨120,5,2,4,1293235152243845652065356550255815199528918606189692173253367660806144,[0,1282896445759,1597471164083,1852200233649,2300058259201],[1000000000000000000000000000000,1282896445759,1597471164083,1852200233649,2300058259201]⟩ +def rdir121 : Row := ⟨121,5,2,5,1724594350546265417250689534012119114019130550674781524190217497477120,[0,1282896445759,1583475061360,1852200233649,2033345439343,3316241885102],[1000000000000000000000000000000,1282896445759,1583475061360,1852200233649,2033345439343,1000000000000000000000000000000]⟩ +def rdir122 : Row := ⟨122,5,2,6,1724594554671286082156341414737775894460649578809894828153928626995200,[0,1282896445759,1571478401882,1852200233649,1984825616569,3267722062328,3556304018451],[1000000000000000000000000000000,1282896445759,1571478401882,1852200233649,1984825616569,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir123 : Row := ⟨123,5,2,7,1050595421713996047284981077966233835123425552997259155230591635423232,[0,1282896445759,1633861031164,1852200233649,2033345439343,3316241885102,3667206470507,3885545672992],[1000000000000000000000000000000,1282896445759,1633861031164,1852200233649,2033345439343,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir124 : Row := ⟨124,5,2,8,934330651737214628912912781649318472715941635646853270845669593055232,[0,1282896445759,1633861031164,1852200233649,1984825616569,3267722062328,3618686647733,3837025850218,3969651233138],[1000000000000000000000000000000,1282896445759,1633861031164,1852200233649,1984825616569,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir125 : Row := ⟨125,5,3,2,1006785508672428506998289712093791614001488853731560309319306286465024,[0,855264297173,1186379864170],[1000000000000000000000000000000,855264297173,1186379864170]⟩ +def rdir126 : Row := ⟨126,5,3,3,1009313003672479243213432775369203958591737362103316153576337392533504,[0,855264297173,1186379864170,1638241049491],[1000000000000000000000000000000,855264297173,1186379864170,1638241049491]⟩ +def rdir127 : Row := ⟨127,5,3,4,1293236875589552281480943623680482669387936978190055555901713392074752,[0,855264297173,1155842912774,1384870048247,1605713290757],[1000000000000000000000000000000,855264297173,1155842912774,1384870048247,1605713290757]⟩ +def rdir128 : Row := ⟨128,5,3,5,1724596406372365013747451269212560532528032446694712788916521242984448,[0,855264297173,1143846253296,1384870048247,1557193467983,2412457765156],[1000000000000000000000000000000,855264297173,1143846253296,1384870048247,1557193467983,1000000000000000000000000000000]⟩ +def rdir129 : Row := ⟨129,5,3,6,1724597956157390309564294127005498383649696498739842156168711386431488,[0,855264297173,1133449148416,1323796145455,1517495431167,2372759728340,2647592290910],[1000000000000000000000000000000,855264297173,1133449148416,1323796145455,1517495431167,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir130 : Row := ⟨130,5,3,7,1048067927165694729730169948829909616783301973349931134095623324696576,[0,855264297173,1185185490029,1384870048247,1557193467983,2412457765156,2742378958012,2942063516230],[1000000000000000000000000000000,855264297173,1185185490029,1384870048247,1557193467983,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir131 : Row := ⟨131,5,3,8,934330652540680586051326187642582802192468636289587530258821643501568,[0,855264297173,1185185490029,1384870048247,1517495431167,2372759728340,2702680921196,2902365479414,3034990862334],[1000000000000000000000000000000,855264297173,1185185490029,1384870048247,1517495431167,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir132 : Row := ⟨132,5,4,1,1221622585068961179313720678101214994539744848136188526540598636707840,[0,641448222879],[1000000000000000000000000000000,641448222879]⟩ +def rdir133 : Row := ⟨133,5,4,2,1293235152519836892601660551833876753706053253523521877128803445112832,[0,641448222879,922045463252],[1000000000000000000000000000000,641448222879,922045463252]⟩ +def rdir134 : Row := ⟨134,5,4,3,1724596433636592146365629605975290842621515735921212282890951134806016,[0,641448222879,922045463252,1171053973953],[1000000000000000000000000000000,641448222879,922045463252,1171053973953]⟩ +def rdir135 : Row := ⟨135,5,4,4,1724609604154578640483768508526662304956356341621750763314427547615232,[0,641448222879,922045463252,1137972276607,1343377393689],[1000000000000000000000000000000,641448222879,922045463252,1137972276607,1343377393689]⟩ +def rdir136 : Row := ⟨136,5,4,5,1724612973100089391932552724182717490027122940689335867923835641659392,[0,641448222879,919633074122,1109980071161,1303679356873,1945127579752],[1000000000000000000000000000000,641448222879,919633074122,1109980071161,1303679356873,1000000000000000000000000000000]⟩ +def rdir137 : Row := ⟨137,5,4,6,1724625106981807601729229812456964539643236356816346790762387368574976,[0,641448222879,910535607352,1085986752205,1303679356873,1945127579752,2171973504410],[1000000000000000000000000000000,641448222879,910535607352,1085986752205,1303679356873,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir138 : Row := ⟨138,5,4,7,1077555376064317295573519265627186771869462452842603268311770759954432,[0,641448222879,922045463252,1137972276607,1303679356873,1945127579752,2225724820125,2441651633480],[1000000000000000000000000000000,641448222879,922045463252,1137972276607,1303679356873,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir139 : Row := ⟨139,5,4,8,933488154204169057761395648817461810469879237371394059820600200790016,[0,641448222879,922045463252,1171053973953,1303679356873,1945127579752,2225724820125,2474733330826,2607358713746],[1000000000000000000000000000000,641448222879,922045463252,1171053973953,1303679356873,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir140 : Row := ⟨140,5,5,2,1239316981823070018792594194199733014980220058586174267668605792419840,[0,513158578303,776218300177],[1000000000000000000000000000000,513158578303,776218300177]⟩ +def rdir141 : Row := ⟨141,5,5,3,1293240577971226727734960972460232914357906854670115761551765577662464,[0,513158578303,764161447185,1042764329377],[1000000000000000000000000000000,513158578303,764161447185,1042764329377]⟩ +def rdir142 : Row := ⟨142,5,5,4,1724665654103279491311286124596740145606725127649811505448166415663104,[0,513158578303,764161447185,981690426585,1263607571887],[1000000000000000000000000000000,513158578303,764161447185,981690426585,1263607571887]⟩ +def rdir143 : Row := ⟨143,5,5,5,1724600630101379141066789610820907158235274423216523900056142987919360,[0,513158578303,764161447185,957697107629,1175389712297,1688548290600],[1000000000000000000000000000000,513158578303,764161447185,957697107629,1175389712297,1000000000000000000000000000000]⟩ +def rdir144 : Row := ⟨144,5,5,6,1722920364260112885046417138362232148833833092427163512036496576086016,[0,513158578303,764161447185,936902897869,1175389712297,1688548290600,1873805795738],[1000000000000000000000000000000,513158578303,764161447185,936902897869,1175389712297,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir145 : Row := ⟨145,5,6,1,1652996772683465680177371992258713398599898766716859493179194821574656,[0,427632148586],[1000000000000000000000000000000,427632148586]⟩ +def rdir146 : Row := ⟨146,5,6,2,1724639216326460256612514742150595964661313264902253253451793553162240,[0,427632148586,658905436474],[1000000000000000000000000000000,427632148586,658905436474]⟩ +def rdir147 : Row := ⟨147,5,6,3,1724798117216637881724063662380226703911013118052171238200390442811392,[0,427632148586,658905436474,872170677912],[1000000000000000000000000000000,427632148586,658905436474,872170677912]⟩ +def rdir148 : Row := ⟨148,5,6,4,1724798118073825470047530802303242888424294207126660397541688667537408,[0,427632148586,658905436474,872170677912,1089863282580],[1000000000000000000000000000000,427632148586,658905436474,872170677912,1089863282580]⟩ +def rdir149 : Row := ⟨149,5,6,5,1724646705823392495552840718194043011096595614457697823012136452882432,[0,427632148586,658905436474,851376468152,1089863282580,1510281904626],[1000000000000000000000000000000,427632148586,658905436474,851376468152,1089863282580,1000000000000000000000000000000]⟩ +def rdir150 : Row := ⟨150,5,6,6,1715364207117878652535193849492819274017655389633730539505151643746304,[0,427632148586,658905436474,851376468152,1089863282580,1510281904626,1702752936304],[1000000000000000000000000000000,427632148586,658905436474,851376468152,1089863282580,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir151 : Row := ⟨151,5,7,1,1652983608646958070671727044061785472690990094936058624888378157432832,[0,366541841645],[1000000000000000000000000000000,366541841645]⟩ +def rdir152 : Row := ⟨152,5,7,2,1724665544399327589804111080269620235991010603627635781708136163835904,[0,366541841645,583722571681],[1000000000000000000000000000000,366541841645,583722571681]⟩ +def rdir153 : Row := ⟨153,5,7,3,1724988995745144619539653111141576030296066136658508190726175806455808,[0,366541841645,583722571681,790286161211],[1000000000000000000000000000000,366541841645,583722571681,790286161211]⟩ +def rdir154 : Row := ⟨154,5,7,4,1724988996495662855741150057078559469984549955007215013467884401721344,[0,366541841645,583722571681,790286161211,1028772975639],[1000000000000000000000000000000,366541841645,583722571681,790286161211,1028772975639]⟩ +def rdir155 : Row := ⟨155,5,7,5,1722079712887031048896507859243078410244396551237856898667978147495936,[0,366541841645,583722571681,790286161211,1068471012455,1374008732892],[1000000000000000000000000000000,366541841645,583722571681,790286161211,1068471012455,1000000000000000000000000000000]⟩ +def rdir156 : Row := ⟨156,5,7,6,1711967830645300390726067324802818450647166908398143296891178348183552,[0,366541841645,583722571681,790286161211,1028772975639,1374008732892,1580572322422],[1000000000000000000000000000000,366541841645,583722571681,790286161211,1028772975639,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir157 : Row := ⟨157,5,8,1,1653049428829299958770720951272555233816058214264559767734821977063424,[0,320724111439],[1000000000000000000000000000000,320724111439]⟩ +def rdir158 : Row := ⟨158,5,8,2,1725007809347244270678715850304158731507938411450953091363223940104192,[0,320724111439,527335423086],[1000000000000000000000000000000,320724111439,527335423086]⟩ +def rdir159 : Row := ⟨159,5,8,3,1725436572983939089901869000552885289179303280038478780105471154978816,[0,320724111439,527335423086,744468431005],[1000000000000000000000000000000,320724111439,527335423086,744468431005]⟩ +def rdir160 : Row := ⟨160,5,8,4,1725436546416302154306973501391776423872330413460762560019084580225024,[0,320724111439,527335423086,744468431005,982955245433],[1000000000000000000000000000000,320724111439,527335423086,744468431005,982955245433]⟩ +def rdir161 : Row := ⟨161,5,8,5,1712007322754676099671079044063199827059286494058918502807898714800128,[0,320724111439,527335423086,744468431005,982955245433,1271803854091],[1000000000000000000000000000000,320724111439,527335423086,744468431005,982955245433,1000000000000000000000000000000]⟩ +def rdir162 : Row := ⟨162,5,8,6,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir163 : Row := ⟨163,5,9,1,1220110597673101594896698658036310199253681338105286529160551086424064,[0,285088099057],[1000000000000000000000000000000,285088099057]⟩ +def rdir164 : Row := ⟨164,5,9,2,1724981481154179480978155684301943406971274447681393806906215951761408,[0,285088099057,483478751956],[1000000000000000000000000000000,285088099057,483478751956]⟩ +def rdir165 : Row := ⟨165,5,9,3,1719084897325991940802223620433570589293316217023973182165491707281408,[0,285088099057,483478751956,729626628383],[1000000000000000000000000000000,285088099057,483478751956,729626628383]⟩ +def rdir166 : Row := ⟨166,5,9,4,1719076454473507404067315922964737428825002565369443847371935033851904,[0,285088099057,483478751956,708832418623,966957503912],[1000000000000000000000000000000,285088099057,483478751956,708832418623,1000000000000000000000000000000]⟩ +def rdir167 : Row := ⟨167,5,10,1,1653365365597545860971933423926930357813615760583145572860786448007168,[0,256579289151],[1000000000000000000000000000000,256579289151]⟩ +def rdir168 : Row := ⟨168,5,10,2,1725429058192903593489248051476853744765984426521570766406197669003264,[0,256579289151,448393415052],[1000000000000000000000000000000,256579289151,448393415052]⟩ +def rdir169 : Row := ⟨169,5,10,3,1712798854587327003016494715533281136648493428042051740193260090425344,[0,256579289151,448393415052,680323608717],[1000000000000000000000000000000,256579289151,448393415052,680323608717]⟩ +def rdir170 : Row := ⟨170,5,10,4,1699251261300849264808366402224925605189360721528803074030198803398656,[0,256579289151,448393415052,680323608717,896786830104],[1000000000000000000000000000000,256579289151,448393415052,680323608717,1000000000000000000000000000000]⟩ +def rdir171 : Row := ⟨171,5,11,1,1651680341612902193581932051270636061096749196179285892773239272243200,[0,233253899229],[1000000000000000000000000000000,233253899229]⟩ +def rdir172 : Row := ⟨172,5,11,2,1662634722561076543643001767832855117994435672389287639170404610736128,[0,233253899229,431744083305],[1000000000000000000000000000000,233253899229,431744083305]⟩ +def rdir173 : Row := ⟨173,5,12,1,1653786587446273337315890411824309469743127098087296874998325491793920,[0,213816074293],[1000000000000000000000000000000,213816074293]⟩ +def rdir174 : Row := ⟨174,5,12,2,1635266639341692828462191503045774309478359528761574137833819815804928,[0,213816074293,407822262689],[1000000000000000000000000000000,213816074293,407822262689]⟩ +def rdir175 : Row := ⟨175,6,3,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir176 : Row := ⟨176,6,4,3,865245788348865845910094515449036271932042103810911498065418991435776,[0,545848006213,722681850105,1268529856318],[1000000000000000000000000000000,545848006213,722681850105,1000000000000000000000000000000]⟩ +def rdir177 : Row := ⟨177,6,4,4,866930785015562760897261203891974998849144425337320283845487967076352,[0,545848006213,704998465717,1250846471930,1409996931434],[1000000000000000000000000000000,545848006213,704998465717,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir178 : Row := ⟨178,6,5,4,866930785015562760897261203891974998849144425337320283845487967076352,[0,436678404971,595828864475,1032507269446,1191657728950],[1000000000000000000000000000000,436678404971,595828864475,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir179 : Row := ⟨179,6,6,2,871985775015653505858761269220791179600451389916546641185694893998080,[0,363898670809,540732514701],[1000000000000000000000000000000,363898670809,540732514701]⟩ +def rdir180 : Row := ⟨180,6,6,3,875355768349047335833094646106668633434656032969364212745832845279232,[0,363898670809,523049130313,886947801122],[1000000000000000000000000000000,363898670809,523049130313,1000000000000000000000000000000]⟩ +def rdir181 : Row := ⟨181,6,6,4,880410758349138080794594711435484814185962997548590570086039772200960,[0,363898670809,508580906721,872479577530,1017161813442],[1000000000000000000000000000000,363898670809,508580906721,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir182 : Row := ⟨182,6,7,2,870300778348956590871594580777852452683349068390137855405625918357504,[0,311913146407,488746990299],[1000000000000000000000000000000,311913146407,488746990299]⟩ +def rdir183 : Row := ⟨183,6,7,3,872828273349001963352344613442260543059002550679751034075729381818368,[0,311913146407,471063605911,782976752318],[1000000000000000000000000000000,311913146407,471063605911,1000000000000000000000000000000]⟩ +def rdir184 : Row := ⟨184,6,7,4,880410758349138080794594711435484814185962997548590570086039772200960,[0,311913146407,456595382319,768508528726,913190764638],[1000000000000000000000000000000,311913146407,456595382319,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir185 : Row := ⟨185,6,8,1,898103223349455688159844940086341446815537373575882820776764016427008,[0,272924003106],[1000000000000000000000000000000,272924003106]⟩ +def rdir186 : Row := ⟨186,6,8,2,902315715016197975627761661193688264108293177391904785226936455528448,[0,272924003106,432074462610],[1000000000000000000000000000000,272924003106,432074462610]⟩ +def rdir187 : Row := ⟨187,6,8,3,1293234941689882252650433379955472908876031771518743086202938804142080,[0,272924003106,405549386026,678473389132],[1000000000000000000000000000000,272924003106,405549386026,1000000000000000000000000000000]⟩ +def rdir188 : Row := ⟨188,6,8,4,934330651683439360383928741609524075533237286393671715048246992699392,[0,272924003106,405549386026,678473389132,811098772052],[1000000000000000000000000000000,272924003106,405549386026,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir189 : Row := ⟨189,6,9,2,900630718349501060640594972750749537191190855865495999446867479887872,[0,242599113872,401749573376],[1000000000000000000000000000000,242599113872,401749573376]⟩ +def rdir190 : Row := ⟨190,6,9,3,1291549945023185337663266691512534181958929449992334300422869828501504,[0,242599113872,375224496792,617823610664],[1000000000000000000000000000000,242599113872,375224496792,1000000000000000000000000000000]⟩ +def rdir191 : Row := ⟨191,6,9,4,934330651683439360383928741609524075533237286393671715048246992699392,[0,242599113872,375224496792,617823610664,750448993584],[1000000000000000000000000000000,242599113872,375224496792,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir192 : Row := ⟨192,6,10,1,1005943010018058247338513000434419969510085951266045110701178457423872,[0,218339202485],[1000000000000000000000000000000,218339202485]⟩ +def rdir193 : Row := ⟨193,6,10,2,1293234941689882252650433379955472908876031771518743086202938804142080,[0,218339202485,350964585405],[1000000000000000000000000000000,218339202485,350964585405]⟩ +def rdir194 : Row := ⟨194,6,10,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218339202485,350964585405,569303787890],[1000000000000000000000000000000,218339202485,350964585405,1000000000000000000000000000000]⟩ +def rdir195 : Row := ⟨195,6,10,4,933488153350090902890345397388054712074686125630467322158212504879104,[0,218339202485,350964585405,569303787890,701929170810],[1000000000000000000000000000000,218339202485,350964585405,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir196 : Row := ⟨196,6,11,1,1004258013351361332351346311991481242592983629739636324921109481783296,[0,198490184077],[1000000000000000000000000000000,198490184077]⟩ +def rdir197 : Row := ⟨197,6,11,2,1291549945023185337663266691512534181958929449992334300422869828501504,[0,198490184077,331115566997],[1000000000000000000000000000000,198490184077,331115566997]⟩ +def rdir198 : Row := ⟨198,6,11,3,1722066593364247116884355588683378909278572599989779067230493104668672,[0,198490184077,331115566997,529605751074],[1000000000000000000000000000000,198490184077,331115566997,1000000000000000000000000000000]⟩ +def rdir199 : Row := ⟨199,6,11,4,930118160016697072916012020502177258240481482577649750598074553597952,[0,198490184077,331115566997,529605751074,662231133994],[1000000000000000000000000000000,198490184077,331115566997,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir200 : Row := ⟨200,6,12,1,1221622583355263365695849121130577014899183106646369690550007339417600,[0,181949335404],[1000000000000000000000000000000,181949335404]⟩ +def rdir201 : Row := ⟨201,6,12,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,181949335404,314574718324],[1000000000000000000000000000000,181949335404,314574718324]⟩ +def rdir202 : Row := ⟨202,6,12,3,1715326606697459456935688834911624001610163313884143924110217202106368,[0,181949335404,314574718324,496524053728],[1000000000000000000000000000000,181949335404,314574718324,1000000000000000000000000000000]⟩ +def rdir203 : Row := ⟨203,6,12,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdir204 : Row := ⟨204,6,13,1,1219937586688566450708682432687638287982080785119960904769938363777024,[0,167953232681],[1000000000000000000000000000000,167953232681]⟩ +def rdir205 : Row := ⟨205,6,13,2,1291549945023185337663266691512534181958929449992334300422869828501504,[0,167953232681,300578615601],[1000000000000000000000000000000,167953232681,300578615601]⟩ +def rdir206 : Row := ⟨206,6,13,3,1253637520022504750452016201546412826324127215648136620371317876588544,[0,167953232681,300578615601,468531848282],[1000000000000000000000000000000,167953232681,300578615601,1000000000000000000000000000000]⟩ +def rdir207 : Row := ⟨207,6,14,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,155956573203],[1000000000000000000000000000000,155956573203]⟩ +def rdir208 : Row := ⟨208,6,14,2,1722909091697595574377938932904848272737123760752983460120527592488960,[0,155956573203,288581956123],[1000000000000000000000000000000,155956573203,288581956123]⟩ +def rdir209 : Row := ⟨209,6,14,3,1577156880028312427988020382590648394407772948718623490144561199579136,[0,155956573203,288581956123,444538529326],[1000000000000000000000000000000,155956573203,288581956123,1000000000000000000000000000000]⟩ +def rdir210 : Row := ⟨210,6,15,1,1651296733362976687423354674079952378760275095880610064467596127764480,[0,145559468323],[1000000000000000000000000000000,145559468323]⟩ +def rdir211 : Row := ⟨211,6,15,2,1715326606697459456935688834911624001610163313884143924110217202106368,[0,145559468323,278184851243],[1000000000000000000000000000000,145559468323,278184851243]⟩ +def rdir212 : Row := ⟨212,6,15,3,1347997333357531989733350754350981533681857221127028624055180512460800,[0,145559468323,278184851243,423744319566],[1000000000000000000000000000000,145559468323,278184851243,1000000000000000000000000000000]⟩ +def rdir213 : Row := ⟨213,6,16,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,136462001553],[1000000000000000000000000000000,136462001553]⟩ +def rdir214 : Row := ⟨214,6,16,2,1688366660030308817141021819824604370936526169461603351629113591857152,[0,136462001553,269087384473],[1000000000000000000000000000000,136462001553,269087384473]⟩ +def rdir215 : Row := ⟨215,6,17,1,1186237653354628150965348663828863749640034354591785189168558850965504,[0,128434824991],[1000000000000000000000000000000,128434824991]⟩ +def rdir216 : Row := ⟨216,6,18,1,1617596800029038387680020905221177840418228665352434348866216614952960,[0,121299556936],[1000000000000000000000000000000,121299556936]⟩ +def rdir217 : Row := ⟨217,6,19,1,1509757013360435828501352844873099317723680087662272058941802173956096,[0,114915369729],[1000000000000000000000000000000,114915369729]⟩ +def rdir218 : Row := ⟨218,6,20,1,1509757013360435828501352844873099317723680087662272058941802173956096,[0,109169601242],[1000000000000000000000000000000,109169601242]⟩ +def rdir219 : Row := ⟨219,7,18,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,88416921946,176833843892],[1000000000000000000000000000000,88416921946,1000000000000000000000000000000]⟩ +def rdir220 : Row := ⟨220,7,20,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,79575229752],[1000000000000000000000000000000,79575229752]⟩ +def rdir221 : Row := ⟨221,7,20,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,79575229752,159150459504],[1000000000000000000000000000000,79575229752,1000000000000000000000000000000]⟩ +def rdir222 : Row := ⟨222,7,22,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,72341117956],[1000000000000000000000000000000,72341117956]⟩ +def rdir223 : Row := ⟨223,7,22,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,72341117956,144682235912],[1000000000000000000000000000000,72341117956,1000000000000000000000000000000]⟩ +def rdir224 : Row := ⟨224,7,24,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,66312691460],[1000000000000000000000000000000,66312691460]⟩ +def rdir225 : Row := ⟨225,7,24,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,66312691460,132625382920],[1000000000000000000000000000000,66312691460,1000000000000000000000000000000]⟩ +def rdir226 : Row := ⟨226,7,26,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,61211715194],[1000000000000000000000000000000,61211715194]⟩ +def rdir227 : Row := ⟨227,7,28,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,56839449823],[1000000000000000000000000000000,56839449823]⟩ +def rdir228 : Row := ⟨228,7,30,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,53050153168],[1000000000000000000000000000000,53050153168]⟩ +def rdir229 : Row := ⟨229,8,48,1,0,[0,0],[1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rdiR : List Row := [rdir0, rdir1, rdir2, rdir3, rdir4, rdir5, rdir6, rdir7, rdir8, rdir9, rdir10, rdir11, rdir12, rdir13, rdir14, rdir15, rdir16, rdir17, rdir18, rdir19, rdir20, rdir21, rdir22, rdir23, rdir24, rdir25, rdir26, rdir27, rdir28, rdir29, rdir30, rdir31, rdir32, rdir33, rdir34, rdir35, rdir36, rdir37, rdir38, rdir39, rdir40, rdir41, rdir42, rdir43, rdir44, rdir45, rdir46, rdir47, rdir48, rdir49, rdir50, rdir51, rdir52, rdir53, rdir54, rdir55, rdir56, rdir57, rdir58, rdir59, rdir60, rdir61, rdir62, rdir63, rdir64, rdir65, rdir66, rdir67, rdir68, rdir69, rdir70, rdir71, rdir72, rdir73, rdir74, rdir75, rdir76, rdir77, rdir78, rdir79, rdir80, rdir81, rdir82, rdir83, rdir84, rdir85, rdir86, rdir87, rdir88, rdir89, rdir90, rdir91, rdir92, rdir93, rdir94, rdir95, rdir96, rdir97, rdir98, rdir99, rdir100, rdir101, rdir102, rdir103, rdir104, rdir105, rdir106, rdir107, rdir108, rdir109, rdir110, rdir111, rdir112, rdir113, rdir114, rdir115, rdir116, rdir117, rdir118, rdir119, rdir120, rdir121, rdir122, rdir123, rdir124, rdir125, rdir126, rdir127, rdir128, rdir129, rdir130, rdir131, rdir132, rdir133, rdir134, rdir135, rdir136, rdir137, rdir138, rdir139, rdir140, rdir141, rdir142, rdir143, rdir144, rdir145, rdir146, rdir147, rdir148, rdir149, rdir150, rdir151, rdir152, rdir153, rdir154, rdir155, rdir156, rdir157, rdir158, rdir159, rdir160, rdir161, rdir162, rdir163, rdir164, rdir165, rdir166, rdir167, rdir168, rdir169, rdir170, rdir171, rdir172, rdir173, rdir174, rdir175, rdir176, rdir177, rdir178, rdir179, rdir180, rdir181, rdir182, rdir183, rdir184, rdir185, rdir186, rdir187, rdir188, rdir189, rdir190, rdir191, rdir192, rdir193, rdir194, rdir195, rdir196, rdir197, rdir198, rdir199, rdir200, rdir201, rdir202, rdir203, rdir204, rdir205, rdir206, rdir207, rdir208, rdir209, rdir210, rdir211, rdir212, rdir213, rdir214, rdir215, rdir216, rdir217, rdir218, rdir219, rdir220, rdir221, rdir222, rdir223, rdir224, rdir225, rdir226, rdir227, rdir228, rdir229] +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP0.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP0.lean new file mode 100644 index 0000000000..a6f694b2f4 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP0.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic0 : Row.check rdiW rdiR rdir0 = true := by decide +kernel +theorem rdic1 : Row.check rdiW rdiR rdir1 = true := by decide +kernel +theorem rdic2 : Row.check rdiW rdiR rdir2 = true := by decide +kernel +theorem rdic3 : Row.check rdiW rdiR rdir3 = true := by decide +kernel +theorem rdic4 : Row.check rdiW rdiR rdir4 = true := by decide +kernel +theorem rdic5 : Row.check rdiW rdiR rdir5 = true := by decide +kernel +theorem rdic6 : Row.check rdiW rdiR rdir6 = true := by decide +kernel +theorem rdic7 : Row.check rdiW rdiR rdir7 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP1.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP1.lean new file mode 100644 index 0000000000..a9de35b2aa --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP1.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic8 : Row.check rdiW rdiR rdir8 = true := by decide +kernel +theorem rdic9 : Row.check rdiW rdiR rdir9 = true := by decide +kernel +theorem rdic10 : Row.check rdiW rdiR rdir10 = true := by decide +kernel +theorem rdic11 : Row.check rdiW rdiR rdir11 = true := by decide +kernel +theorem rdic12 : Row.check rdiW rdiR rdir12 = true := by decide +kernel +theorem rdic13 : Row.check rdiW rdiR rdir13 = true := by decide +kernel +theorem rdic14 : Row.check rdiW rdiR rdir14 = true := by decide +kernel +theorem rdic15 : Row.check rdiW rdiR rdir15 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP10.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP10.lean new file mode 100644 index 0000000000..1c413ca53f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP10.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic80 : Row.check rdiW rdiR rdir80 = true := by decide +kernel +theorem rdic81 : Row.check rdiW rdiR rdir81 = true := by decide +kernel +theorem rdic82 : Row.check rdiW rdiR rdir82 = true := by decide +kernel +theorem rdic83 : Row.check rdiW rdiR rdir83 = true := by decide +kernel +theorem rdic84 : Row.check rdiW rdiR rdir84 = true := by decide +kernel +theorem rdic85 : Row.check rdiW rdiR rdir85 = true := by decide +kernel +theorem rdic86 : Row.check rdiW rdiR rdir86 = true := by decide +kernel +theorem rdic87 : Row.check rdiW rdiR rdir87 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP11.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP11.lean new file mode 100644 index 0000000000..af17b45a1a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP11.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic88 : Row.check rdiW rdiR rdir88 = true := by decide +kernel +theorem rdic89 : Row.check rdiW rdiR rdir89 = true := by decide +kernel +theorem rdic90 : Row.check rdiW rdiR rdir90 = true := by decide +kernel +theorem rdic91 : Row.check rdiW rdiR rdir91 = true := by decide +kernel +theorem rdic92 : Row.check rdiW rdiR rdir92 = true := by decide +kernel +theorem rdic93 : Row.check rdiW rdiR rdir93 = true := by decide +kernel +theorem rdic94 : Row.check rdiW rdiR rdir94 = true := by decide +kernel +theorem rdic95 : Row.check rdiW rdiR rdir95 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP12.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP12.lean new file mode 100644 index 0000000000..0df462e103 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP12.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic96 : Row.check rdiW rdiR rdir96 = true := by decide +kernel +theorem rdic97 : Row.check rdiW rdiR rdir97 = true := by decide +kernel +theorem rdic98 : Row.check rdiW rdiR rdir98 = true := by decide +kernel +theorem rdic99 : Row.check rdiW rdiR rdir99 = true := by decide +kernel +theorem rdic100 : Row.check rdiW rdiR rdir100 = true := by decide +kernel +theorem rdic101 : Row.check rdiW rdiR rdir101 = true := by decide +kernel +theorem rdic102 : Row.check rdiW rdiR rdir102 = true := by decide +kernel +theorem rdic103 : Row.check rdiW rdiR rdir103 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP13.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP13.lean new file mode 100644 index 0000000000..f0a7f0a793 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP13.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic104 : Row.check rdiW rdiR rdir104 = true := by decide +kernel +theorem rdic105 : Row.check rdiW rdiR rdir105 = true := by decide +kernel +theorem rdic106 : Row.check rdiW rdiR rdir106 = true := by decide +kernel +theorem rdic107 : Row.check rdiW rdiR rdir107 = true := by decide +kernel +theorem rdic108 : Row.check rdiW rdiR rdir108 = true := by decide +kernel +theorem rdic109 : Row.check rdiW rdiR rdir109 = true := by decide +kernel +theorem rdic110 : Row.check rdiW rdiR rdir110 = true := by decide +kernel +theorem rdic111 : Row.check rdiW rdiR rdir111 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP14.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP14.lean new file mode 100644 index 0000000000..a6cbd42b4e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP14.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic112 : Row.check rdiW rdiR rdir112 = true := by decide +kernel +theorem rdic113 : Row.check rdiW rdiR rdir113 = true := by decide +kernel +theorem rdic114 : Row.check rdiW rdiR rdir114 = true := by decide +kernel +theorem rdic115 : Row.check rdiW rdiR rdir115 = true := by decide +kernel +theorem rdic116 : Row.check rdiW rdiR rdir116 = true := by decide +kernel +theorem rdic117 : Row.check rdiW rdiR rdir117 = true := by decide +kernel +theorem rdic118 : Row.check rdiW rdiR rdir118 = true := by decide +kernel +theorem rdic119 : Row.check rdiW rdiR rdir119 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP15.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP15.lean new file mode 100644 index 0000000000..2998738935 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP15.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic120 : Row.check rdiW rdiR rdir120 = true := by decide +kernel +theorem rdic121 : Row.check rdiW rdiR rdir121 = true := by decide +kernel +theorem rdic122 : Row.check rdiW rdiR rdir122 = true := by decide +kernel +theorem rdic123 : Row.check rdiW rdiR rdir123 = true := by decide +kernel +theorem rdic124 : Row.check rdiW rdiR rdir124 = true := by decide +kernel +theorem rdic125 : Row.check rdiW rdiR rdir125 = true := by decide +kernel +theorem rdic126 : Row.check rdiW rdiR rdir126 = true := by decide +kernel +theorem rdic127 : Row.check rdiW rdiR rdir127 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP16.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP16.lean new file mode 100644 index 0000000000..f9901261e3 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP16.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic128 : Row.check rdiW rdiR rdir128 = true := by decide +kernel +theorem rdic129 : Row.check rdiW rdiR rdir129 = true := by decide +kernel +theorem rdic130 : Row.check rdiW rdiR rdir130 = true := by decide +kernel +theorem rdic131 : Row.check rdiW rdiR rdir131 = true := by decide +kernel +theorem rdic132 : Row.check rdiW rdiR rdir132 = true := by decide +kernel +theorem rdic133 : Row.check rdiW rdiR rdir133 = true := by decide +kernel +theorem rdic134 : Row.check rdiW rdiR rdir134 = true := by decide +kernel +theorem rdic135 : Row.check rdiW rdiR rdir135 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP17.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP17.lean new file mode 100644 index 0000000000..3d0a68e130 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP17.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic136 : Row.check rdiW rdiR rdir136 = true := by decide +kernel +theorem rdic137 : Row.check rdiW rdiR rdir137 = true := by decide +kernel +theorem rdic138 : Row.check rdiW rdiR rdir138 = true := by decide +kernel +theorem rdic139 : Row.check rdiW rdiR rdir139 = true := by decide +kernel +theorem rdic140 : Row.check rdiW rdiR rdir140 = true := by decide +kernel +theorem rdic141 : Row.check rdiW rdiR rdir141 = true := by decide +kernel +theorem rdic142 : Row.check rdiW rdiR rdir142 = true := by decide +kernel +theorem rdic143 : Row.check rdiW rdiR rdir143 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP18.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP18.lean new file mode 100644 index 0000000000..8ee9faf039 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP18.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic144 : Row.check rdiW rdiR rdir144 = true := by decide +kernel +theorem rdic145 : Row.check rdiW rdiR rdir145 = true := by decide +kernel +theorem rdic146 : Row.check rdiW rdiR rdir146 = true := by decide +kernel +theorem rdic147 : Row.check rdiW rdiR rdir147 = true := by decide +kernel +theorem rdic148 : Row.check rdiW rdiR rdir148 = true := by decide +kernel +theorem rdic149 : Row.check rdiW rdiR rdir149 = true := by decide +kernel +theorem rdic150 : Row.check rdiW rdiR rdir150 = true := by decide +kernel +theorem rdic151 : Row.check rdiW rdiR rdir151 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP19.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP19.lean new file mode 100644 index 0000000000..aca9278d24 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP19.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic152 : Row.check rdiW rdiR rdir152 = true := by decide +kernel +theorem rdic153 : Row.check rdiW rdiR rdir153 = true := by decide +kernel +theorem rdic154 : Row.check rdiW rdiR rdir154 = true := by decide +kernel +theorem rdic155 : Row.check rdiW rdiR rdir155 = true := by decide +kernel +theorem rdic156 : Row.check rdiW rdiR rdir156 = true := by decide +kernel +theorem rdic157 : Row.check rdiW rdiR rdir157 = true := by decide +kernel +theorem rdic158 : Row.check rdiW rdiR rdir158 = true := by decide +kernel +theorem rdic159 : Row.check rdiW rdiR rdir159 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP2.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP2.lean new file mode 100644 index 0000000000..46400d6c8b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP2.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic16 : Row.check rdiW rdiR rdir16 = true := by decide +kernel +theorem rdic17 : Row.check rdiW rdiR rdir17 = true := by decide +kernel +theorem rdic18 : Row.check rdiW rdiR rdir18 = true := by decide +kernel +theorem rdic19 : Row.check rdiW rdiR rdir19 = true := by decide +kernel +theorem rdic20 : Row.check rdiW rdiR rdir20 = true := by decide +kernel +theorem rdic21 : Row.check rdiW rdiR rdir21 = true := by decide +kernel +theorem rdic22 : Row.check rdiW rdiR rdir22 = true := by decide +kernel +theorem rdic23 : Row.check rdiW rdiR rdir23 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP20.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP20.lean new file mode 100644 index 0000000000..2bd5f21146 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP20.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic160 : Row.check rdiW rdiR rdir160 = true := by decide +kernel +theorem rdic161 : Row.check rdiW rdiR rdir161 = true := by decide +kernel +theorem rdic162 : Row.check rdiW rdiR rdir162 = true := by decide +kernel +theorem rdic163 : Row.check rdiW rdiR rdir163 = true := by decide +kernel +theorem rdic164 : Row.check rdiW rdiR rdir164 = true := by decide +kernel +theorem rdic165 : Row.check rdiW rdiR rdir165 = true := by decide +kernel +theorem rdic166 : Row.check rdiW rdiR rdir166 = true := by decide +kernel +theorem rdic167 : Row.check rdiW rdiR rdir167 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP21.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP21.lean new file mode 100644 index 0000000000..83909c5d2b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP21.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic168 : Row.check rdiW rdiR rdir168 = true := by decide +kernel +theorem rdic169 : Row.check rdiW rdiR rdir169 = true := by decide +kernel +theorem rdic170 : Row.check rdiW rdiR rdir170 = true := by decide +kernel +theorem rdic171 : Row.check rdiW rdiR rdir171 = true := by decide +kernel +theorem rdic172 : Row.check rdiW rdiR rdir172 = true := by decide +kernel +theorem rdic173 : Row.check rdiW rdiR rdir173 = true := by decide +kernel +theorem rdic174 : Row.check rdiW rdiR rdir174 = true := by decide +kernel +theorem rdic175 : Row.check rdiW rdiR rdir175 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP22.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP22.lean new file mode 100644 index 0000000000..c1c5bdee02 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP22.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic176 : Row.check rdiW rdiR rdir176 = true := by decide +kernel +theorem rdic177 : Row.check rdiW rdiR rdir177 = true := by decide +kernel +theorem rdic178 : Row.check rdiW rdiR rdir178 = true := by decide +kernel +theorem rdic179 : Row.check rdiW rdiR rdir179 = true := by decide +kernel +theorem rdic180 : Row.check rdiW rdiR rdir180 = true := by decide +kernel +theorem rdic181 : Row.check rdiW rdiR rdir181 = true := by decide +kernel +theorem rdic182 : Row.check rdiW rdiR rdir182 = true := by decide +kernel +theorem rdic183 : Row.check rdiW rdiR rdir183 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP23.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP23.lean new file mode 100644 index 0000000000..b317ebee18 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP23.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic184 : Row.check rdiW rdiR rdir184 = true := by decide +kernel +theorem rdic185 : Row.check rdiW rdiR rdir185 = true := by decide +kernel +theorem rdic186 : Row.check rdiW rdiR rdir186 = true := by decide +kernel +theorem rdic187 : Row.check rdiW rdiR rdir187 = true := by decide +kernel +theorem rdic188 : Row.check rdiW rdiR rdir188 = true := by decide +kernel +theorem rdic189 : Row.check rdiW rdiR rdir189 = true := by decide +kernel +theorem rdic190 : Row.check rdiW rdiR rdir190 = true := by decide +kernel +theorem rdic191 : Row.check rdiW rdiR rdir191 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP24.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP24.lean new file mode 100644 index 0000000000..896248837d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP24.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic192 : Row.check rdiW rdiR rdir192 = true := by decide +kernel +theorem rdic193 : Row.check rdiW rdiR rdir193 = true := by decide +kernel +theorem rdic194 : Row.check rdiW rdiR rdir194 = true := by decide +kernel +theorem rdic195 : Row.check rdiW rdiR rdir195 = true := by decide +kernel +theorem rdic196 : Row.check rdiW rdiR rdir196 = true := by decide +kernel +theorem rdic197 : Row.check rdiW rdiR rdir197 = true := by decide +kernel +theorem rdic198 : Row.check rdiW rdiR rdir198 = true := by decide +kernel +theorem rdic199 : Row.check rdiW rdiR rdir199 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP25.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP25.lean new file mode 100644 index 0000000000..507f7f053a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP25.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic200 : Row.check rdiW rdiR rdir200 = true := by decide +kernel +theorem rdic201 : Row.check rdiW rdiR rdir201 = true := by decide +kernel +theorem rdic202 : Row.check rdiW rdiR rdir202 = true := by decide +kernel +theorem rdic203 : Row.check rdiW rdiR rdir203 = true := by decide +kernel +theorem rdic204 : Row.check rdiW rdiR rdir204 = true := by decide +kernel +theorem rdic205 : Row.check rdiW rdiR rdir205 = true := by decide +kernel +theorem rdic206 : Row.check rdiW rdiR rdir206 = true := by decide +kernel +theorem rdic207 : Row.check rdiW rdiR rdir207 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP26.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP26.lean new file mode 100644 index 0000000000..34708638c0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP26.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic208 : Row.check rdiW rdiR rdir208 = true := by decide +kernel +theorem rdic209 : Row.check rdiW rdiR rdir209 = true := by decide +kernel +theorem rdic210 : Row.check rdiW rdiR rdir210 = true := by decide +kernel +theorem rdic211 : Row.check rdiW rdiR rdir211 = true := by decide +kernel +theorem rdic212 : Row.check rdiW rdiR rdir212 = true := by decide +kernel +theorem rdic213 : Row.check rdiW rdiR rdir213 = true := by decide +kernel +theorem rdic214 : Row.check rdiW rdiR rdir214 = true := by decide +kernel +theorem rdic215 : Row.check rdiW rdiR rdir215 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP27.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP27.lean new file mode 100644 index 0000000000..d9776831f0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP27.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic216 : Row.check rdiW rdiR rdir216 = true := by decide +kernel +theorem rdic217 : Row.check rdiW rdiR rdir217 = true := by decide +kernel +theorem rdic218 : Row.check rdiW rdiR rdir218 = true := by decide +kernel +theorem rdic219 : Row.check rdiW rdiR rdir219 = true := by decide +kernel +theorem rdic220 : Row.check rdiW rdiR rdir220 = true := by decide +kernel +theorem rdic221 : Row.check rdiW rdiR rdir221 = true := by decide +kernel +theorem rdic222 : Row.check rdiW rdiR rdir222 = true := by decide +kernel +theorem rdic223 : Row.check rdiW rdiR rdir223 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP28.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP28.lean new file mode 100644 index 0000000000..cba279b804 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP28.lean @@ -0,0 +1,9 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic224 : Row.check rdiW rdiR rdir224 = true := by decide +kernel +theorem rdic225 : Row.check rdiW rdiR rdir225 = true := by decide +kernel +theorem rdic226 : Row.check rdiW rdiR rdir226 = true := by decide +kernel +theorem rdic227 : Row.check rdiW rdiR rdir227 = true := by decide +kernel +theorem rdic228 : Row.check rdiW rdiR rdir228 = true := by decide +kernel +theorem rdic229 : Row.check rdiW rdiR rdir229 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP3.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP3.lean new file mode 100644 index 0000000000..6b7f8193d6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP3.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic24 : Row.check rdiW rdiR rdir24 = true := by decide +kernel +theorem rdic25 : Row.check rdiW rdiR rdir25 = true := by decide +kernel +theorem rdic26 : Row.check rdiW rdiR rdir26 = true := by decide +kernel +theorem rdic27 : Row.check rdiW rdiR rdir27 = true := by decide +kernel +theorem rdic28 : Row.check rdiW rdiR rdir28 = true := by decide +kernel +theorem rdic29 : Row.check rdiW rdiR rdir29 = true := by decide +kernel +theorem rdic30 : Row.check rdiW rdiR rdir30 = true := by decide +kernel +theorem rdic31 : Row.check rdiW rdiR rdir31 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP4.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP4.lean new file mode 100644 index 0000000000..8330d53b0e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP4.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic32 : Row.check rdiW rdiR rdir32 = true := by decide +kernel +theorem rdic33 : Row.check rdiW rdiR rdir33 = true := by decide +kernel +theorem rdic34 : Row.check rdiW rdiR rdir34 = true := by decide +kernel +theorem rdic35 : Row.check rdiW rdiR rdir35 = true := by decide +kernel +theorem rdic36 : Row.check rdiW rdiR rdir36 = true := by decide +kernel +theorem rdic37 : Row.check rdiW rdiR rdir37 = true := by decide +kernel +theorem rdic38 : Row.check rdiW rdiR rdir38 = true := by decide +kernel +theorem rdic39 : Row.check rdiW rdiR rdir39 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP5.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP5.lean new file mode 100644 index 0000000000..e06565e3d1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP5.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic40 : Row.check rdiW rdiR rdir40 = true := by decide +kernel +theorem rdic41 : Row.check rdiW rdiR rdir41 = true := by decide +kernel +theorem rdic42 : Row.check rdiW rdiR rdir42 = true := by decide +kernel +theorem rdic43 : Row.check rdiW rdiR rdir43 = true := by decide +kernel +theorem rdic44 : Row.check rdiW rdiR rdir44 = true := by decide +kernel +theorem rdic45 : Row.check rdiW rdiR rdir45 = true := by decide +kernel +theorem rdic46 : Row.check rdiW rdiR rdir46 = true := by decide +kernel +theorem rdic47 : Row.check rdiW rdiR rdir47 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP6.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP6.lean new file mode 100644 index 0000000000..d70edf9c15 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP6.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic48 : Row.check rdiW rdiR rdir48 = true := by decide +kernel +theorem rdic49 : Row.check rdiW rdiR rdir49 = true := by decide +kernel +theorem rdic50 : Row.check rdiW rdiR rdir50 = true := by decide +kernel +theorem rdic51 : Row.check rdiW rdiR rdir51 = true := by decide +kernel +theorem rdic52 : Row.check rdiW rdiR rdir52 = true := by decide +kernel +theorem rdic53 : Row.check rdiW rdiR rdir53 = true := by decide +kernel +theorem rdic54 : Row.check rdiW rdiR rdir54 = true := by decide +kernel +theorem rdic55 : Row.check rdiW rdiR rdir55 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP7.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP7.lean new file mode 100644 index 0000000000..df2f26dbee --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP7.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic56 : Row.check rdiW rdiR rdir56 = true := by decide +kernel +theorem rdic57 : Row.check rdiW rdiR rdir57 = true := by decide +kernel +theorem rdic58 : Row.check rdiW rdiR rdir58 = true := by decide +kernel +theorem rdic59 : Row.check rdiW rdiR rdir59 = true := by decide +kernel +theorem rdic60 : Row.check rdiW rdiR rdir60 = true := by decide +kernel +theorem rdic61 : Row.check rdiW rdiR rdir61 = true := by decide +kernel +theorem rdic62 : Row.check rdiW rdiR rdir62 = true := by decide +kernel +theorem rdic63 : Row.check rdiW rdiR rdir63 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP8.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP8.lean new file mode 100644 index 0000000000..6829aed977 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP8.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic64 : Row.check rdiW rdiR rdir64 = true := by decide +kernel +theorem rdic65 : Row.check rdiW rdiR rdir65 = true := by decide +kernel +theorem rdic66 : Row.check rdiW rdiR rdir66 = true := by decide +kernel +theorem rdic67 : Row.check rdiW rdiR rdir67 = true := by decide +kernel +theorem rdic68 : Row.check rdiW rdiR rdir68 = true := by decide +kernel +theorem rdic69 : Row.check rdiW rdiR rdir69 = true := by decide +kernel +theorem rdic70 : Row.check rdiW rdiR rdir70 = true := by decide +kernel +theorem rdic71 : Row.check rdiW rdiR rdir71 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerdiP9.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP9.lean new file mode 100644 index 0000000000..0232e35252 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerdiP9.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerdiDefs +namespace CTree +theorem rdic72 : Row.check rdiW rdiR rdir72 = true := by decide +kernel +theorem rdic73 : Row.check rdiW rdiR rdir73 = true := by decide +kernel +theorem rdic74 : Row.check rdiW rdiR rdir74 = true := by decide +kernel +theorem rdic75 : Row.check rdiW rdiR rdir75 = true := by decide +kernel +theorem rdic76 : Row.check rdiW rdiR rdir76 = true := by decide +kernel +theorem rdic77 : Row.check rdiW rdiR rdir77 = true := by decide +kernel +theorem rdic78 : Row.check rdiW rdiR rdir78 = true := by decide +kernel +theorem rdic79 : Row.check rdiW rdiR rdir79 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaDefs.lean new file mode 100644 index 0000000000..ea6dd5ce8c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaDefs.lean @@ -0,0 +1,235 @@ +import Nov15.CTreeCore +namespace CTree +def reaW : List (List Nat) := [[0,0,0,0,0,0,0,0,0],[0,0,1595162760613,2188390344733,2571652494777,2855655060065,3081380002179,3268691127022,3428754580216],[0,0,0,2188390344733,3164880078897,3832144794229,4341872301631,4754908368588,3268691127022],[0,0,0,0,2571652494777,3832144794229,4725134451675,4341872301631,3081380002179],[0,0,0,0,0,2855655060065,3832144794229,3832144794229,2855655060065],[0,0,0,0,0,0,2571652494777,3164880078897,2571652494777],[0,0,0,0,0,0,0,2188390344733,2188390344733],[0,0,0,0,0,0,0,0,1595162760613],[0,0,0,0,0,0,0,0,0]] +def rear0 : Row := ⟨0,1,1,48,1725436586697640946858688965569256363112777243042596638790631055949822,[0,2928609377285,3183600824105,3475386203401,3681262778277,4129160367981,4336244046046,4904341886421,5110218461297,6140214435491,6354783628553,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,10756186007085,10963269685150,11480530629958,11687614308023,12612627565179,12851952066153,13330970165432,13538053843497,15128864327968,15407785107378,15839721413224,16684288787138,17116225092984,17548161398830,18441188626729,18648272304794,19678268278988,19892837472050,20396610879241,20603694557306,21626032765568,21880198237066,22312134542912,23375228616046,24181865806793,24501323528647,25018584473455,25225668151520,26150681408676,26390005909650,26869024008929,27076107686994],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4129160367981,4336244046046,4904341886421,5110218461297,6140214435491,6354783628553,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,10756186007085,10963269685150,11480530629958,11687614308023,12612627565179,12851952066153,13330970165432,13538053843497,16748782396493,17002947867991,17434884173837,18279451547751,18711387853597,19143324159443,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear1 : Row := ⟨1,2,1,20,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,11485572565015,11692656243080,12228426470691,12435510148756],[1000000000000000000000000000000,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,13446308756518,13653392434583,14690873923774,14897957601839]⟩ +def rear2 : Row := ⟨2,2,1,22,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,11485572565015,11692656243080,12228426470691,12435510148756,13205855149300,13445179650274],[1000000000000000000000000000000,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,13446308756518,13653392434583,14690873923774,14897957601839,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear3 : Row := ⟨3,2,1,24,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,11485572565015,11692656243080,12228426470691,12435510148756,13205855149300,13445179650274,13924197749553,14131281427618],[1000000000000000000000000000000,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,13446308756518,13653392434583,14690873923774,14897957601839,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear4 : Row := ⟨4,2,1,26,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,11485572565015,11692656243080,12228426470691,12435510148756,13205855149300,13445179650274,13924197749553,14131281427618,15153619635880,15407785107378],[1000000000000000000000000000000,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,13446308756518,13653392434583,14690873923774,14897957601839,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear5 : Row := ⟨5,2,1,28,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,11485572565015,11692656243080,12228426470691,12435510148756,13205855149300,13445179650274,13924197749553,14131281427618,15153619635880,15407785107378,15839721413224,16684288787138],[1000000000000000000000000000000,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,13446308756518,13653392434583,14690873923774,14897957601839,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear6 : Row := ⟨6,2,1,30,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,11485572565015,11692656243080,12228426470691,12435510148756,13205855149300,13445179650274,13924197749553,14131281427618,15153619635880,15407785107378,15839721413224,16684288787138,17116225092984,17548161398830],[1000000000000000000000000000000,2958735345277,3406788650190,3735037177051,3940913751927,4419931851206,4627015529271,5163992860071,5369869434947,6140214435491,6379538936465,6858557035744,7065640713809,8135060715504,8342144393569,8774080699415,9837174772549,13446308756518,13653392434583,14690873923774,14897957601839,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear7 : Row := ⟨7,2,2,18,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8242012011936,9161023246472,9368106924537],[1000000000000000000000000000000,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8742979600182,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear8 : Row := ⟨8,2,2,20,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8242012011936,9161023246472,9368106924537,9885367869345,10092451547410],[1000000000000000000000000000000,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8742979600182,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear9 : Row := ⟨9,2,2,22,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8242012011936,9161023246472,9368106924537,9885367869345,10092451547410,11017464804566,11256789305540],[1000000000000000000000000000000,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8742979600182,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear10 : Row := ⟨10,2,2,24,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8242012011936,9161023246472,9368106924537,9885367869345,10092451547410,11017464804566,11256789305540,11735807404819,11942891082884],[1000000000000000000000000000000,1634345563511,2194388368776,2486173748072,2692050322948,3189577705030,3396661383095,3915129431092,4121006005968,5046019263124,5285343764098,5764361863377,5971445541442,7040865543137,7247949221202,7679885527048,8742979600182,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear11 : Row := ⟨11,3,1,8,1725436586697640946858688965569256363112769808131088451570363873099776,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297]⟩ +def rear12 : Row := ⟨12,3,1,10,1725436586697640946858688965569256363112777243028422585784197460262912,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553]⟩ +def rear13 : Row := ⟨13,3,1,11,1725436586697640946858688965569256363112777243033147258110076319170560,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738]⟩ +def rear14 : Row := ⟨14,3,1,12,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803]⟩ +def rear15 : Row := ⟨15,3,1,13,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000]⟩ +def rear16 : Row := ⟨16,3,1,14,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344,9638402452065],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear17 : Row := ⟨17,3,1,15,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344,9638402452065,10014560347718],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear18 : Row := ⟨18,3,1,16,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344,9638402452065,10014560347718,10220436922594],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear19 : Row := ⟨19,3,1,17,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344,9638402452065,10014560347718,10220436922594,11257918411785],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear20 : Row := ⟨20,3,1,18,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344,9638402452065,10014560347718,10220436922594,11257918411785,11465002089850],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear21 : Row := ⟨21,3,1,19,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344,9638402452065,10014560347718,10220436922594,11257918411785,11465002089850,12502483579041],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear22 : Row := ⟨22,3,1,20,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,9427096449344,9638402452065,10014560347718,10220436922594,11257918411785,11465002089850,12502483579041,12709567257106],[1000000000000000000000000000000,2928609377285,3183600824105,3475386203401,3681262778277,4316877988047,4528183990768,4904341886421,5110218461297,6147699950488,6354783628553,8181401848738,8388485526803,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear23 : Row := ⟨23,3,2,6,1725436586697640946858688964519793351043731158960419414395210547855360,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379]⟩ +def rear24 : Row := ⟨24,3,2,7,1725436586697640946858688964869614258143869349367193180740345082675200,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032]⟩ +def rear25 : Row := ⟨25,3,2,8,1725436586697640946858688965569256072344145730180740713430614152314880,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908]⟩ +def rear26 : Row := ⟨26,3,2,9,1725436586697640946858688965569256072344148208479851515041139711279104,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099]⟩ +def rear27 : Row := ⟨27,3,2,10,1725436586697640946858688965569256072344153165078073118262190829207552,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164]⟩ +def rear28 : Row := ⟨28,3,2,11,1725436586697640946858688965569256072344153165082795484745060474421248,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6013952169920],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6895575601349]⟩ +def rear29 : Row := ⟨29,3,2,12,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6013952169920,6219828744796],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6895575601349,7102659279414]⟩ +def rear30 : Row := ⟨30,3,2,13,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6013952169920,6219828744796,6855443954566],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6895575601349,7102659279414,1000000000000000000000000000000]⟩ +def rear31 : Row := ⟨31,3,2,14,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6013952169920,6219828744796,6855443954566,7066749957287],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6895575601349,7102659279414,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear32 : Row := ⟨32,3,2,15,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6013952169920,6219828744796,6855443954566,7066749957287,7442907852940],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6895575601349,7102659279414,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear33 : Row := ⟨33,3,2,16,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6013952169920,6219828744796,6855443954566,7066749957287,7442907852940,7648784427816],[1000000000000000000000000000000,1540690001089,1897774576716,2189559956012,2395436530888,3031051740658,3242357743379,3618515639032,3824392213908,4861873703099,5068957381164,6895575601349,7102659279414,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear34 : Row := ⟨34,3,3,4,1725436586697640946849780764332283298176074888370600511503471000682496,[0,1027126667393,1469165827587,1760951206883,1966827781759],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759]⟩ +def rear35 : Row := ⟨35,3,3,6,1725436586697640946858688964519783049526763825862118485357350877134848,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057]⟩ +def rear36 : Row := ⟨36,3,3,7,1725436586697640946858688964869593322802935736941613873340823816372224,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903]⟩ +def rear37 : Row := ⟨37,3,3,8,1725436586697640946858688965569213869355279559100604649307769694846976,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779]⟩ +def rear38 : Row := ⟨38,3,3,9,1725436586697640946858688965569213869355282037398534859297577842507776,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4422910132172],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4433264953970]⟩ +def rear39 : Row := ⟨39,3,3,10,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4422910132172,4640348632035],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4433264953970,4640348632035]⟩ +def rear40 : Row := ⟨40,3,3,11,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4422910132172,4640348632035,5156734671662],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4433264953970,4640348632035,1000000000000000000000000000000]⟩ +def rear41 : Row := ⟨41,3,3,12,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4422910132172,4640348632035,5156734671662,5362611246538],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4433264953970,4640348632035,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear42 : Row := ⟨42,3,3,13,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4422910132172,4640348632035,5156734671662,5362611246538,5946670370771],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4433264953970,4640348632035,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear43 : Row := ⟨43,3,3,14,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4422910132172,4640348632035,5156734671662,5362611246538,5946670370771,6153754048836],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4433264953970,4640348632035,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear44 : Row := ⟨44,3,3,15,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4422910132172,4640348632035,5156734671662,5362611246538,5946670370771,6153754048836,6585690354682],[1000000000000000000000000000000,1027126667393,1469165827587,1760951206883,1966827781759,2550886905992,2757970584057,3189906889903,3395783464779,4433264953970,4640348632035,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear45 : Row := ⟨45,3,4,3,1725436572984891677951467423971062446496094382868200824551407605514240,[0,770345000544,1218398305457,1546646832318],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318]⟩ +def rear46 : Row := ⟨46,3,4,4,1725436586697640898959295112272958727406674468635681809116020569276416,[0,770345000544,1218398305457,1546646832318,1752523407194],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194]⟩ +def rear47 : Row := ⟨47,3,4,5,1725436586697640898962264512335118362156649842518275365008053446377472,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473]⟩ +def rear48 : Row := ⟨48,3,4,6,1725436586697640898968203312459437631656600590283462476792119200579584,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538]⟩ +def rear49 : Row := ⟨49,3,4,7,1725436586697640898968203312807886775465088746904641456538550479618048,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338]⟩ +def rear50 : Row := ⟨50,3,4,8,1725436586697640898968203313504785063082065060146999416031413037694976,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214]⟩ +def rear51 : Row := ⟨51,3,4,9,1725436586697640898968203313504785063082067536027077986791962835943424,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,3951824090758],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,4218960579405]⟩ +def rear52 : Row := ⟨52,3,4,10,1725436586697640898968203313504785063082072487787235128313062432440320,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,3951824090758,4191148591732],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,4218960579405,4426044257470]⟩ +def rear53 : Row := ⟨53,3,4,11,1725436586697640898968203313504785063082072487787235128313062432440320,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,3951824090758,4191148591732,4670166691011],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,4218960579405,4426044257470,1000000000000000000000000000000]⟩ +def rear54 : Row := ⟨54,3,4,12,1725436586697640898968203313504785063082072487787235128313062432440320,[0,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,3951824090758,4191148591732,4670166691011,4877250369076],[1000000000000000000000000000000,770345000544,1218398305457,1546646832318,1752523407194,2231541506473,2438625184538,2975602515338,3181479090214,4218960579405,4426044257470,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear55 : Row := ⟨55,4,1,4,1725436586697640946849780764332285624630501836782856782355286582099968,[0,2855655060065,3252325296689,3537535918888,3743412493764],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764]⟩ +def rear56 : Row := ⟨56,4,1,6,1725436586697640946858688964519793434364829842347494516881757994745856,[0,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046]⟩ +def rear57 : Row := ⟨57,4,1,7,1725436586697640946858688964869614341383520862114826843778097958879232,[0,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021]⟩ +def rear58 : Row := ⟨58,4,1,8,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897]⟩ +def rear59 : Row := ⟨59,4,1,9,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,7872572861745],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,1000000000000000000000000000000]⟩ +def rear60 : Row := ⟨60,4,1,10,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,7872572861745,8079656539810],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear61 : Row := ⟨61,4,1,11,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,7872572861745,8079656539810,8465404414027],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear62 : Row := ⟨62,4,1,12,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,7872572861745,8079656539810,8465404414027,8672488092092],[1000000000000000000000000000000,2855655060065,3252325296689,3537535918888,3743412493764,4129160367981,4336244046046,5196789101021,5402665675897,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear63 : Row := ⟨63,4,2,2,1725429058513974481006928856009369042408591087781735667604368899702784,[0,1427827530032,1824497766656],[1000000000000000000000000000000,1427827530032,1824497766656]⟩ +def rear64 : Row := ⟨64,4,2,3,1725436572984891677951467423971191030149188575169341034321976229888000,[0,1427827530032,1824497766656,2109708388855],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855]⟩ +def rear65 : Row := ⟨65,4,2,4,1725436586697640946849780764332285583092126968504235754111315948339200,[0,1427827530032,1824497766656,2109708388855,2315584963731],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731]⟩ +def rear66 : Row := ⟨66,4,2,5,1725436586697640946852750164394788158644653058173367646790825996713984,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948]⟩ +def rear67 : Row := ⟨67,4,2,6,1725436586697640946858688964519793309749705237511631432149846093463552,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013]⟩ +def rear68 : Row := ⟨68,4,2,7,1725436586697640946858688964869614216768396257278963759046186057596928,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988]⟩ +def rear69 : Row := ⟨69,4,2,8,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864]⟩ +def rear70 : Row := ⟨70,4,2,9,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,5016917801679],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,1000000000000000000000000000000]⟩ +def rear71 : Row := ⟨71,4,2,10,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,5016917801679,5224001479744],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear72 : Row := ⟨72,4,2,11,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,5016917801679,5224001479744,5609749353961],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear73 : Row := ⟨73,4,2,12,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,5016917801679,5224001479744,5609749353961,5816833032026],[1000000000000000000000000000000,1427827530032,1824497766656,2109708388855,2315584963731,2701332837948,2908416516013,3768961570988,3974838145864,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear74 : Row := ⟨74,4,3,2,1725429058513974481006928856009368710101592141552767441652603829616640,[0,951885020021,1348555256645],[1000000000000000000000000000000,951885020021,1348555256645]⟩ +def rear75 : Row := ⟨75,4,3,3,1725436572984891677951467423971190033228191736482436356466681019629568,[0,951885020021,1348555256645,1633765878844],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844]⟩ +def rear76 : Row := ⟨76,4,3,4,1725436586697640946849780764332283256943134344901458172448960457736192,[0,951885020021,1348555256645,1633765878844,1839642453720],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844,1839642453720]⟩ +def rear77 : Row := ⟨77,4,3,5,1725436586697640946852750164394783174039668864738844257514349945421824,[0,951885020021,1348555256645,1633765878844,1839642453720,2225390327937],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844,1839642453720,2225390327937]⟩ +def rear78 : Row := ⟨78,4,3,6,1725436586697640946858688964519783008232737904413616427645128920793088,[0,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002]⟩ +def rear79 : Row := ⟨79,4,3,7,1725436586697640946858688964869593281427462644853965524084986642169856,[0,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977]⟩ +def rear80 : Row := ⟨80,4,3,8,1725436586697640946858688965569213827816912125734663716964702084923392,[0,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977,3498895635853],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977,3498895635853]⟩ +def rear81 : Row := ⟨81,4,3,9,1725436586697640946858688965569213827816912125734663716964702084923392,[0,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977,3498895635853,4065032781657],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977,3498895635853,1000000000000000000000000000000]⟩ +def rear82 : Row := ⟨82,4,3,10,1725436586697640946858688965569213827816912125734663716964702084923392,[0,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977,3498895635853,4065032781657,4272116459722],[1000000000000000000000000000000,951885020021,1348555256645,1633765878844,1839642453720,2225390327937,2432474006002,3293019060977,3498895635853,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear83 : Row := ⟨83,4,4,1,1653786614870979874242332953218776295840243179859395196846919280230400,[0,713913765016],[1000000000000000000000000000000,713913765016]⟩ +def rear84 : Row := ⟨84,4,4,2,1725429058513974481006928856009326174805727024244834519826674858590208,[0,713913765016,1090966428607],[1000000000000000000000000000000,713913765016,1090966428607]⟩ +def rear85 : Row := ⟨85,4,4,3,1725436572984891677951467423971062427340596384558637590988894106550272,[0,713913765016,1090966428607,1382751807903],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903]⟩ +def rear86 : Row := ⟨86,4,4,4,1725436586697640898959295112272958686173733925298765731581860092313600,[0,713913765016,1090966428607,1382751807903,1588628382779],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1588628382779]⟩ +def rear87 : Row := ⟨87,4,4,5,1725436586697640898962264512335118320903347506672688442039817811787776,[0,713913765016,1090966428607,1382751807903,1588628382779,1987419072932],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1588628382779,1987419072932]⟩ +def rear88 : Row := ⟨88,4,4,6,1725436586697640898968203312459437590362574669420533862955733250736128,[0,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997]⟩ +def rear89 : Row := ⟨89,4,4,7,1725436586697640898968203312807886734089615656007029460965863899267072,[0,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,2908416516013],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,3055047805972]⟩ +def rear90 : Row := ⟨90,4,4,8,1725436586697640898968203313504785021543697629180020656986125196328960,[0,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,2908416516013,3177256765558],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,3055047805972,3260924380848]⟩ +def rear91 : Row := ⟨91,4,4,9,1725436586697640898968203313504785021543697629180020656986125196328960,[0,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,2908416516013,3177256765558,3576047455711],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,3055047805972,3260924380848,1000000000000000000000000000000]⟩ +def rear92 : Row := ⟨92,4,4,10,1725436586697640898968203313504785021543697629180020656986125196328960,[0,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,2908416516013,3177256765558,3576047455711,3783131133776],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1588628382779,1987419072932,2194502750997,3055047805972,3260924380848,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear93 : Row := ⟨93,4,5,2,1725429058513974481006928855992992621193521977998592538669949984440320,[0,571131012013,899359188895],[1000000000000000000000000000000,571131012013,899359188895]⟩ +def rear94 : Row := ⟨94,4,5,3,1725436572984891582170496119814897154848762079756415658785340930392064,[0,571131012013,899359188895,1191144568191],[1000000000000000000000000000000,571131012013,899359188895,1191144568191]⟩ +def rear95 : Row := ⟨95,4,5,4,1725436586697640611616381199837129975922641103384583897284650312138752,[0,571131012013,899359188895,1191144568191,1397021143067],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1397021143067]⟩ +def rear96 : Row := ⟨96,4,5,5,1725436586697640611619350599812177324720494438111882708240075369480192,[0,571131012013,899359188895,1191144568191,1397021143067,1844636319929],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1397021143067,1844636319929]⟩ +def rear97 : Row := ⟨97,4,5,6,1725436586697640611625289399762272022316201107566480330150925484163072,[0,571131012013,899359188895,1191144568191,1397021143067,1844636319929,2051719997994],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1397021143067,1844636319929,2051719997994]⟩ +def rear98 : Row := ⟨98,4,5,7,1725436586697640611625289399762272022316201107566480330150925484163072,[0,571131012013,899359188895,1191144568191,1397021143067,1844636319929,2051719997994,2588165711258],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1397021143067,1844636319929,2051719997994,1000000000000000000000000000000]⟩ +def rear99 : Row := ⟨99,4,5,8,1725436586697640611625289399762272022316201107566480330150925484163072,[0,571131012013,899359188895,1191144568191,1397021143067,1844636319929,2051719997994,2588165711258,2794042286134],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1397021143067,1844636319929,2051719997994,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear100 : Row := ⟨100,4,6,1,1653786614870979874242332953213331777969508164443981203128010988847104,[0,475942510010],[1000000000000000000000000000000,475942510010]⟩ +def rear101 : Row := ⟨101,4,6,2,1725429058513974481006928854599196046285358031652610146629427390316544,[0,475942510010,771621029088],[1000000000000000000000000000000,475942510010,771621029088]⟩ +def rear102 : Row := ⟨102,4,6,3,1725436572984891582170496115633507430124270240718468482663773148020736,[0,475942510010,771621029088,1063406408384],[1000000000000000000000000000000,475942510010,771621029088,1063406408384]⟩ +def rear103 : Row := ⟨103,4,6,4,1725436586697640228492495973608339361978736691385411248316211607371776,[0,475942510010,771621029088,1063406408384,1269282983260],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1269282983260]⟩ +def rear104 : Row := ⟨104,4,6,5,1725436586697640228495465362433014111511278455344850922947455911723008,[0,475942510010,771621029088,1063406408384,1269282983260,1745225493270],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1269282983260,1749447817926]⟩ +def rear105 : Row := ⟨105,4,6,6,1725436586697640228501404140082363610576361983263730272209944520425472,[0,475942510010,771621029088,1063406408384,1269282983260,1745225493270,1956531495991],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1269282983260,1749447817926,1956531495991]⟩ +def rear106 : Row := ⟨106,4,6,7,1725436586697640228501404140082363610576361983263730272209944520425472,[0,475942510010,771621029088,1063406408384,1269282983260,1745225493270,1956531495991,2332689391644],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1269282983260,1749447817926,1956531495991,1000000000000000000000000000000]⟩ +def rear107 : Row := ⟨107,4,6,8,1725436586697640228501404140082363610576361983263730272209944520425472,[0,475942510010,771621029088,1063406408384,1269282983260,1745225493270,1956531495991,2332689391644,2538565966520],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1269282983260,1749447817926,1956531495991,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear108 : Row := ⟨108,4,7,2,1725429058513973714759158287850295675928105607283708701369697262632960,[0,407950722866,680379486368],[1000000000000000000000000000000,407950722866,680379486368]⟩ +def rear109 : Row := ⟨109,4,7,3,1725436572984889283427184504589787113175005533754637237478028788891648,[0,407950722866,680379486368,972164865664],[1000000000000000000000000000000,407950722866,680379486368,972164865664]⟩ +def rear110 : Row := ⟨110,4,7,4,1725436586697634864758102273974979151845447419231720403278438785351680,[0,407950722866,680379486368,972164865664,1178041440540],[1000000000000000000000000000000,407950722866,680379486368,972164865664,1178041440540]⟩ +def rear111 : Row := ⟨111,4,8,1,1653786614870979874242330054116455968988499764800605758841015211393024,[0,356956882508],[1000000000000000000000000000000,356956882508]⟩ +def rear112 : Row := ⟨112,4,8,2,1725429058513967584776986260808706006780710656331157529442390231744512,[0,356956882508,611948329328],[1000000000000000000000000000000,356956882508,611948329328]⟩ +def rear113 : Row := ⟨113,4,8,3,1725436572984870893480674132455788929572344914040861519676653227212800,[0,356956882508,611948329328,903733708624],[1000000000000000000000000000000,356956882508,611948329328,903733708624]⟩ +def rear114 : Row := ⟨114,4,8,4,1725436586697591954882915211656163939332255461995495593728926162092032,[0,356956882508,611948329328,903733708624,1109610283500],[1000000000000000000000000000000,356956882508,611948329328,903733708624,1109610283500]⟩ +def rear115 : Row := ⟨115,5,1,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2571652494777,2841357121372,2996368104123,3202244678999],[1000000000000000000000000000000,2571652494777,2841357121372,2996368104123,3202244678999]⟩ +def rear116 : Row := ⟨116,5,1,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2571652494777,2841357121372,2996368104123,3202244678999,5773897173776,5992736208246],[1000000000000000000000000000000,2571652494777,2841357121372,2996368104123,3202244678999,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear117 : Row := ⟨117,5,1,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2571652494777,2841357121372,2996368104123,3202244678999,5773897173776,5992736208246,6198612783122,6404489357998],[1000000000000000000000000000000,2571652494777,2841357121372,2996368104123,3202244678999,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear118 : Row := ⟨118,5,2,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,1285826247388,1555530873983],[1000000000000000000000000000000,1285826247388,1555530873983]⟩ +def rear119 : Row := ⟨119,5,2,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,1285826247388,1555530873983,1710541856734],[1000000000000000000000000000000,1285826247388,1555530873983,1710541856734]⟩ +def rear120 : Row := ⟨120,5,2,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1285826247388,1555530873983,1710541856734,1916418431610],[1000000000000000000000000000000,1285826247388,1555530873983,1710541856734,1916418431610]⟩ +def rear121 : Row := ⟨121,5,2,5,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1285826247388,1555530873983,1710541856734,1916418431610,3202244678998],[1000000000000000000000000000000,1285826247388,1555530873983,1710541856734,1916418431610,1000000000000000000000000000000]⟩ +def rear122 : Row := ⟨122,5,2,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1285826247388,1555530873983,1710541856734,1916418431610,3202244678998,3421083713468],[1000000000000000000000000000000,1285826247388,1555530873983,1710541856734,1916418431610,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear123 : Row := ⟨123,5,2,7,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1285826247388,1555530873983,1710541856734,1916418431610,3202244678998,3421083713468,3626960288344],[1000000000000000000000000000000,1285826247388,1555530873983,1710541856734,1916418431610,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear124 : Row := ⟨124,5,2,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1285826247388,1555530873983,1710541856734,1916418431610,3202244678998,3421083713468,3626960288344,3832836863220],[1000000000000000000000000000000,1285826247388,1555530873983,1710541856734,1916418431610,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear125 : Row := ⟨125,5,3,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,857217498259,1126922124854],[1000000000000000000000000000000,857217498259,1126922124854]⟩ +def rear126 : Row := ⟨126,5,3,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,857217498259,1126922124854,1281933107605],[1000000000000000000000000000000,857217498259,1126922124854,1281933107605]⟩ +def rear127 : Row := ⟨127,5,3,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,857217498259,1126922124854,1281933107605,1487809682481],[1000000000000000000000000000000,857217498259,1126922124854,1281933107605,1487809682481]⟩ +def rear128 : Row := ⟨128,5,3,5,1725436586697640898968203313510229539414432644595434650705033487712256,[0,857217498259,1126922124854,1281933107605,1487809682481,2345027180740],[1000000000000000000000000000000,857217498259,1126922124854,1281933107605,1487809682481,1000000000000000000000000000000]⟩ +def rear129 : Row := ⟨129,5,3,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,857217498259,1126922124854,1281933107605,1487809682481,2345027180740,2563866215210],[1000000000000000000000000000000,857217498259,1126922124854,1281933107605,1487809682481,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear130 : Row := ⟨130,5,3,7,1725436586697640898968203313510229539414432644595434650705033487712256,[0,857217498259,1126922124854,1281933107605,1487809682481,2345027180740,2563866215210,2769742790086],[1000000000000000000000000000000,857217498259,1126922124854,1281933107605,1487809682481,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear131 : Row := ⟨131,5,3,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,857217498259,1126922124854,1281933107605,1487809682481,2345027180740,2563866215210,2769742790086,2975619364962],[1000000000000000000000000000000,857217498259,1126922124854,1281933107605,1487809682481,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear132 : Row := ⟨132,5,4,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,642913123694],[1000000000000000000000000000000,642913123694]⟩ +def rear133 : Row := ⟨133,5,4,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,642913123694,912617750289],[1000000000000000000000000000000,642913123694,912617750289]⟩ +def rear134 : Row := ⟨134,5,4,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,642913123694,912617750289,1067628733040],[1000000000000000000000000000000,642913123694,912617750289,1067628733040]⟩ +def rear135 : Row := ⟨135,5,4,4,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642913123694,912617750289,1067628733040,1273505307916],[1000000000000000000000000000000,642913123694,912617750289,1067628733040,1273505307916]⟩ +def rear136 : Row := ⟨136,5,4,5,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642913123694,912617750289,1067628733040,1273505307916,1916418431610],[1000000000000000000000000000000,642913123694,912617750289,1067628733040,1273505307916,1000000000000000000000000000000]⟩ +def rear137 : Row := ⟨137,5,4,6,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642913123694,912617750289,1067628733040,1273505307916,1916418431610,2135257466080],[1000000000000000000000000000000,642913123694,912617750289,1067628733040,1273505307916,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear138 : Row := ⟨138,5,4,7,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642913123694,912617750289,1067628733040,1273505307916,1916418431610,2135257466080,2341134040956],[1000000000000000000000000000000,642913123694,912617750289,1067628733040,1273505307916,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear139 : Row := ⟨139,5,4,8,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642913123694,912617750289,1067628733040,1273505307916,1916418431610,2135257466080,2341134040956,2547010615832],[1000000000000000000000000000000,642913123694,912617750289,1067628733040,1273505307916,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear140 : Row := ⟨140,5,5,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,514330498955,765906245829],[1000000000000000000000000000000,514330498955,765906245829]⟩ +def rear141 : Row := ⟨141,5,5,3,1725436572984891535880517150478355001856677197196097826469908263731200,[0,514330498955,765906245829,939046108301],[1000000000000000000000000000000,514330498955,765906245829,939046108301]⟩ +def rear142 : Row := ⟨142,5,5,4,1725436586697640563734803749097041773526020455465300734105850510049280,[0,514330498955,765906245829,939046108301,1144922683177],[1000000000000000000000000000000,514330498955,765906245829,939046108301,1144922683177]⟩ +def rear143 : Row := ⟨143,5,5,5,1725436586697640563734803749097041773526020455465300734105850510049280,[0,514330498955,765906245829,939046108301,1144922683177,1659253182132],[1000000000000000000000000000000,514330498955,765906245829,939046108301,1144922683177,1000000000000000000000000000000]⟩ +def rear144 : Row := ⟨144,5,5,6,1725436586697640563734803749097041773526020455465300734105850510049280,[0,514330498955,765906245829,939046108301,1144922683177,1659253182132,1878092216602],[1000000000000000000000000000000,514330498955,765906245829,939046108301,1144922683177,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear145 : Row := ⟨145,5,6,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,428608749129],[1000000000000000000000000000000,428608749129]⟩ +def rear146 : Row := ⟨146,5,6,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,428608749129,660410243199],[1000000000000000000000000000000,428608749129,660410243199]⟩ +def rear147 : Row := ⟨147,5,6,3,1725436572984891535880517150478355001856677197196097826469908263731200,[0,428608749129,660410243199,853324358475],[1000000000000000000000000000000,428608749129,660410243199,853324358475]⟩ +def rear148 : Row := ⟨148,5,6,4,1725436586697640180610918532624827183939263667888004829421069964148736,[0,428608749129,660410243199,853324358475,1059200933351],[1000000000000000000000000000000,428608749129,660410243199,853324358475,1059200933351]⟩ +def rear149 : Row := ⟨149,5,6,5,1725436586697640180610918532624827183939263667888004829421069964148736,[0,428608749129,660410243199,853324358475,1059200933351,1487809682480],[1000000000000000000000000000000,428608749129,660410243199,853324358475,1059200933351,1000000000000000000000000000000]⟩ +def rear150 : Row := ⟨150,5,6,6,1725436586697640180610918532624827183939263667888004829421069964148736,[0,428608749129,660410243199,853324358475,1059200933351,1487809682480,1706648716950],[1000000000000000000000000000000,428608749129,660410243199,853324358475,1059200933351,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear151 : Row := ⟨151,5,7,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,367378927825],[1000000000000000000000000000000,367378927825]⟩ +def rear152 : Row := ⟨152,5,7,2,1725429058513973669264978694413794313730191402963165562416639793692672,[0,367378927825,585055955606],[1000000000000000000000000000000,367378927825,585055955606]⟩ +def rear153 : Row := ⟨153,5,7,3,1725436572984889237137205851645067464336136471732322398361224988327936,[0,367378927825,585055955606,792094537171],[1000000000000000000000000000000,367378927825,585055955606,792094537171]⟩ +def rear154 : Row := ⟨154,5,7,4,1725436586697634816876525502013822929724668641805862163834142321541120,[0,367378927825,585055955606,792094537171,997971112047],[1000000000000000000000000000000,367378927825,585055955606,792094537171,997971112047]⟩ +def rear155 : Row := ⟨155,5,7,5,1725436586697634816876525502013822929724668641805862163834142321541120,[0,367378927825,585055955606,792094537171,997971112047,1365350039872],[1000000000000000000000000000000,367378927825,585055955606,792094537171,997971112047,1000000000000000000000000000000]⟩ +def rear156 : Row := ⟨156,5,7,6,1725436586697634816876525502013822929724668641805862163834142321541120,[0,367378927825,585055955606,792094537171,997971112047,1365350039872,1583027067653],[1000000000000000000000000000000,367378927825,585055955606,792094537171,997971112047,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear157 : Row := ⟨157,5,8,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,321456561847],[1000000000000000000000000000000,321456561847]⟩ +def rear158 : Row := ⟨158,5,8,2,1725429058513967539282815230858360880342082801726431087460151059283968,[0,321456561847,528540239912],[1000000000000000000000000000000,321456561847,528540239912]⟩ +def rear159 : Row := ⟨159,5,8,3,1725436572984870847190715460978767164171810668022118973491758785101824,[0,321456561847,528540239912,746172171193],[1000000000000000000000000000000,321456561847,528540239912,746172171193]⟩ +def rear160 : Row := ⟨160,5,8,4,1725436586697591907001381257125788896007908433148720839138721180680192,[0,321456561847,528540239912,746172171193,952048746069],[1000000000000000000000000000000,321456561847,528540239912,746172171193,952048746069]⟩ +def rear161 : Row := ⟨161,5,8,5,1725436586697591907001381257125788896007908433148720839138721180680192,[0,321456561847,528540239912,746172171193,952048746069,1273505307916],[1000000000000000000000000000000,321456561847,528540239912,746172171193,952048746069,1000000000000000000000000000000]⟩ +def rear162 : Row := ⟨162,5,8,6,1725436586697591907001381257125788896007908433148720839138721180680192,[0,321456561847,528540239912,746172171193,952048746069,1273505307916,1480588985981],[1000000000000000000000000000000,321456561847,528540239912,746172171193,952048746069,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear163 : Row := ⟨163,5,9,1,1653786614870930819220298669022873459737421670038487811861692278636544,[0,285739166086],[1000000000000000000000000000000,285739166086]⟩ +def rear164 : Row := ⟨164,5,9,2,1725429058513820419710892105527958479027476372044803688504421433475072,[0,285739166086,484583572149],[1000000000000000000000000000000,285739166086,484583572149]⟩ +def rear165 : Row := ⟨165,5,9,3,1725436572984527568189561501874494894437728998764988375928389658214400,[0,285739166086,484583572149,710454775432],[1000000000000000000000000000000,285739166086,484583572149,710454775432]⟩ +def rear166 : Row := ⟨166,5,9,4,1725436586696856309141765630473776889434876284740583844360073051635712,[0,285739166086,484583572149,710454775432,916331350308],[1000000000000000000000000000000,285739166086,484583572149,710454775432,916331350308]⟩ +def rear167 : Row := ⟨167,5,10,1,1653786614870930819220298669022873459737421670038487811861692278636544,[0,257165249477],[1000000000000000000000000000000,257165249477]⟩ +def rear168 : Row := ⟨168,5,10,2,1725429058513035781993968770432479005349575413742790894073863429160960,[0,257165249477,449418237939],[1000000000000000000000000000000,257165249477,449418237939]⟩ +def rear169 : Row := ⟨169,5,10,3,1725436572982173655038791496588056473404026123858949992636715645272064,[0,257165249477,449418237939,681880858823],[1000000000000000000000000000000,257165249477,449418237939,681880858823]⟩ +def rear170 : Row := ⟨170,5,10,4,1725436586691363845123302284805420573689569576626494283346167021436928,[0,257165249477,449418237939,681880858823,887757433699],[1000000000000000000000000000000,257165249477,449418237939,681880858823,887757433699]⟩ +def rear171 : Row := ⟨171,5,11,1,1653786614864653717484911988259037670314214003622385456417228244123648,[0,233786590434],[1000000000000000000000000000000,233786590434]⟩ +def rear172 : Row := ⟨172,5,11,2,1725429058494204476787808728140971637079952414494483827740471325622272,[0,233786590434,420646600858],[1000000000000000000000000000000,233786590434,420646600858]⟩ +def rear173 : Row := ⟨173,5,12,1,1653786614764220089718725096037665039542891340964747769305803691917312,[0,214304374564],[1000000000000000000000000000000,214304374564]⟩ +def rear174 : Row := ⟨174,5,12,2,1725429058192903593489248051476853744765984426521570766406197669003264,[0,214304374564,396670236624],[1000000000000000000000000000000,214304374564,396670236624]⟩ +def rear175 : Row := ⟨175,6,3,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,729463448244,862393678294,1591857126538,1724787356588],[1000000000000000000000000000000,729463448244,862393678294,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear176 : Row := ⟨176,6,4,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,547097586183,680027816233,1227125402416],[1000000000000000000000000000000,547097586183,680027816233,1000000000000000000000000000000]⟩ +def rear177 : Row := ⟨177,6,4,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,547097586183,680027816233,1227125402416,1360055632466],[1000000000000000000000000000000,547097586183,680027816233,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear178 : Row := ⟨178,6,5,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,437678068946,570608298996,1008286367942,1141216597992],[1000000000000000000000000000000,437678068946,570608298996,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear179 : Row := ⟨179,6,6,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,364731724122,497661954172],[1000000000000000000000000000000,364731724122,497661954172]⟩ +def rear180 : Row := ⟨180,6,6,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,364731724122,497661954172,862393678294],[1000000000000000000000000000000,364731724122,497661954172,1000000000000000000000000000000]⟩ +def rear181 : Row := ⟨181,6,6,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,364731724122,497661954172,862393678294,995323908344],[1000000000000000000000000000000,364731724122,497661954172,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear182 : Row := ⟨182,6,7,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,312627192104,445557422154],[1000000000000000000000000000000,312627192104,445557422154]⟩ +def rear183 : Row := ⟨183,6,7,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,312627192104,445557422154,758184614258],[1000000000000000000000000000000,312627192104,445557422154,1000000000000000000000000000000]⟩ +def rear184 : Row := ⟨184,6,7,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,312627192104,445557422154,758184614258,891114844308],[1000000000000000000000000000000,312627192104,445557422154,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear185 : Row := ⟨185,6,8,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,273548793091],[1000000000000000000000000000000,273548793091]⟩ +def rear186 : Row := ⟨186,6,8,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,273548793091,406479023141],[1000000000000000000000000000000,273548793091,406479023141]⟩ +def rear187 : Row := ⟨187,6,8,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,273548793091,406479023141,680027816232],[1000000000000000000000000000000,273548793091,406479023141,1000000000000000000000000000000]⟩ +def rear188 : Row := ⟨188,6,8,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,273548793091,406479023141,680027816232,812958046282],[1000000000000000000000000000000,273548793091,406479023141,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear189 : Row := ⟨189,6,9,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,243154482748,376084712798],[1000000000000000000000000000000,243154482748,376084712798]⟩ +def rear190 : Row := ⟨190,6,9,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,243154482748,376084712798,619239195546],[1000000000000000000000000000000,243154482748,376084712798,1000000000000000000000000000000]⟩ +def rear191 : Row := ⟨191,6,9,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,243154482748,376084712798,619239195546,752169425596],[1000000000000000000000000000000,243154482748,376084712798,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear192 : Row := ⟨192,6,10,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,218839034473],[1000000000000000000000000000000,218839034473]⟩ +def rear193 : Row := ⟨193,6,10,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218839034473,351769264523],[1000000000000000000000000000000,218839034473,351769264523]⟩ +def rear194 : Row := ⟨194,6,10,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218839034473,351769264523,570608298996],[1000000000000000000000000000000,218839034473,351769264523,1000000000000000000000000000000]⟩ +def rear195 : Row := ⟨195,6,10,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218839034473,351769264523,570608298996,703538529046],[1000000000000000000000000000000,218839034473,351769264523,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear196 : Row := ⟨196,6,11,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,198944576793],[1000000000000000000000000000000,198944576793]⟩ +def rear197 : Row := ⟨197,6,11,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198944576793,331874806843],[1000000000000000000000000000000,198944576793,331874806843]⟩ +def rear198 : Row := ⟨198,6,11,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198944576793,331874806843,530819383636],[1000000000000000000000000000000,198944576793,331874806843,1000000000000000000000000000000]⟩ +def rear199 : Row := ⟨199,6,11,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198944576793,331874806843,530819383636,663749613686],[1000000000000000000000000000000,198944576793,331874806843,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear200 : Row := ⟨200,6,12,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,182365862061],[1000000000000000000000000000000,182365862061]⟩ +def rear201 : Row := ⟨201,6,12,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182365862061,315296092111],[1000000000000000000000000000000,182365862061,315296092111]⟩ +def rear202 : Row := ⟨202,6,12,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182365862061,315296092111,497661954172],[1000000000000000000000000000000,182365862061,315296092111,1000000000000000000000000000000]⟩ +def rear203 : Row := ⟨203,6,12,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182365862061,315296092111,497661954172,630592184222],[1000000000000000000000000000000,182365862061,315296092111,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rear204 : Row := ⟨204,6,13,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,168337718825],[1000000000000000000000000000000,168337718825]⟩ +def rear205 : Row := ⟨205,6,13,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,168337718825,301267948875],[1000000000000000000000000000000,168337718825,301267948875]⟩ +def rear206 : Row := ⟨206,6,13,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,168337718825,301267948875,469605667700],[1000000000000000000000000000000,168337718825,301267948875,1000000000000000000000000000000]⟩ +def rear207 : Row := ⟨207,6,14,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,156313596052],[1000000000000000000000000000000,156313596052]⟩ +def rear208 : Row := ⟨208,6,14,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,156313596052,289243826102],[1000000000000000000000000000000,156313596052,289243826102]⟩ +def rear209 : Row := ⟨209,6,14,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,156313596052,289243826102,445557422154],[1000000000000000000000000000000,156313596052,289243826102,1000000000000000000000000000000]⟩ +def rear210 : Row := ⟨210,6,15,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,145892689648],[1000000000000000000000000000000,145892689648]⟩ +def rear211 : Row := ⟨211,6,15,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,145892689648,278822919698],[1000000000000000000000000000000,145892689648,278822919698]⟩ +def rear212 : Row := ⟨212,6,15,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,145892689648,278822919698,424715609346],[1000000000000000000000000000000,145892689648,278822919698,1000000000000000000000000000000]⟩ +def rear213 : Row := ⟨213,6,16,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,136774396545],[1000000000000000000000000000000,136774396545]⟩ +def rear214 : Row := ⟨214,6,16,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,136774396545,269704626595],[1000000000000000000000000000000,136774396545,269704626595]⟩ +def rear215 : Row := ⟨215,6,17,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,128728843807],[1000000000000000000000000000000,128728843807]⟩ +def rear216 : Row := ⟨216,6,18,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,121577241374],[1000000000000000000000000000000,121577241374]⟩ +def rear217 : Row := ⟨217,6,19,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,115178439196],[1000000000000000000000000000000,115178439196]⟩ +def rear218 : Row := ⟨218,6,20,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,109419517236],[1000000000000000000000000000000,109419517236]⟩ +def rear219 : Row := ⟨219,7,18,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,88620153367,177240306734],[1000000000000000000000000000000,88620153367,1000000000000000000000000000000]⟩ +def rear220 : Row := ⟨220,7,20,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,79758138030],[1000000000000000000000000000000,79758138030]⟩ +def rear221 : Row := ⟨221,7,20,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,79758138030,159516276060],[1000000000000000000000000000000,79758138030,1000000000000000000000000000000]⟩ +def rear222 : Row := ⟨222,7,22,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,72507398209],[1000000000000000000000000000000,72507398209]⟩ +def rear223 : Row := ⟨223,7,22,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,72507398209,145014796418],[1000000000000000000000000000000,72507398209,1000000000000000000000000000000]⟩ +def rear224 : Row := ⟨224,7,24,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,66465115025],[1000000000000000000000000000000,66465115025]⟩ +def rear225 : Row := ⟨225,7,24,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,66465115025,132930230050],[1000000000000000000000000000000,66465115025,1000000000000000000000000000000]⟩ +def rear226 : Row := ⟨226,7,26,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,61352413869],[1000000000000000000000000000000,61352413869]⟩ +def rear227 : Row := ⟨227,7,28,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,56970098593],[1000000000000000000000000000000,56970098593]⟩ +def rear228 : Row := ⟨228,7,30,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,53172092020],[1000000000000000000000000000000,53172092020]⟩ +def rear229 : Row := ⟨229,8,48,1,0,[0,0],[1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reaR : List Row := [rear0, rear1, rear2, rear3, rear4, rear5, rear6, rear7, rear8, rear9, rear10, rear11, rear12, rear13, rear14, rear15, rear16, rear17, rear18, rear19, rear20, rear21, rear22, rear23, rear24, rear25, rear26, rear27, rear28, rear29, rear30, rear31, rear32, rear33, rear34, rear35, rear36, rear37, rear38, rear39, rear40, rear41, rear42, rear43, rear44, rear45, rear46, rear47, rear48, rear49, rear50, rear51, rear52, rear53, rear54, rear55, rear56, rear57, rear58, rear59, rear60, rear61, rear62, rear63, rear64, rear65, rear66, rear67, rear68, rear69, rear70, rear71, rear72, rear73, rear74, rear75, rear76, rear77, rear78, rear79, rear80, rear81, rear82, rear83, rear84, rear85, rear86, rear87, rear88, rear89, rear90, rear91, rear92, rear93, rear94, rear95, rear96, rear97, rear98, rear99, rear100, rear101, rear102, rear103, rear104, rear105, rear106, rear107, rear108, rear109, rear110, rear111, rear112, rear113, rear114, rear115, rear116, rear117, rear118, rear119, rear120, rear121, rear122, rear123, rear124, rear125, rear126, rear127, rear128, rear129, rear130, rear131, rear132, rear133, rear134, rear135, rear136, rear137, rear138, rear139, rear140, rear141, rear142, rear143, rear144, rear145, rear146, rear147, rear148, rear149, rear150, rear151, rear152, rear153, rear154, rear155, rear156, rear157, rear158, rear159, rear160, rear161, rear162, rear163, rear164, rear165, rear166, rear167, rear168, rear169, rear170, rear171, rear172, rear173, rear174, rear175, rear176, rear177, rear178, rear179, rear180, rear181, rear182, rear183, rear184, rear185, rear186, rear187, rear188, rear189, rear190, rear191, rear192, rear193, rear194, rear195, rear196, rear197, rear198, rear199, rear200, rear201, rear202, rear203, rear204, rear205, rear206, rear207, rear208, rear209, rear210, rear211, rear212, rear213, rear214, rear215, rear216, rear217, rear218, rear219, rear220, rear221, rear222, rear223, rear224, rear225, rear226, rear227, rear228, rear229] +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP0.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP0.lean new file mode 100644 index 0000000000..e0f70edc36 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP0.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac0 : Row.check reaW reaR rear0 = true := by decide +kernel +theorem reac1 : Row.check reaW reaR rear1 = true := by decide +kernel +theorem reac2 : Row.check reaW reaR rear2 = true := by decide +kernel +theorem reac3 : Row.check reaW reaR rear3 = true := by decide +kernel +theorem reac4 : Row.check reaW reaR rear4 = true := by decide +kernel +theorem reac5 : Row.check reaW reaR rear5 = true := by decide +kernel +theorem reac6 : Row.check reaW reaR rear6 = true := by decide +kernel +theorem reac7 : Row.check reaW reaR rear7 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP1.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP1.lean new file mode 100644 index 0000000000..be1b03a208 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP1.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac8 : Row.check reaW reaR rear8 = true := by decide +kernel +theorem reac9 : Row.check reaW reaR rear9 = true := by decide +kernel +theorem reac10 : Row.check reaW reaR rear10 = true := by decide +kernel +theorem reac11 : Row.check reaW reaR rear11 = true := by decide +kernel +theorem reac12 : Row.check reaW reaR rear12 = true := by decide +kernel +theorem reac13 : Row.check reaW reaR rear13 = true := by decide +kernel +theorem reac14 : Row.check reaW reaR rear14 = true := by decide +kernel +theorem reac15 : Row.check reaW reaR rear15 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP10.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP10.lean new file mode 100644 index 0000000000..622f1ed22d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP10.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac80 : Row.check reaW reaR rear80 = true := by decide +kernel +theorem reac81 : Row.check reaW reaR rear81 = true := by decide +kernel +theorem reac82 : Row.check reaW reaR rear82 = true := by decide +kernel +theorem reac83 : Row.check reaW reaR rear83 = true := by decide +kernel +theorem reac84 : Row.check reaW reaR rear84 = true := by decide +kernel +theorem reac85 : Row.check reaW reaR rear85 = true := by decide +kernel +theorem reac86 : Row.check reaW reaR rear86 = true := by decide +kernel +theorem reac87 : Row.check reaW reaR rear87 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP11.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP11.lean new file mode 100644 index 0000000000..405a59872e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP11.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac88 : Row.check reaW reaR rear88 = true := by decide +kernel +theorem reac89 : Row.check reaW reaR rear89 = true := by decide +kernel +theorem reac90 : Row.check reaW reaR rear90 = true := by decide +kernel +theorem reac91 : Row.check reaW reaR rear91 = true := by decide +kernel +theorem reac92 : Row.check reaW reaR rear92 = true := by decide +kernel +theorem reac93 : Row.check reaW reaR rear93 = true := by decide +kernel +theorem reac94 : Row.check reaW reaR rear94 = true := by decide +kernel +theorem reac95 : Row.check reaW reaR rear95 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP12.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP12.lean new file mode 100644 index 0000000000..c5943d8d3e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP12.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac96 : Row.check reaW reaR rear96 = true := by decide +kernel +theorem reac97 : Row.check reaW reaR rear97 = true := by decide +kernel +theorem reac98 : Row.check reaW reaR rear98 = true := by decide +kernel +theorem reac99 : Row.check reaW reaR rear99 = true := by decide +kernel +theorem reac100 : Row.check reaW reaR rear100 = true := by decide +kernel +theorem reac101 : Row.check reaW reaR rear101 = true := by decide +kernel +theorem reac102 : Row.check reaW reaR rear102 = true := by decide +kernel +theorem reac103 : Row.check reaW reaR rear103 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP13.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP13.lean new file mode 100644 index 0000000000..eb147d0481 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP13.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac104 : Row.check reaW reaR rear104 = true := by decide +kernel +theorem reac105 : Row.check reaW reaR rear105 = true := by decide +kernel +theorem reac106 : Row.check reaW reaR rear106 = true := by decide +kernel +theorem reac107 : Row.check reaW reaR rear107 = true := by decide +kernel +theorem reac108 : Row.check reaW reaR rear108 = true := by decide +kernel +theorem reac109 : Row.check reaW reaR rear109 = true := by decide +kernel +theorem reac110 : Row.check reaW reaR rear110 = true := by decide +kernel +theorem reac111 : Row.check reaW reaR rear111 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP14.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP14.lean new file mode 100644 index 0000000000..02e3b721eb --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP14.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac112 : Row.check reaW reaR rear112 = true := by decide +kernel +theorem reac113 : Row.check reaW reaR rear113 = true := by decide +kernel +theorem reac114 : Row.check reaW reaR rear114 = true := by decide +kernel +theorem reac115 : Row.check reaW reaR rear115 = true := by decide +kernel +theorem reac116 : Row.check reaW reaR rear116 = true := by decide +kernel +theorem reac117 : Row.check reaW reaR rear117 = true := by decide +kernel +theorem reac118 : Row.check reaW reaR rear118 = true := by decide +kernel +theorem reac119 : Row.check reaW reaR rear119 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP15.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP15.lean new file mode 100644 index 0000000000..a74fc1580e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP15.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac120 : Row.check reaW reaR rear120 = true := by decide +kernel +theorem reac121 : Row.check reaW reaR rear121 = true := by decide +kernel +theorem reac122 : Row.check reaW reaR rear122 = true := by decide +kernel +theorem reac123 : Row.check reaW reaR rear123 = true := by decide +kernel +theorem reac124 : Row.check reaW reaR rear124 = true := by decide +kernel +theorem reac125 : Row.check reaW reaR rear125 = true := by decide +kernel +theorem reac126 : Row.check reaW reaR rear126 = true := by decide +kernel +theorem reac127 : Row.check reaW reaR rear127 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP16.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP16.lean new file mode 100644 index 0000000000..ad6aa5c2a7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP16.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac128 : Row.check reaW reaR rear128 = true := by decide +kernel +theorem reac129 : Row.check reaW reaR rear129 = true := by decide +kernel +theorem reac130 : Row.check reaW reaR rear130 = true := by decide +kernel +theorem reac131 : Row.check reaW reaR rear131 = true := by decide +kernel +theorem reac132 : Row.check reaW reaR rear132 = true := by decide +kernel +theorem reac133 : Row.check reaW reaR rear133 = true := by decide +kernel +theorem reac134 : Row.check reaW reaR rear134 = true := by decide +kernel +theorem reac135 : Row.check reaW reaR rear135 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP17.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP17.lean new file mode 100644 index 0000000000..c1f1b23667 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP17.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac136 : Row.check reaW reaR rear136 = true := by decide +kernel +theorem reac137 : Row.check reaW reaR rear137 = true := by decide +kernel +theorem reac138 : Row.check reaW reaR rear138 = true := by decide +kernel +theorem reac139 : Row.check reaW reaR rear139 = true := by decide +kernel +theorem reac140 : Row.check reaW reaR rear140 = true := by decide +kernel +theorem reac141 : Row.check reaW reaR rear141 = true := by decide +kernel +theorem reac142 : Row.check reaW reaR rear142 = true := by decide +kernel +theorem reac143 : Row.check reaW reaR rear143 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP18.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP18.lean new file mode 100644 index 0000000000..66b4dc4433 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP18.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac144 : Row.check reaW reaR rear144 = true := by decide +kernel +theorem reac145 : Row.check reaW reaR rear145 = true := by decide +kernel +theorem reac146 : Row.check reaW reaR rear146 = true := by decide +kernel +theorem reac147 : Row.check reaW reaR rear147 = true := by decide +kernel +theorem reac148 : Row.check reaW reaR rear148 = true := by decide +kernel +theorem reac149 : Row.check reaW reaR rear149 = true := by decide +kernel +theorem reac150 : Row.check reaW reaR rear150 = true := by decide +kernel +theorem reac151 : Row.check reaW reaR rear151 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP19.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP19.lean new file mode 100644 index 0000000000..ef531588c7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP19.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac152 : Row.check reaW reaR rear152 = true := by decide +kernel +theorem reac153 : Row.check reaW reaR rear153 = true := by decide +kernel +theorem reac154 : Row.check reaW reaR rear154 = true := by decide +kernel +theorem reac155 : Row.check reaW reaR rear155 = true := by decide +kernel +theorem reac156 : Row.check reaW reaR rear156 = true := by decide +kernel +theorem reac157 : Row.check reaW reaR rear157 = true := by decide +kernel +theorem reac158 : Row.check reaW reaR rear158 = true := by decide +kernel +theorem reac159 : Row.check reaW reaR rear159 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP2.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP2.lean new file mode 100644 index 0000000000..7c9de15c1c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP2.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac16 : Row.check reaW reaR rear16 = true := by decide +kernel +theorem reac17 : Row.check reaW reaR rear17 = true := by decide +kernel +theorem reac18 : Row.check reaW reaR rear18 = true := by decide +kernel +theorem reac19 : Row.check reaW reaR rear19 = true := by decide +kernel +theorem reac20 : Row.check reaW reaR rear20 = true := by decide +kernel +theorem reac21 : Row.check reaW reaR rear21 = true := by decide +kernel +theorem reac22 : Row.check reaW reaR rear22 = true := by decide +kernel +theorem reac23 : Row.check reaW reaR rear23 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP20.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP20.lean new file mode 100644 index 0000000000..8e6c817711 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP20.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac160 : Row.check reaW reaR rear160 = true := by decide +kernel +theorem reac161 : Row.check reaW reaR rear161 = true := by decide +kernel +theorem reac162 : Row.check reaW reaR rear162 = true := by decide +kernel +theorem reac163 : Row.check reaW reaR rear163 = true := by decide +kernel +theorem reac164 : Row.check reaW reaR rear164 = true := by decide +kernel +theorem reac165 : Row.check reaW reaR rear165 = true := by decide +kernel +theorem reac166 : Row.check reaW reaR rear166 = true := by decide +kernel +theorem reac167 : Row.check reaW reaR rear167 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP21.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP21.lean new file mode 100644 index 0000000000..f5d52e9c3e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP21.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac168 : Row.check reaW reaR rear168 = true := by decide +kernel +theorem reac169 : Row.check reaW reaR rear169 = true := by decide +kernel +theorem reac170 : Row.check reaW reaR rear170 = true := by decide +kernel +theorem reac171 : Row.check reaW reaR rear171 = true := by decide +kernel +theorem reac172 : Row.check reaW reaR rear172 = true := by decide +kernel +theorem reac173 : Row.check reaW reaR rear173 = true := by decide +kernel +theorem reac174 : Row.check reaW reaR rear174 = true := by decide +kernel +theorem reac175 : Row.check reaW reaR rear175 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP22.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP22.lean new file mode 100644 index 0000000000..41505a8946 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP22.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac176 : Row.check reaW reaR rear176 = true := by decide +kernel +theorem reac177 : Row.check reaW reaR rear177 = true := by decide +kernel +theorem reac178 : Row.check reaW reaR rear178 = true := by decide +kernel +theorem reac179 : Row.check reaW reaR rear179 = true := by decide +kernel +theorem reac180 : Row.check reaW reaR rear180 = true := by decide +kernel +theorem reac181 : Row.check reaW reaR rear181 = true := by decide +kernel +theorem reac182 : Row.check reaW reaR rear182 = true := by decide +kernel +theorem reac183 : Row.check reaW reaR rear183 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP23.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP23.lean new file mode 100644 index 0000000000..ba61a66347 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP23.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac184 : Row.check reaW reaR rear184 = true := by decide +kernel +theorem reac185 : Row.check reaW reaR rear185 = true := by decide +kernel +theorem reac186 : Row.check reaW reaR rear186 = true := by decide +kernel +theorem reac187 : Row.check reaW reaR rear187 = true := by decide +kernel +theorem reac188 : Row.check reaW reaR rear188 = true := by decide +kernel +theorem reac189 : Row.check reaW reaR rear189 = true := by decide +kernel +theorem reac190 : Row.check reaW reaR rear190 = true := by decide +kernel +theorem reac191 : Row.check reaW reaR rear191 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP24.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP24.lean new file mode 100644 index 0000000000..161ed5bcc8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP24.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac192 : Row.check reaW reaR rear192 = true := by decide +kernel +theorem reac193 : Row.check reaW reaR rear193 = true := by decide +kernel +theorem reac194 : Row.check reaW reaR rear194 = true := by decide +kernel +theorem reac195 : Row.check reaW reaR rear195 = true := by decide +kernel +theorem reac196 : Row.check reaW reaR rear196 = true := by decide +kernel +theorem reac197 : Row.check reaW reaR rear197 = true := by decide +kernel +theorem reac198 : Row.check reaW reaR rear198 = true := by decide +kernel +theorem reac199 : Row.check reaW reaR rear199 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP25.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP25.lean new file mode 100644 index 0000000000..0589912f38 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP25.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac200 : Row.check reaW reaR rear200 = true := by decide +kernel +theorem reac201 : Row.check reaW reaR rear201 = true := by decide +kernel +theorem reac202 : Row.check reaW reaR rear202 = true := by decide +kernel +theorem reac203 : Row.check reaW reaR rear203 = true := by decide +kernel +theorem reac204 : Row.check reaW reaR rear204 = true := by decide +kernel +theorem reac205 : Row.check reaW reaR rear205 = true := by decide +kernel +theorem reac206 : Row.check reaW reaR rear206 = true := by decide +kernel +theorem reac207 : Row.check reaW reaR rear207 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP26.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP26.lean new file mode 100644 index 0000000000..c55c658ae1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP26.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac208 : Row.check reaW reaR rear208 = true := by decide +kernel +theorem reac209 : Row.check reaW reaR rear209 = true := by decide +kernel +theorem reac210 : Row.check reaW reaR rear210 = true := by decide +kernel +theorem reac211 : Row.check reaW reaR rear211 = true := by decide +kernel +theorem reac212 : Row.check reaW reaR rear212 = true := by decide +kernel +theorem reac213 : Row.check reaW reaR rear213 = true := by decide +kernel +theorem reac214 : Row.check reaW reaR rear214 = true := by decide +kernel +theorem reac215 : Row.check reaW reaR rear215 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP27.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP27.lean new file mode 100644 index 0000000000..97b5238cc0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP27.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac216 : Row.check reaW reaR rear216 = true := by decide +kernel +theorem reac217 : Row.check reaW reaR rear217 = true := by decide +kernel +theorem reac218 : Row.check reaW reaR rear218 = true := by decide +kernel +theorem reac219 : Row.check reaW reaR rear219 = true := by decide +kernel +theorem reac220 : Row.check reaW reaR rear220 = true := by decide +kernel +theorem reac221 : Row.check reaW reaR rear221 = true := by decide +kernel +theorem reac222 : Row.check reaW reaR rear222 = true := by decide +kernel +theorem reac223 : Row.check reaW reaR rear223 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP28.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP28.lean new file mode 100644 index 0000000000..ca812dc246 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP28.lean @@ -0,0 +1,9 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac224 : Row.check reaW reaR rear224 = true := by decide +kernel +theorem reac225 : Row.check reaW reaR rear225 = true := by decide +kernel +theorem reac226 : Row.check reaW reaR rear226 = true := by decide +kernel +theorem reac227 : Row.check reaW reaR rear227 = true := by decide +kernel +theorem reac228 : Row.check reaW reaR rear228 = true := by decide +kernel +theorem reac229 : Row.check reaW reaR rear229 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP3.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP3.lean new file mode 100644 index 0000000000..1d16f637cf --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP3.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac24 : Row.check reaW reaR rear24 = true := by decide +kernel +theorem reac25 : Row.check reaW reaR rear25 = true := by decide +kernel +theorem reac26 : Row.check reaW reaR rear26 = true := by decide +kernel +theorem reac27 : Row.check reaW reaR rear27 = true := by decide +kernel +theorem reac28 : Row.check reaW reaR rear28 = true := by decide +kernel +theorem reac29 : Row.check reaW reaR rear29 = true := by decide +kernel +theorem reac30 : Row.check reaW reaR rear30 = true := by decide +kernel +theorem reac31 : Row.check reaW reaR rear31 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP4.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP4.lean new file mode 100644 index 0000000000..e9c228cc38 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP4.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac32 : Row.check reaW reaR rear32 = true := by decide +kernel +theorem reac33 : Row.check reaW reaR rear33 = true := by decide +kernel +theorem reac34 : Row.check reaW reaR rear34 = true := by decide +kernel +theorem reac35 : Row.check reaW reaR rear35 = true := by decide +kernel +theorem reac36 : Row.check reaW reaR rear36 = true := by decide +kernel +theorem reac37 : Row.check reaW reaR rear37 = true := by decide +kernel +theorem reac38 : Row.check reaW reaR rear38 = true := by decide +kernel +theorem reac39 : Row.check reaW reaR rear39 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP5.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP5.lean new file mode 100644 index 0000000000..1e8a088839 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP5.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac40 : Row.check reaW reaR rear40 = true := by decide +kernel +theorem reac41 : Row.check reaW reaR rear41 = true := by decide +kernel +theorem reac42 : Row.check reaW reaR rear42 = true := by decide +kernel +theorem reac43 : Row.check reaW reaR rear43 = true := by decide +kernel +theorem reac44 : Row.check reaW reaR rear44 = true := by decide +kernel +theorem reac45 : Row.check reaW reaR rear45 = true := by decide +kernel +theorem reac46 : Row.check reaW reaR rear46 = true := by decide +kernel +theorem reac47 : Row.check reaW reaR rear47 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP6.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP6.lean new file mode 100644 index 0000000000..3c98d31fb9 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP6.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac48 : Row.check reaW reaR rear48 = true := by decide +kernel +theorem reac49 : Row.check reaW reaR rear49 = true := by decide +kernel +theorem reac50 : Row.check reaW reaR rear50 = true := by decide +kernel +theorem reac51 : Row.check reaW reaR rear51 = true := by decide +kernel +theorem reac52 : Row.check reaW reaR rear52 = true := by decide +kernel +theorem reac53 : Row.check reaW reaR rear53 = true := by decide +kernel +theorem reac54 : Row.check reaW reaR rear54 = true := by decide +kernel +theorem reac55 : Row.check reaW reaR rear55 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP7.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP7.lean new file mode 100644 index 0000000000..fe90aef675 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP7.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac56 : Row.check reaW reaR rear56 = true := by decide +kernel +theorem reac57 : Row.check reaW reaR rear57 = true := by decide +kernel +theorem reac58 : Row.check reaW reaR rear58 = true := by decide +kernel +theorem reac59 : Row.check reaW reaR rear59 = true := by decide +kernel +theorem reac60 : Row.check reaW reaR rear60 = true := by decide +kernel +theorem reac61 : Row.check reaW reaR rear61 = true := by decide +kernel +theorem reac62 : Row.check reaW reaR rear62 = true := by decide +kernel +theorem reac63 : Row.check reaW reaR rear63 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP8.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP8.lean new file mode 100644 index 0000000000..70cc30ba46 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP8.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac64 : Row.check reaW reaR rear64 = true := by decide +kernel +theorem reac65 : Row.check reaW reaR rear65 = true := by decide +kernel +theorem reac66 : Row.check reaW reaR rear66 = true := by decide +kernel +theorem reac67 : Row.check reaW reaR rear67 = true := by decide +kernel +theorem reac68 : Row.check reaW reaR rear68 = true := by decide +kernel +theorem reac69 : Row.check reaW reaR rear69 = true := by decide +kernel +theorem reac70 : Row.check reaW reaR rear70 = true := by decide +kernel +theorem reac71 : Row.check reaW reaR rear71 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereaP9.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereaP9.lean new file mode 100644 index 0000000000..931abeceac --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereaP9.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereaDefs +namespace CTree +theorem reac72 : Row.check reaW reaR rear72 = true := by decide +kernel +theorem reac73 : Row.check reaW reaR rear73 = true := by decide +kernel +theorem reac74 : Row.check reaW reaR rear74 = true := by decide +kernel +theorem reac75 : Row.check reaW reaR rear75 = true := by decide +kernel +theorem reac76 : Row.check reaW reaR rear76 = true := by decide +kernel +theorem reac77 : Row.check reaW reaR rear77 = true := by decide +kernel +theorem reac78 : Row.check reaW reaR rear78 = true := by decide +kernel +theorem reac79 : Row.check reaW reaR rear79 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiDefs.lean new file mode 100644 index 0000000000..e9c16213ba --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiDefs.lean @@ -0,0 +1,235 @@ +import Nov15.CTreeCore +namespace CTree +def reiW : List (List Nat) := [[0,0,0,0,0,0,0,0,0],[0,0,1595162760613,2188390344733,2571652494777,2855655060065,3081380002179,3268691127022,3428754580216],[0,0,0,2188390344733,3164880078897,3832144794229,4341872301631,4754908368588,3268691127022],[0,0,0,0,2571652494777,3832144794229,4725134451675,4341872301631,3081380002179],[0,0,0,0,0,2855655060065,3832144794229,3832144794229,2855655060065],[0,0,0,0,0,0,2571652494777,3164880078897,2571652494777],[0,0,0,0,0,0,0,2188390344733,2188390344733],[0,0,0,0,0,0,0,0,1595162760613],[0,0,0,0,0,0,0,0,0]] +def reir0 : Row := ⟨0,1,1,48,1725436573842136544890435102625209188850057808257732186958073375490046,[0,2928609377285,3195685390473,3506095611525,3745129615865,4130367471170,4439844134407,4937499315885,5432009639839,6173028911792,6482505575029,6963364227294,7911531689569,8273025336518,8634518983467,9129029307421,10480757129633,10964593286996,11412618676096,11907129000050,12558070104351,12945785487409,13333500870467,14072794080177,14616940243582,15597883210761,16092393534715,16907544319985,17269037966934,17763548290888,18258058614842,19428291062438,19816006445496,20296865097761,21036158307471,21580304470876,21968019853934,22462530177888,23201823387598,23745969551003,24726912518182,25221422842136,25891570974818,26279286357876,26667001740934,27387087922263,27950441114049,28689734323759,29233880487164],[1000000000000000000000000000000,2928609377285,3195685390473,3506095611525,3745129615865,4130367471170,4439844134407,4937499315885,5432009639839,6173028911792,6482505575029,6963364227294,7911531689569,8273025336518,8634518983467,9129029307421,10480757129633,10964593286996,11412618676096,11907129000050,12558070104351,12945785487409,13333500870467,14072794080177,14616940243582,17680652991278,18141213433649,18502707080598,18864200727547,19358711051501,19853221375455,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir1 : Row := ⟨1,2,1,20,1725015324675462002517084071354633591292683456439700743677216293214208,[0,3215517012126,3738071895728,4109014251376,4348048255716,4842922435586,5159458200164,5706719899074,6271108324780,7002580346569,7319116111147,8692065034775,8987743553853,10866178099238,11413439798148,11977828223854,12478574311311,13025836010221,13590224435927,14321696457716,14638232222294],[1000000000000000000000000000000,3215517012126,3738071895728,4109014251376,4348048255716,4842922435586,5159458200164,5706719899074,6271108324780,7002580346569,7319116111147,8692065034775,8987743553853,12108338561364,12347372565704,12813375620071,13052409624411,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir2 : Row := ⟨2,2,1,22,1725436573842136256050943512598856188173734310570540763622829158037504,[0,3215517012126,3738071895728,4109014251376,4348048255716,4842922435586,5159458200164,5706719899074,6271108324780,6766256495912,7319116111147,7813990291017,8876544581732,9186021244969,9491736481725,11925714696076,12472976394986,12973448491181,13520710190091,14085098615797,14580246786929,15133106402164,15627980582034],[1000000000000000000000000000000,3215517012126,3738071895728,4109014251376,4348048255716,4842922435586,5159458200164,5706719899074,6271108324780,6766256495912,7319116111147,7813990291017,8876544581732,9186021244969,9491736481725,12813375620071,13052409624411,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir3 : Row := ⟨3,2,1,24,1725436573842136544890435102625208983754331896122596109027616915716096,[0,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6766256495912,7075733159149,7571112575083,7911531689569,9186021244969,9491736481725,9986246805679,11811929976108,12487187823249,12961492706720,13322986353669,13817496677623,14646845734232,14987264848718,15482644264652,15823063379138],[1000000000000000000000000000000,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6766256495912,7075733159149,7571112575083,7911531689569,9186021244969,9491736481725,9986246805679,13052409624411,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir4 : Row := ⟨4,2,1,26,1725436573842136544890435102625209149907831359575118398056611880890368,[0,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6646984260007,7075733159149,7571112575083,7911531689569,8273025336518,9491736481725,9986246805679,10480757129633,12487187823249,12961492706720,13322986353669,13684480000618,14178990324572,14920009596525,15348758495667,15823063379138,16184557026087,16546050673036],[1000000000000000000000000000000,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6646984260007,7075733159149,7571112575083,7911531689569,8273025336518,9491736481725,9986246805679,10480757129633,14158572233090,14468048896327,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir5 : Row := ⟨5,2,1,28,1725436573842136449109463798507155500239512287015111266501574392791040,[0,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6646984260007,6956460923244,7571112575083,7911531689569,8273025336518,8634518983467,9986246805679,10480757129633,12367915587344,12862425911298,13322986353669,13684480000618,14045973647567,14540483971521,15229486259762,15590979906711,16184557026087,16546050673036,16907544319985,17269037966934],[1000000000000000000000000000000,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6646984260007,6956460923244,7571112575083,7911531689569,8273025336518,8634518983467,9986246805679,10480757129633,14158572233090,14468048896327,14843924831554,15153401494791,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir6 : Row := ⟨6,2,1,30,1725015324675462028800729473553375950327607832226055896745478848970752,[0,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6646984260007,6956460923244,7571112575083,7911531689569,8273025336518,8634518983467,9129029307421,10480757129633,12367915587344,12862425911298,13322986353669,13684480000618,14045973647567,14540483971521,15034994295475,15590979906711,16085490230665,16546050673036,16907544319985,17269037966934,17763548290888,18258058614842],[1000000000000000000000000000000,3215517012126,3738071895728,4109014251376,4348048255716,4740484353914,5049961017151,5411454664100,5905964988054,6646984260007,6956460923244,7571112575083,7911531689569,8273025336518,8634518983467,9129029307421,10480757129633,14158572233090,14468048896327,14843924831554,15153401494791,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir7 : Row := ⟨7,2,2,18,1725429991823894998508765754469743057491304461710640024346824886190080,[0,1634345563511,2206472935144,2563429817652,2834685764501,3417467476920,3622721114064,4363310212360,4665556845683,5286254538135,6224920938780,7040188590984,7245442228128,7986031326424,8288277959747,8892051633312,9331113691366,9951811383818,10572509076270],[1000000000000000000000000000000,1634345563511,2206472935144,2563429817652,2834685764501,3417467476920,3622721114064,4363310212360,4665556845683,5286254538135,6224920938780,7296996584959,7606473248196,8091826072602,8397541309358,8892051633312,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir8 : Row := ⟨8,2,2,20,1725436573842136449106449451380146306440222793220369896478428312371200,[0,1634345563511,2206472935144,2563429817652,2814908872992,3293222889891,3622721114064,4102955117168,4529397871874,5171977008632,5481453671869,6476917402716,6817336517202,7725676231232,8152118985938,8632352989042,9058795743748,9584408789037,10010851543743,10653430680501,10962907343738],[1000000000000000000000000000000,1634345563511,2206472935144,2563429817652,2814908872992,3293222889891,3622721114064,4102955117168,4529397871874,5171977008632,5481453671869,6476917402716,6817336517202,8091826072602,8397541309358,8892051633312,9386561957266,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir9 : Row := ⟨9,2,2,22,1725436573842135874423635973797346292484320015926037067947319207395328,[0,1634345563511,2206472935144,2563429817652,2814908872992,3190784808219,3500261471456,3948286860556,4442797184510,5171977008632,5481453671869,5869169054927,6817336517202,7178830164151,7540323811100,8391084045066,8885594369020,9369430526383,9817455915483,10311966239437,10962907343738,11350622726796,11738338109854],[1000000000000000000000000000000,1634345563511,2206472935144,2563429817652,2814908872992,3190784808219,3500261471456,3948286860556,4442797184510,5171977008632,5481453671869,5869169054927,6817336517202,7178830164151,7540323811100,8892051633312,9386561957266,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir10 : Row := ⟨10,2,2,24,1725436573842136257547521189216008126471978509806327231887960319197184,[0,1634345563511,2206472935144,2563429817652,2814908872992,3190784808219,3500261471456,3948286860556,4442797184510,5171977008632,5481453671869,5869169054927,6817336517202,7178830164151,7540323811100,8034834135054,8885594369020,9369430526383,9817455915483,10311966239437,10962907343738,11350622726796,11738338109854,12477631319564,13021777482969],[1000000000000000000000000000000,1634345563511,2206472935144,2563429817652,2814908872992,3190784808219,3500261471456,3948286860556,4442797184510,5171977008632,5481453671869,5869169054927,6817336517202,7178830164151,7540323811100,8034834135054,9386561957266,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir11 : Row := ⟨11,3,1,8,1724691879332226163255842105515269237569795001124286938345380071342080,[0,3081380002179,3471011683672,3783638875776,4001831067308,4900688007575,5401629731400,7785469943084,8003662134616],[1000000000000000000000000000000,3081380002179,3471011683672,3783638875776,4001831067308,4900688007575,5401629731400,10106185693589,10345219697929]⟩ +def reir12 : Row := ⟨12,3,1,10,1725015324675461991289735722275867791881061165080929906339321888112640,[0,3081380002179,3471011683672,3783638875776,4001831067308,4560278670898,4992214976743,6059611609161,6413756823415,8562109738206,8994046044051],[1000000000000000000000000000000,3081380002179,3471011683672,3783638875776,4001831067308,4560278670898,4992214976743,6059611609161,6413756823415,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir13 : Row := ⟨13,3,1,11,1725015324675461991289737127222815216233559422391912940518374073434112,[0,3081380002179,3471011683672,3783638875776,4001831067308,4560278670898,4992214976743,6059611609161,6413756823415,8562109738206,8994046044051,9552493647641],[1000000000000000000000000000000,3081380002179,3471011683672,3783638875776,4001831067308,4560278670898,4992214976743,6059611609161,6413756823415,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir14 : Row := ⟨14,3,1,12,1725015324675462280222856187148823347661927116336088114357438305533952,[0,3081380002179,3471011683672,3762797062968,4001831067308,4560278670898,4869755334135,5567154543574,6413756823415,7687226141479,7976732377051,9430034005033,9739510668270],[1000000000000000000000000000000,3081380002179,3471011683672,3762797062968,4001831067308,4560278670898,4869755334135,5567154543574,6413756823415,7687226141479,7976732377051,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir15 : Row := ⟨15,3,1,13,1725436573842136212647130871363085760565117322918546857094666522722304,[0,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,6413756823415,7687226141479,7976732377051,9430034005033,9739510668270,10436909877709],[1000000000000000000000000000000,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,6413756823415,7687226141479,7976732377051,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir16 : Row := ⟨16,3,1,14,1725436573842136508972570862884040742246718255018739783786170559758336,[0,3081380002179,3471011683672,3762797062968,4001831067308,4519933999567,4849432223740,5232764550859,5797152976565,6770066384593,7976732377051,9234595618167,9698864447480,10082196774599,10465529101718],[1000000000000000000000000000000,3081380002179,3471011683672,3762797062968,4001831067308,4519933999567,4849432223740,5232764550859,5797152976565,6770066384593,7976732377051,11244302182026,11451340763591,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir17 : Row := ⟨17,3,1,15,1725436573842136508972570862884040742246718259854406168756539839479808,[0,3081380002179,3471011683672,3762797062968,4001831067308,4519933999567,4849432223740,5232764550859,5797152976565,6770066384593,7028778753459,9234595618167,9698864447480,10082196774599,10465529101718,11029917527424],[1000000000000000000000000000000,3081380002179,3471011683672,3762797062968,4001831067308,4519933999567,4849432223740,5232764550859,5797152976565,6770066384593,7028778753459,11244302182026,11451340763591,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir18 : Row := ⟨18,3,1,16,1725436573842136410198441351708280540826957078208233419559579429109760,[0,3081380002179,3471011683672,3762797062968,4001831067308,4519933999567,4726972581132,5192975635499,5432009639839,6770066384593,7028778753459,8286209040288,9433840707147,9919948216631,10158982220971,10624985275338,10864019279678],[1000000000000000000000000000000,3081380002179,3471011683672,3762797062968,4001831067308,4519933999567,4726972581132,5192975635499,5432009639839,6770066384593,7028778753459,8286209040288,11451340763591,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir19 : Row := ⟨19,3,1,17,1725436573842136212650188036964751983929217180609891469519930766917632,[0,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6173028911792,7028778753459,8286209040288,8595685703525,10357431647463,10666908310700,11042784245927,11594305953130,11970181888357],[1000000000000000000000000000000,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6173028911792,7028778753459,8286209040288,8595685703525,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir20 : Row := ⟨20,3,1,18,1725436573842087172792880283908902425565645283999362124232370465800192,[0,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6173028911792,6482505575029,8286209040288,8595685703525,10357431647463,10666908310700,11042784245927,11352260909164,11970181888357,12279658551594],[1000000000000000000000000000000,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6173028911792,6482505575029,8286209040288,8595685703525,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir21 : Row := ⟨21,3,1,19,1725015324675406047815971936975081915591629661211475837569764750786560,[0,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6173028911792,6482505575029,8286209040288,8595685703525,10357431647463,10666908310700,11042784245927,11352260909164,11970181888357,12279658551594,12655534486821],[1000000000000000000000000000000,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6173028911792,6482505575029,8286209040288,8595685703525,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir22 : Row := ⟨22,3,1,20,1291753974625909894242973195510263877508117383371071955542159524888576,[0,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6252507142038,6482505575029,8388647121960,8595685703525,10357431647463,10666908310700,11042784245927,11352260909164,12049660118603,12279658551594,12735012717067,12965011150058],[1000000000000000000000000000000,3081380002179,3662618923384,3954404302680,4184402735671,4560278670898,4869755334135,5567154543574,5797152976565,6252507142038,6482505575029,8388647121960,8595685703525,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir23 : Row := ⟨23,3,2,6,1724797191619175783735400944853108397594210146492606303761713470636032,[0,1540690001089,2057447276476,2662244568307,2907612059631,3376890505181,4890594869116],[1000000000000000000000000000000,1540690001089,2057447276476,2662244568307,2907612059631,3376890505181,4890594869116]⟩ +def reir24 : Row := ⟨24,3,2,7,1724797191622314717726979501882151003100027857202348574221783047077888,[0,1540690001089,2057447276476,2370074468580,2716004819919,3274452423509,3706388729354,5086079288499],[1000000000000000000000000000000,1540690001089,2057447276476,2370074468580,2716004819919,3274452423509,3706388729354,5810502616482]⟩ +def reir25 : Row := ⟨25,3,2,8,1725015323871992974351448694926653041798694169110054950243558309756928,[0,1540690001089,2057447276476,2349232655772,2588266660112,3274452423509,3583929086746,4281328296185,5176533320224],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3274452423509,3583929086746,4281328296185,5894801949982]⟩ +def reir26 : Row := ⟨26,3,2,9,1725436573038667209084596767771996548138967675657632542441433269796864,[0,1540690001089,2057447276476,2370074468580,2716004819919,3274452423509,3583929086746,4281328296185,5127930576026,5954003555326],[1000000000000000000000000000000,1540690001089,2057447276476,2370074468580,2716004819919,3274452423509,3583929086746,4281328296185,5127930576026,1000000000000000000000000000000]⟩ +def reir27 : Row := ⟨27,3,2,10,1725436573842136543393766081445028143566739526816309557546538017751040,[0,1540690001089,2057447276476,2349232655772,2588266660112,3120853684860,3583929086746,4281328296185,4511326729176,5709120344972,6172195746858],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3120853684860,3583929086746,4281328296185,4511326729176,6503837975762,1000000000000000000000000000000]⟩ +def reir28 : Row := ⟨28,3,2,11,1725436573842136543393857425300104519275586814216737465834959754231808,[0,1540690001089,2057447276476,2349232655772,2588266660112,3120853684860,3500261471456,4281328296185,4511326729176,5709120344972,6088528131568,6621115156316],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3120853684860,3500261471456,4281328296185,4511326729176,6401399894090,6690906129662,1000000000000000000000000000000]⟩ +def reir29 : Row := ⟨29,3,2,12,1725436573842136449109463798507155209388800400214593303980251402993664,[0,1540690001089,2057447276476,2349232655772,2588266660112,3103998085482,3399676604560,4281328296185,4511326729176,5484240137204,5987943264672,6503674690042,6799353209120],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3103998085482,3399676604560,4281328296185,4511326729176,5484240137204,6690906129662,7000382792899,1000000000000000000000000000000]⟩ +def reir30 : Row := ⟨30,3,2,13,1725436573842136257547521190271047582288742434229410757899061808857088,[0,1540690001089,2057447276476,2349232655772,2588266660112,3103998085482,3399676604560,3946938303470,4511326729176,4887202664403,5742952506070,6503674690042,6799353209120,7346614908030],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3103998085482,3399676604560,3946938303470,4511326729176,4887202664403,5742952506070,7000382792899,7309859456136,1000000000000000000000000000000]⟩ +def reir31 : Row := ⟨31,3,2,14,1725436573842136257547521190265600738349505617879854593347310655111168,[0,1540690001089,2057447276476,2349232655772,2588266660112,3036481168503,3345957831740,3651673068496,4146183392450,4887202664403,5196679327640,6239939728608,6688154236999,6997630900236,7303346136992],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3036481168503,3345957831740,3651673068496,4146183392450,4887202664403,5196679327640,7000382792899,7309859456136,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir32 : Row := ⟨32,3,2,15,1725436573842136257547521190265557870744086368655058101620043316985856,[0,1540690001089,2057447276476,2349232655772,2588266660112,3036481168503,3345957831740,3651673068496,4146183392450,4887202664403,5196679327640,6239939728608,6688154236999,6997630900236,7303346136992,7797856460946],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3036481168503,3345957831740,3651673068496,4146183392450,4887202664403,5196679327640,7000382792899,7309859456136,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir33 : Row := ⟨33,3,2,16,1725015324675399180520058799817792954304926641149443805838890019848192,[0,1540690001089,2057447276476,2349232655772,2588266660112,3103998085482,3399676604560,3907149388110,4146183392450,4966680894649,5196679327640,6495416048222,6734450052562,7250181477932,7545859997010,8053332780560,8292366784900],[1000000000000000000000000000000,1540690001089,2057447276476,2349232655772,2588266660112,3103998085482,3399676604560,3907149388110,4146183392450,4966680894649,5196679327640,7102820874571,7309859456136,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir34 : Row := ⟨34,3,3,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir35 : Row := ⟨35,3,3,6,1724981481704708208044660068023339766542834024824556934860489376137216,[0,1027126667393,1580220997260,2069203879258,2287396070790,3186253011057,3687194734882],[1000000000000000000000000000000,1027126667393,1580220997260,2069203879258,2287396070790,3186253011057,3687194734882]⟩ +def reir36 : Row := ⟨36,3,3,7,1724138983421241331034605756681957787456231791428861707420782005583872,[0,1027126667393,1564183030637,1920623906643,2159657910983,3186253011057,3515751235230,4080281817626],[1000000000000000000000000000000,1027126667393,1564183030637,1920623906643,2159657910983,3186253011057,3515751235230,4226174507276]⟩ +def reir37 : Row := ⟨37,3,3,8,1725008742657215501060263516936682169514748965718045571558240033964032,[0,1027126667393,1549681550995,1920623906643,2159657910983,2791116199750,2984030315026,3852719547056,4319315821966],[1000000000000000000000000000000,1027126667393,1549681550995,1920623906643,2159657910983,2791116199750,2984030315026,3852719547056,4319315821966]⟩ +def reir38 : Row := ⟨38,3,3,9,1725436573841695280455999333928870854608338608384770828651301510840320,[0,1027126667393,1580220997260,1920623906643,2159657910983,2692244935731,2984030315026,3852719547056,4082717980047,4851902846714],[1000000000000000000000000000000,1027126667393,1580220997260,1920623906643,2159657910983,2692244935731,2984030315026,3852719547056,4082717980047,1000000000000000000000000000000]⟩ +def reir39 : Row := ⟨39,3,3,10,1725436573842136257544506842001895497334175015961362696906908438102016,[0,1027126667393,1549681550995,1920623906643,2159657910983,2654532090853,2971067855431,3518329554341,4082717980047,4814190001836,5130725766414],[1000000000000000000000000000000,1027126667393,1549681550995,1920623906643,2159657910983,2654532090853,2971067855431,3518329554341,4082717980047,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir40 : Row := ⟨40,3,3,11,1725436573842136257544506842001895497007111257582165228278559818121216,[0,1027126667393,1549681550995,1920623906643,2159657910983,2654532090853,2971067855431,3518329554341,4082717980047,4814190001836,5130725766414,5625599946284],[1000000000000000000000000000000,1027126667393,1549681550995,1920623906643,2159657910983,2654532090853,2971067855431,3518329554341,4082717980047,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir41 : Row := ⟨41,3,3,12,1725436573842122081963765325226559189160748860002050336828123661729792,[0,1027126667393,1549681550995,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,4711751920164,5021228583401,5382722230350,5723141344836],[1000000000000000000000000000000,1027126667393,1549681550995,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,5055631388075,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir42 : Row := ⟨42,3,3,13,1725436573842063080885441988494453214577201261746743827380562359746560,[0,1027126667393,1580220997260,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,4458593915274,5021228583401,5382722230350,5723141344836,6084634991785],[1000000000000000000000000000000,1027126667393,1580220997260,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,4458593915274,5314343756941,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir43 : Row := ⟨43,3,3,14,1725436573842063080885441943892962817510849559210789463157620997095424,[0,1027126667393,1580220997260,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,4458593915274,4768070578511,5382722230350,5723141344836,6084634991785,6446128638734],[1000000000000000000000000000000,1027126667393,1580220997260,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,4458593915274,4768070578511,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir44 : Row := ⟨44,3,3,15,1724172826241386087509120555855898733662906190388245142363929468469248,[0,1027126667393,1580220997260,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,4458593915274,4768070578511,5382722230350,5723141344836,6084634991785,6446128638734,6940638962688],[1000000000000000000000000000000,1027126667393,1580220997260,1920623906643,2159657910983,2552094009181,2861570672418,3223064319367,3717574643321,4458593915274,4768070578511,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir45 : Row := ⟨45,3,4,3,1215740115285145407006307736394970646240717885393841048537395210747904,[0,770345000544,1262708382141,2033053382685],[1000000000000000000000000000000,770345000544,1262708382141,2098611276423]⟩ +def reir46 : Row := ⟨46,3,4,4,1711261187066247890813363025679948986197761369184792094843736221024256,[0,770345000544,1218398305457,1704208369750,2304487851297],[1000000000000000000000000000000,770345000544,1218398305457,1704208369750,2304487851297]⟩ +def reir47 : Row := ⟨47,3,4,5,1711949085610381755412222851521837156972125571415050677602692446027776,[0,770345000544,1218398305457,1704208369750,1933453038514,2703798039058],[1000000000000000000000000000000,770345000544,1218398305457,1704208369750,1933453038514,2733977381487]⟩ +def reir48 : Row := ⟨48,3,4,6,1725429065421934135775443279377013739081480447434081339858259225346048,[0,770345000544,1218398305457,1678945567090,1884822141964,2631539299815,3063475605660],[1000000000000000000000000000000,770345000544,1218398305457,1678945567090,1884822141964,2631539299815,3063475605660]⟩ +def reir49 : Row := ⟨49,3,4,7,1725429991822320455121495916335180487343303910962716634609037191675904,[0,770345000544,1218398305457,1623902901898,1845033226604,2471770800231,2836128415159,3405274013803],[1000000000000000000000000000000,770345000544,1218398305457,1623902901898,1845033226604,2471770800231,2836128415159,3405274013803]⟩ +def reir50 : Row := ⟨50,3,4,8,1725436573840551274031366283120767677749658095272466878308865361838080,[0,770345000544,1218398305457,1605999222264,1845033226604,2335186691334,2664684915507,3304025179776,3571361673317],[1000000000000000000000000000000,770345000544,1218398305457,1605999222264,1845033226604,2335186691334,2664684915507,3304025179776,3571361673317]⟩ +def reir51 : Row := ⟨51,3,4,9,1725436573038666469167241256029755228080640410543054049851597920403456,[0,770345000544,1218398305457,1605999222264,1856872674435,2335186691334,2664684915507,3304025179776,3713745348870,4192059365769],[1000000000000000000000000000000,770345000544,1218398305457,1605999222264,1856872674435,2335186691334,2664684915507,3304025179776,3868413605482,1000000000000000000000000000000]⟩ +def reir52 : Row := ⟨52,3,4,10,1725436573842078405840852706019897410967521518242578966598401317142528,[0,770345000544,1218398305457,1605999222264,1845033226604,2232748609662,2542225272899,3008759944802,3503270268756,4077781836266,4387258499503],[1000000000000000000000000000000,770345000544,1218398305457,1605999222264,1845033226604,2232748609662,2542225272899,3008759944802,3503270268756,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir53 : Row := ⟨53,3,4,11,1725436573838041812586162001054180667492084376406608905998688462045184,[0,770345000544,1218398305457,1605999222264,1845033226604,2232748609662,2542225272899,3008759944802,3503270268756,4077781836266,4387258499503,4774973882561],[1000000000000000000000000000000,770345000544,1218398305457,1605999222264,1845033226604,2232748609662,2542225272899,3008759944802,3503270268756,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir54 : Row := ⟨54,3,4,12,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir55 : Row := ⟨55,4,1,4,1239316981823147026693528421085722635592843543290395622062911442124800,[0,2855655060065,3440711015671,3839591226720,4122154984616],[1000000000000000000000000000000,2855655060065,3440711015671,3839591226720,4122154984616]⟩ +def reir56 : Row := ⟨56,4,1,6,1293306507428935247685885916830646565345887176951247491355334076792832,[0,2855655060065,3440711015671,3647749597236,3886783601576,5233839670269,5509301391983],[1000000000000000000000000000000,2855655060065,3440711015671,3647749597236,3886783601576,5233839670269,5509301391983]⟩ +def reir57 : Row := ⟨57,4,1,7,1724599724699482344649655364594831117126166680771311008975668048297984,[0,2855655060065,3440711015671,3647749597236,3886783601576,5233839670269,5509301391983,7534533198812],[1000000000000000000000000000000,2855655060065,3440711015671,3647749597236,3886783601576,5233839670269,5509301391983,1000000000000000000000000000000]⟩ +def reir58 : Row := ⟨58,4,1,8,1724771790000978729764805480468511514507227008689791213199677395566592,[0,2855655060065,3440711015671,3647749597236,3886783601576,4548065671661,4733747276667,7534533198812,7773567203152],[1000000000000000000000000000000,2855655060065,3440711015671,3647749597236,3886783601576,4548065671661,4733747276667,9370368670761,9503298900811]⟩ +def reir59 : Row := ⟨59,4,1,9,1724988996602545128962364136802128780867495548430487288691761470242816,[0,2855655060065,3440711015671,3647749597236,3886783601576,4548065671661,4733747276667,7534533198812,7773567203152,8381496873903],[1000000000000000000000000000000,2855655060065,3440711015671,3647749597236,3886783601576,4548065671661,4733747276667,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir60 : Row := ⟨60,4,1,10,1724988996602495993324130793361514504127325670349064725969671993425920,[0,2855655060065,3440711015671,3647749597236,3886783601576,4232805552842,4733747276667,5764659053905,5897589283955,8119589154418,8465611105684],[1000000000000000000000000000000,2855655060065,3440711015671,3647749597236,3886783601576,4232805552842,4733747276667,5764659053905,5897589283955,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir61 : Row := ⟨61,4,1,11,1724607212227243633327641078765802060389195591744496360417669716901888,[0,2855655060065,3440711015671,3647749597236,3886783601576,4232805552842,4562303777015,5764659053905,5897589283955,8119589154418,8449087378591,8795109329857],[1000000000000000000000000000000,2855655060065,3440711015671,3647749597236,3886783601576,4232805552842,4562303777015,5764659053905,5897589283955,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir62 : Row := ⟨62,4,1,12,1724605360927892125009436352783555288042517265488812713331387059404800,[0,2855655060065,3440711015671,3647749597236,3886783601576,4232805552842,4439844134407,5764659053905,5897589283955,8087593731643,8326627735983,8672649687249,8879688268814],[1000000000000000000000000000000,2855655060065,3440711015671,3647749597236,3886783601576,4232805552842,4439844134407,5764659053905,5897589283955,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir63 : Row := ⟨63,4,2,2,1657209653241867727754277428799190269559553157320145843044180880785408,[0,1427827530032,2075588673174],[1000000000000000000000000000000,1427827530032,2075588673174]⟩ +def reir64 : Row := ⟨64,4,2,3,1670689703910324887239747707941152989547198337172229464391125076803584,[0,1427827530032,1956367769944,2301993701315],[1000000000000000000000000000000,1427827530032,1956367769944,2301993701315]⟩ +def reir65 : Row := ⟨65,4,2,4,1724691879329089144474434918536799264960592040516900777262263646027776,[0,1427827530032,1956367769944,2173999701225,2520185892847],[1000000000000000000000000000000,1427827530032,1956367769944,2173999701225,2520185892847]⟩ +def reir66 : Row := ⟨66,4,2,5,1724798117217071194839542966803644998336291209630814422947367143604224,[0,1427827530032,1956367769944,2173999701225,2520185892847,3377403391106],[1000000000000000000000000000000,1427827530032,1956367769944,2173999701225,2520185892847,3377403391106]⟩ +def reir67 : Row := ⟨67,4,2,6,1724798118073895869251296075549290374355175151902179595608009612460032,[0,1427827530032,1956367769944,2173999701225,2413033705565,2941562131706,3604768621728],[1000000000000000000000000000000,1427827530032,1956367769944,2173999701225,2413033705565,2941562131706,3604768621728]⟩ +def reir68 : Row := ⟨68,4,2,7,1725015324675462268846388999136149038420825622169005486649463959191552,[0,1427827530032,1877245767971,2173999701225,2413033705565,2941562131706,3305919746634,4587033406790],[1000000000000000000000000000000,1427827530032,1877245767971,2173999701225,2413033705565,2941562131706,3305919746634,5322257749400]⟩ +def reir69 : Row := ⟨69,4,2,8,1725436573842136401625135686044189019204858291154506333438337095827456,[0,1427827530032,1877245767971,2173999701225,2413033705565,2941562131706,3134476246982,3875065345278,4826067411130],[1000000000000000000000000000000,1427827530032,1877245767971,2173999701225,2413033705565,2941562131706,3134476246982,3875065345278,5406557082900]⟩ +def reir70 : Row := ⟨70,4,2,9,1725436573842136209665710213776658375779200421344055905004233156460544,[0,1427827530032,1956367769944,2173999701225,2413033705565,2804978022809,3134476246982,3875065345278,4469761753922,5218011728374],[1000000000000000000000000000000,1427827530032,1956367769944,2173999701225,2413033705565,2804978022809,3134476246982,3875065345278,4469761753922,1000000000000000000000000000000]⟩ +def reir71 : Row := ⟨71,4,2,10,1725436573842136209668450527234008085266194310161291877811834528464896,[0,1427827530032,1956367769944,2173999701225,2413033705565,2702539941137,3134476246982,3875065345278,4041153004792,5115573646702,5405079882274],[1000000000000000000000000000000,1427827530032,1956367769944,2173999701225,2413033705565,2702539941137,3134476246982,3875065345278,4041153004792,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir72 : Row := ⟨72,4,2,11,1724646705943459306822234965357863655674844939633377566875201763803136,[0,1427827530032,1956367769944,2173999701225,2413033705565,2702539941137,3012016604374,3875065345278,4041153004792,5115573646702,5405079882274,5714556545511],[1000000000000000000000000000000,1427827530032,1956367769944,2173999701225,2413033705565,2702539941137,3012016604374,3875065345278,4041153004792,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir73 : Row := ⟨73,4,2,12,1722946692333229248764981672107714498145507701326248865345787811332096,[0,1427827530032,1956367769944,2173999701225,2413033705565,2804978022809,3012016604374,3908222774742,4041153004792,5186016305599,5425050309939,5816994627183,6024033208748],[1000000000000000000000000000000,1427827530032,1956367769944,2173999701225,2413033705565,2804978022809,3012016604374,3908222774742,4041153004792,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir74 : Row := ⟨74,4,3,2,1653826573206650435937118788600311048813541693181571612125795117432832,[0,951885020021,1454621904810],[1000000000000000000000000000000,951885020021,1454621904810]⟩ +def reir75 : Row := ⟨75,4,3,3,1656357359215864854421665288239140158184582560514623040981482828988416,[0,951885020021,1436897874136,1743979557192],[1000000000000000000000000000000,951885020021,1436897874136,1743979557192]⟩ +def reir76 : Row := ⟨76,4,3,4,1724770857123213143770702344688275565012014400973079842846731279532032,[0,951885020021,1410311828126,1743979557192,1983013561532],[1000000000000000000000000000000,951885020021,1410311828126,1743979557192,1983013561532]⟩ +def reir77 : Row := ⟨77,4,3,5,1724988995745286375412850804557021486473316662175488330656117929541632,[0,951885020021,1410311828126,1702097207422,1983013561532,2934898581553],[1000000000000000000000000000000,951885020021,1410311828126,1702097207422,1983013561532,1000000000000000000000000000000]⟩ +def reir78 : Row := ⟨78,4,3,6,1724988996602544851243310189014585396252394554884441345102226038718464,[0,951885020021,1384616187247,1683181608261,1941131211762,2329035512798,2829977236623],[1000000000000000000000000000000,951885020021,1384616187247,1683181608261,1941131211762,2329035512798,2829977236623]⟩ +def reir79 : Row := ⟨79,4,3,7,1724988996602544851338309222853525992781114460921175422697902822129664,[0,951885020021,1384616187247,1662339795453,1921052164319,2329035512798,2658533736971,3583391959772],[1000000000000000000000000000000,951885020021,1384616187247,1662339795453,1921052164319,2329035512798,2658533736971,3900677929221]⟩ +def reir80 : Row := ⟨80,4,3,8,1724988996602531055686428321789310712077331459104628773102849422786560,[0,951885020021,1384616187247,1662339795453,1921052164319,2329035512798,2536074094363,3487959114384,3842104328638],[1000000000000000000000000000000,951885020021,1384616187247,1662339795453,1921052164319,2329035512798,2536074094363,3860889013861,3993819243911]⟩ +def reir81 : Row := ⟨81,4,3,9,1724988996601588947668470689708921509844255690125611938086509212598272,[0,951885020021,1410311828126,1662339795453,1921052164319,2329035512798,2536074094363,3487959114384,3842104328638,4198413889816],[1000000000000000000000000000000,951885020021,1410311828126,1662339795453,1921052164319,2329035512798,2536074094363,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir82 : Row := ⟨82,4,3,10,1723303999934695873204516371103176940114976684751502084778490427604992,[0,951885020021,1410311828126,1662339795453,1921052164319,2329035512798,2536074094363,3487959114384,3842104328638,4198413889816,4457126258682],[1000000000000000000000000000000,951885020021,1410311828126,1662339795453,1921052164319,2329035512798,2536074094363,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir83 : Row := ⟨83,4,4,1,1652996772683465680177557579065700088316417642379738466562555881979904,[0,713913765016],[1000000000000000000000000000000,713913765016]⟩ +def reir84 : Row := ⟨84,4,4,2,1670771979137993255628778445903802405933548475601221959393066723835904,[0,713913765016,1103050994975],[1000000000000000000000000000000,713913765016,1103050994975]⟩ +def reir85 : Row := ⟨85,4,4,3,1725007816203674625135576811143372345919495893227407661780756580007936,[0,713913765016,1090966428607,1455698152729],[1000000000000000000000000000000,713913765016,1090966428607,1455698152729]⟩ +def reir86 : Row := ⟨86,4,4,4,1725015323871980902955908308906566683699909250269833413292692613365760,[0,713913765016,1090966428607,1382751807903,1661574727603],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1661574727603]⟩ +def reir87 : Row := ⟨87,4,4,5,1725436573842136226022838078417684694330497254121867829285424767959040,[0,713913765016,1090966428607,1382751807903,1621785812243,2091064257793],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1621785812243,2091064257793]⟩ +def reir88 : Row := ⟨88,4,4,6,1725436573842136257547429845362478598467268773511614090693544641560576,[0,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2420562481966],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2420562481966]⟩ +def reir89 : Row := ⟨89,4,4,7,1725436573842136257547521188158575312977063513223344076914064608985088,[0,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2298102839358,2995502048797],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2298102839358,3161151580262]⟩ +def reir90 : Row := ⟨90,4,4,8,1725436573842066513835685033601645491242898389591000490536156667052032,[0,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2298102839358,2995502048797,3225500481788],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2298102839358,3194309009726,3327239239776]⟩ +def reir91 : Row := ⟨91,4,4,9,1722909078734203536619517881827344946293541769869686838314199173562368,[0,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2298102839358,2995502048797,3225500481788,3601376417015],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1612750240894,1988626176121,2298102839358,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir92 : Row := ⟨92,4,4,10,1715747841078812868429306904584027269507503040386422520868983296491520,[0,713913765016,1090966428607,1382751807903,1612750240894,2091064257793,2298102839358,2995502048797,3225500481788,3680854647261,3910853080252],[1000000000000000000000000000000,713913765016,1090966428607,1382751807903,1612750240894,2091064257793,2298102839358,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir93 : Row := ⟨93,4,5,2,1220847838564979176479569252607127231657536889195429319619070096572416,[0,571131012013,943669265579],[1000000000000000000000000000000,571131012013,943669265579]⟩ +def reir94 : Row := ⟨94,4,5,3,1724138983367772555627460989543758557592359108128053136223854682701824,[0,571131012013,899359188895,1297248342481],[1000000000000000000000000000000,571131012013,899359188895,1297248342481]⟩ +def reir95 : Row := ⟨95,4,5,4,1724982414155665836171579288444025490833843043768833864449683389153280,[0,571131012013,899359188895,1211986380999,1430178572531],[1000000000000000000000000000000,571131012013,899359188895,1211986380999,1430178572531]⟩ +def reir96 : Row := ⟨96,4,5,5,1724988995744347731577246642412515358398450033233404779897166013399040,[0,571131012013,899359188895,1191144568191,1540298156311,2090503757086],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1540298156311,1000000000000000000000000000000]⟩ +def reir97 : Row := ⟨97,4,5,6,1724988995748785835471480329621223963651551170192056402995928432115712,[0,571131012013,899359188895,1191144568191,1518598384441,2089729396454,2382289136382],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1518598384441,2263541623609,2449223228615]⟩ +def reir98 : Row := ⟨98,4,5,7,1724146470145819408131724123916146396753076339079351992630569756262400,[0,571131012013,899359188895,1191144568191,1469967487891,1948281504790,2277779728963,2661112056082],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1469967487891,1948281504790,2277779728963,1000000000000000000000000000000]⟩ +def reir99 : Row := ⟨99,4,5,8,1720776477078025442084861927323261590543872593788115347628848702291968,[0,571131012013,899359188895,1191144568191,1430178572531,1948281504790,2155320086355,2621323140722,2860357145062],[1000000000000000000000000000000,571131012013,899359188895,1191144568191,1430178572531,1948281504790,2155320086355,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir100 : Row := ⟨100,4,6,1,1653154741020485848532871223618558363173908517733387401430128689938432,[0,475942510010],[1000000000000000000000000000000,475942510010]⟩ +def reir101 : Row := ⟨101,4,6,2,1711527836013669720619157512792911780928988661216424104463838847434752,[0,475942510010,771621029088],[1000000000000000000000000000000,475942510010,771621029088]⟩ +def reir102 : Row := ⟨102,4,6,3,1725429990964883811577620967393716633027783442393098501486389437136896,[0,475942510010,771621029088,1084248221192],[1000000000000000000000000000000,475942510010,771621029088,1084248221192]⟩ +def reir103 : Row := ⟨103,4,6,4,1725436573841453146160354573951895631317498147231800176795916389318656,[0,475942510010,771621029088,1063406408384,1302440412724],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1302440412724]⟩ +def reir104 : Row := ⟨104,4,6,5,1725436572887060899672066136790405951426881921540979176519780593041408,[0,475942510010,771621029088,1063406408384,1374778985888,1835027437472],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1374778985888,1989677111684]⟩ +def reir105 : Row := ⟨105,4,6,6,1725436573031409719458399527908506746479372275175274555290329492226048,[0,475942510010,771621029088,1063406408384,1342229328084,1818171838094,2113850357172],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1342229328084,1853093002787,2182591226960]⟩ +def reir106 : Row := ⟨106,4,6,7,1721224055912000688755552777459026530638507064502999122273681698455552,[0,475942510010,771621029088,1063406408384,1302440412724,1750654921115,2060131584352,2365846821108],[1000000000000000000000000000000,475942510010,771621029088,1063406408384,1302440412724,1750654921115,2060131584352,1000000000000000000000000000000]⟩ +def reir107 : Row := ⟨107,4,6,8,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir108 : Row := ⟨108,4,7,2,1625563359492006241466637959256470788314009648950061637980398318256128,[0,407950722866,724689563052],[1000000000000000000000000000000,407950722866,724689563052]⟩ +def reir109 : Row := ⟨109,4,7,3,1655054091967455770603934705049722619749297750199283555005517250166784,[0,407950722866,706965532378,1114916255244],[1000000000000000000000000000000,407950722866,706965532378,1200045260037]⟩ +def reir110 : Row := ⟨110,4,7,4,1662636577168471400362669369746055916862950995153991160341436062236672,[0,407950722866,692464052736,1100414775602,1384928105472],[1000000000000000000000000000000,407950722866,692464052736,1200045260037,1439079264377]⟩ +def reir111 : Row := ⟨111,4,8,1,1626826642386109796790553044274187217316101172287346979122090189258752,[0,356956882508],[1000000000000000000000000000000,356956882508]⟩ +def reir112 : Row := ⟨112,4,8,2,1658025874805001768620179514986218103668981537441437880955886131740672,[0,356956882508,638534375338],[1000000000000000000000000000000,356956882508,638534375338]⟩ +def reir113 : Row := ⟨113,4,8,3,1671509139147789810644578124764360693646098616120370104414898367758336,[0,356956882508,624032895696,980989778204],[1000000000000000000000000000000,356956882508,624032895696,1103129053701]⟩ +def reir114 : Row := ⟨114,4,8,4,1635279858014437252081819232104619459510690731591968370908035150774272,[0,356956882508,624032895696,980989778204,1248065791392],[1000000000000000000000000000000,356956882508,624032895696,1103129053701,1291976145560]⟩ +def reir115 : Row := ⟨115,5,1,4,902315715017087972413119526148179874144310719450291367972144582492160,[0,2571652494777,2974323253585,3606524908729,3766041184789],[1000000000000000000000000000000,2571652494777,2974323253585,3606524908729,3766041184789]⟩ +def reir116 : Row := ⟨116,5,1,6,969715581689500758700750094886469658028768495690154266976567070556160,[0,2571652494777,2947737207575,3190891690323,3323821920373,5895474415150,6271559127948],[1000000000000000000000000000000,2571652494777,2947737207575,3190891690323,3323821920373,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir117 : Row := ⟨117,5,1,8,934330651686995133162622820233130030222982791276963094496493495648256,[0,2571652494777,2947737207575,3190891690323,3323821920373,5895474415150,6271559127948,6514713610696,6647643840746],[1000000000000000000000000000000,2571652494777,2947737207575,3190891690323,3323821920373,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir118 : Row := ⟨118,5,2,2,1006785508370385895857949945222228281726380116113775778249895766392832,[0,1285826247388,1637595511911],[1000000000000000000000000000000,1285826247388,1637595511911]⟩ +def reir119 : Row := ⟨119,5,2,3,1010155501704572026026910986647877000973621469014524237936202639998976,[0,1285826247388,1637595511911,2174805971692],[1000000000000000000000000000000,1285826247388,1637595511911,2174805971692]⟩ +def reir120 : Row := ⟨120,5,2,4,1293235152243845652065356550255815199528918606189692173253367660806144,[0,1285826247388,1601122339499,1856434546384,2305319288468],[1000000000000000000000000000000,1285826247388,1601122339499,1856434546384,2305319288468]⟩ +def reir121 : Row := ⟨121,5,2,5,1724594350546265417250689534012119114019130550674781524190217497477120,[0,1285826247388,1587094196263,1856434546384,2037995672984,3323821920372],[1000000000000000000000000000000,1285826247388,1587094196263,1856434546384,2037995672984,1000000000000000000000000000000]⟩ +def reir122 : Row := ⟨122,5,2,6,1724594554671286082156341414737775894460649578809894828153928626995200,[0,1285826247388,1575070073490,1856434546384,1989364776434,3275191023822,3564434849924],[1000000000000000000000000000000,1285826247388,1575070073490,1856434546384,1989364776434,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir123 : Row := ⟨123,5,2,7,1050595421713996047284981077966233835123425552997259155230591635423232,[0,1285826247388,1637595511911,1856434546384,2037995672984,3323821920372,3675591184895,3894430219368],[1000000000000000000000000000000,1285826247388,1637595511911,1856434546384,2037995672984,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir124 : Row := ⟨124,5,2,8,934330651737214628912912781649318472715941635646853270845669593055232,[0,1285826247388,1637595511911,1856434546384,1989364776434,3275191023822,3626960288345,3845799322818,3978729552868],[1000000000000000000000000000000,1285826247388,1637595511911,1856434546384,1989364776434,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir125 : Row := ⟨125,5,3,2,1006785508672428506998289712093791614001488853731560309319306286465024,[0,857217498259,1189092305102],[1000000000000000000000000000000,857217498259,1189092305102]⟩ +def reir126 : Row := ⟨126,5,3,3,1009313003672479243213432775369203958591737362103316153576337392533504,[0,857217498259,1189092305102,1641988158527],[1000000000000000000000000000000,857217498259,1189092305102,1641988158527]⟩ +def reir127 : Row := ⟨127,5,3,4,1293236875589552281480943623680482669387936978190055555901713392074752,[0,857217498259,1158485447134,1388036881895,1609386923855],[1000000000000000000000000000000,857217498259,1158485447134,1388036881895,1609386923855]⟩ +def reir128 : Row := ⟨128,5,3,5,1724596406372365013747451269212560532528032446694712788916521242984448,[0,857217498259,1146461324361,1388036881895,1560756027305,2417973525564],[1000000000000000000000000000000,857217498259,1146461324361,1388036881895,1560756027305,1000000000000000000000000000000]⟩ +def reir129 : Row := ⟨129,5,3,6,1724597956157390309564294127005498383649696498739842156168711386431488,[0,857217498259,1136040417957,1326823165959,1520967111945,2378184610204,2653646331918],[1000000000000000000000000000000,857217498259,1136040417957,1326823165959,1520967111945,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir130 : Row := ⟨130,5,3,7,1048067927165694729730169948829909616783301973349931134095623324696576,[0,857217498259,1187890256349,1388036881895,1560756027305,2417973525564,2748646283654,2948792909200],[1000000000000000000000000000000,857217498259,1187890256349,1388036881895,1560756027305,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir131 : Row := ⟨131,5,3,8,934330652540680586051326187642582802192468636289587530258821643501568,[0,857217498259,1187890256349,1388036881895,1520967111945,2378184610204,2708857368294,2909003993840,3041934223890],[1000000000000000000000000000000,857217498259,1187890256349,1388036881895,1520967111945,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir132 : Row := ⟨132,5,4,1,1221622585068961179313720678101214994539744848136188526540598636707840,[0,642913123694],[1000000000000000000000000000000,642913123694]⟩ +def reir133 : Row := ⟨133,5,4,2,1293235152519836892601660551833876753706053253523521877128803445112832,[0,642913123694,924150249774],[1000000000000000000000000000000,642913123694,924150249774]⟩ +def reir134 : Row := ⟨134,5,4,3,1724596433636592146365629605975290842621515735921212282890951134806016,[0,642913123694,924150249774,1173732507330],[1000000000000000000000000000000,642913123694,924150249774,1173732507330]⟩ +def reir135 : Row := ⟨135,5,4,4,1724609604154578640483768508526662304956356341621750763314427547615232,[0,642913123694,924150249774,1140575077866,1346451652740],[1000000000000000000000000000000,642913123694,924150249774,1140575077866,1346451652740]⟩ +def reir136 : Row := ⟨136,5,4,5,1724612973100089391932552724182717490027122940689335867923835641659392,[0,642913123694,921736043392,1112518791394,1306662737380,1949575861074],[1000000000000000000000000000000,642913123694,921736043392,1112518791394,1306662737380,1000000000000000000000000000000]⟩ +def reir137 : Row := ⟨137,5,4,6,1724625106981807601729229812456964539643236356816346790762387368574976,[0,642913123694,912617750289,1088470545848,1306662737380,1949575861074,2176941091696],[1000000000000000000000000000000,642913123694,912617750289,1088470545848,1306662737380,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir138 : Row := ⟨138,5,4,7,1077555376064317295573519265627186771869462452842603268311770759954432,[0,642913123694,924150249774,1140575077866,1306662737380,1949575861074,2230812987154,2447237815246],[1000000000000000000000000000000,642913123694,924150249774,1140575077866,1306662737380,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir139 : Row := ⟨139,5,4,8,933488154204169057761395648817461810469879237371394059820600200790016,[0,642913123694,924150249774,1173732507330,1306662737380,1949575861074,2230812987154,2480395244710,2613325474760],[1000000000000000000000000000000,642913123694,924150249774,1173732507330,1306662737380,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir140 : Row := ⟨140,5,5,2,1239316981823070018792594194199733014980220058586174267668605792419840,[0,514330498955,777990812197],[1000000000000000000000000000000,514330498955,777990812197]⟩ +def reir141 : Row := ⟨141,5,5,3,1293240577971226727734960972460232914357906854670115761551765577662464,[0,514330498955,765906245829,1045149882591],[1000000000000000000000000000000,514330498955,765906245829,1045149882591]⟩ +def reir142 : Row := ⟨142,5,5,4,1724665654103279491311286124596740145606725127649811505448166415663104,[0,514330498955,765906245829,983936166655,1266499924551],[1000000000000000000000000000000,514330498955,765906245829,983936166655,1266499924551]⟩ +def reir143 : Row := ⟨143,5,5,5,1724600630101379141066789610820907158235274423216523900056142987919360,[0,514330498955,765906245829,959887921109,1178080112641,1692410611596],[1000000000000000000000000000000,514330498955,765906245829,959887921109,1178080112641,1000000000000000000000000000000]⟩ +def reir144 : Row := ⟨144,5,5,6,1722920364260112885046417138362232148833833092427163512036496576086016,[0,514330498955,765906245829,939046108301,1178080112641,1692410611596,1878092216602],[1000000000000000000000000000000,514330498955,765906245829,939046108301,1178080112641,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir145 : Row := ⟨145,5,6,1,1652996772683465680177371992258713398599898766716859493179194821574656,[0,428608749129],[1000000000000000000000000000000,428608749129]⟩ +def reir146 : Row := ⟨146,5,6,2,1724639216326460256612514742150595964661313264902253253451793553162240,[0,428608749129,660410243199],[1000000000000000000000000000000,428608749129,660410243199]⟩ +def reir147 : Row := ⟨147,5,6,3,1724798117216637881724063662380226703911013118052171238200390442811392,[0,428608749129,660410243199,874166171283],[1000000000000000000000000000000,428608749129,660410243199,874166171283]⟩ +def reir148 : Row := ⟨148,5,6,4,1724798118073825470047530802303242888424294207126660397541688667537408,[0,428608749129,660410243199,874166171283,1092358362815],[1000000000000000000000000000000,428608749129,660410243199,874166171283,1092358362815]⟩ +def reir149 : Row := ⟨149,5,6,5,1724646705823392495552840718194043011096595614457697823012136452882432,[0,428608749129,660410243199,853324358475,1092358362815,1513734601674],[1000000000000000000000000000000,428608749129,660410243199,853324358475,1092358362815,1000000000000000000000000000000]⟩ +def reir150 : Row := ⟨150,5,6,6,1715364207117878652535193849492819274017655389633730539505151643746304,[0,428608749129,660410243199,853324358475,1092358362815,1513734601674,1706648716950],[1000000000000000000000000000000,428608749129,660410243199,853324358475,1092358362815,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir151 : Row := ⟨151,5,7,1,1652983608646958070671727044061785472690990094936058624888378157432832,[0,367378927825],[1000000000000000000000000000000,367378927825]⟩ +def reir152 : Row := ⟨152,5,7,2,1724665544399327589804111080269620235991010603627635781708136163835904,[0,367378927825,585055955606],[1000000000000000000000000000000,367378927825,585055955606]⟩ +def reir153 : Row := ⟨153,5,7,3,1724988995745144619539653111141576030296066136658508190726175806455808,[0,367378927825,585055955606,792094537171],[1000000000000000000000000000000,367378927825,585055955606,792094537171]⟩ +def reir154 : Row := ⟨154,5,7,4,1724988996495662855741150057078559469984549955007215013467884401721344,[0,367378927825,585055955606,792094537171,1031128541511],[1000000000000000000000000000000,367378927825,585055955606,792094537171,1031128541511]⟩ +def reir155 : Row := ⟨155,5,7,5,1722079712887031048896507859243078410244396551237856898667978147495936,[0,367378927825,585055955606,792094537171,1070917456871,1377150492777],[1000000000000000000000000000000,367378927825,585055955606,792094537171,1070917456871,1000000000000000000000000000000]⟩ +def reir156 : Row := ⟨156,5,7,6,1711967830645300390726067324802818450647166908398143296891178348183552,[0,367378927825,585055955606,792094537171,1031128541511,1377150492777,1584189074342],[1000000000000000000000000000000,367378927825,585055955606,792094537171,1031128541511,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir157 : Row := ⟨157,5,8,1,1653049428829299958770720951272555233816058214264559767734821977063424,[0,321456561847],[1000000000000000000000000000000,321456561847]⟩ +def reir158 : Row := ⟨158,5,8,2,1725007809347244270678715850304158731507938411450953091363223940104192,[0,321456561847,528540239912],[1000000000000000000000000000000,321456561847,528540239912]⟩ +def reir159 : Row := ⟨159,5,8,3,1725436572983939089901869000552885289179303280038478780105471154978816,[0,321456561847,528540239912,746172171193],[1000000000000000000000000000000,321456561847,528540239912,746172171193]⟩ +def reir160 : Row := ⟨160,5,8,4,1725436546416302154306973501391776423872330413460762560019084580225024,[0,321456561847,528540239912,746172171193,985206175533],[1000000000000000000000000000000,321456561847,528540239912,746172171193,985206175533]⟩ +def reir161 : Row := ⟨161,5,8,5,1712007322754676099671079044063199827059286494058918502807898714800128,[0,321456561847,528540239912,746172171193,985206175533,1274712411105],[1000000000000000000000000000000,321456561847,528540239912,746172171193,985206175533,1000000000000000000000000000000]⟩ +def reir162 : Row := ⟨162,5,8,6,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir163 : Row := ⟨163,5,9,1,1220110597673101594896698658036310199253681338105286529160551086424064,[0,285739166086],[1000000000000000000000000000000,285739166086]⟩ +def reir164 : Row := ⟨164,5,9,2,1724981481154179480978155684301943406971274447681393806906215951761408,[0,285739166086,484583572149],[1000000000000000000000000000000,285739166086,484583572149]⟩ +def reir165 : Row := ⟨165,5,9,3,1719084897325991940802223620433570589293316217023973182165491707281408,[0,285739166086,484583572149,731296588240],[1000000000000000000000000000000,285739166086,484583572149,731296588240]⟩ +def reir166 : Row := ⟨166,5,9,4,1719076454473507404067315922964737428825002565369443847371935033851904,[0,285739166086,484583572149,710454775432,969167144298],[1000000000000000000000000000000,285739166086,484583572149,710454775432,1000000000000000000000000000000]⟩ +def reir167 : Row := ⟨167,5,10,1,1653365365597545860971933423926930357813615760583145572860786448007168,[0,257165249477],[1000000000000000000000000000000,257165249477]⟩ +def reir168 : Row := ⟨168,5,10,2,1725429058192903593489248051476853744765984426521570766406197669003264,[0,257165249477,449418237939],[1000000000000000000000000000000,257165249477,449418237939]⟩ +def reir169 : Row := ⟨169,5,10,3,1712798854587327003016494715533281136648493428042051740193260090425344,[0,257165249477,449418237939,681880858823],[1000000000000000000000000000000,257165249477,449418237939,681880858823]⟩ +def reir170 : Row := ⟨170,5,10,4,1699251261300849264808366402224925605189360721528803074030198803398656,[0,257165249477,449418237939,681880858823,898836475878],[1000000000000000000000000000000,257165249477,449418237939,681880858823,1000000000000000000000000000000]⟩ +def reir171 : Row := ⟨171,5,11,1,1651680341612902193581932051270636061096749196179285892773239272243200,[0,233786590434],[1000000000000000000000000000000,233786590434]⟩ +def reir172 : Row := ⟨172,5,11,2,1662634722561076543643001767832855117994435672389287639170404610736128,[0,233786590434,432731167226],[1000000000000000000000000000000,233786590434,432731167226]⟩ +def reir173 : Row := ⟨173,5,12,1,1653786587446273337315890411824309469743127098087296874998325491793920,[0,214304374564],[1000000000000000000000000000000,214304374564]⟩ +def reir174 : Row := ⟨174,5,12,2,1635266639341692828462191503045774309478359528761574137833819815804928,[0,214304374564,408754802992],[1000000000000000000000000000000,214304374564,408754802992]⟩ +def reir175 : Row := ⟨175,6,3,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir176 : Row := ⟨176,6,4,3,865245788348865845910094515449036271932042103810911498065418991435776,[0,547097586183,724337892917,1271435479100],[1000000000000000000000000000000,547097586183,724337892917,1000000000000000000000000000000]⟩ +def reir177 : Row := ⟨177,6,4,4,866930785015562760897261203891974998849144425337320283845487967076352,[0,547097586183,706613862243,1253711448426,1413227724486],[1000000000000000000000000000000,547097586183,706613862243,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir178 : Row := ⟨178,6,5,4,866930785015562760897261203891974998849144425337320283845487967076352,[0,437678068946,597194345006,1034872413952,1194388690012],[1000000000000000000000000000000,437678068946,597194345006,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir179 : Row := ⟨179,6,6,2,871985775015653505858761269220791179600451389916546641185694893998080,[0,364731724122,541972030856],[1000000000000000000000000000000,364731724122,541972030856]⟩ +def reir180 : Row := ⟨180,6,6,3,875355768349047335833094646106668633434656032969364212745832845279232,[0,364731724122,524248000182,888979724304],[1000000000000000000000000000000,364731724122,524248000182,1000000000000000000000000000000]⟩ +def reir181 : Row := ⟨181,6,6,4,880410758349138080794594711435484814185962997548590570086039772200960,[0,364731724122,509746520540,874478244662,1019493041080],[1000000000000000000000000000000,364731724122,509746520540,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir182 : Row := ⟨182,6,7,2,870300778348956590871594580777852452683349068390137855405625918357504,[0,312627192104,489867498838],[1000000000000000000000000000000,312627192104,489867498838]⟩ +def reir183 : Row := ⟨183,6,7,3,872828273349001963352344613442260543059002550679751034075729381818368,[0,312627192104,472143468164,784770660268],[1000000000000000000000000000000,312627192104,472143468164,1000000000000000000000000000000]⟩ +def reir184 : Row := ⟨184,6,7,4,880410758349138080794594711435484814185962997548590570086039772200960,[0,312627192104,457641988522,770269180626,915283977044],[1000000000000000000000000000000,312627192104,457641988522,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir185 : Row := ⟨185,6,8,1,898103223349455688159844940086341446815537373575882820776764016427008,[0,273548793091],[1000000000000000000000000000000,273548793091]⟩ +def reir186 : Row := ⟨186,6,8,2,902315715016197975627761661193688264108293177391904785226936455528448,[0,273548793091,433065069151],[1000000000000000000000000000000,273548793091,433065069151]⟩ +def reir187 : Row := ⟨187,6,8,3,1293234941689882252650433379955472908876031771518743086202938804142080,[0,273548793091,406479023141,680027816232],[1000000000000000000000000000000,273548793091,406479023141,1000000000000000000000000000000]⟩ +def reir188 : Row := ⟨188,6,8,4,934330651683439360383928741609524075533237286393671715048246992699392,[0,273548793091,406479023141,680027816232,812958046282],[1000000000000000000000000000000,273548793091,406479023141,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir189 : Row := ⟨189,6,9,2,900630718349501060640594972750749537191190855865495999446867479887872,[0,243154482748,402670758808],[1000000000000000000000000000000,243154482748,402670758808]⟩ +def reir190 : Row := ⟨190,6,9,3,1291549945023185337663266691512534181958929449992334300422869828501504,[0,243154482748,376084712798,619239195546],[1000000000000000000000000000000,243154482748,376084712798,1000000000000000000000000000000]⟩ +def reir191 : Row := ⟨191,6,9,4,934330651683439360383928741609524075533237286393671715048246992699392,[0,243154482748,376084712798,619239195546,752169425596],[1000000000000000000000000000000,243154482748,376084712798,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir192 : Row := ⟨192,6,10,1,1005943010018058247338513000434419969510085951266045110701178457423872,[0,218839034473],[1000000000000000000000000000000,218839034473]⟩ +def reir193 : Row := ⟨193,6,10,2,1293234941689882252650433379955472908876031771518743086202938804142080,[0,218839034473,351769264523],[1000000000000000000000000000000,218839034473,351769264523]⟩ +def reir194 : Row := ⟨194,6,10,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218839034473,351769264523,570608298996],[1000000000000000000000000000000,218839034473,351769264523,1000000000000000000000000000000]⟩ +def reir195 : Row := ⟨195,6,10,4,933488153350090902890345397388054712074686125630467322158212504879104,[0,218839034473,351769264523,570608298996,703538529046],[1000000000000000000000000000000,218839034473,351769264523,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir196 : Row := ⟨196,6,11,1,1004258013351361332351346311991481242592983629739636324921109481783296,[0,198944576793],[1000000000000000000000000000000,198944576793]⟩ +def reir197 : Row := ⟨197,6,11,2,1291549945023185337663266691512534181958929449992334300422869828501504,[0,198944576793,331874806843],[1000000000000000000000000000000,198944576793,331874806843]⟩ +def reir198 : Row := ⟨198,6,11,3,1722066593364247116884355588683378909278572599989779067230493104668672,[0,198944576793,331874806843,530819383636],[1000000000000000000000000000000,198944576793,331874806843,1000000000000000000000000000000]⟩ +def reir199 : Row := ⟨199,6,11,4,930118160016697072916012020502177258240481482577649750598074553597952,[0,198944576793,331874806843,530819383636,663749613686],[1000000000000000000000000000000,198944576793,331874806843,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir200 : Row := ⟨200,6,12,1,1221622583355263365695849121130577014899183106646369690550007339417600,[0,182365862061],[1000000000000000000000000000000,182365862061]⟩ +def reir201 : Row := ⟨201,6,12,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182365862061,315296092111],[1000000000000000000000000000000,182365862061,315296092111]⟩ +def reir202 : Row := ⟨202,6,12,3,1715326606697459456935688834911624001610163313884143924110217202106368,[0,182365862061,315296092111,497661954172],[1000000000000000000000000000000,182365862061,315296092111,1000000000000000000000000000000]⟩ +def reir203 : Row := ⟨203,6,12,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reir204 : Row := ⟨204,6,13,1,1219937586688566450708682432687638287982080785119960904769938363777024,[0,168337718825],[1000000000000000000000000000000,168337718825]⟩ +def reir205 : Row := ⟨205,6,13,2,1291549945023185337663266691512534181958929449992334300422869828501504,[0,168337718825,301267948875],[1000000000000000000000000000000,168337718825,301267948875]⟩ +def reir206 : Row := ⟨206,6,13,3,1253637520022504750452016201546412826324127215648136620371317876588544,[0,168337718825,301267948875,469605667700],[1000000000000000000000000000000,168337718825,301267948875,1000000000000000000000000000000]⟩ +def reir207 : Row := ⟨207,6,14,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,156313596052],[1000000000000000000000000000000,156313596052]⟩ +def reir208 : Row := ⟨208,6,14,2,1722909091697595574377938932904848272737123760752983460120527592488960,[0,156313596052,289243826102],[1000000000000000000000000000000,156313596052,289243826102]⟩ +def reir209 : Row := ⟨209,6,14,3,1577156880028312427988020382590648394407772948718623490144561199579136,[0,156313596052,289243826102,445557422154],[1000000000000000000000000000000,156313596052,289243826102,1000000000000000000000000000000]⟩ +def reir210 : Row := ⟨210,6,15,1,1651296733362976687423354674079952378760275095880610064467596127764480,[0,145892689648],[1000000000000000000000000000000,145892689648]⟩ +def reir211 : Row := ⟨211,6,15,2,1715326606697459456935688834911624001610163313884143924110217202106368,[0,145892689648,278822919698],[1000000000000000000000000000000,145892689648,278822919698]⟩ +def reir212 : Row := ⟨212,6,15,3,1347997333357531989733350754350981533681857221127028624055180512460800,[0,145892689648,278822919698,424715609346],[1000000000000000000000000000000,145892689648,278822919698,1000000000000000000000000000000]⟩ +def reir213 : Row := ⟨213,6,16,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,136774396545],[1000000000000000000000000000000,136774396545]⟩ +def reir214 : Row := ⟨214,6,16,2,1688366660030308817141021819824604370936526169461603351629113591857152,[0,136774396545,269704626595],[1000000000000000000000000000000,136774396545,269704626595]⟩ +def reir215 : Row := ⟨215,6,17,1,1186237653354628150965348663828863749640034354591785189168558850965504,[0,128728843807],[1000000000000000000000000000000,128728843807]⟩ +def reir216 : Row := ⟨216,6,18,1,1617596800029038387680020905221177840418228665352434348866216614952960,[0,121577241374],[1000000000000000000000000000000,121577241374]⟩ +def reir217 : Row := ⟨217,6,19,1,1509757013360435828501352844873099317723680087662272058941802173956096,[0,115178439196],[1000000000000000000000000000000,115178439196]⟩ +def reir218 : Row := ⟨218,6,20,1,1509757013360435828501352844873099317723680087662272058941802173956096,[0,109419517236],[1000000000000000000000000000000,109419517236]⟩ +def reir219 : Row := ⟨219,7,18,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,88620153367,177240306734],[1000000000000000000000000000000,88620153367,1000000000000000000000000000000]⟩ +def reir220 : Row := ⟨220,7,20,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,79758138030],[1000000000000000000000000000000,79758138030]⟩ +def reir221 : Row := ⟨221,7,20,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,79758138030,159516276060],[1000000000000000000000000000000,79758138030,1000000000000000000000000000000]⟩ +def reir222 : Row := ⟨222,7,22,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,72507398209],[1000000000000000000000000000000,72507398209]⟩ +def reir223 : Row := ⟨223,7,22,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,72507398209,145014796418],[1000000000000000000000000000000,72507398209,1000000000000000000000000000000]⟩ +def reir224 : Row := ⟨224,7,24,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,66465115025],[1000000000000000000000000000000,66465115025]⟩ +def reir225 : Row := ⟨225,7,24,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,66465115025,132930230050],[1000000000000000000000000000000,66465115025,1000000000000000000000000000000]⟩ +def reir226 : Row := ⟨226,7,26,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,61352413869],[1000000000000000000000000000000,61352413869]⟩ +def reir227 : Row := ⟨227,7,28,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,56970098593],[1000000000000000000000000000000,56970098593]⟩ +def reir228 : Row := ⟨228,7,30,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,53172092020],[1000000000000000000000000000000,53172092020]⟩ +def reir229 : Row := ⟨229,8,48,1,0,[0,0],[1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def reiR : List Row := [reir0, reir1, reir2, reir3, reir4, reir5, reir6, reir7, reir8, reir9, reir10, reir11, reir12, reir13, reir14, reir15, reir16, reir17, reir18, reir19, reir20, reir21, reir22, reir23, reir24, reir25, reir26, reir27, reir28, reir29, reir30, reir31, reir32, reir33, reir34, reir35, reir36, reir37, reir38, reir39, reir40, reir41, reir42, reir43, reir44, reir45, reir46, reir47, reir48, reir49, reir50, reir51, reir52, reir53, reir54, reir55, reir56, reir57, reir58, reir59, reir60, reir61, reir62, reir63, reir64, reir65, reir66, reir67, reir68, reir69, reir70, reir71, reir72, reir73, reir74, reir75, reir76, reir77, reir78, reir79, reir80, reir81, reir82, reir83, reir84, reir85, reir86, reir87, reir88, reir89, reir90, reir91, reir92, reir93, reir94, reir95, reir96, reir97, reir98, reir99, reir100, reir101, reir102, reir103, reir104, reir105, reir106, reir107, reir108, reir109, reir110, reir111, reir112, reir113, reir114, reir115, reir116, reir117, reir118, reir119, reir120, reir121, reir122, reir123, reir124, reir125, reir126, reir127, reir128, reir129, reir130, reir131, reir132, reir133, reir134, reir135, reir136, reir137, reir138, reir139, reir140, reir141, reir142, reir143, reir144, reir145, reir146, reir147, reir148, reir149, reir150, reir151, reir152, reir153, reir154, reir155, reir156, reir157, reir158, reir159, reir160, reir161, reir162, reir163, reir164, reir165, reir166, reir167, reir168, reir169, reir170, reir171, reir172, reir173, reir174, reir175, reir176, reir177, reir178, reir179, reir180, reir181, reir182, reir183, reir184, reir185, reir186, reir187, reir188, reir189, reir190, reir191, reir192, reir193, reir194, reir195, reir196, reir197, reir198, reir199, reir200, reir201, reir202, reir203, reir204, reir205, reir206, reir207, reir208, reir209, reir210, reir211, reir212, reir213, reir214, reir215, reir216, reir217, reir218, reir219, reir220, reir221, reir222, reir223, reir224, reir225, reir226, reir227, reir228, reir229] +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP0.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP0.lean new file mode 100644 index 0000000000..d1a157c6fb --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP0.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic0 : Row.check reiW reiR reir0 = true := by decide +kernel +theorem reic1 : Row.check reiW reiR reir1 = true := by decide +kernel +theorem reic2 : Row.check reiW reiR reir2 = true := by decide +kernel +theorem reic3 : Row.check reiW reiR reir3 = true := by decide +kernel +theorem reic4 : Row.check reiW reiR reir4 = true := by decide +kernel +theorem reic5 : Row.check reiW reiR reir5 = true := by decide +kernel +theorem reic6 : Row.check reiW reiR reir6 = true := by decide +kernel +theorem reic7 : Row.check reiW reiR reir7 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP1.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP1.lean new file mode 100644 index 0000000000..df166a9675 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP1.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic8 : Row.check reiW reiR reir8 = true := by decide +kernel +theorem reic9 : Row.check reiW reiR reir9 = true := by decide +kernel +theorem reic10 : Row.check reiW reiR reir10 = true := by decide +kernel +theorem reic11 : Row.check reiW reiR reir11 = true := by decide +kernel +theorem reic12 : Row.check reiW reiR reir12 = true := by decide +kernel +theorem reic13 : Row.check reiW reiR reir13 = true := by decide +kernel +theorem reic14 : Row.check reiW reiR reir14 = true := by decide +kernel +theorem reic15 : Row.check reiW reiR reir15 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP10.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP10.lean new file mode 100644 index 0000000000..7317fba4ca --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP10.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic80 : Row.check reiW reiR reir80 = true := by decide +kernel +theorem reic81 : Row.check reiW reiR reir81 = true := by decide +kernel +theorem reic82 : Row.check reiW reiR reir82 = true := by decide +kernel +theorem reic83 : Row.check reiW reiR reir83 = true := by decide +kernel +theorem reic84 : Row.check reiW reiR reir84 = true := by decide +kernel +theorem reic85 : Row.check reiW reiR reir85 = true := by decide +kernel +theorem reic86 : Row.check reiW reiR reir86 = true := by decide +kernel +theorem reic87 : Row.check reiW reiR reir87 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP11.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP11.lean new file mode 100644 index 0000000000..630e0afb04 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP11.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic88 : Row.check reiW reiR reir88 = true := by decide +kernel +theorem reic89 : Row.check reiW reiR reir89 = true := by decide +kernel +theorem reic90 : Row.check reiW reiR reir90 = true := by decide +kernel +theorem reic91 : Row.check reiW reiR reir91 = true := by decide +kernel +theorem reic92 : Row.check reiW reiR reir92 = true := by decide +kernel +theorem reic93 : Row.check reiW reiR reir93 = true := by decide +kernel +theorem reic94 : Row.check reiW reiR reir94 = true := by decide +kernel +theorem reic95 : Row.check reiW reiR reir95 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP12.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP12.lean new file mode 100644 index 0000000000..bdad660eb7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP12.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic96 : Row.check reiW reiR reir96 = true := by decide +kernel +theorem reic97 : Row.check reiW reiR reir97 = true := by decide +kernel +theorem reic98 : Row.check reiW reiR reir98 = true := by decide +kernel +theorem reic99 : Row.check reiW reiR reir99 = true := by decide +kernel +theorem reic100 : Row.check reiW reiR reir100 = true := by decide +kernel +theorem reic101 : Row.check reiW reiR reir101 = true := by decide +kernel +theorem reic102 : Row.check reiW reiR reir102 = true := by decide +kernel +theorem reic103 : Row.check reiW reiR reir103 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP13.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP13.lean new file mode 100644 index 0000000000..3de3f6fb55 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP13.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic104 : Row.check reiW reiR reir104 = true := by decide +kernel +theorem reic105 : Row.check reiW reiR reir105 = true := by decide +kernel +theorem reic106 : Row.check reiW reiR reir106 = true := by decide +kernel +theorem reic107 : Row.check reiW reiR reir107 = true := by decide +kernel +theorem reic108 : Row.check reiW reiR reir108 = true := by decide +kernel +theorem reic109 : Row.check reiW reiR reir109 = true := by decide +kernel +theorem reic110 : Row.check reiW reiR reir110 = true := by decide +kernel +theorem reic111 : Row.check reiW reiR reir111 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP14.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP14.lean new file mode 100644 index 0000000000..62c568c679 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP14.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic112 : Row.check reiW reiR reir112 = true := by decide +kernel +theorem reic113 : Row.check reiW reiR reir113 = true := by decide +kernel +theorem reic114 : Row.check reiW reiR reir114 = true := by decide +kernel +theorem reic115 : Row.check reiW reiR reir115 = true := by decide +kernel +theorem reic116 : Row.check reiW reiR reir116 = true := by decide +kernel +theorem reic117 : Row.check reiW reiR reir117 = true := by decide +kernel +theorem reic118 : Row.check reiW reiR reir118 = true := by decide +kernel +theorem reic119 : Row.check reiW reiR reir119 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP15.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP15.lean new file mode 100644 index 0000000000..e9e5111b6f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP15.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic120 : Row.check reiW reiR reir120 = true := by decide +kernel +theorem reic121 : Row.check reiW reiR reir121 = true := by decide +kernel +theorem reic122 : Row.check reiW reiR reir122 = true := by decide +kernel +theorem reic123 : Row.check reiW reiR reir123 = true := by decide +kernel +theorem reic124 : Row.check reiW reiR reir124 = true := by decide +kernel +theorem reic125 : Row.check reiW reiR reir125 = true := by decide +kernel +theorem reic126 : Row.check reiW reiR reir126 = true := by decide +kernel +theorem reic127 : Row.check reiW reiR reir127 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP16.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP16.lean new file mode 100644 index 0000000000..7108ca91e3 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP16.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic128 : Row.check reiW reiR reir128 = true := by decide +kernel +theorem reic129 : Row.check reiW reiR reir129 = true := by decide +kernel +theorem reic130 : Row.check reiW reiR reir130 = true := by decide +kernel +theorem reic131 : Row.check reiW reiR reir131 = true := by decide +kernel +theorem reic132 : Row.check reiW reiR reir132 = true := by decide +kernel +theorem reic133 : Row.check reiW reiR reir133 = true := by decide +kernel +theorem reic134 : Row.check reiW reiR reir134 = true := by decide +kernel +theorem reic135 : Row.check reiW reiR reir135 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP17.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP17.lean new file mode 100644 index 0000000000..6df309be88 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP17.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic136 : Row.check reiW reiR reir136 = true := by decide +kernel +theorem reic137 : Row.check reiW reiR reir137 = true := by decide +kernel +theorem reic138 : Row.check reiW reiR reir138 = true := by decide +kernel +theorem reic139 : Row.check reiW reiR reir139 = true := by decide +kernel +theorem reic140 : Row.check reiW reiR reir140 = true := by decide +kernel +theorem reic141 : Row.check reiW reiR reir141 = true := by decide +kernel +theorem reic142 : Row.check reiW reiR reir142 = true := by decide +kernel +theorem reic143 : Row.check reiW reiR reir143 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP18.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP18.lean new file mode 100644 index 0000000000..0fa1c83f91 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP18.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic144 : Row.check reiW reiR reir144 = true := by decide +kernel +theorem reic145 : Row.check reiW reiR reir145 = true := by decide +kernel +theorem reic146 : Row.check reiW reiR reir146 = true := by decide +kernel +theorem reic147 : Row.check reiW reiR reir147 = true := by decide +kernel +theorem reic148 : Row.check reiW reiR reir148 = true := by decide +kernel +theorem reic149 : Row.check reiW reiR reir149 = true := by decide +kernel +theorem reic150 : Row.check reiW reiR reir150 = true := by decide +kernel +theorem reic151 : Row.check reiW reiR reir151 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP19.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP19.lean new file mode 100644 index 0000000000..a8dac28cb6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP19.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic152 : Row.check reiW reiR reir152 = true := by decide +kernel +theorem reic153 : Row.check reiW reiR reir153 = true := by decide +kernel +theorem reic154 : Row.check reiW reiR reir154 = true := by decide +kernel +theorem reic155 : Row.check reiW reiR reir155 = true := by decide +kernel +theorem reic156 : Row.check reiW reiR reir156 = true := by decide +kernel +theorem reic157 : Row.check reiW reiR reir157 = true := by decide +kernel +theorem reic158 : Row.check reiW reiR reir158 = true := by decide +kernel +theorem reic159 : Row.check reiW reiR reir159 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP2.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP2.lean new file mode 100644 index 0000000000..fb77f861af --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP2.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic16 : Row.check reiW reiR reir16 = true := by decide +kernel +theorem reic17 : Row.check reiW reiR reir17 = true := by decide +kernel +theorem reic18 : Row.check reiW reiR reir18 = true := by decide +kernel +theorem reic19 : Row.check reiW reiR reir19 = true := by decide +kernel +theorem reic20 : Row.check reiW reiR reir20 = true := by decide +kernel +theorem reic21 : Row.check reiW reiR reir21 = true := by decide +kernel +theorem reic22 : Row.check reiW reiR reir22 = true := by decide +kernel +theorem reic23 : Row.check reiW reiR reir23 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP20.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP20.lean new file mode 100644 index 0000000000..2856a3d7d6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP20.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic160 : Row.check reiW reiR reir160 = true := by decide +kernel +theorem reic161 : Row.check reiW reiR reir161 = true := by decide +kernel +theorem reic162 : Row.check reiW reiR reir162 = true := by decide +kernel +theorem reic163 : Row.check reiW reiR reir163 = true := by decide +kernel +theorem reic164 : Row.check reiW reiR reir164 = true := by decide +kernel +theorem reic165 : Row.check reiW reiR reir165 = true := by decide +kernel +theorem reic166 : Row.check reiW reiR reir166 = true := by decide +kernel +theorem reic167 : Row.check reiW reiR reir167 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP21.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP21.lean new file mode 100644 index 0000000000..02323e01ef --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP21.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic168 : Row.check reiW reiR reir168 = true := by decide +kernel +theorem reic169 : Row.check reiW reiR reir169 = true := by decide +kernel +theorem reic170 : Row.check reiW reiR reir170 = true := by decide +kernel +theorem reic171 : Row.check reiW reiR reir171 = true := by decide +kernel +theorem reic172 : Row.check reiW reiR reir172 = true := by decide +kernel +theorem reic173 : Row.check reiW reiR reir173 = true := by decide +kernel +theorem reic174 : Row.check reiW reiR reir174 = true := by decide +kernel +theorem reic175 : Row.check reiW reiR reir175 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP22.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP22.lean new file mode 100644 index 0000000000..2f28e23e3d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP22.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic176 : Row.check reiW reiR reir176 = true := by decide +kernel +theorem reic177 : Row.check reiW reiR reir177 = true := by decide +kernel +theorem reic178 : Row.check reiW reiR reir178 = true := by decide +kernel +theorem reic179 : Row.check reiW reiR reir179 = true := by decide +kernel +theorem reic180 : Row.check reiW reiR reir180 = true := by decide +kernel +theorem reic181 : Row.check reiW reiR reir181 = true := by decide +kernel +theorem reic182 : Row.check reiW reiR reir182 = true := by decide +kernel +theorem reic183 : Row.check reiW reiR reir183 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP23.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP23.lean new file mode 100644 index 0000000000..da99bd55e9 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP23.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic184 : Row.check reiW reiR reir184 = true := by decide +kernel +theorem reic185 : Row.check reiW reiR reir185 = true := by decide +kernel +theorem reic186 : Row.check reiW reiR reir186 = true := by decide +kernel +theorem reic187 : Row.check reiW reiR reir187 = true := by decide +kernel +theorem reic188 : Row.check reiW reiR reir188 = true := by decide +kernel +theorem reic189 : Row.check reiW reiR reir189 = true := by decide +kernel +theorem reic190 : Row.check reiW reiR reir190 = true := by decide +kernel +theorem reic191 : Row.check reiW reiR reir191 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP24.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP24.lean new file mode 100644 index 0000000000..e892b48573 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP24.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic192 : Row.check reiW reiR reir192 = true := by decide +kernel +theorem reic193 : Row.check reiW reiR reir193 = true := by decide +kernel +theorem reic194 : Row.check reiW reiR reir194 = true := by decide +kernel +theorem reic195 : Row.check reiW reiR reir195 = true := by decide +kernel +theorem reic196 : Row.check reiW reiR reir196 = true := by decide +kernel +theorem reic197 : Row.check reiW reiR reir197 = true := by decide +kernel +theorem reic198 : Row.check reiW reiR reir198 = true := by decide +kernel +theorem reic199 : Row.check reiW reiR reir199 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP25.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP25.lean new file mode 100644 index 0000000000..e8e3d4518e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP25.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic200 : Row.check reiW reiR reir200 = true := by decide +kernel +theorem reic201 : Row.check reiW reiR reir201 = true := by decide +kernel +theorem reic202 : Row.check reiW reiR reir202 = true := by decide +kernel +theorem reic203 : Row.check reiW reiR reir203 = true := by decide +kernel +theorem reic204 : Row.check reiW reiR reir204 = true := by decide +kernel +theorem reic205 : Row.check reiW reiR reir205 = true := by decide +kernel +theorem reic206 : Row.check reiW reiR reir206 = true := by decide +kernel +theorem reic207 : Row.check reiW reiR reir207 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP26.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP26.lean new file mode 100644 index 0000000000..1fbe02322c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP26.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic208 : Row.check reiW reiR reir208 = true := by decide +kernel +theorem reic209 : Row.check reiW reiR reir209 = true := by decide +kernel +theorem reic210 : Row.check reiW reiR reir210 = true := by decide +kernel +theorem reic211 : Row.check reiW reiR reir211 = true := by decide +kernel +theorem reic212 : Row.check reiW reiR reir212 = true := by decide +kernel +theorem reic213 : Row.check reiW reiR reir213 = true := by decide +kernel +theorem reic214 : Row.check reiW reiR reir214 = true := by decide +kernel +theorem reic215 : Row.check reiW reiR reir215 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP27.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP27.lean new file mode 100644 index 0000000000..8aa45316a8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP27.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic216 : Row.check reiW reiR reir216 = true := by decide +kernel +theorem reic217 : Row.check reiW reiR reir217 = true := by decide +kernel +theorem reic218 : Row.check reiW reiR reir218 = true := by decide +kernel +theorem reic219 : Row.check reiW reiR reir219 = true := by decide +kernel +theorem reic220 : Row.check reiW reiR reir220 = true := by decide +kernel +theorem reic221 : Row.check reiW reiR reir221 = true := by decide +kernel +theorem reic222 : Row.check reiW reiR reir222 = true := by decide +kernel +theorem reic223 : Row.check reiW reiR reir223 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP28.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP28.lean new file mode 100644 index 0000000000..fe0a766ec6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP28.lean @@ -0,0 +1,9 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic224 : Row.check reiW reiR reir224 = true := by decide +kernel +theorem reic225 : Row.check reiW reiR reir225 = true := by decide +kernel +theorem reic226 : Row.check reiW reiR reir226 = true := by decide +kernel +theorem reic227 : Row.check reiW reiR reir227 = true := by decide +kernel +theorem reic228 : Row.check reiW reiR reir228 = true := by decide +kernel +theorem reic229 : Row.check reiW reiR reir229 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP3.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP3.lean new file mode 100644 index 0000000000..5e411c2747 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP3.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic24 : Row.check reiW reiR reir24 = true := by decide +kernel +theorem reic25 : Row.check reiW reiR reir25 = true := by decide +kernel +theorem reic26 : Row.check reiW reiR reir26 = true := by decide +kernel +theorem reic27 : Row.check reiW reiR reir27 = true := by decide +kernel +theorem reic28 : Row.check reiW reiR reir28 = true := by decide +kernel +theorem reic29 : Row.check reiW reiR reir29 = true := by decide +kernel +theorem reic30 : Row.check reiW reiR reir30 = true := by decide +kernel +theorem reic31 : Row.check reiW reiR reir31 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP4.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP4.lean new file mode 100644 index 0000000000..c2bd2a35b0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP4.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic32 : Row.check reiW reiR reir32 = true := by decide +kernel +theorem reic33 : Row.check reiW reiR reir33 = true := by decide +kernel +theorem reic34 : Row.check reiW reiR reir34 = true := by decide +kernel +theorem reic35 : Row.check reiW reiR reir35 = true := by decide +kernel +theorem reic36 : Row.check reiW reiR reir36 = true := by decide +kernel +theorem reic37 : Row.check reiW reiR reir37 = true := by decide +kernel +theorem reic38 : Row.check reiW reiR reir38 = true := by decide +kernel +theorem reic39 : Row.check reiW reiR reir39 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP5.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP5.lean new file mode 100644 index 0000000000..43546860af --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP5.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic40 : Row.check reiW reiR reir40 = true := by decide +kernel +theorem reic41 : Row.check reiW reiR reir41 = true := by decide +kernel +theorem reic42 : Row.check reiW reiR reir42 = true := by decide +kernel +theorem reic43 : Row.check reiW reiR reir43 = true := by decide +kernel +theorem reic44 : Row.check reiW reiR reir44 = true := by decide +kernel +theorem reic45 : Row.check reiW reiR reir45 = true := by decide +kernel +theorem reic46 : Row.check reiW reiR reir46 = true := by decide +kernel +theorem reic47 : Row.check reiW reiR reir47 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP6.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP6.lean new file mode 100644 index 0000000000..32ac37ccb5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP6.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic48 : Row.check reiW reiR reir48 = true := by decide +kernel +theorem reic49 : Row.check reiW reiR reir49 = true := by decide +kernel +theorem reic50 : Row.check reiW reiR reir50 = true := by decide +kernel +theorem reic51 : Row.check reiW reiR reir51 = true := by decide +kernel +theorem reic52 : Row.check reiW reiR reir52 = true := by decide +kernel +theorem reic53 : Row.check reiW reiR reir53 = true := by decide +kernel +theorem reic54 : Row.check reiW reiR reir54 = true := by decide +kernel +theorem reic55 : Row.check reiW reiR reir55 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP7.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP7.lean new file mode 100644 index 0000000000..72b14bb101 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP7.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic56 : Row.check reiW reiR reir56 = true := by decide +kernel +theorem reic57 : Row.check reiW reiR reir57 = true := by decide +kernel +theorem reic58 : Row.check reiW reiR reir58 = true := by decide +kernel +theorem reic59 : Row.check reiW reiR reir59 = true := by decide +kernel +theorem reic60 : Row.check reiW reiR reir60 = true := by decide +kernel +theorem reic61 : Row.check reiW reiR reir61 = true := by decide +kernel +theorem reic62 : Row.check reiW reiR reir62 = true := by decide +kernel +theorem reic63 : Row.check reiW reiR reir63 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP8.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP8.lean new file mode 100644 index 0000000000..701b680719 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP8.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic64 : Row.check reiW reiR reir64 = true := by decide +kernel +theorem reic65 : Row.check reiW reiR reir65 = true := by decide +kernel +theorem reic66 : Row.check reiW reiR reir66 = true := by decide +kernel +theorem reic67 : Row.check reiW reiR reir67 = true := by decide +kernel +theorem reic68 : Row.check reiW reiR reir68 = true := by decide +kernel +theorem reic69 : Row.check reiW reiR reir69 = true := by decide +kernel +theorem reic70 : Row.check reiW reiR reir70 = true := by decide +kernel +theorem reic71 : Row.check reiW reiR reir71 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreereiP9.lean b/research/p104-reader-ceiling/lean/Nov15/CTreereiP9.lean new file mode 100644 index 0000000000..75cdf09db8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreereiP9.lean @@ -0,0 +1,11 @@ +import Nov15.CTreereiDefs +namespace CTree +theorem reic72 : Row.check reiW reiR reir72 = true := by decide +kernel +theorem reic73 : Row.check reiW reiR reir73 = true := by decide +kernel +theorem reic74 : Row.check reiW reiR reir74 = true := by decide +kernel +theorem reic75 : Row.check reiW reiR reir75 = true := by decide +kernel +theorem reic76 : Row.check reiW reiR reir76 = true := by decide +kernel +theorem reic77 : Row.check reiW reiR reir77 = true := by decide +kernel +theorem reic78 : Row.check reiW reiR reir78 = true := by decide +kernel +theorem reic79 : Row.check reiW reiR reir79 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaDefs.lean new file mode 100644 index 0000000000..7e47550485 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaDefs.lean @@ -0,0 +1,235 @@ +import Nov15.CTreeCore +namespace CTree +def rfaW : List (List Nat) := [[0,0,0,0,0,0,0,0,0],[0,0,1593787518311,2186511298872,2569449669526,2853213163435,3078748608453,3265902831914,3425832457328],[0,0,0,2186511298872,3162173450087,3828875314650,4338174253577,4750863922056,3265902831914],[0,0,0,0,2569449669526,3828875314650,4721112624231,4338174253577,3078748608453],[0,0,0,0,0,2853213163435,3828875314650,3828875314650,2853213163435],[0,0,0,0,0,0,2569449669526,3162173450087,2569449669526],[0,0,0,0,0,0,0,2186511298872,2186511298872],[0,0,0,0,0,0,0,0,1593787518311],[0,0,0,0,0,0,0,0,0]] +def rfar0 : Row := ⟨0,1,1,48,1725436586697640946858688965569256363112777243042596638790631055949822,[0,2926101314955,3180874710381,3472409550229,3678108886717,4125625383675,4332531482769,4900141710308,5105841046796,6134952245636,6349339911240,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722937,10746967341304,10953873440398,11470689466958,11677595566052,12601814059939,12840931895743,13319541310073,13526447409167,15115901074514,15394581585065,15826146758138,16669991980402,17101557153475,17533122326548,18425382356869,18632288455963,19661399654803,19875787320407,20379126904937,20586033004031,21607493059017,21861443399368,22293008572441,23355191132104,24161142748339,24480320849565,24997136876125,25204042975219,26128261469106,26367379304910,26845988719240,27052894818334],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4125625383675,4332531482769,4900141710308,5105841046796,6134952245636,6349339911240,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722937,10746967341304,10953873440398,11470689466958,11677595566052,12601814059939,12840931895743,13319541310073,13526447409167,16734418763025,16988369103376,17419934276449,18263779498713,18695344671786,19126909844859,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar1 : Row := ⟨1,2,1,20,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,11475727942638,11682634041732,12217944589293,12424850688387],[1000000000000000000000000000000,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,13434786157814,13641692256908,14678285022258,14885191121352]⟩ +def rfar2 : Row := ⟨2,2,1,22,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,11475727942638,11682634041732,12217944589293,12424850688387,13194537840500,13433655676304],[1000000000000000000000000000000,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,13434786157814,13641692256908,14678285022258,14885191121352,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar3 : Row := ⟨3,2,1,24,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,11475727942638,11682634041732,12217944589293,12424850688387,13194537840500,13433655676304,13912265090634,14119171189728],[1000000000000000000000000000000,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,13434786157814,13641692256908,14678285022258,14885191121352,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar4 : Row := ⟨4,2,1,26,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,11475727942638,11682634041732,12217944589293,12424850688387,13194537840500,13433655676304,13912265090634,14119171189728,15140631244714,15394581585065],[1000000000000000000000000000000,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,13434786157814,13641692256908,14678285022258,14885191121352,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar5 : Row := ⟨5,2,1,28,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,11475727942638,11682634041732,12217944589293,12424850688387,13194537840500,13433655676304,13912265090634,14119171189728,15140631244714,15394581585065,15826146758138,16669991980402],[1000000000000000000000000000000,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,13434786157814,13641692256908,14678285022258,14885191121352,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar6 : Row := ⟨6,2,1,30,1725436586697640946858688965569256363112777243042596638790631055947776,[0,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,11475727942638,11682634041732,12217944589293,12424850688387,13194537840500,13433655676304,13912265090634,14119171189728,15140631244714,15394581585065,15826146758138,16669991980402,17101557153475,17533122326548],[1000000000000000000000000000000,2956198450985,3403870488790,3731833596956,3937532933444,4416142347774,4623048446868,5159565757035,5365265093523,6134952245636,6374070081440,6852679495770,7059585594864,8128089891107,8334995990201,8766561163274,9828743722938,13434786157814,13641692256908,14678285022258,14885191121352,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar7 : Row := ⟨7,2,2,18,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8234956204626,9153179822993,9360085922087],[1000000000000000000000000000000,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8735488073502,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar8 : Row := ⟨8,2,2,20,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8234956204626,9153179822993,9360085922087,9876901948647,10083808047741],[1000000000000000000000000000000,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8735488073502,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar9 : Row := ⟨9,2,2,22,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8234956204626,9153179822993,9360085922087,9876901948647,10083808047741,11008026541628,11247144377432],[1000000000000000000000000000000,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8735488073502,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar10 : Row := ⟨10,2,2,24,1725436586697640946858688965569256072344153165092240253739596775424000,[0,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8234956204626,9153179822993,9360085922087,9876901948647,10083808047741,11008026541628,11247144377432,11725753791762,11932659890856],[1000000000000000000000000000000,1632951415957,2192511765898,2484046605746,2689745942234,3186849877565,3393755976659,3911778765825,4117478102313,5041696596200,5280814432004,5759423846334,5966329945428,7034834241671,7241740340765,7673305513838,8735488073502,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar11 : Row := ⟨11,3,1,8,1725436586697640946858688965569256363112769808131088451570363873099776,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796]⟩ +def rfar12 : Row := ⟨12,3,1,10,1725436586697640946858688965569256363112777243028422585784197460262912,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240]⟩ +def rfar13 : Row := ⟨13,3,1,11,1725436586697640946858688965569256363112777243033147258110076319170560,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534]⟩ +def rfar14 : Row := ⟨14,3,1,12,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628]⟩ +def rfar15 : Row := ⟨15,3,1,13,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000]⟩ +def rfar16 : Row := ⟨16,3,1,14,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196,9630144562895],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar17 : Row := ⟨17,3,1,15,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196,9630144562895,10005982757104],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar18 : Row := ⟨18,3,1,16,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196,9630144562895,10005982757104,10211682093592],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar19 : Row := ⟨19,3,1,17,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196,9630144562895,10005982757104,10211682093592,11248274858942],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar20 : Row := ⟨20,3,1,18,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196,9630144562895,10005982757104,10211682093592,11248274858942,11455180958036],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar21 : Row := ⟨21,3,1,19,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196,9630144562895,10005982757104,10211682093592,11248274858942,11455180958036,12491773723386],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar22 : Row := ⟨22,3,1,20,1725436586697640946858688965569256363112777243042596602761834036985856,[0,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,9419021932196,9630144562895,10005982757104,10211682093592,11248274858942,11455180958036,12491773723386,12698679822480],[1000000000000000000000000000000,2926101314955,3180874710381,3472409550229,3678108886717,4313180885400,4524303516099,4900141710308,5105841046796,6142433812146,6349339911240,8174393372534,8381299471628,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar23 : Row := ⟨23,3,2,6,1725436586697640946858688964519793351043731158960419414395210547855360,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336]⟩ +def rfar24 : Row := ⟨24,3,2,7,1725436586697640946858688964869614258143869349367193180740345082675200,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545]⟩ +def rfar25 : Row := ⟨25,3,2,8,1725436586697640946858688965569256072344145730180740713430614152314880,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033]⟩ +def rfar26 : Row := ⟨26,3,2,9,1725436586697640946858688965569256072344148208479851515041139711279104,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383]⟩ +def rfar27 : Row := ⟨27,3,2,10,1725436586697640946858688965569256072344153165078073118262190829207552,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477]⟩ +def rfar28 : Row := ⟨28,3,2,11,1725436586697640946858688965569256072344153165082795484745060474421248,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6008800927499],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6889668537771]⟩ +def rfar29 : Row := ⟨29,3,2,12,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6008800927499,6214500263987],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6889668537771,7096574636865]⟩ +def rfar30 : Row := ⟨30,3,2,13,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6008800927499,6214500263987,6849572262670],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6889668537771,7096574636865,1000000000000000000000000000000]⟩ +def rfar31 : Row := ⟨31,3,2,14,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6008800927499,6214500263987,6849572262670,7060694893369],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6889668537771,7096574636865,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar32 : Row := ⟨32,3,2,15,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6008800927499,6214500263987,6849572262670,7060694893369,7436533087578],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6889668537771,7096574636865,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar33 : Row := ⟨33,3,2,16,1725436586697640946858688965569256072344153165092240217710799764848640,[0,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6008800927499,6214500263987,6849572262670,7060694893369,7436533087578,7642232424066],[1000000000000000000000000000000,1539374304226,1896149875618,2187684715466,2393384051954,3028456050637,3239578681336,3615416875545,3821116212033,4857708977383,5064615076477,6889668537771,7096574636865,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar34 : Row := ⟨34,3,3,4,1725436586697640946849780764332283298176074888370600511503471000682496,[0,1026249536151,1467908264030,1759443103878,1965142440366],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366]⟩ +def rfar35 : Row := ⟨35,3,3,6,1725436586697640946858688964519783049526763825862118485357350877134848,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884]⟩ +def rfar36 : Row := ⟨36,3,3,7,1725436586697640946858688964869593322802935736941613873340823816372224,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957]⟩ +def rfar37 : Row := ⟨37,3,3,8,1725436586697640946858688965569213869355279559100604649307769694846976,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445]⟩ +def rfar38 : Row := ⟨38,3,3,9,1725436586697640946858688965569213869355282037398534859297577842507776,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4419124136596],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4429467365795]⟩ +def rfar39 : Row := ⟨39,3,3,10,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4419124136596,4636373464889],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4429467365795,4636373464889]⟩ +def rfar40 : Row := ⟨40,3,3,11,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4419124136596,4636373464889,5152317704323],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4429467365795,4636373464889,1000000000000000000000000000000]⟩ +def rfar41 : Row := ⟨41,3,3,12,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4419124136596,4636373464889,5152317704323,5358017040811],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4429467365795,4636373464889,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar42 : Row := ⟨42,3,3,13,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4419124136596,4636373464889,5152317704323,5358017040811,5941578592235],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4429467365795,4636373464889,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar43 : Row := ⟨43,3,3,14,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4419124136596,4636373464889,5152317704323,5358017040811,5941578592235,6148484691329],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4429467365795,4636373464889,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar44 : Row := ⟨44,3,3,15,1725436586697640946858688965569213869355286993994395279277194137829376,[0,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4419124136596,4636373464889,5152317704323,5358017040811,5941578592235,6148484691329,6580049864402],[1000000000000000000000000000000,1026249536151,1467908264030,1759443103878,1965142440366,2548703991790,2755610090884,3187175263957,3392874600445,4429467365795,4636373464889,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar45 : Row := ⟨45,3,4,3,1725436572984891677951467423971062446496094382868200824551407605514240,[0,769687152113,1217359189918,1545322298084],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084]⟩ +def rfar46 : Row := ⟨46,3,4,4,1725436586697640898959295112272958727406674468635681809116020569276416,[0,769687152113,1217359189918,1545322298084,1751021634572],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572]⟩ +def rfar47 : Row := ⟨47,3,4,5,1725436586697640898962264512335118362156649842518275365008053446377472,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902]⟩ +def rfar48 : Row := ⟨48,3,4,6,1725436586697640898968203312459437631656600590283462476792119200579584,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996]⟩ +def rfar49 : Row := ⟨49,3,4,7,1725436586697640898968203312807886775465088746904641456538550479618048,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163]⟩ +def rfar50 : Row := ⟨50,3,4,8,1725436586697640898968203313504785063082065060146999416031413037694976,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651]⟩ +def rfar51 : Row := ⟨51,3,4,9,1725436586697640898968203313504785063082067536027077986791962835943424,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,3948440946764],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,4215346560001]⟩ +def rfar52 : Row := ⟨52,3,4,10,1725436586697640898968203313504785063082072487787235128313062432440320,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,3948440946764,4187558782568],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,4215346560001,4422252659095]⟩ +def rfar53 : Row := ⟨53,3,4,11,1725436586697640898968203313504785063082072487787235128313062432440320,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,3948440946764,4187558782568,4666168196898],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,4215346560001,4422252659095,1000000000000000000000000000000]⟩ +def rfar54 : Row := ⟨54,3,4,12,1725436586697640898968203313504785063082072487787235128313062432440320,[0,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,3948440946764,4187558782568,4666168196898,4873074295992],[1000000000000000000000000000000,769687152113,1217359189918,1545322298084,1751021634572,2229631048902,2436537147996,2973054458163,3178753794651,4215346560001,4422252659095,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar55 : Row := ⟨55,4,1,4,1725436586697640946849780764332285624630501836782856782355286582099968,[0,2853213163435,3249543244132,3534508596759,3740207933247],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247]⟩ +def rfar56 : Row := ⟨56,4,1,6,1725436586697640946858688964519793434364829842347494516881757994745856,[0,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769]⟩ +def rfar57 : Row := ⟨57,4,1,7,1725436586697640946858688964869614341383520862114826843778097958879232,[0,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429]⟩ +def rfar58 : Row := ⟨58,4,1,8,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917]⟩ +def rfar59 : Row := ⟨59,4,1,9,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,7865833316922],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,1000000000000000000000000000000]⟩ +def rfar60 : Row := ⟨60,4,1,10,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,7865833316922,8072739416016],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar61 : Row := ⟨61,4,1,11,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,7865833316922,8072739416016,8458156866444],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar62 : Row := ⟨62,4,1,12,1725436586697640946858688965569256321574402374763975610546660422189056,[0,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,7865833316922,8072739416016,8458156866444,8665062965538],[1000000000000000000000000000000,2853213163435,3249543244132,3534508596759,3740207933247,4125625383675,4332531482769,5192338267429,5398037603917,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar63 : Row := ⟨63,4,2,2,1725429058513974481006928856009369042408591087781735667604368899702784,[0,1426606581717,1822936662414],[1000000000000000000000000000000,1426606581717,1822936662414]⟩ +def rfar64 : Row := ⟨64,4,2,3,1725436572984891677951467423971191030149188575169341034321976229888000,[0,1426606581717,1822936662414,2107902015041],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041]⟩ +def rfar65 : Row := ⟨65,4,2,4,1725436586697640946849780764332285583092126968504235754111315948339200,[0,1426606581717,1822936662414,2107902015041,2313601351529],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529]⟩ +def rfar66 : Row := ⟨66,4,2,5,1725436586697640946852750164394788158644653058173367646790825996713984,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957]⟩ +def rfar67 : Row := ⟨67,4,2,6,1725436586697640946858688964519793309749705237511631432149846093463552,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051]⟩ +def rfar68 : Row := ⟨68,4,2,7,1725436586697640946858688964869614216768396257278963759046186057596928,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711]⟩ +def rfar69 : Row := ⟨69,4,2,8,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199]⟩ +def rfar70 : Row := ⟨70,4,2,9,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,5012620153486],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,1000000000000000000000000000000]⟩ +def rfar71 : Row := ⟨71,4,2,10,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,5012620153486,5219526252580],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar72 : Row := ⟨72,4,2,11,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,5012620153486,5219526252580,5604943703008],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar73 : Row := ⟨73,4,2,12,1725436586697640946858688965569256030805778296813628412838865985863680,[0,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,5012620153486,5219526252580,5604943703008,5811849802102],[1000000000000000000000000000000,1426606581717,1822936662414,2107902015041,2313601351529,2699018801957,2905924901051,3765731685711,3971431022199,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar74 : Row := ⟨74,4,3,2,1725429058513974481006928856009368710101592141552767441652603829616640,[0,951071054478,1347401135175],[1000000000000000000000000000000,951071054478,1347401135175]⟩ +def rfar75 : Row := ⟨75,4,3,3,1725436572984891677951467423971190033228191736482436356466681019629568,[0,951071054478,1347401135175,1632366487802],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802]⟩ +def rfar76 : Row := ⟨76,4,3,4,1725436586697640946849780764332283256943134344901458172448960457736192,[0,951071054478,1347401135175,1632366487802,1838065824290],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802,1838065824290]⟩ +def rfar77 : Row := ⟨77,4,3,5,1725436586697640946852750164394783174039668864738844257514349945421824,[0,951071054478,1347401135175,1632366487802,1838065824290,2223483274718],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802,1838065824290,2223483274718]⟩ +def rfar78 : Row := ⟨78,4,3,6,1725436586697640946858688964519783008232737904413616427645128920793088,[0,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812]⟩ +def rfar79 : Row := ⟨79,4,3,7,1725436586697640946858688964869593281427462644853965524084986642169856,[0,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472]⟩ +def rfar80 : Row := ⟨80,4,3,8,1725436586697640946858688965569213827816912125734663716964702084923392,[0,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472,3495895494960],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472,3495895494960]⟩ +def rfar81 : Row := ⟨81,4,3,9,1725436586697640946858688965569213827816912125734663716964702084923392,[0,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472,3495895494960,4061549099008],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472,3495895494960,1000000000000000000000000000000]⟩ +def rfar82 : Row := ⟨82,4,3,10,1725436586697640946858688965569213827816912125734663716964702084923392,[0,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472,3495895494960,4061549099008,4268455198102],[1000000000000000000000000000000,951071054478,1347401135175,1632366487802,1838065824290,2223483274718,2430389373812,3290196158472,3495895494960,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar83 : Row := ⟨83,4,4,1,1653786614870979874242332953218776295840243179859395196846919280230400,[0,713303290858],[1000000000000000000000000000000,713303290858]⟩ +def rfar84 : Row := ⟨84,4,4,2,1725429058513974481006928856009326174805727024244834519826674858590208,[0,713303290858,1090034455186],[1000000000000000000000000000000,713303290858,1090034455186]⟩ +def rfar85 : Row := ⟨85,4,4,3,1725436572984891677951467423971062427340596384558637590988894106550272,[0,713303290858,1090034455186,1381569295034],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034]⟩ +def rfar86 : Row := ⟨86,4,4,4,1725436586697640898959295112272958686173733925298765731581860092313600,[0,713303290858,1090034455186,1381569295034,1587268631522],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1587268631522]⟩ +def rfar87 : Row := ⟨87,4,4,5,1725436586697640898962264512335118320903347506672688442039817811787776,[0,713303290858,1090034455186,1381569295034,1587268631522,1985715511098],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1587268631522,1985715511098]⟩ +def rfar88 : Row := ⟨88,4,4,6,1725436586697640898968203312459437590362574669420533862955733250736128,[0,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192]⟩ +def rfar89 : Row := ⟨89,4,4,7,1725436586697640898968203312807886734089615656007029460965863899267072,[0,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,2905924901050],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,3052428394852]⟩ +def rfar90 : Row := ⟨90,4,4,8,1725436586697640898968203313504785021543697629180020656986125196328960,[0,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,2905924901050,3174537263044],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,3052428394852,3258127731340]⟩ +def rfar91 : Row := ⟨91,4,4,9,1725436586697640898968203313504785021543697629180020656986125196328960,[0,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,2905924901050,3174537263044,3572984142620],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,3052428394852,3258127731340,1000000000000000000000000000000]⟩ +def rfar92 : Row := ⟨92,4,4,10,1725436586697640898968203313504785021543697629180020656986125196328960,[0,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,2905924901050,3174537263044,3572984142620,3779890241714],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1587268631522,1985715511098,2192621610192,3052428394852,3258127731340,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar93 : Row := ⟨93,4,5,2,1725429058513974481006928855992992621193521977998592538669949984440320,[0,570642632687,898590689454],[1000000000000000000000000000000,570642632687,898590689454]⟩ +def rfar94 : Row := ⟨94,4,5,3,1725436572984891582170496119814897154848762079756415658785340930392064,[0,570642632687,898590689454,1190125529302],[1000000000000000000000000000000,570642632687,898590689454,1190125529302]⟩ +def rfar95 : Row := ⟨95,4,5,4,1725436586697640611616381199837129975922641103384583897284650312138752,[0,570642632687,898590689454,1190125529302,1395824865790],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1395824865790]⟩ +def rfar96 : Row := ⟨96,4,5,5,1725436586697640611619350599812177324720494438111882708240075369480192,[0,570642632687,898590689454,1190125529302,1395824865790,1843054852927],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1395824865790,1843054852927]⟩ +def rfar97 : Row := ⟨97,4,5,6,1725436586697640611625289399762272022316201107566480330150925484163072,[0,570642632687,898590689454,1190125529302,1395824865790,1843054852927,2049960952021],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1395824865790,1843054852927,2049960952021]⟩ +def rfar98 : Row := ⟨98,4,5,7,1725436586697640611625289399762272022316201107566480330150925484163072,[0,570642632687,898590689454,1190125529302,1395824865790,1843054852927,2049960952021,2585950395092],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1395824865790,1843054852927,2049960952021,1000000000000000000000000000000]⟩ +def rfar99 : Row := ⟨99,4,5,8,1725436586697640611625289399762272022316201107566480330150925484163072,[0,570642632687,898590689454,1190125529302,1395824865790,1843054852927,2049960952021,2585950395092,2791649731580],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1395824865790,1843054852927,2049960952021,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar100 : Row := ⟨100,4,6,1,1653786614870979874242332953213331777969508164443981203128010988847104,[0,475535527239],[1000000000000000000000000000000,475535527239]⟩ +def rfar101 : Row := ⟨101,4,6,2,1725429058513974481006928854599196046285358031652610146629427390316544,[0,475535527239,770961512299],[1000000000000000000000000000000,475535527239,770961512299]⟩ +def rfar102 : Row := ⟨102,4,6,3,1725436572984891582170496115633507430124270240718468482663773148020736,[0,475535527239,770961512299,1062496352147],[1000000000000000000000000000000,475535527239,770961512299,1062496352147]⟩ +def rfar103 : Row := ⟨103,4,6,4,1725436586697640228492495973608339361978736691385411248316211607371776,[0,475535527239,770961512299,1062496352147,1268195688635],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1268195688635]⟩ +def rfar104 : Row := ⟨104,4,6,5,1725436586697640228495465362433014111511278455344850922947455911723008,[0,475535527239,770961512299,1062496352147,1268195688635,1743731215874],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1268195688635,1747947747479]⟩ +def rfar105 : Row := ⟨105,4,6,6,1725436586697640228501404140082363610576361983263730272209944520425472,[0,475535527239,770961512299,1062496352147,1268195688635,1743731215874,1954853846573],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1268195688635,1747947747479,1954853846573]⟩ +def rfar106 : Row := ⟨106,4,6,7,1725436586697640228501404140082363610576361983263730272209944520425472,[0,475535527239,770961512299,1062496352147,1268195688635,1743731215874,1954853846573,2330692040782],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1268195688635,1747947747479,1954853846573,1000000000000000000000000000000]⟩ +def rfar107 : Row := ⟨107,4,6,8,1725436586697640228501404140082363610576361983263730272209944520425472,[0,475535527239,770961512299,1062496352147,1268195688635,1743731215874,1954853846573,2330692040782,2536391377270],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1268195688635,1747947747479,1954853846573,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar108 : Row := ⟨108,4,7,2,1725429058513973714759158287850295675928105607283708701369697262632960,[0,407601880490,679797814331],[1000000000000000000000000000000,407601880490,679797814331]⟩ +def rfar109 : Row := ⟨109,4,7,3,1725436572984889283427184504589787113175005533754637237478028788891648,[0,407601880490,679797814331,971332654179],[1000000000000000000000000000000,407601880490,679797814331,971332654179]⟩ +def rfar110 : Row := ⟨110,4,7,4,1725436586697634864758102273974979151845447419231720403278438785351680,[0,407601880490,679797814331,971332654179,1177031990667],[1000000000000000000000000000000,407601880490,679797814331,971332654179,1177031990667]⟩ +def rfar111 : Row := ⟨111,4,8,1,1653786614870979874242330054116455968988499764800605758841015211393024,[0,356651645429],[1000000000000000000000000000000,356651645429]⟩ +def rfar112 : Row := ⟨112,4,8,2,1725429058513967584776986260808706006780710656331157529442390231744512,[0,356651645429,611425040855],[1000000000000000000000000000000,356651645429,611425040855]⟩ +def rfar113 : Row := ⟨113,4,8,3,1725436572984870893480674132455788929572344914040861519676653227212800,[0,356651645429,611425040855,902959880703],[1000000000000000000000000000000,356651645429,611425040855,902959880703]⟩ +def rfar114 : Row := ⟨114,4,8,4,1725436586697591954882915211656163939332255461995495593728926162092032,[0,356651645429,611425040855,902959880703,1108659217191],[1000000000000000000000000000000,356651645429,611425040855,902959880703,1108659217191]⟩ +def rfar115 : Row := ⟨115,5,1,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2569449669526,2838922252229,2993800135898,3199499472386],[1000000000000000000000000000000,2569449669526,2838922252229,2993800135898,3199499472386]⟩ +def rfar116 : Row := ⟨116,5,1,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2569449669526,2838922252229,2993800135898,3199499472386,5768949141912,5987600271796],[1000000000000000000000000000000,2569449669526,2838922252229,2993800135898,3199499472386,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar117 : Row := ⟨117,5,1,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,2569449669526,2838922252229,2993800135898,3199499472386,5768949141912,5987600271796,6193299608284,6398998944772],[1000000000000000000000000000000,2569449669526,2838922252229,2993800135898,3199499472386,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar118 : Row := ⟨118,5,2,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,1284724834763,1554197417466],[1000000000000000000000000000000,1284724834763,1554197417466]⟩ +def rfar119 : Row := ⟨119,5,2,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,1284724834763,1554197417466,1709075301135],[1000000000000000000000000000000,1284724834763,1554197417466,1709075301135]⟩ +def rfar120 : Row := ⟨120,5,2,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1284724834763,1554197417466,1709075301135,1914774637623],[1000000000000000000000000000000,1284724834763,1554197417466,1709075301135,1914774637623]⟩ +def rfar121 : Row := ⟨121,5,2,5,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1284724834763,1554197417466,1709075301135,1914774637623,3199499472386],[1000000000000000000000000000000,1284724834763,1554197417466,1709075301135,1914774637623,1000000000000000000000000000000]⟩ +def rfar122 : Row := ⟨122,5,2,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1284724834763,1554197417466,1709075301135,1914774637623,3199499472386,3418150602270],[1000000000000000000000000000000,1284724834763,1554197417466,1709075301135,1914774637623,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar123 : Row := ⟨123,5,2,7,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1284724834763,1554197417466,1709075301135,1914774637623,3199499472386,3418150602270,3623849938758],[1000000000000000000000000000000,1284724834763,1554197417466,1709075301135,1914774637623,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar124 : Row := ⟨124,5,2,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,1284724834763,1554197417466,1709075301135,1914774637623,3199499472386,3418150602270,3623849938758,3829549275246],[1000000000000000000000000000000,1284724834763,1554197417466,1709075301135,1914774637623,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar125 : Row := ⟨125,5,3,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,856483223175,1125955805878],[1000000000000000000000000000000,856483223175,1125955805878]⟩ +def rfar126 : Row := ⟨126,5,3,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,856483223175,1125955805878,1280833689547],[1000000000000000000000000000000,856483223175,1125955805878,1280833689547]⟩ +def rfar127 : Row := ⟨127,5,3,4,1725436586697640898968203313510229539414432644595434650705033487712256,[0,856483223175,1125955805878,1280833689547,1486533026035],[1000000000000000000000000000000,856483223175,1125955805878,1280833689547,1486533026035]⟩ +def rfar128 : Row := ⟨128,5,3,5,1725436586697640898968203313510229539414432644595434650705033487712256,[0,856483223175,1125955805878,1280833689547,1486533026035,2343016249210],[1000000000000000000000000000000,856483223175,1125955805878,1280833689547,1486533026035,1000000000000000000000000000000]⟩ +def rfar129 : Row := ⟨129,5,3,6,1725436586697640898968203313510229539414432644595434650705033487712256,[0,856483223175,1125955805878,1280833689547,1486533026035,2343016249210,2561667379094],[1000000000000000000000000000000,856483223175,1125955805878,1280833689547,1486533026035,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar130 : Row := ⟨130,5,3,7,1725436586697640898968203313510229539414432644595434650705033487712256,[0,856483223175,1125955805878,1280833689547,1486533026035,2343016249210,2561667379094,2767366715582],[1000000000000000000000000000000,856483223175,1125955805878,1280833689547,1486533026035,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar131 : Row := ⟨131,5,3,8,1725436586697640898968203313510229539414432644595434650705033487712256,[0,856483223175,1125955805878,1280833689547,1486533026035,2343016249210,2561667379094,2767366715582,2973066052070],[1000000000000000000000000000000,856483223175,1125955805878,1280833689547,1486533026035,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar132 : Row := ⟨132,5,4,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,642362417381],[1000000000000000000000000000000,642362417381]⟩ +def rfar133 : Row := ⟨133,5,4,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,642362417381,911835000084],[1000000000000000000000000000000,642362417381,911835000084]⟩ +def rfar134 : Row := ⟨134,5,4,3,1725436572984891631661488454596408649253366394090421802641103400206336,[0,642362417381,911835000084,1066712883753],[1000000000000000000000000000000,642362417381,911835000084,1066712883753]⟩ +def rfar135 : Row := ⟨135,5,4,4,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642362417381,911835000084,1066712883753,1272412220241],[1000000000000000000000000000000,642362417381,911835000084,1066712883753,1272412220241]⟩ +def rfar136 : Row := ⟨136,5,4,5,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642362417381,911835000084,1066712883753,1272412220241,1914774637622],[1000000000000000000000000000000,642362417381,911835000084,1066712883753,1272412220241,1000000000000000000000000000000]⟩ +def rfar137 : Row := ⟨137,5,4,6,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642362417381,911835000084,1066712883753,1272412220241,1914774637622,2133425767506],[1000000000000000000000000000000,642362417381,911835000084,1066712883753,1272412220241,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar138 : Row := ⟨138,5,4,7,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642362417381,911835000084,1066712883753,1272412220241,1914774637622,2133425767506,2339125103994],[1000000000000000000000000000000,642362417381,911835000084,1066712883753,1272412220241,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar139 : Row := ⟨139,5,4,8,1725436586697640851077717661451202715716088046148272662619435919474688,[0,642362417381,911835000084,1066712883753,1272412220241,1914774637622,2133425767506,2339125103994,2544824440482],[1000000000000000000000000000000,642362417381,911835000084,1066712883753,1272412220241,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar140 : Row := ⟨140,5,5,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,513889933905,765250316541],[1000000000000000000000000000000,513889933905,765250316541]⟩ +def rfar141 : Row := ⟨141,5,5,3,1725436572984891535880517150478355001856677197196097826469908263731200,[0,513889933905,765250316541,938240400277],[1000000000000000000000000000000,513889933905,765250316541,938240400277]⟩ +def rfar142 : Row := ⟨142,5,5,4,1725436586697640563734803749097041773526020455465300734105850510049280,[0,513889933905,765250316541,938240400277,1143939736765],[1000000000000000000000000000000,513889933905,765250316541,938240400277,1143939736765]⟩ +def rfar143 : Row := ⟨143,5,5,5,1725436586697640563734803749097041773526020455465300734105850510049280,[0,513889933905,765250316541,938240400277,1143939736765,1657829670670],[1000000000000000000000000000000,513889933905,765250316541,938240400277,1143939736765,1000000000000000000000000000000]⟩ +def rfar144 : Row := ⟨144,5,5,6,1725436586697640563734803749097041773526020455465300734105850510049280,[0,513889933905,765250316541,938240400277,1143939736765,1657829670670,1876480800554],[1000000000000000000000000000000,513889933905,765250316541,938240400277,1143939736765,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar145 : Row := ⟨145,5,6,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,428241611587],[1000000000000000000000000000000,428241611587]⟩ +def rfar146 : Row := ⟨146,5,6,2,1725429058513974435512749127358223492903704978117757371786200885493760,[0,428241611587,659844534871],[1000000000000000000000000000000,428241611587,659844534871]⟩ +def rfar147 : Row := ⟨147,5,6,3,1725436572984891535880517150478355001856677197196097826469908263731200,[0,428241611587,659844534871,852592077959],[1000000000000000000000000000000,428241611587,659844534871,852592077959]⟩ +def rfar148 : Row := ⟨148,5,6,4,1725436586697640180610918532624827183939263667888004829421069964148736,[0,428241611587,659844534871,852592077959,1058291414447],[1000000000000000000000000000000,428241611587,659844534871,852592077959,1058291414447]⟩ +def rfar149 : Row := ⟨149,5,6,5,1725436586697640180610918532624827183939263667888004829421069964148736,[0,428241611587,659844534871,852592077959,1058291414447,1486533026034],[1000000000000000000000000000000,428241611587,659844534871,852592077959,1058291414447,1000000000000000000000000000000]⟩ +def rfar150 : Row := ⟨150,5,6,6,1725436586697640180610918532624827183939263667888004829421069964148736,[0,428241611587,659844534871,852592077959,1058291414447,1486533026034,1705184155918],[1000000000000000000000000000000,428241611587,659844534871,852592077959,1058291414447,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar151 : Row := ⟨151,5,7,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,367064238503],[1000000000000000000000000000000,367064238503]⟩ +def rfar152 : Row := ⟨152,5,7,2,1725429058513973669264978694413794313730191402963165562416639793692672,[0,367064238503,584554690822],[1000000000000000000000000000000,367064238503,584554690822]⟩ +def rfar153 : Row := ⟨153,5,7,3,1725436572984889237137205851645067464336136471732322398361224988327936,[0,367064238503,584554690822,791414704875],[1000000000000000000000000000000,367064238503,584554690822,791414704875]⟩ +def rfar154 : Row := ⟨154,5,7,4,1725436586697634816876525502013822929724668641805862163834142321541120,[0,367064238503,584554690822,791414704875,997114041363],[1000000000000000000000000000000,367064238503,584554690822,791414704875,997114041363]⟩ +def rfar155 : Row := ⟨155,5,7,5,1725436586697634816876525502013822929724668641805862163834142321541120,[0,367064238503,584554690822,791414704875,997114041363,1364178279866],[1000000000000000000000000000000,367064238503,584554690822,791414704875,997114041363,1000000000000000000000000000000]⟩ +def rfar156 : Row := ⟨156,5,7,6,1725436586697634816876525502013822929724668641805862163834142321541120,[0,367064238503,584554690822,791414704875,997114041363,1364178279866,1581668732185],[1000000000000000000000000000000,367064238503,584554690822,791414704875,997114041363,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar157 : Row := ⟨157,5,8,1,1653786614870979859077606377466340926842290479932363611513602153906176,[0,321181208690],[1000000000000000000000000000000,321181208690]⟩ +def rfar158 : Row := ⟨158,5,8,2,1725429058513967539282815230858360880342082801726431087460151059283968,[0,321181208690,528087307784],[1000000000000000000000000000000,321181208690,528087307784]⟩ +def rfar159 : Row := ⟨159,5,8,3,1725436572984870847190715460978767164171810668022118973491758785101824,[0,321181208690,528087307784,745531675062],[1000000000000000000000000000000,321181208690,528087307784,745531675062]⟩ +def rfar160 : Row := ⟨160,5,8,4,1725436586697591907001381257125788896007908433148720839138721180680192,[0,321181208690,528087307784,745531675062,951231011550],[1000000000000000000000000000000,321181208690,528087307784,745531675062,951231011550]⟩ +def rfar161 : Row := ⟨161,5,8,5,1725436586697591907001381257125788896007908433148720839138721180680192,[0,321181208690,528087307784,745531675062,951231011550,1272412220240],[1000000000000000000000000000000,321181208690,528087307784,745531675062,951231011550,1000000000000000000000000000000]⟩ +def rfar162 : Row := ⟨162,5,8,6,1725436586697591907001381257125788896007908433148720839138721180680192,[0,321181208690,528087307784,745531675062,951231011550,1272412220240,1479318319334],[1000000000000000000000000000000,321181208690,528087307784,745531675062,951231011550,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar163 : Row := ⟨163,5,9,1,1653786614870930819220298669022873459737421670038487811861692278636544,[0,285494407725],[1000000000000000000000000000000,285494407725]⟩ +def rfar164 : Row := ⟨164,5,9,2,1725429058513820419710892105527958479027476372044803688504421433475072,[0,285494407725,484168232089],[1000000000000000000000000000000,285494407725,484168232089]⟩ +def rfar165 : Row := ⟨165,5,9,3,1725436572984527568189561501874494894437728998764988375928389658214400,[0,285494407725,484168232089,709844874097],[1000000000000000000000000000000,285494407725,484168232089,709844874097]⟩ +def rfar166 : Row := ⟨166,5,9,4,1725436586696856309141765630473776889434876284740583844360073051635712,[0,285494407725,484168232089,709844874097,915544210585],[1000000000000000000000000000000,285494407725,484168232089,709844874097,915544210585]⟩ +def rfar167 : Row := ⟨167,5,10,1,1653786614870930819220298669022873459737421670038487811861692278636544,[0,256944966952],[1000000000000000000000000000000,256944966952]⟩ +def rfar168 : Row := ⟨168,5,10,2,1725429058513035781993968770432479005349575413742790894073863429160960,[0,256944966952,449032971532],[1000000000000000000000000000000,256944966952,449032971532]⟩ +def rfar169 : Row := ⟨169,5,10,3,1725436572982173655038791496588056473404026123858949992636715645272064,[0,256944966952,449032971532,681295433324],[1000000000000000000000000000000,256944966952,449032971532,681295433324]⟩ +def rfar170 : Row := ⟨170,5,10,4,1725436586691363845123302284805420573689569576626494283346167021436928,[0,256944966952,449032971532,681295433324,886994769812],[1000000000000000000000000000000,256944966952,449032971532,681295433324,886994769812]⟩ +def rfar171 : Row := ⟨171,5,11,1,1653786614864653717484911988259037670314214003622385456417228244123648,[0,233586333593],[1000000000000000000000000000000,233586333593]⟩ +def rfar172 : Row := ⟨172,5,11,2,1725429058494204476787808728140971637079952414494483827740471325622272,[0,233586333593,420285940168],[1000000000000000000000000000000,233586333593,420285940168]⟩ +def rfar173 : Row := ⟨173,5,12,1,1653786614764220089718725096037665039542891340964747769305803691917312,[0,214120805793],[1000000000000000000000000000000,214120805793]⟩ +def rfar174 : Row := ⟨174,5,12,2,1725429058192903593489248051476853744765984426521570766406197669003264,[0,214120805793,396330080697],[1000000000000000000000000000000,214120805793,396330080697]⟩ +def rfar175 : Row := ⟨175,6,3,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,728837099624,861652726148,1590489825772,1723305452296],[1000000000000000000000000000000,728837099624,861652726148,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar176 : Row := ⟨176,6,4,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,546627824718,679443451242,1226071275960],[1000000000000000000000000000000,546627824718,679443451242,1000000000000000000000000000000]⟩ +def rfar177 : Row := ⟨177,6,4,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,546627824718,679443451242,1226071275960,1358886902484],[1000000000000000000000000000000,546627824718,679443451242,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar178 : Row := ⟨178,6,5,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,437302259774,570117886298,1007420146072,1140235772596],[1000000000000000000000000000000,437302259774,570117886298,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar179 : Row := ⟨179,6,6,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,364418549812,497234176336],[1000000000000000000000000000000,364418549812,497234176336]⟩ +def rfar180 : Row := ⟨180,6,6,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,364418549812,497234176336,861652726148],[1000000000000000000000000000000,364418549812,497234176336,1000000000000000000000000000000]⟩ +def rfar181 : Row := ⟨181,6,6,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,364418549812,497234176336,861652726148,994468352672],[1000000000000000000000000000000,364418549812,497234176336,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar182 : Row := ⟨182,6,7,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,312358756981,445174383505],[1000000000000000000000000000000,312358756981,445174383505]⟩ +def rfar183 : Row := ⟨183,6,7,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,312358756981,445174383505,757533140486],[1000000000000000000000000000000,312358756981,445174383505,1000000000000000000000000000000]⟩ +def rfar184 : Row := ⟨184,6,7,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,312358756981,445174383505,757533140486,890348767010],[1000000000000000000000000000000,312358756981,445174383505,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar185 : Row := ⟨185,6,8,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,273313912359],[1000000000000000000000000000000,273313912359]⟩ +def rfar186 : Row := ⟨186,6,8,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,273313912359,406129538883],[1000000000000000000000000000000,273313912359,406129538883]⟩ +def rfar187 : Row := ⟨187,6,8,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,273313912359,406129538883,679443451242],[1000000000000000000000000000000,273313912359,406129538883,1000000000000000000000000000000]⟩ +def rfar188 : Row := ⟨188,6,8,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,273313912359,406129538883,679443451242,812259077766],[1000000000000000000000000000000,273313912359,406129538883,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar189 : Row := ⟨189,6,9,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,242945699874,375761326398],[1000000000000000000000000000000,242945699874,375761326398]⟩ +def rfar190 : Row := ⟨190,6,9,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,242945699874,375761326398,618707026272],[1000000000000000000000000000000,242945699874,375761326398,1000000000000000000000000000000]⟩ +def rfar191 : Row := ⟨191,6,9,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,242945699874,375761326398,618707026272,751522652796],[1000000000000000000000000000000,242945699874,375761326398,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar192 : Row := ⟨192,6,10,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,218651129887],[1000000000000000000000000000000,218651129887]⟩ +def rfar193 : Row := ⟨193,6,10,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218651129887,351466756411],[1000000000000000000000000000000,218651129887,351466756411]⟩ +def rfar194 : Row := ⟨194,6,10,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218651129887,351466756411,570117886298],[1000000000000000000000000000000,218651129887,351466756411,1000000000000000000000000000000]⟩ +def rfar195 : Row := ⟨195,6,10,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218651129887,351466756411,570117886298,702933512822],[1000000000000000000000000000000,218651129887,351466756411,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar196 : Row := ⟨196,6,11,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,198773754442],[1000000000000000000000000000000,198773754442]⟩ +def rfar197 : Row := ⟨197,6,11,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198773754442,331589380966],[1000000000000000000000000000000,198773754442,331589380966]⟩ +def rfar198 : Row := ⟨198,6,11,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198773754442,331589380966,530363135408],[1000000000000000000000000000000,198773754442,331589380966,1000000000000000000000000000000]⟩ +def rfar199 : Row := ⟨199,6,11,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,198773754442,331589380966,530363135408,663178761932],[1000000000000000000000000000000,198773754442,331589380966,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar200 : Row := ⟨200,6,12,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,182209274906],[1000000000000000000000000000000,182209274906]⟩ +def rfar201 : Row := ⟨201,6,12,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182209274906,315024901430],[1000000000000000000000000000000,182209274906,315024901430]⟩ +def rfar202 : Row := ⟨202,6,12,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182209274906,315024901430,497234176336],[1000000000000000000000000000000,182209274906,315024901430,1000000000000000000000000000000]⟩ +def rfar203 : Row := ⟨203,6,12,4,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182209274906,315024901430,497234176336,630049802860],[1000000000000000000000000000000,182209274906,315024901430,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfar204 : Row := ⟨204,6,13,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,168193176836],[1000000000000000000000000000000,168193176836]⟩ +def rfar205 : Row := ⟨205,6,13,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,168193176836,301008803360],[1000000000000000000000000000000,168193176836,301008803360]⟩ +def rfar206 : Row := ⟨206,6,13,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,168193176836,301008803360,469201980196],[1000000000000000000000000000000,168193176836,301008803360,1000000000000000000000000000000]⟩ +def rfar207 : Row := ⟨207,6,14,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,156179378490],[1000000000000000000000000000000,156179378490]⟩ +def rfar208 : Row := ⟨208,6,14,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,156179378490,288995005014],[1000000000000000000000000000000,156179378490,288995005014]⟩ +def rfar209 : Row := ⟨209,6,14,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,156179378490,288995005014,445174383504],[1000000000000000000000000000000,156179378490,288995005014,1000000000000000000000000000000]⟩ +def rfar210 : Row := ⟨210,6,15,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,145767419924],[1000000000000000000000000000000,145767419924]⟩ +def rfar211 : Row := ⟨211,6,15,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,145767419924,278583046448],[1000000000000000000000000000000,145767419924,278583046448]⟩ +def rfar212 : Row := ⟨212,6,15,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,145767419924,278583046448,424350466372],[1000000000000000000000000000000,145767419924,278583046448,1000000000000000000000000000000]⟩ +def rfar213 : Row := ⟨213,6,16,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,136656956179],[1000000000000000000000000000000,136656956179]⟩ +def rfar214 : Row := ⟨214,6,16,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,136656956179,269472582703],[1000000000000000000000000000000,136656956179,269472582703]⟩ +def rfar215 : Row := ⟨215,6,17,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,128618311698],[1000000000000000000000000000000,128618311698]⟩ +def rfar216 : Row := ⟨216,6,18,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,121472849937],[1000000000000000000000000000000,121472849937]⟩ +def rfar217 : Row := ⟨217,6,19,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,115079542045],[1000000000000000000000000000000,115079542045]⟩ +def rfar218 : Row := ⟨218,6,20,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,109325564943],[1000000000000000000000000000000,109325564943]⟩ +def rfar219 : Row := ⟨219,7,18,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,88543751017,177087502034],[1000000000000000000000000000000,88543751017,1000000000000000000000000000000]⟩ +def rfar220 : Row := ⟨220,7,20,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,79689375915],[1000000000000000000000000000000,79689375915]⟩ +def rfar221 : Row := ⟨221,7,20,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,79689375915,159378751830],[1000000000000000000000000000000,79689375915,1000000000000000000000000000000]⟩ +def rfar222 : Row := ⟨222,7,22,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,72444887195],[1000000000000000000000000000000,72444887195]⟩ +def rfar223 : Row := ⟨223,7,22,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,72444887195,144889774390],[1000000000000000000000000000000,72444887195,1000000000000000000000000000000]⟩ +def rfar224 : Row := ⟨224,7,24,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,66407813262],[1000000000000000000000000000000,66407813262]⟩ +def rfar225 : Row := ⟨225,7,24,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,66407813262,132815626524],[1000000000000000000000000000000,66407813262,1000000000000000000000000000000]⟩ +def rfar226 : Row := ⟨226,7,26,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,61299519935],[1000000000000000000000000000000,61299519935]⟩ +def rfar227 : Row := ⟨227,7,28,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,56920982796],[1000000000000000000000000000000,56920982796]⟩ +def rfar228 : Row := ⟨228,7,30,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,53126250610],[1000000000000000000000000000000,53126250610]⟩ +def rfar229 : Row := ⟨229,8,48,1,0,[0,0],[1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfaR : List Row := [rfar0, rfar1, rfar2, rfar3, rfar4, rfar5, rfar6, rfar7, rfar8, rfar9, rfar10, rfar11, rfar12, rfar13, rfar14, rfar15, rfar16, rfar17, rfar18, rfar19, rfar20, rfar21, rfar22, rfar23, rfar24, rfar25, rfar26, rfar27, rfar28, rfar29, rfar30, rfar31, rfar32, rfar33, rfar34, rfar35, rfar36, rfar37, rfar38, rfar39, rfar40, rfar41, rfar42, rfar43, rfar44, rfar45, rfar46, rfar47, rfar48, rfar49, rfar50, rfar51, rfar52, rfar53, rfar54, rfar55, rfar56, rfar57, rfar58, rfar59, rfar60, rfar61, rfar62, rfar63, rfar64, rfar65, rfar66, rfar67, rfar68, rfar69, rfar70, rfar71, rfar72, rfar73, rfar74, rfar75, rfar76, rfar77, rfar78, rfar79, rfar80, rfar81, rfar82, rfar83, rfar84, rfar85, rfar86, rfar87, rfar88, rfar89, rfar90, rfar91, rfar92, rfar93, rfar94, rfar95, rfar96, rfar97, rfar98, rfar99, rfar100, rfar101, rfar102, rfar103, rfar104, rfar105, rfar106, rfar107, rfar108, rfar109, rfar110, rfar111, rfar112, rfar113, rfar114, rfar115, rfar116, rfar117, rfar118, rfar119, rfar120, rfar121, rfar122, rfar123, rfar124, rfar125, rfar126, rfar127, rfar128, rfar129, rfar130, rfar131, rfar132, rfar133, rfar134, rfar135, rfar136, rfar137, rfar138, rfar139, rfar140, rfar141, rfar142, rfar143, rfar144, rfar145, rfar146, rfar147, rfar148, rfar149, rfar150, rfar151, rfar152, rfar153, rfar154, rfar155, rfar156, rfar157, rfar158, rfar159, rfar160, rfar161, rfar162, rfar163, rfar164, rfar165, rfar166, rfar167, rfar168, rfar169, rfar170, rfar171, rfar172, rfar173, rfar174, rfar175, rfar176, rfar177, rfar178, rfar179, rfar180, rfar181, rfar182, rfar183, rfar184, rfar185, rfar186, rfar187, rfar188, rfar189, rfar190, rfar191, rfar192, rfar193, rfar194, rfar195, rfar196, rfar197, rfar198, rfar199, rfar200, rfar201, rfar202, rfar203, rfar204, rfar205, rfar206, rfar207, rfar208, rfar209, rfar210, rfar211, rfar212, rfar213, rfar214, rfar215, rfar216, rfar217, rfar218, rfar219, rfar220, rfar221, rfar222, rfar223, rfar224, rfar225, rfar226, rfar227, rfar228, rfar229] +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP0.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP0.lean new file mode 100644 index 0000000000..771b9bb302 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP0.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac0 : Row.check rfaW rfaR rfar0 = true := by decide +kernel +theorem rfac1 : Row.check rfaW rfaR rfar1 = true := by decide +kernel +theorem rfac2 : Row.check rfaW rfaR rfar2 = true := by decide +kernel +theorem rfac3 : Row.check rfaW rfaR rfar3 = true := by decide +kernel +theorem rfac4 : Row.check rfaW rfaR rfar4 = true := by decide +kernel +theorem rfac5 : Row.check rfaW rfaR rfar5 = true := by decide +kernel +theorem rfac6 : Row.check rfaW rfaR rfar6 = true := by decide +kernel +theorem rfac7 : Row.check rfaW rfaR rfar7 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP1.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP1.lean new file mode 100644 index 0000000000..3f7b9516a6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP1.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac8 : Row.check rfaW rfaR rfar8 = true := by decide +kernel +theorem rfac9 : Row.check rfaW rfaR rfar9 = true := by decide +kernel +theorem rfac10 : Row.check rfaW rfaR rfar10 = true := by decide +kernel +theorem rfac11 : Row.check rfaW rfaR rfar11 = true := by decide +kernel +theorem rfac12 : Row.check rfaW rfaR rfar12 = true := by decide +kernel +theorem rfac13 : Row.check rfaW rfaR rfar13 = true := by decide +kernel +theorem rfac14 : Row.check rfaW rfaR rfar14 = true := by decide +kernel +theorem rfac15 : Row.check rfaW rfaR rfar15 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP10.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP10.lean new file mode 100644 index 0000000000..8b1572fc53 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP10.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac80 : Row.check rfaW rfaR rfar80 = true := by decide +kernel +theorem rfac81 : Row.check rfaW rfaR rfar81 = true := by decide +kernel +theorem rfac82 : Row.check rfaW rfaR rfar82 = true := by decide +kernel +theorem rfac83 : Row.check rfaW rfaR rfar83 = true := by decide +kernel +theorem rfac84 : Row.check rfaW rfaR rfar84 = true := by decide +kernel +theorem rfac85 : Row.check rfaW rfaR rfar85 = true := by decide +kernel +theorem rfac86 : Row.check rfaW rfaR rfar86 = true := by decide +kernel +theorem rfac87 : Row.check rfaW rfaR rfar87 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP11.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP11.lean new file mode 100644 index 0000000000..3c1ce3f454 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP11.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac88 : Row.check rfaW rfaR rfar88 = true := by decide +kernel +theorem rfac89 : Row.check rfaW rfaR rfar89 = true := by decide +kernel +theorem rfac90 : Row.check rfaW rfaR rfar90 = true := by decide +kernel +theorem rfac91 : Row.check rfaW rfaR rfar91 = true := by decide +kernel +theorem rfac92 : Row.check rfaW rfaR rfar92 = true := by decide +kernel +theorem rfac93 : Row.check rfaW rfaR rfar93 = true := by decide +kernel +theorem rfac94 : Row.check rfaW rfaR rfar94 = true := by decide +kernel +theorem rfac95 : Row.check rfaW rfaR rfar95 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP12.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP12.lean new file mode 100644 index 0000000000..de2fe66c16 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP12.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac96 : Row.check rfaW rfaR rfar96 = true := by decide +kernel +theorem rfac97 : Row.check rfaW rfaR rfar97 = true := by decide +kernel +theorem rfac98 : Row.check rfaW rfaR rfar98 = true := by decide +kernel +theorem rfac99 : Row.check rfaW rfaR rfar99 = true := by decide +kernel +theorem rfac100 : Row.check rfaW rfaR rfar100 = true := by decide +kernel +theorem rfac101 : Row.check rfaW rfaR rfar101 = true := by decide +kernel +theorem rfac102 : Row.check rfaW rfaR rfar102 = true := by decide +kernel +theorem rfac103 : Row.check rfaW rfaR rfar103 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP13.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP13.lean new file mode 100644 index 0000000000..82a3d23c3d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP13.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac104 : Row.check rfaW rfaR rfar104 = true := by decide +kernel +theorem rfac105 : Row.check rfaW rfaR rfar105 = true := by decide +kernel +theorem rfac106 : Row.check rfaW rfaR rfar106 = true := by decide +kernel +theorem rfac107 : Row.check rfaW rfaR rfar107 = true := by decide +kernel +theorem rfac108 : Row.check rfaW rfaR rfar108 = true := by decide +kernel +theorem rfac109 : Row.check rfaW rfaR rfar109 = true := by decide +kernel +theorem rfac110 : Row.check rfaW rfaR rfar110 = true := by decide +kernel +theorem rfac111 : Row.check rfaW rfaR rfar111 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP14.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP14.lean new file mode 100644 index 0000000000..ce3278fb65 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP14.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac112 : Row.check rfaW rfaR rfar112 = true := by decide +kernel +theorem rfac113 : Row.check rfaW rfaR rfar113 = true := by decide +kernel +theorem rfac114 : Row.check rfaW rfaR rfar114 = true := by decide +kernel +theorem rfac115 : Row.check rfaW rfaR rfar115 = true := by decide +kernel +theorem rfac116 : Row.check rfaW rfaR rfar116 = true := by decide +kernel +theorem rfac117 : Row.check rfaW rfaR rfar117 = true := by decide +kernel +theorem rfac118 : Row.check rfaW rfaR rfar118 = true := by decide +kernel +theorem rfac119 : Row.check rfaW rfaR rfar119 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP15.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP15.lean new file mode 100644 index 0000000000..5065316299 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP15.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac120 : Row.check rfaW rfaR rfar120 = true := by decide +kernel +theorem rfac121 : Row.check rfaW rfaR rfar121 = true := by decide +kernel +theorem rfac122 : Row.check rfaW rfaR rfar122 = true := by decide +kernel +theorem rfac123 : Row.check rfaW rfaR rfar123 = true := by decide +kernel +theorem rfac124 : Row.check rfaW rfaR rfar124 = true := by decide +kernel +theorem rfac125 : Row.check rfaW rfaR rfar125 = true := by decide +kernel +theorem rfac126 : Row.check rfaW rfaR rfar126 = true := by decide +kernel +theorem rfac127 : Row.check rfaW rfaR rfar127 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP16.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP16.lean new file mode 100644 index 0000000000..578cef96ca --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP16.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac128 : Row.check rfaW rfaR rfar128 = true := by decide +kernel +theorem rfac129 : Row.check rfaW rfaR rfar129 = true := by decide +kernel +theorem rfac130 : Row.check rfaW rfaR rfar130 = true := by decide +kernel +theorem rfac131 : Row.check rfaW rfaR rfar131 = true := by decide +kernel +theorem rfac132 : Row.check rfaW rfaR rfar132 = true := by decide +kernel +theorem rfac133 : Row.check rfaW rfaR rfar133 = true := by decide +kernel +theorem rfac134 : Row.check rfaW rfaR rfar134 = true := by decide +kernel +theorem rfac135 : Row.check rfaW rfaR rfar135 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP17.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP17.lean new file mode 100644 index 0000000000..8ef7bbeba0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP17.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac136 : Row.check rfaW rfaR rfar136 = true := by decide +kernel +theorem rfac137 : Row.check rfaW rfaR rfar137 = true := by decide +kernel +theorem rfac138 : Row.check rfaW rfaR rfar138 = true := by decide +kernel +theorem rfac139 : Row.check rfaW rfaR rfar139 = true := by decide +kernel +theorem rfac140 : Row.check rfaW rfaR rfar140 = true := by decide +kernel +theorem rfac141 : Row.check rfaW rfaR rfar141 = true := by decide +kernel +theorem rfac142 : Row.check rfaW rfaR rfar142 = true := by decide +kernel +theorem rfac143 : Row.check rfaW rfaR rfar143 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP18.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP18.lean new file mode 100644 index 0000000000..3522ca92b1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP18.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac144 : Row.check rfaW rfaR rfar144 = true := by decide +kernel +theorem rfac145 : Row.check rfaW rfaR rfar145 = true := by decide +kernel +theorem rfac146 : Row.check rfaW rfaR rfar146 = true := by decide +kernel +theorem rfac147 : Row.check rfaW rfaR rfar147 = true := by decide +kernel +theorem rfac148 : Row.check rfaW rfaR rfar148 = true := by decide +kernel +theorem rfac149 : Row.check rfaW rfaR rfar149 = true := by decide +kernel +theorem rfac150 : Row.check rfaW rfaR rfar150 = true := by decide +kernel +theorem rfac151 : Row.check rfaW rfaR rfar151 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP19.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP19.lean new file mode 100644 index 0000000000..58504bf7ca --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP19.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac152 : Row.check rfaW rfaR rfar152 = true := by decide +kernel +theorem rfac153 : Row.check rfaW rfaR rfar153 = true := by decide +kernel +theorem rfac154 : Row.check rfaW rfaR rfar154 = true := by decide +kernel +theorem rfac155 : Row.check rfaW rfaR rfar155 = true := by decide +kernel +theorem rfac156 : Row.check rfaW rfaR rfar156 = true := by decide +kernel +theorem rfac157 : Row.check rfaW rfaR rfar157 = true := by decide +kernel +theorem rfac158 : Row.check rfaW rfaR rfar158 = true := by decide +kernel +theorem rfac159 : Row.check rfaW rfaR rfar159 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP2.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP2.lean new file mode 100644 index 0000000000..0048e0d4fe --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP2.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac16 : Row.check rfaW rfaR rfar16 = true := by decide +kernel +theorem rfac17 : Row.check rfaW rfaR rfar17 = true := by decide +kernel +theorem rfac18 : Row.check rfaW rfaR rfar18 = true := by decide +kernel +theorem rfac19 : Row.check rfaW rfaR rfar19 = true := by decide +kernel +theorem rfac20 : Row.check rfaW rfaR rfar20 = true := by decide +kernel +theorem rfac21 : Row.check rfaW rfaR rfar21 = true := by decide +kernel +theorem rfac22 : Row.check rfaW rfaR rfar22 = true := by decide +kernel +theorem rfac23 : Row.check rfaW rfaR rfar23 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP20.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP20.lean new file mode 100644 index 0000000000..fcfc5a641e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP20.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac160 : Row.check rfaW rfaR rfar160 = true := by decide +kernel +theorem rfac161 : Row.check rfaW rfaR rfar161 = true := by decide +kernel +theorem rfac162 : Row.check rfaW rfaR rfar162 = true := by decide +kernel +theorem rfac163 : Row.check rfaW rfaR rfar163 = true := by decide +kernel +theorem rfac164 : Row.check rfaW rfaR rfar164 = true := by decide +kernel +theorem rfac165 : Row.check rfaW rfaR rfar165 = true := by decide +kernel +theorem rfac166 : Row.check rfaW rfaR rfar166 = true := by decide +kernel +theorem rfac167 : Row.check rfaW rfaR rfar167 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP21.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP21.lean new file mode 100644 index 0000000000..86defba412 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP21.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac168 : Row.check rfaW rfaR rfar168 = true := by decide +kernel +theorem rfac169 : Row.check rfaW rfaR rfar169 = true := by decide +kernel +theorem rfac170 : Row.check rfaW rfaR rfar170 = true := by decide +kernel +theorem rfac171 : Row.check rfaW rfaR rfar171 = true := by decide +kernel +theorem rfac172 : Row.check rfaW rfaR rfar172 = true := by decide +kernel +theorem rfac173 : Row.check rfaW rfaR rfar173 = true := by decide +kernel +theorem rfac174 : Row.check rfaW rfaR rfar174 = true := by decide +kernel +theorem rfac175 : Row.check rfaW rfaR rfar175 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP22.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP22.lean new file mode 100644 index 0000000000..1889e32513 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP22.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac176 : Row.check rfaW rfaR rfar176 = true := by decide +kernel +theorem rfac177 : Row.check rfaW rfaR rfar177 = true := by decide +kernel +theorem rfac178 : Row.check rfaW rfaR rfar178 = true := by decide +kernel +theorem rfac179 : Row.check rfaW rfaR rfar179 = true := by decide +kernel +theorem rfac180 : Row.check rfaW rfaR rfar180 = true := by decide +kernel +theorem rfac181 : Row.check rfaW rfaR rfar181 = true := by decide +kernel +theorem rfac182 : Row.check rfaW rfaR rfar182 = true := by decide +kernel +theorem rfac183 : Row.check rfaW rfaR rfar183 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP23.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP23.lean new file mode 100644 index 0000000000..511a958ce1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP23.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac184 : Row.check rfaW rfaR rfar184 = true := by decide +kernel +theorem rfac185 : Row.check rfaW rfaR rfar185 = true := by decide +kernel +theorem rfac186 : Row.check rfaW rfaR rfar186 = true := by decide +kernel +theorem rfac187 : Row.check rfaW rfaR rfar187 = true := by decide +kernel +theorem rfac188 : Row.check rfaW rfaR rfar188 = true := by decide +kernel +theorem rfac189 : Row.check rfaW rfaR rfar189 = true := by decide +kernel +theorem rfac190 : Row.check rfaW rfaR rfar190 = true := by decide +kernel +theorem rfac191 : Row.check rfaW rfaR rfar191 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP24.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP24.lean new file mode 100644 index 0000000000..83352a01c7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP24.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac192 : Row.check rfaW rfaR rfar192 = true := by decide +kernel +theorem rfac193 : Row.check rfaW rfaR rfar193 = true := by decide +kernel +theorem rfac194 : Row.check rfaW rfaR rfar194 = true := by decide +kernel +theorem rfac195 : Row.check rfaW rfaR rfar195 = true := by decide +kernel +theorem rfac196 : Row.check rfaW rfaR rfar196 = true := by decide +kernel +theorem rfac197 : Row.check rfaW rfaR rfar197 = true := by decide +kernel +theorem rfac198 : Row.check rfaW rfaR rfar198 = true := by decide +kernel +theorem rfac199 : Row.check rfaW rfaR rfar199 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP25.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP25.lean new file mode 100644 index 0000000000..6cb360327d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP25.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac200 : Row.check rfaW rfaR rfar200 = true := by decide +kernel +theorem rfac201 : Row.check rfaW rfaR rfar201 = true := by decide +kernel +theorem rfac202 : Row.check rfaW rfaR rfar202 = true := by decide +kernel +theorem rfac203 : Row.check rfaW rfaR rfar203 = true := by decide +kernel +theorem rfac204 : Row.check rfaW rfaR rfar204 = true := by decide +kernel +theorem rfac205 : Row.check rfaW rfaR rfar205 = true := by decide +kernel +theorem rfac206 : Row.check rfaW rfaR rfar206 = true := by decide +kernel +theorem rfac207 : Row.check rfaW rfaR rfar207 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP26.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP26.lean new file mode 100644 index 0000000000..7f48b85a66 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP26.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac208 : Row.check rfaW rfaR rfar208 = true := by decide +kernel +theorem rfac209 : Row.check rfaW rfaR rfar209 = true := by decide +kernel +theorem rfac210 : Row.check rfaW rfaR rfar210 = true := by decide +kernel +theorem rfac211 : Row.check rfaW rfaR rfar211 = true := by decide +kernel +theorem rfac212 : Row.check rfaW rfaR rfar212 = true := by decide +kernel +theorem rfac213 : Row.check rfaW rfaR rfar213 = true := by decide +kernel +theorem rfac214 : Row.check rfaW rfaR rfar214 = true := by decide +kernel +theorem rfac215 : Row.check rfaW rfaR rfar215 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP27.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP27.lean new file mode 100644 index 0000000000..75b9591955 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP27.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac216 : Row.check rfaW rfaR rfar216 = true := by decide +kernel +theorem rfac217 : Row.check rfaW rfaR rfar217 = true := by decide +kernel +theorem rfac218 : Row.check rfaW rfaR rfar218 = true := by decide +kernel +theorem rfac219 : Row.check rfaW rfaR rfar219 = true := by decide +kernel +theorem rfac220 : Row.check rfaW rfaR rfar220 = true := by decide +kernel +theorem rfac221 : Row.check rfaW rfaR rfar221 = true := by decide +kernel +theorem rfac222 : Row.check rfaW rfaR rfar222 = true := by decide +kernel +theorem rfac223 : Row.check rfaW rfaR rfar223 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP28.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP28.lean new file mode 100644 index 0000000000..d6fc66eba1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP28.lean @@ -0,0 +1,9 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac224 : Row.check rfaW rfaR rfar224 = true := by decide +kernel +theorem rfac225 : Row.check rfaW rfaR rfar225 = true := by decide +kernel +theorem rfac226 : Row.check rfaW rfaR rfar226 = true := by decide +kernel +theorem rfac227 : Row.check rfaW rfaR rfar227 = true := by decide +kernel +theorem rfac228 : Row.check rfaW rfaR rfar228 = true := by decide +kernel +theorem rfac229 : Row.check rfaW rfaR rfar229 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP3.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP3.lean new file mode 100644 index 0000000000..a12f98d646 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP3.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac24 : Row.check rfaW rfaR rfar24 = true := by decide +kernel +theorem rfac25 : Row.check rfaW rfaR rfar25 = true := by decide +kernel +theorem rfac26 : Row.check rfaW rfaR rfar26 = true := by decide +kernel +theorem rfac27 : Row.check rfaW rfaR rfar27 = true := by decide +kernel +theorem rfac28 : Row.check rfaW rfaR rfar28 = true := by decide +kernel +theorem rfac29 : Row.check rfaW rfaR rfar29 = true := by decide +kernel +theorem rfac30 : Row.check rfaW rfaR rfar30 = true := by decide +kernel +theorem rfac31 : Row.check rfaW rfaR rfar31 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP4.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP4.lean new file mode 100644 index 0000000000..e8f0668f62 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP4.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac32 : Row.check rfaW rfaR rfar32 = true := by decide +kernel +theorem rfac33 : Row.check rfaW rfaR rfar33 = true := by decide +kernel +theorem rfac34 : Row.check rfaW rfaR rfar34 = true := by decide +kernel +theorem rfac35 : Row.check rfaW rfaR rfar35 = true := by decide +kernel +theorem rfac36 : Row.check rfaW rfaR rfar36 = true := by decide +kernel +theorem rfac37 : Row.check rfaW rfaR rfar37 = true := by decide +kernel +theorem rfac38 : Row.check rfaW rfaR rfar38 = true := by decide +kernel +theorem rfac39 : Row.check rfaW rfaR rfar39 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP5.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP5.lean new file mode 100644 index 0000000000..f7978fee45 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP5.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac40 : Row.check rfaW rfaR rfar40 = true := by decide +kernel +theorem rfac41 : Row.check rfaW rfaR rfar41 = true := by decide +kernel +theorem rfac42 : Row.check rfaW rfaR rfar42 = true := by decide +kernel +theorem rfac43 : Row.check rfaW rfaR rfar43 = true := by decide +kernel +theorem rfac44 : Row.check rfaW rfaR rfar44 = true := by decide +kernel +theorem rfac45 : Row.check rfaW rfaR rfar45 = true := by decide +kernel +theorem rfac46 : Row.check rfaW rfaR rfar46 = true := by decide +kernel +theorem rfac47 : Row.check rfaW rfaR rfar47 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP6.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP6.lean new file mode 100644 index 0000000000..a8542d9d25 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP6.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac48 : Row.check rfaW rfaR rfar48 = true := by decide +kernel +theorem rfac49 : Row.check rfaW rfaR rfar49 = true := by decide +kernel +theorem rfac50 : Row.check rfaW rfaR rfar50 = true := by decide +kernel +theorem rfac51 : Row.check rfaW rfaR rfar51 = true := by decide +kernel +theorem rfac52 : Row.check rfaW rfaR rfar52 = true := by decide +kernel +theorem rfac53 : Row.check rfaW rfaR rfar53 = true := by decide +kernel +theorem rfac54 : Row.check rfaW rfaR rfar54 = true := by decide +kernel +theorem rfac55 : Row.check rfaW rfaR rfar55 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP7.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP7.lean new file mode 100644 index 0000000000..075540a1f6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP7.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac56 : Row.check rfaW rfaR rfar56 = true := by decide +kernel +theorem rfac57 : Row.check rfaW rfaR rfar57 = true := by decide +kernel +theorem rfac58 : Row.check rfaW rfaR rfar58 = true := by decide +kernel +theorem rfac59 : Row.check rfaW rfaR rfar59 = true := by decide +kernel +theorem rfac60 : Row.check rfaW rfaR rfar60 = true := by decide +kernel +theorem rfac61 : Row.check rfaW rfaR rfar61 = true := by decide +kernel +theorem rfac62 : Row.check rfaW rfaR rfar62 = true := by decide +kernel +theorem rfac63 : Row.check rfaW rfaR rfar63 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP8.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP8.lean new file mode 100644 index 0000000000..22a6daf862 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP8.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac64 : Row.check rfaW rfaR rfar64 = true := by decide +kernel +theorem rfac65 : Row.check rfaW rfaR rfar65 = true := by decide +kernel +theorem rfac66 : Row.check rfaW rfaR rfar66 = true := by decide +kernel +theorem rfac67 : Row.check rfaW rfaR rfar67 = true := by decide +kernel +theorem rfac68 : Row.check rfaW rfaR rfar68 = true := by decide +kernel +theorem rfac69 : Row.check rfaW rfaR rfar69 = true := by decide +kernel +theorem rfac70 : Row.check rfaW rfaR rfar70 = true := by decide +kernel +theorem rfac71 : Row.check rfaW rfaR rfar71 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfaP9.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP9.lean new file mode 100644 index 0000000000..0ab93764b1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfaP9.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfaDefs +namespace CTree +theorem rfac72 : Row.check rfaW rfaR rfar72 = true := by decide +kernel +theorem rfac73 : Row.check rfaW rfaR rfar73 = true := by decide +kernel +theorem rfac74 : Row.check rfaW rfaR rfar74 = true := by decide +kernel +theorem rfac75 : Row.check rfaW rfaR rfar75 = true := by decide +kernel +theorem rfac76 : Row.check rfaW rfaR rfar76 = true := by decide +kernel +theorem rfac77 : Row.check rfaW rfaR rfar77 = true := by decide +kernel +theorem rfac78 : Row.check rfaW rfaR rfar78 = true := by decide +kernel +theorem rfac79 : Row.check rfaW rfaR rfar79 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiDefs.lean new file mode 100644 index 0000000000..84c6f67436 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiDefs.lean @@ -0,0 +1,235 @@ +import Nov15.CTreeCore +namespace CTree +def rfiW : List (List Nat) := [[0,0,0,0,0,0,0,0,0],[0,0,1593787518311,2186511298872,2569449669526,2853213163435,3078748608453,3265902831914,3425832457328],[0,0,0,2186511298872,3162173450087,3828875314650,4338174253577,4750863922056,3265902831914],[0,0,0,0,2569449669526,3828875314650,4721112624231,4338174253577,3078748608453],[0,0,0,0,0,2853213163435,3828875314650,3828875314650,2853213163435],[0,0,0,0,0,0,2569449669526,3162173450087,2569449669526],[0,0,0,0,0,0,0,2186511298872,2186511298872],[0,0,0,0,0,0,0,0,1593787518311],[0,0,0,0,0,0,0,0,0]] +def rfir0 : Row := ⟨0,1,1,48,1725436573842136544890435102625209188850057808257732186958073375490046,[0,2926101314955,3192948858247,3503099074825,3741927370385,4126832146281,4436042573185,4933270669380,5427357319250,6167741177152,6476951604056,6957397348792,7904753661472,8265936703201,8627119744930,9121206394800,10471776267845,10955196284742,11402836942564,11896923592434,12547309129985,12934690023504,13322070917023,14060732638442,14604412419642,15584517093722,16078603743592,16893056448131,17254239489860,17748326139730,18242412789600,19411641627560,19799022521079,20279468265815,21018129987234,21561809768434,21949190661953,22443277311823,23181939033242,23725618814442,24705723488522,25199810138392,25869380047008,26256760940527,26644141834046,27363619184400,27926483336665,28665145058084,29208824839284],[1000000000000000000000000000000,2926101314955,3192948858247,3503099074825,3741927370385,4126832146281,4436042573185,4933270669380,5427357319250,6167741177152,6476951604056,6957397348792,7904753661472,8265936703201,8627119744930,9121206394800,10471776267845,10955196284742,11402836942564,11896923592434,12547309129985,12934690023504,13322070917023,14060732638442,14604412419642,17665490369688,18125660924713,18486843966442,18848027008171,19342113658041,19836200307911,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir1 : Row := ⟨1,2,1,20,1725015324675462002517084071354633591292683456439700743677216293214208,[0,3212760835023,3734866484244,4105490874194,4344319169754,4838772466119,5155035432943,5701828627101,6265732989891,6996580337001,7312843303825,8684616805130,8980042790190,10856864060044,11403657254202,11967561616992,12467878736768,13014671930926,13578576293716,14309423640826,14625686607650],[1000000000000000000000000000000,3212760835023,3734866484244,4105490874194,4344319169754,4838772466119,5155035432943,5701828627101,6265732989891,6996580337001,7312843303825,8684616805130,8980042790190,12097962034525,12336790330085,12802397641812,13041225937372,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir2 : Row := ⟨2,2,1,22,1725436573842136256050943512598856188173734310570540763622829158037504,[0,3212760835023,3734866484244,4105490874194,4344319169754,4838772466119,5155035432943,5701828627101,6265732989891,6760464957713,7312843303825,7807296600190,8868936478337,9178146905241,9483602968106,11915500390656,12462293584814,12962332033133,13509125227291,14073029590081,14567761557903,15120139904015,15614593200380],[1000000000000000000000000000000,3212760835023,3734866484244,4105490874194,4344319169754,4838772466119,5155035432943,5701828627101,6265732989891,6760464957713,7312843303825,7807296600190,8868936478337,9178146905241,9483602968106,12802397641812,13041225937372,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir3 : Row := ⟨3,2,1,24,1725436573842136544890435102625208983754331896122596109027616915716096,[0,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6760464957713,7069675384617,7564623392783,7904753661472,9178146905241,9483602968106,9977689617976,11801804343542,12476490906518,12950386141644,13311569183373,13805655833243,14634298777400,14974429046089,15469377054255,15809507322944],[1000000000000000000000000000000,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6760464957713,7069675384617,7564623392783,7904753661472,9178146905241,9483602968106,9977689617976,13041225937372,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir4 : Row := ⟨4,2,1,26,1725436573842136544890435102625209149907831359575118398056611880890368,[0,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6641286029673,7069675384617,7564623392783,7904753661472,8265936703201,9483602968106,9977689617976,10471776267846,12476490906518,12950386141644,13311569183373,13672752225102,14166838874972,14907222732874,15335612087818,15809507322944,16170690364673,16531873406402],[1000000000000000000000000000000,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6641286029673,7069675384617,7564623392783,7904753661472,8265936703201,9483602968106,9977689617976,10471776267846,14146440613394,14455651040298,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir5 : Row := ⟨5,2,1,28,1725436573842136449109463798507155500239512287015111266501574392791040,[0,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6641286029673,6950496456577,7564623392783,7904753661472,8265936703201,8627119744930,9977689617976,10471776267846,12357311978478,12851398628348,13311569183373,13672752225102,14033935266831,14528021916701,15216433159778,15577616201507,16170690364673,16531873406402,16893056448131,17254239489860],[1000000000000000000000000000000,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6641286029673,6950496456577,7564623392783,7904753661472,8265936703201,8627119744930,9977689617976,10471776267846,14146440613394,14455651040298,14831204080080,15140414506984,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir6 : Row := ⟨6,2,1,30,1725015324675462028800729473553375950327607832226055896745478848970752,[0,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6641286029673,6950496456577,7564623392783,7904753661472,8265936703201,8627119744930,9121206394800,10471776267846,12357311978478,12851398628348,13311569183373,13672752225102,14033935266831,14528021916701,15022108566571,15577616201507,16071702851377,16531873406402,16893056448131,17254239489860,17748326139730,18242412789600],[1000000000000000000000000000000,3212760835023,3734866484244,4105490874194,4344319169754,4736422053268,5045632480172,5406815521901,5900902171771,6641286029673,6950496456577,7564623392783,7904753661472,8265936703201,8627119744930,9121206394800,10471776267846,14146440613394,14455651040298,14831204080080,15140414506984,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir7 : Row := ⟨7,2,2,18,1725429991823894998508765754469743057491304461710640024346824886190080,[0,1632951415957,2204585913764,2561237559193,2832265888720,3414544589489,3619621813243,4359575430355,4661556836724,5281728645521,6219587654389,7034166402732,7239243626486,7979197243598,8281178649967,8884433968540,9323113673448,9943285482245,10563457291042],[1000000000000000000000000000000,1632951415957,2204585913764,2561237559193,2832265888720,3414544589489,3619621813243,4359575430355,4661556836724,5281728645521,6219587654389,7290748281073,7599958707977,8084891255805,8390347318670,8884433968540,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir8 : Row := ⟨8,2,2,20,1725436573842136449106449451380146306440222793220369896478428312371200,[0,1632951415957,2204585913764,2561237559193,2812503600389,3290407053022,3619621813243,4099439066671,4525520015951,5167550378933,5476760805837,6471367743347,6811498012036,7719060879914,8145141829194,8624959082622,9051040031902,9576199872508,10002280821788,10644311184770,10953521611674],[1000000000000000000000000000000,1632951415957,2204585913764,2561237559193,2812503600389,3290407053022,3619621813243,4099439066671,4525520015951,5167550378933,5476760805837,6471367743347,6811498012036,8084891255805,8390347318670,8884433968540,9378520618410,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir9 : Row := ⟨9,2,2,22,1725436573842135874423635973797346292484320015926037067947319207395328,[0,1632951415957,2204585913764,2561237559193,2812503600389,3188056640171,3497267067075,3944907724897,4438994374767,5167550378933,5476760805837,5864141699356,6811498012036,7172681053765,7533864095494,8383902099664,8877988749534,9361408766431,9809049424253,10303136074123,10953521611674,11340902505193,11728283398712],[1000000000000000000000000000000,1632951415957,2204585913764,2561237559193,2812503600389,3188056640171,3497267067075,3944907724897,4438994374767,5167550378933,5476760805837,5864141699356,6811498012036,7172681053765,7533864095494,8884433968540,9378520618410,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir10 : Row := ⟨10,2,2,24,1725436573842136257547521189216008126471978509806327231887960319197184,[0,1632951415957,2204585913764,2561237559193,2812503600389,3188056640171,3497267067075,3944907724897,4438994374767,5167550378933,5476760805837,5864141699356,6811498012036,7172681053765,7533864095494,8027950745364,8877988749534,9361408766431,9809049424253,10303136074123,10953521611674,11340902505193,11728283398712,12466945120131,13010624901331],[1000000000000000000000000000000,1632951415957,2204585913764,2561237559193,2812503600389,3188056640171,3497267067075,3944907724897,4438994374767,5167550378933,5476760805837,5864141699356,6811498012036,7172681053765,7533864095494,8027950745364,9378520618410,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir11 : Row := ⟨11,3,1,8,1724691879332226163255842105515269237569795001124286938345380071342080,[0,3078748608453,3468040358980,3780399115960,3998403494388,4896490119701,5397001524558,7778802610348,7996806988776],[1000000000000000000000000000000,3078748608453,3468040358980,3780399115960,3998403494388,4896490119701,5397001524558,10097533701706,10336361997266]⟩ +def rfir12 : Row := ⟨12,3,1,10,1725015324675461991289735722275867791881061165080929906339321888112640,[0,3078748608453,3468040358980,3780399115960,3998403494388,4556371943230,4987937116302,6054421188232,6408264706838,8554775437618,8986340610690],[1000000000000000000000000000000,3078748608453,3468040358980,3780399115960,3998403494388,4556371943230,4987937116302,6054421188232,6408264706838,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir13 : Row := ⟨13,3,1,11,1725015324675461991289737127222815216233559422391912940518374073434112,[0,3078748608453,3468040358980,3780399115960,3998403494388,4556371943230,4987937116302,6054421188232,6408264706838,8554775437618,8986340610690,9544309059532],[1000000000000000000000000000000,3078748608453,3468040358980,3780399115960,3998403494388,4556371943230,4987937116302,6054421188232,6408264706838,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir14 : Row := ⟨14,3,1,12,1725015324675462280222856187148823347661927116336088114357438305533952,[0,3078748608453,3468040358980,3759575198828,3998403494388,4556371943230,4865582370134,5562388198482,6408264706838,7680641786428,7969900798652,9421954313364,9731164740268],[1000000000000000000000000000000,3078748608453,3468040358980,3759575198828,3998403494388,4556371943230,4865582370134,5562388198482,6408264706838,7680641786428,7969900798652,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir15 : Row := ⟨15,3,1,13,1725436573842136212647130871363085760565117322918546857094666522722304,[0,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,6408264706838,7680641786428,7969900798652,9421954313364,9731164740268,10427970568616],[1000000000000000000000000000000,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,6408264706838,7680641786428,7969900798652,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir16 : Row := ⟨16,3,1,14,1725436573842136508972570862884040742246718255018739783786170559758336,[0,3078748608453,3468040358980,3759575198828,3998403494388,4516061697910,4845276458131,5228283774580,5792188137370,6764266062329,7969900798652,9226687268968,9690552916262,10073560232711,10456567549160],[1000000000000000000000000000000,3078748608453,3468040358980,3759575198828,3998403494388,4516061697910,4845276458131,5228283774580,5792188137370,6764266062329,7969900798652,11234674801843,11441534815896,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir17 : Row := ⟨17,3,1,15,1725436573842136508972570862884040742246718259854406168756539839479808,[0,3078748608453,3468040358980,3759575198828,3998403494388,4516061697910,4845276458131,5228283774580,5792188137370,6764266062329,7022757652410,9226687268968,9690552916262,10073560232711,10456567549160,11020471911950],[1000000000000000000000000000000,3078748608453,3468040358980,3759575198828,3998403494388,4516061697910,4845276458131,5228283774580,5792188137370,6764266062329,7022757652410,11234674801843,11441534815896,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir18 : Row := ⟨18,3,1,16,1725436573842136410198441351708280540826957078208233419559579429109760,[0,3078748608453,3468040358980,3759575198828,3998403494388,4516061697910,4722921711963,5188529023690,5427357319250,6764266062329,7022757652410,8279111225556,9425760813638,9911450735653,10150279031213,10615886342940,10854714638500],[1000000000000000000000000000000,3078748608453,3468040358980,3759575198828,3998403494388,4516061697910,4722921711963,5188529023690,5427357319250,6764266062329,7022757652410,8279111225556,11441534815896,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir19 : Row := ⟨19,3,1,17,1725436573842136212650188036964751983929217180609891469519930766917632,[0,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6167741177152,7022757652410,8279111225556,8588321652460,10348560080600,10657770507504,11033323547286,11584376274740,11959929314522],[1000000000000000000000000000000,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6167741177152,7022757652410,8279111225556,8588321652460,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir20 : Row := ⟨20,3,1,18,1725436573842087172792880283908902425565645283999362124232370465800192,[0,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6167741177152,6476951604056,8279111225556,8588321652460,10348560080600,10657770507504,11033323547286,11342533974190,11959929314522,12269139741426],[1000000000000000000000000000000,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6167741177152,6476951604056,8279111225556,8588321652460,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir21 : Row := ⟨21,3,1,19,1725015324675406047815971936975081915591629661211475837569764750786560,[0,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6167741177152,6476951604056,8279111225556,8588321652460,10348560080600,10657770507504,11033323547286,11342533974190,11959929314522,12269139741426,12644692781208],[1000000000000000000000000000000,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6167741177152,6476951604056,8279111225556,8588321652460,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir22 : Row := ⟨22,3,1,20,1291753974625909894242973195510263877508117383371071955542159524888576,[0,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6247151665168,6476951604056,8381461638407,8588321652460,10348560080600,10657770507504,11033323547286,11342533974190,12039339802538,12269139741426,12724103269224,12953903208112],[1000000000000000000000000000000,3078748608453,3659484124712,3951018964560,4180818903448,4556371943230,4865582370134,5562388198482,5792188137370,6247151665168,6476951604056,8381461638407,8588321652460,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir23 : Row := ⟨23,3,2,6,1724797191619175783735400944853108397594210146492606303761713470636032,[0,1539374304226,2055686347062,2659969332387,2905122425357,3373997521318,4886405018250],[1000000000000000000000000000000,1539374304226,2055686347062,2659969332387,2905122425357,3373997521318,4886405018250]⟩ +def rfir24 : Row := ⟨24,3,2,7,1724797191622314717726979501882151003100027857202348574221783047077888,[0,1539374304226,2055686347062,2368045104042,2713678659625,3271647108467,3703212281539,5081723763667],[1000000000000000000000000000000,1539374304226,2055686347062,2368045104042,2713678659625,3271647108467,3703212281539,5805527865945]⟩ +def rfir25 : Row := ⟨25,3,2,8,1725015323871992974351448694926653041798694169110054950243558309756928,[0,1539374304226,2055686347062,2347221186910,2586049482470,3271647108467,3580857535371,4277663363719,5172098964940],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3271647108467,3580857535371,4277663363719,5889754352495]⟩ +def rfir26 : Row := ⟨26,3,2,9,1725436573038667209084596767771996548138967675657632542441433269796864,[0,1539374304226,2055686347062,2368045104042,2713678659625,3271647108467,3580857535371,4277663363719,5123539872075,5948902639413],[1000000000000000000000000000000,1539374304226,2055686347062,2368045104042,2713678659625,3271647108467,3580857535371,4277663363719,5123539872075,1000000000000000000000000000000]⟩ +def rfir27 : Row := ⟨27,3,2,10,1725436573842136543393766081445028143566739526816309557546538017751040,[0,1539374304226,2055686347062,2347221186910,2586049482470,3118182699209,3580857535371,4277663363719,4507463302607,5704232181679,6166907017841],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3118182699209,3580857535371,4277663363719,4507463302607,6498267364516,1000000000000000000000000000000]⟩ +def rfir28 : Row := ⟨28,3,2,11,1725436573842136543393857425300104519275586814216737465834959754231808,[0,1539374304226,2055686347062,2347221186910,2586049482470,3118182699209,3497267067075,4277663363719,4507463302607,5704232181679,6083316549545,6615449766284],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3118182699209,3497267067075,4277663363719,4507463302607,6395916951665,6685175963889,1000000000000000000000000000000]⟩ +def rfir29 : Row := ⟨29,3,2,12,1725436573842136449109463798507155209388800400214593303980251402993664,[0,1539374304226,2055686347062,2347221186910,2586049482470,3101339760599,3396765745659,4277663363719,4507463302607,5479541227566,5982815228129,6498105506258,6793531491318],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3101339760599,3396765745659,4277663363719,4507463302607,5479541227566,6685175963889,6994386390793,1000000000000000000000000000000]⟩ +def rfir30 : Row := ⟨30,3,2,13,1725436573842136257547521190271047582288742434229410757899061808857088,[0,1539374304226,2055686347062,2347221186910,2586049482470,3101339760599,3396765745659,3943558939817,4507463302607,4883016342389,5738032817647,6498105506258,6793531491318,7340324685476],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3101339760599,3396765745659,3943558939817,4507463302607,4883016342389,5738032817647,6994386390793,7303596817697,1000000000000000000000000000000]⟩ +def rfir31 : Row := ⟨31,3,2,14,1725436573842136257547521190265600738349505617879854593347310655111168,[0,1539374304226,2055686347062,2347221186910,2586049482470,3033879344848,3343089771752,3648545834617,4142632484487,4883016342389,5192226769293,6234595317087,6682425179465,6991635606369,7297091669234],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3033879344848,3343089771752,3648545834617,4142632484487,4883016342389,5192226769293,6994386390793,7303596817697,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir32 : Row := ⟨32,3,2,15,1725436573842136257547521190265557870744086368655058101620043316985856,[0,1539374304226,2055686347062,2347221186910,2586049482470,3033879344848,3343089771752,3648545834617,4142632484487,4883016342389,5192226769293,6234595317087,6682425179465,6991635606369,7297091669234,7791178319104],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3033879344848,3343089771752,3648545834617,4142632484487,4883016342389,5192226769293,6994386390793,7303596817697,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir33 : Row := ⟨33,3,2,16,1725015324675399180520058799817792954304926641149443805838890019848192,[0,1539374304226,2055686347062,2347221186910,2586049482470,3101339760599,3396765745659,3903804188927,4142632484487,4962426830405,5192226769293,6489853671397,6728681966957,7243972245086,7539398230146,8046436673414,8285264968974],[1000000000000000000000000000000,1539374304226,2055686347062,2347221186910,2586049482470,3101339760599,3396765745659,3903804188927,4142632484487,4962426830405,5192226769293,7096736803644,7303596817697,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir34 : Row := ⟨34,3,3,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir35 : Row := ⟨35,3,3,6,1724981481704708208044660068023339766542834024824556934860489376137216,[0,1026249536151,1578873711049,2067432669609,2285437048037,3183523673350,3684035078207],[1000000000000000000000000000000,1026249536151,1578873711049,2067432669609,2285437048037,3183523673350,3684035078207]⟩ +def rfir36 : Row := ⟨36,3,3,7,1724138983421241331034605756681957787456231791428861707420782005583872,[0,1026249536151,1562844162812,1918979575322,2157807870882,3183523673350,3512738433571,4076787446204],[1000000000000000000000000000000,1026249536151,1562844162812,1918979575322,2157807870882,3183523673350,3512738433571,4222554866130]⟩ +def rfir37 : Row := ⟨37,3,3,8,1725008742657215501060263516936682169514748965718045571558240033964032,[0,1026249536151,1548355185372,1918979575322,2157807870882,2788728384380,2981475927468,3849421752131,4315615741764],[1000000000000000000000000000000,1026249536151,1548355185372,1918979575322,2157807870882,2788728384380,2981475927468,3849421752131,4315615741764]⟩ +def rfir38 : Row := ⟨38,3,3,9,1725436573841695280455999333928870854608338608384770828651301510840320,[0,1026249536151,1578873711049,1918979575322,2157807870882,2689941087621,2981475927468,3849421752131,4079221691019,4847748958503],[1000000000000000000000000000000,1026249536151,1578873711049,1918979575322,2157807870882,2689941087621,2981475927468,3849421752131,4079221691019,1000000000000000000000000000000]⟩ +def rfir39 : Row := ⟨39,3,3,10,1725436573842136257544506842001895497334175015961362696906908438102016,[0,1026249536151,1548355185372,1918979575322,2157807870882,2652261167247,2968524134071,3515317328229,4079221691019,4810069038129,5126332004953],[1000000000000000000000000000000,1026249536151,1548355185372,1918979575322,2157807870882,2652261167247,2968524134071,3515317328229,4079221691019,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir40 : Row := ⟨40,3,3,11,1725436573842136257544506842001895497007111257582165228278559818121216,[0,1026249536151,1548355185372,1918979575322,2157807870882,2652261167247,2968524134071,3515317328229,4079221691019,4810069038129,5126332004953,5620785301318],[1000000000000000000000000000000,1026249536151,1548355185372,1918979575322,2157807870882,2652261167247,2968524134071,3515317328229,4079221691019,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir41 : Row := ⟨41,3,3,12,1725436573842122081963765325226559189160748860002050336828123661729792,[0,1026249536151,1548355185372,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,4707718625278,5016929052182,5378112093911,5718242362600],[1000000000000000000000000000000,1026249536151,1548355185372,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,5051299615978,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir42 : Row := ⟨42,3,3,13,1725436573842063080885441988494453214577201261746743827380562359746560,[0,1026249536151,1578873711049,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,4454774730801,5016929052182,5378112093911,5718242362600,6079425404329],[1000000000000000000000000000000,1026249536151,1578873711049,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,4454774730801,5309791206059,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir43 : Row := ⟨43,3,3,14,1725436573842063080885441943892962817510849559210789463157620997095424,[0,1026249536151,1578873711049,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,4454774730801,4763985157705,5378112093911,5718242362600,6079425404329,6440608446058],[1000000000000000000000000000000,1026249536151,1578873711049,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,4454774730801,4763985157705,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir44 : Row := ⟨44,3,3,15,1724172826241386087509120555855898733662906190388245142363929468469248,[0,1026249536151,1578873711049,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,4454774730801,4763985157705,5378112093911,5718242362600,6079425404329,6440608446058,6934695095928],[1000000000000000000000000000000,1026249536151,1578873711049,1918979575322,2157807870882,2549910754396,2859121181300,3220304223029,3714390872899,4454774730801,4763985157705,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir45 : Row := ⟨45,3,4,3,1215740115285145407006307736394970646240717885393841048537395210747904,[0,769687152113,1261631065428,2031318217541],[1000000000000000000000000000000,769687152113,1261631065428,2096815422379]⟩ +def rfir46 : Row := ⟨46,3,4,4,1711261187066247890813363025679948986197761369184792094843736221024256,[0,769687152113,1217359189918,1702750503724,2302514758865],[1000000000000000000000000000000,769687152113,1217359189918,1702750503724,2302514758865]⟩ +def rfir47 : Row := ⟨47,3,4,5,1711949085610381755412222851521837156972125571415050677602692446027776,[0,769687152113,1217359189918,1702750503724,1931800808853,2701487960966],[1000000000000000000000000000000,769687152113,1217359189918,1702750503724,1931800808853,2731635103936]⟩ +def rfir48 : Row := ⟨48,3,4,6,1725429065421934135775443279377013739081480447434081339858259225346048,[0,769687152113,1217359189918,1677512332393,1883211668879,2629284691085,3060849864157],[1000000000000000000000000000000,769687152113,1217359189918,1677512332393,1883211668879,2629284691085,3060849864157]⟩ +def rfir49 : Row := ⟨49,3,4,7,1725429991822320455121495916335180487343303910962716634609037191675904,[0,769687152113,1217359189918,1622513251531,1843456917989,2469655441492,2833699629216,3402356601692],[1000000000000000000000000000000,769687152113,1217359189918,1622513251531,1843456917989,2469655441492,2833699629216,3402356601692]⟩ +def rfir50 : Row := ⟨50,3,4,8,1725436573840551274031366283120767677749658095272466878308865361838080,[0,769687152113,1217359189918,1604628622429,1843456917989,2333188224359,2662402984580,3301196522435,3568301187288],[1000000000000000000000000000000,769687152113,1217359189918,1604628622429,1843456917989,2333188224359,2662402984580,3301196522435,3568301187288]⟩ +def rfir51 : Row := ⟨51,3,4,9,1725436573038666469167241256029755228080640410543054049851597920403456,[0,769687152113,1217359189918,1604628622429,1855284771726,2333188224359,2662402984580,3301196522435,3710569543452,4188472996085],[1000000000000000000000000000000,769687152113,1217359189918,1604628622429,1855284771726,2333188224359,2662402984580,3301196522435,3865100885225,1000000000000000000000000000000]⟩ +def rfir52 : Row := ⟨52,3,4,10,1725436573842078405840852706019897410967521518242578966598401317142528,[0,769687152113,1217359189918,1604628622429,1843456917989,2230837811508,2540048238412,3006183417235,3500270067105,4074294729497,4383505156401],[1000000000000000000000000000000,769687152113,1217359189918,1604628622429,1843456917989,2230837811508,2540048238412,3006183417235,3500270067105,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir53 : Row := ⟨53,3,4,11,1725436573838041812586162001054180667492084376406608905998688462045184,[0,769687152113,1217359189918,1604628622429,1843456917989,2230837811508,2540048238412,3006183417235,3500270067105,4074294729497,4383505156401,4770886049920],[1000000000000000000000000000000,769687152113,1217359189918,1604628622429,1843456917989,2230837811508,2540048238412,3006183417235,3500270067105,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir54 : Row := ⟨54,3,4,12,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir55 : Row := ⟨55,4,1,4,1239316981823147026693528421085722635592843543290395622062911442124800,[0,2853213163435,3437767854257,3836305077536,4118625750136],[1000000000000000000000000000000,2853213163435,3437767854257,3836305077536,4118625750136]⟩ +def rfir56 : Row := ⟨56,4,1,6,1293306507428935247685885916830646565345887176951247491355334076792832,[0,2853213163435,3437767854257,3644627868310,3883456163870,5229358371717,5504583570177],[1000000000000000000000000000000,2853213163435,3437767854257,3644627868310,3883456163870,5229358371717,5504583570177]⟩ +def rfir57 : Row := ⟨57,4,1,7,1724599724699482344649655364594831117126166680771311008975668048297984,[0,2853213163435,3437767854257,3644627868310,3883456163870,5229358371717,5504583570177,7528084032180],[1000000000000000000000000000000,2853213163435,3437767854257,3644627868310,3883456163870,5229358371717,5504583570177,1000000000000000000000000000000]⟩ +def rfir58 : Row := ⟨58,4,1,8,1724771790000978729764805480468511514507227008689791213199677395566592,[0,2853213163435,3437767854257,3644627868310,3883456163870,4544171793177,4729693963989,7528084032180,7766912327740],[1000000000000000000000000000000,2853213163435,3437767854257,3644627868310,3883456163870,4544171793177,4729693963989,9362342181555,9495157808079]⟩ +def rfir59 : Row := ⟨59,4,1,9,1724988996602545128962364136802128780867495548430487288691761470242816,[0,2853213163435,3437767854257,3644627868310,3883456163870,4544171793177,4729693963989,7528084032180,7766912327740,8374321832299],[1000000000000000000000000000000,2853213163435,3437767854257,3644627868310,3883456163870,4544171793177,4729693963989,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir60 : Row := ⟨60,4,1,10,1724988996602495993324130793361514504127325670349064725969671993425920,[0,2853213163435,3437767854257,3644627868310,3883456163870,4229182559132,4729693963989,5759721507125,5892537133649,8112638723002,8458365118264],[1000000000000000000000000000000,2853213163435,3437767854257,3644627868310,3883456163870,4229182559132,4729693963989,5759721507125,5892537133649,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir61 : Row := ⟨61,4,1,11,1724607212227243633327641078765802060389195591744496360417669716901888,[0,2853213163435,3437767854257,3644627868310,3883456163870,4229182559132,4558397319353,5759721507125,5892537133649,8112638723002,8441853483223,8787579878485],[1000000000000000000000000000000,2853213163435,3437767854257,3644627868310,3883456163870,4229182559132,4558397319353,5759721507125,5892537133649,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir62 : Row := ⟨62,4,1,12,1724605360927892125009436352783555288042517265488812713331387059404800,[0,2853213163435,3437767854257,3644627868310,3883456163870,4229182559132,4436042573185,5759721507125,5892537133649,8080670441495,8319498737055,8665225132317,8872085146370],[1000000000000000000000000000000,2853213163435,3437767854257,3644627868310,3883456163870,4229182559132,4436042573185,5759721507125,5892537133649,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir63 : Row := ⟨63,4,2,2,1657209653241867727754277428799190269559553157320145843044180880785408,[0,1426606581717,2073816409155],[1000000000000000000000000000000,1426606581717,2073816409155]⟩ +def rfir64 : Row := ⟨64,4,2,3,1670689703910324887239747707941152989547198337172229464391125076803584,[0,1426606581717,1954693889501,2300022576808],[1000000000000000000000000000000,1426606581717,1954693889501,2300022576808]⟩ +def rfir65 : Row := ⟨65,4,2,4,1724691879329089144474434918536799264960592040516900777262263646027776,[0,1426606581717,1954693889501,2172138256779,2518026955236],[1000000000000000000000000000000,1426606581717,1954693889501,2172138256779,2518026955236]⟩ +def rfir66 : Row := ⟨66,4,2,5,1724798117217071194839542966803644998336291209630814422947367143604224,[0,1426606581717,1954693889501,2172138256779,2518026955236,3374510178411],[1000000000000000000000000000000,1426606581717,1954693889501,2172138256779,2518026955236,3374510178411]⟩ +def rfir67 : Row := ⟨67,4,2,6,1724798118073895869251296075549290374355175151902179595608009612460032,[0,1426606581717,1954693889501,2172138256779,2410966552339,2939043194547,3601680183487],[1000000000000000000000000000000,1426606581717,1954693889501,2172138256779,2410966552339,2939043194547,3601680183487]⟩ +def rfir68 : Row := ⟨68,4,2,7,1725015324675462268846388999136149038420825622169005486649463959191552,[0,1426606581717,1875639553249,2172138256779,2410966552339,2939043194547,3303087382271,4583104809118],[1000000000000000000000000000000,1426606581717,1875639553249,2172138256779,2410966552339,2939043194547,3303087382271,5317696790337]⟩ +def rfir69 : Row := ⟨69,4,2,8,1725436573842136401625135686044189019204858291154506333438337095827456,[0,1426606581717,1875639553249,2172138256779,2410966552339,2939043194547,3131790737635,3871744354747,4821933104678],[1000000000000000000000000000000,1426606581717,1875639553249,2172138256779,2410966552339,2939043194547,3131790737635,3871744354747,5401923276887]⟩ +def rfir70 : Row := ⟨70,4,2,9,1725436573842136209665710213776658375779200421344055905004233156460544,[0,1426606581717,1954693889501,2172138256779,2410966552339,2802575977414,3131790737635,3871744354747,4465930551931,5213542529753],[1000000000000000000000000000000,1426606581717,1954693889501,2172138256779,2410966552339,2802575977414,3131790737635,3871744354747,4465930551931,1000000000000000000000000000000]⟩ +def rfir71 : Row := ⟨71,4,2,10,1725436573842136209668450527234008085266194310161291877811834528464896,[0,1426606581717,1954693889501,2172138256779,2410966552339,2700225564563,3131790737635,3871744354747,4037688940343,5111192116902,5400451129126],[1000000000000000000000000000000,1426606581717,1954693889501,2172138256779,2410966552339,2700225564563,3131790737635,3871744354747,4037688940343,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir72 : Row := ⟨72,4,2,11,1724646705943459306822234965357863655674844939633377566875201763803136,[0,1426606581717,1954693889501,2172138256779,2410966552339,2700225564563,3009435991467,3871744354747,4037688940343,5111192116902,5400451129126,5709661556030],[1000000000000000000000000000000,1426606581717,1954693889501,2172138256779,2410966552339,2700225564563,3009435991467,3871744354747,4037688940343,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir73 : Row := ⟨73,4,2,12,1722946692333229248764981672107714498145507701326248865345787811332096,[0,1426606581717,1954693889501,2172138256779,2410966552339,2802575977414,3009435991467,3904873313819,4037688940343,5181574248246,5420402543806,5812011968881,6018871982934],[1000000000000000000000000000000,1426606581717,1954693889501,2172138256779,2410966552339,2802575977414,3009435991467,3904873313819,4037688940343,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir74 : Row := ⟨74,4,3,2,1653826573206650435937118788600311048813541693181571612125795117432832,[0,951071054478,1453379273584],[1000000000000000000000000000000,951071054478,1453379273584]⟩ +def rfir75 : Row := ⟨75,4,3,3,1656357359215864854421665288239140158184582560514623040981482828988416,[0,951071054478,1435670523380,1742485759353],[1000000000000000000000000000000,951071054478,1435670523380,1742485759353]⟩ +def rfir76 : Row := ⟨76,4,3,4,1724770857123213143770702344688275565012014400973079842846731279532032,[0,951071054478,1409107398074,1742485759353,1981314054913],[1000000000000000000000000000000,951071054478,1409107398074,1742485759353,1981314054913]⟩ +def rfir77 : Row := ⟨77,4,3,5,1724988995745286375412850804557021486473316662175488330656117929541632,[0,951071054478,1409107398074,1700642237922,1981314054913,2932385109391],[1000000000000000000000000000000,951071054478,1409107398074,1700642237922,1981314054913,1000000000000000000000000000000]⟩ +def rfir78 : Row := ⟨78,4,3,6,1724988996602544851243310189014585396252394554884441345102226038718464,[0,951071054478,1383431142512,1681739845707,1939470533482,2327040450175,2827551855032],[1000000000000000000000000000000,951071054478,1383431142512,1681739845707,1939470533482,2327040450175,2827551855032]⟩ +def rfir79 : Row := ⟨79,4,3,7,1724988996602544851338309222853525992781114460921175422697902822129664,[0,951071054478,1383431142512,1660915928575,1919407518656,2327040450175,2656255210396,3580323447231],[1000000000000000000000000000000,951071054478,1383431142512,1660915928575,1919407518656,2327040450175,2656255210396,3897334149058]⟩ +def rfir80 : Row := ⟨80,4,3,8,1724988996602531055686428321789310712077331459104628773102849422786560,[0,951071054478,1383431142512,1660915928575,1919407518656,2327040450175,2533900464228,3484971518706,3838815037312],[1000000000000000000000000000000,951071054478,1383431142512,1660915928575,1919407518656,2327040450175,2533900464228,3857579398168,3990395024692]⟩ +def rfir81 : Row := ⟨81,4,3,9,1724988996601588947668470689708921509844255690125611938086509212598272,[0,951071054478,1409107398074,1660915928575,1919407518656,2327040450175,2533900464228,3484971518706,3838815037312,4194816392803],[1000000000000000000000000000000,951071054478,1409107398074,1660915928575,1919407518656,2327040450175,2533900464228,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir82 : Row := ⟨82,4,3,10,1723303999934695873204516371103176940114976684751502084778490427604992,[0,951071054478,1409107398074,1660915928575,1919407518656,2327040450175,2533900464228,3484971518706,3838815037312,4194816392803,4453307982884],[1000000000000000000000000000000,951071054478,1409107398074,1660915928575,1919407518656,2327040450175,2533900464228,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir83 : Row := ⟨83,4,4,1,1652996772683465680177557579065700088316417642379738466562555881979904,[0,713303290858],[1000000000000000000000000000000,713303290858]⟩ +def rfir84 : Row := ⟨84,4,4,2,1670771979137993255628778445903802405933548475601221959393066723835904,[0,713303290858,1102108603052],[1000000000000000000000000000000,713303290858,1102108603052]⟩ +def rfir85 : Row := ⟨85,4,4,3,1725007816203674625135576811143372345919495893227407661780756580007936,[0,713303290858,1090034455186,1454453004998],[1000000000000000000000000000000,713303290858,1090034455186,1454453004998]⟩ +def rfir86 : Row := ⟨86,4,4,4,1725015323871980902955908308906566683699909250269833413292692613365760,[0,713303290858,1090034455186,1381569295034,1660152341484],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1660152341484]⟩ +def rfir87 : Row := ⟨87,4,4,5,1725436573842136226022838078417684694330497254121867829285424767959040,[0,713303290858,1090034455186,1381569295034,1620397590594,2089272686555],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1620397590594,2089272686555]⟩ +def rfir88 : Row := ⟨88,4,4,6,1725436573842136257547429845362478598467268773511614090693544641560576,[0,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2418487446776],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2418487446776]⟩ +def rfir89 : Row := ⟨89,4,4,7,1725436573842136257547521188158575312977063513223344076914064608985088,[0,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2296132700608,2992938528956],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2296132700608,3158441063888]⟩ +def rfir90 : Row := ⟨90,4,4,8,1725436573842066513835685033601645491242898389591000490536156667052032,[0,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2296132700608,2992938528956,3222738467844],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2296132700608,3191570022960,3324385649484]⟩ +def rfir91 : Row := ⟨91,4,4,9,1722909078734203536619517881827344946293541769869686838314199173562368,[0,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2296132700608,2992938528956,3222738467844,3598291507626],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1611369233922,1986922273704,2296132700608,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir92 : Row := ⟨92,4,4,10,1715747841078812868429306904584027269507503040386422520868983296491520,[0,713303290858,1090034455186,1381569295034,1611369233922,2089272686555,2296132700608,2992938528956,3222738467844,3677701995642,3907501934530],[1000000000000000000000000000000,713303290858,1090034455186,1381569295034,1611369233922,2089272686555,2296132700608,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir93 : Row := ⟨93,4,5,2,1220847838564979176479569252607127231657536889195429319619070096572416,[0,570642632687,942862564964],[1000000000000000000000000000000,570642632687,942862564964]⟩ +def rfir94 : Row := ⟨94,4,5,3,1724138983367772555627460989543758557592359108128053136223854682701824,[0,570642632687,898590689454,1296138198338],[1000000000000000000000000000000,570642632687,898590689454,1296138198338]⟩ +def rfir95 : Row := ⟨95,4,5,4,1724982414155665836171579288444025490833843043768833864449683389153280,[0,570642632687,898590689454,1210949446434,1428953824862],[1000000000000000000000000000000,570642632687,898590689454,1210949446434,1428953824862]⟩ +def rfir96 : Row := ⟨96,4,5,5,1724988995744347731577246642412515358398450033233404779897166013399040,[0,570642632687,898590689454,1190125529302,1538979096865,2088716218756],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1538979096865,1000000000000000000000000000000]⟩ +def rfir97 : Row := ⟨97,4,5,6,1724988995748785835471480329621223963651551170192056402995928432115712,[0,570642632687,898590689454,1190125529302,1517297715726,2087940348413,2380251058604],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1517297715726,2261601262429,2447123433241]⟩ +def rfir98 : Row := ⟨98,4,5,7,1724146470145819408131724123916146396753076339079351992630569756262400,[0,570642632687,898590689454,1190125529302,1468708575752,1946612028384,2275826788605,2658834105054],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1468708575752,1946612028384,2275826788605,1000000000000000000000000000000]⟩ +def rfir99 : Row := ⟨99,4,5,8,1720776477078025442084861927323261590543872593788115347628848702291968,[0,570642632687,898590689454,1190125529302,1428953824862,1946612028384,2153472042437,2619079354164,2857907649724],[1000000000000000000000000000000,570642632687,898590689454,1190125529302,1428953824862,1946612028384,2153472042437,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir100 : Row := ⟨100,4,6,1,1653154741020485848532871223618558363173908517733387401430128689938432,[0,475535527239],[1000000000000000000000000000000,475535527239]⟩ +def rfir101 : Row := ⟨101,4,6,2,1711527836013669720619157512792911780928988661216424104463838847434752,[0,475535527239,770961512299],[1000000000000000000000000000000,475535527239,770961512299]⟩ +def rfir102 : Row := ⟨102,4,6,3,1725429990964883811577620967393716633027783442393098501486389437136896,[0,475535527239,770961512299,1083320269279],[1000000000000000000000000000000,475535527239,770961512299,1083320269279]⟩ +def rfir103 : Row := ⟨103,4,6,4,1725436573841453146160354573951895631317498147231800176795916389318656,[0,475535527239,770961512299,1062496352147,1301324647707],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1301324647707]⟩ +def rfir104 : Row := ⟨104,4,6,5,1725436572887060899672066136790405951426881921540979176519780593041408,[0,475535527239,770961512299,1062496352147,1373601470303,1833457864446],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1373601470303,1987972140069]⟩ +def rfir105 : Row := ⟨105,4,6,6,1725436573031409719458399527908506746479372275175274555290329492226048,[0,475535527239,770961512299,1062496352147,1341079398597,1816614925836,2112040910896],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1341079398597,1851504922936,2180719683157]⟩ +def rfir106 : Row := ⟨106,4,6,7,1721224055912000688755552777459026530638507064502999122273681698455552,[0,475535527239,770961512299,1062496352147,1301324647707,1749154510085,2058364936989,2363820999854],[1000000000000000000000000000000,475535527239,770961512299,1062496352147,1301324647707,1749154510085,2058364936989,1000000000000000000000000000000]⟩ +def rfir107 : Row := ⟨107,4,6,8,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir108 : Row := ⟨108,4,7,2,1625563359492006241466637959256470788314009648950061637980398318256128,[0,407601880490,724069689841],[1000000000000000000000000000000,407601880490,724069689841]⟩ +def rfir109 : Row := ⟨109,4,7,3,1655054091967455770603934705049722619749297750199283555005517250166784,[0,407601880490,706360939637,1113962820127],[1000000000000000000000000000000,407601880490,706360939637,1199016585365]⟩ +def rfir110 : Row := ⟨110,4,7,4,1662636577168471400362669369746055916862950995153991160341436062236672,[0,407601880490,691871962197,1099473842687,1383743924394],[1000000000000000000000000000000,407601880490,691871962197,1199016585365,1437844880925]⟩ +def rfir111 : Row := ⟨111,4,8,1,1626826642386109796790553044274187217316101172287346979122090189258752,[0,356651645429],[1000000000000000000000000000000,356651645429]⟩ +def rfir112 : Row := ⟨112,4,8,2,1658025874805001768620179514986218103668981537441437880955886131740672,[0,356651645429,637988166161],[1000000000000000000000000000000,356651645429,637988166161]⟩ +def rfir113 : Row := ⟨113,4,8,3,1671509139147789810644578124764360693646098616120370104414898367758336,[0,356651645429,623499188721,980150834150],[1000000000000000000000000000000,356651645429,623499188721,1102183320491]⟩ +def rfir114 : Row := ⟨114,4,8,4,1635279858014437252081819232104619459510690731591968370908035150774272,[0,356651645429,623499188721,980150834150,1246998377442],[1000000000000000000000000000000,356651645429,623499188721,1102183320491,1290868492097]⟩ +def rfir115 : Row := ⟨115,5,1,4,902315715017087972413119526148179874144310719450291367972144582492160,[0,2569449669526,2971774121230,3603432940904,3762811692734],[1000000000000000000000000000000,2569449669526,2971774121230,3603432940904,3762811692734]⟩ +def rfir116 : Row := ⟨116,5,1,6,969715581689500758700750094886469658028768495690154266976567070556160,[0,2569449669526,2945210995924,3188156695798,3320972322322,5890421991848,6266183318246],[1000000000000000000000000000000,2569449669526,2945210995924,3188156695798,3320972322322,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir117 : Row := ⟨117,5,1,8,934330651686995133162622820233130030222982791276963094496493495648256,[0,2569449669526,2945210995924,3188156695798,3320972322322,5890421991848,6266183318246,6509129018120,6641944644644],[1000000000000000000000000000000,2569449669526,2945210995924,3188156695798,3320972322322,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir118 : Row := ⟨118,5,2,2,1006785508370385895857949945222228281726380116113775778249895766392832,[0,1284724834763,1636191591174],[1000000000000000000000000000000,1284724834763,1636191591174]⟩ +def rfir119 : Row := ⟨119,5,2,3,1010155501704572026026910986647877000973621469014524237936202639998976,[0,1284724834763,1636191591174,2172940686217],[1000000000000000000000000000000,1284724834763,1636191591174,2172940686217]⟩ +def rfir120 : Row := ⟨120,5,2,4,1293235152243845652065356550255815199528918606189692173253367660806144,[0,1284724834763,1599749736193,1854842721061,2303341483167],[1000000000000000000000000000000,1284724834763,1599749736193,1854842721061,2303341483167]⟩ +def rfir121 : Row := ⟨121,5,2,5,1724594350546265417250689534012119114019130550674781524190217497477120,[0,1284724834763,1585733638123,1854842721061,2036247487559,3320972322322],[1000000000000000000000000000000,1284724834763,1585733638123,1854842721061,2036247487559,1000000000000000000000000000000]⟩ +def rfir122 : Row := ⟨122,5,2,6,1724594554671286082156341414737775894460649578809894828153928626995200,[0,1284724834763,1573719839777,1854842721061,1987658347585,3272383182348,3561378187362],[1000000000000000000000000000000,1284724834763,1573719839777,1854842721061,1987658347585,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir123 : Row := ⟨123,5,2,7,1050595421713996047284981077966233835123425552997259155230591635423232,[0,1284724834763,1636191591174,1854842721061,2036247487559,3320972322322,3672439078733,3891090208620],[1000000000000000000000000000000,1284724834763,1636191591174,1854842721061,2036247487559,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir124 : Row := ⟨124,5,2,8,934330651737214628912912781649318472715941635646853270845669593055232,[0,1284724834763,1636191591174,1854842721061,1987658347585,3272383182348,3623849938759,3842501068646,3975316695170],[1000000000000000000000000000000,1284724834763,1636191591174,1854842721061,1987658347585,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir125 : Row := ⟨125,5,3,2,1006785508672428506998289712093791614001488853731560309319306286465024,[0,856483223175,1188072604141],[1000000000000000000000000000000,856483223175,1188072604141]⟩ +def rfir126 : Row := ⟨126,5,3,3,1009313003672479243213432775369203958591737362103316153576337392533504,[0,856483223175,1188072604141,1640579488967],[1000000000000000000000000000000,856483223175,1188072604141,1640579488967]⟩ +def rfir127 : Row := ⟨127,5,3,4,1293236875589552281480943623680482669387936978190055555901713392074752,[0,856483223175,1157492026535,1386846358583,1608005875971],[1000000000000000000000000000000,856483223175,1157492026535,1386846358583,1608005875971]⟩ +def rfir128 : Row := ⟨128,5,3,5,1724596406372365013747451269212560532528032446694712788916521242984448,[0,856483223175,1145478228189,1386846358583,1559416735997,2415899959172],[1000000000000000000000000000000,856483223175,1145478228189,1386846358583,1559416735997,1000000000000000000000000000000]⟩ +def rfir129 : Row := ⟨129,5,3,6,1724597956157390309564294127005498383649696498739842156168711386431488,[0,856483223175,1135066269623,1325685203371,1519661985107,2376145208282,2651370406742],[1000000000000000000000000000000,856483223175,1135066269623,1325685203371,1519661985107,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir130 : Row := ⟨130,5,3,7,1048067927165694729730169948829909616783301973349931134095623324696576,[0,856483223175,1186873443219,1386846358583,1559416735997,2415899959172,2746290179216,2946263094580],[1000000000000000000000000000000,856483223175,1186873443219,1386846358583,1559416735997,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir131 : Row := ⟨131,5,3,8,934330652540680586051326187642582802192468636289587530258821643501568,[0,856483223175,1186873443219,1386846358583,1519661985107,2376145208282,2706535428326,2906508343690,3039323970214],[1000000000000000000000000000000,856483223175,1186873443219,1386846358583,1519661985107,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir132 : Row := ⟨132,5,4,1,1221622585068961179313720678101214994539744848136188526540598636707840,[0,642362417381],[1000000000000000000000000000000,642362417381]⟩ +def rfir133 : Row := ⟨133,5,4,2,1293235152519836892601660551833876753706053253523521877128803445112832,[0,642362417381,923358989045],[1000000000000000000000000000000,642362417381,923358989045]⟩ +def rfir134 : Row := ⟨134,5,4,3,1724596433636592146365629605975290842621515735921212282890951134806016,[0,642362417381,923358989045,1172725552789],[1000000000000000000000000000000,642362417381,923358989045,1172725552789]⟩ +def rfir135 : Row := ⟨135,5,4,4,1724609604154578640483768508526662304956356341621750763314427547615232,[0,642362417381,923358989045,1139596593717,1345295930203],[1000000000000000000000000000000,642362417381,923358989045,1139596593717,1345295930203]⟩ +def rfir136 : Row := ⟨136,5,4,5,1724612973100089391932552724182717490027122940689335867923835641659392,[0,642362417381,920945463829,1111564397577,1305541179313,1947903596694],[1000000000000000000000000000000,642362417381,920945463829,1111564397577,1305541179313,1000000000000000000000000000000]⟩ +def rfir137 : Row := ⟨137,5,4,6,1724625106981807601729229812456964539643236356816346790762387368574976,[0,642362417381,911835000084,1087536800885,1305541179313,1947903596694,2175073601770],[1000000000000000000000000000000,642362417381,911835000084,1087536800885,1305541179313,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir138 : Row := ⟨138,5,4,7,1077555376064317295573519265627186771869462452842603268311770759954432,[0,642362417381,923358989045,1139596593717,1305541179313,1947903596694,2228900168358,2445137773030],[1000000000000000000000000000000,642362417381,923358989045,1139596593717,1305541179313,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir139 : Row := ⟨139,5,4,8,933488154204169057761395648817461810469879237371394059820600200790016,[0,642362417381,923358989045,1172725552789,1305541179313,1947903596694,2228900168358,2478266732102,2611082358626],[1000000000000000000000000000000,642362417381,923358989045,1172725552789,1305541179313,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir140 : Row := ⟨140,5,5,2,1239316981823070018792594194199733014980220058586174267668605792419840,[0,513889933905,777324464407],[1000000000000000000000000000000,513889933905,777324464407]⟩ +def rfir141 : Row := ⟨141,5,5,3,1293240577971226727734960972460232914357906854670115761551765577662464,[0,513889933905,765250316541,1044253069313],[1000000000000000000000000000000,513889933905,765250316541,1044253069313]⟩ +def rfir142 : Row := ⟨142,5,5,4,1724665654103279491311286124596740145606725127649811505448166415663104,[0,513889933905,765250316541,983091914101,1265412586701],[1000000000000000000000000000000,513889933905,765250316541,983091914101,1265412586701]⟩ +def rfir143 : Row := ⟨143,5,5,5,1724600630101379141066789610820907158235274423216523900056142987919360,[0,513889933905,765250316541,959064317409,1177068695837,1690958629742],[1000000000000000000000000000000,513889933905,765250316541,959064317409,1177068695837,1000000000000000000000000000000]⟩ +def rfir144 : Row := ⟨144,5,5,6,1722920364260112885046417138362232148833833092427163512036496576086016,[0,513889933905,765250316541,938240400277,1177068695837,1690958629742,1876480800554],[1000000000000000000000000000000,513889933905,765250316541,938240400277,1177068695837,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir145 : Row := ⟨145,5,6,1,1652996772683465680177371992258713398599898766716859493179194821574656,[0,428241611587],[1000000000000000000000000000000,428241611587]⟩ +def rfir146 : Row := ⟨146,5,6,2,1724639216326460256612514742150595964661313264902253253451793553162240,[0,428241611587,659844534871],[1000000000000000000000000000000,428241611587,659844534871]⟩ +def rfir147 : Row := ⟨147,5,6,3,1724798117216637881724063662380226703911013118052171238200390442811392,[0,428241611587,659844534871,873415995091],[1000000000000000000000000000000,428241611587,659844534871,873415995091]⟩ +def rfir148 : Row := ⟨148,5,6,4,1724798118073825470047530802303242888424294207126660397541688667537408,[0,428241611587,659844534871,873415995091,1091420373519],[1000000000000000000000000000000,428241611587,659844534871,873415995091,1091420373519]⟩ +def rfir149 : Row := ⟨149,5,6,5,1724646705823392495552840718194043011096595614457697823012136452882432,[0,428241611587,659844534871,852592077959,1091420373519,1512436612830],[1000000000000000000000000000000,428241611587,659844534871,852592077959,1091420373519,1000000000000000000000000000000]⟩ +def rfir150 : Row := ⟨150,5,6,6,1715364207117878652535193849492819274017655389633730539505151643746304,[0,428241611587,659844534871,852592077959,1091420373519,1512436612830,1705184155918],[1000000000000000000000000000000,428241611587,659844534871,852592077959,1091420373519,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir151 : Row := ⟨151,5,7,1,1652983608646958070671727044061785472690990094936058624888378157432832,[0,367064238503],[1000000000000000000000000000000,367064238503]⟩ +def rfir152 : Row := ⟨152,5,7,2,1724665544399327589804111080269620235991010603627635781708136163835904,[0,367064238503,584554690822],[1000000000000000000000000000000,367064238503,584554690822]⟩ +def rfir153 : Row := ⟨153,5,7,3,1724988995745144619539653111141576030296066136658508190726175806455808,[0,367064238503,584554690822,791414704875],[1000000000000000000000000000000,367064238503,584554690822,791414704875]⟩ +def rfir154 : Row := ⟨154,5,7,4,1724988996495662855741150057078559469984549955007215013467884401721344,[0,367064238503,584554690822,791414704875,1030243000435],[1000000000000000000000000000000,367064238503,584554690822,791414704875,1030243000435]⟩ +def rfir155 : Row := ⟨155,5,7,5,1722079712887031048896507859243078410244396551237856898667978147495936,[0,367064238503,584554690822,791414704875,1069997751325,1375969395697],[1000000000000000000000000000000,367064238503,584554690822,791414704875,1069997751325,1000000000000000000000000000000]⟩ +def rfir156 : Row := ⟨156,5,7,6,1711967830645300390726067324802818450647166908398143296891178348183552,[0,367064238503,584554690822,791414704875,1030243000435,1375969395697,1582829409750],[1000000000000000000000000000000,367064238503,584554690822,791414704875,1030243000435,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir157 : Row := ⟨157,5,8,1,1653049428829299958770720951272555233816058214264559767734821977063424,[0,321181208690],[1000000000000000000000000000000,321181208690]⟩ +def rfir158 : Row := ⟨158,5,8,2,1725007809347244270678715850304158731507938411450953091363223940104192,[0,321181208690,528087307784],[1000000000000000000000000000000,321181208690,528087307784]⟩ +def rfir159 : Row := ⟨159,5,8,3,1725436572983939089901869000552885289179303280038478780105471154978816,[0,321181208690,528087307784,745531675062],[1000000000000000000000000000000,321181208690,528087307784,745531675062]⟩ +def rfir160 : Row := ⟨160,5,8,4,1725436546416302154306973501391776423872330413460762560019084580225024,[0,321181208690,528087307784,745531675062,984359970622],[1000000000000000000000000000000,321181208690,528087307784,745531675062,984359970622]⟩ +def rfir161 : Row := ⟨161,5,8,5,1712007322754676099671079044063199827059286494058918502807898714800128,[0,321181208690,528087307784,745531675062,984359970622,1273618982846],[1000000000000000000000000000000,321181208690,528087307784,745531675062,984359970622,1000000000000000000000000000000]⟩ +def rfir162 : Row := ⟨162,5,8,6,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir163 : Row := ⟨163,5,9,1,1220110597673101594896698658036310199253681338105286529160551086424064,[0,285494407725],[1000000000000000000000000000000,285494407725]⟩ +def rfir164 : Row := ⟨164,5,9,2,1724981481154179480978155684301943406971274447681393806906215951761408,[0,285494407725,484168232089],[1000000000000000000000000000000,285494407725,484168232089]⟩ +def rfir165 : Row := ⟨165,5,9,3,1719084897325991940802223620433570589293316217023973182165491707281408,[0,285494407725,484168232089,730668791229],[1000000000000000000000000000000,285494407725,484168232089,730668791229]⟩ +def rfir166 : Row := ⟨166,5,9,4,1719076454473507404067315922964737428825002565369443847371935033851904,[0,285494407725,484168232089,709844874097,968336464178],[1000000000000000000000000000000,285494407725,484168232089,709844874097,1000000000000000000000000000000]⟩ +def rfir167 : Row := ⟨167,5,10,1,1653365365597545860971933423926930357813615760583145572860786448007168,[0,256944966952],[1000000000000000000000000000000,256944966952]⟩ +def rfir168 : Row := ⟨168,5,10,2,1725429058192903593489248051476853744765984426521570766406197669003264,[0,256944966952,449032971532],[1000000000000000000000000000000,256944966952,449032971532]⟩ +def rfir169 : Row := ⟨169,5,10,3,1712798854587327003016494715533281136648493428042051740193260090425344,[0,256944966952,449032971532,681295433324],[1000000000000000000000000000000,256944966952,449032971532,681295433324]⟩ +def rfir170 : Row := ⟨170,5,10,4,1699251261300849264808366402224925605189360721528803074030198803398656,[0,256944966952,449032971532,681295433324,898065943064],[1000000000000000000000000000000,256944966952,449032971532,681295433324,1000000000000000000000000000000]⟩ +def rfir171 : Row := ⟨171,5,11,1,1651680341612902193581932051270636061096749196179285892773239272243200,[0,233586333593],[1000000000000000000000000000000,233586333593]⟩ +def rfir172 : Row := ⟨172,5,11,2,1662634722561076543643001767832855117994435672389287639170404610736128,[0,233586333593,432360088034],[1000000000000000000000000000000,233586333593,432360088034]⟩ +def rfir173 : Row := ⟨173,5,12,1,1653786587446273337315890411824309469743127098087296874998325491793920,[0,214120805793],[1000000000000000000000000000000,214120805793]⟩ +def rfir174 : Row := ⟨174,5,12,2,1635266639341692828462191503045774309478359528761574137833819815804928,[0,214120805793,408404228563],[1000000000000000000000000000000,214120805793,408404228563]⟩ +def rfir175 : Row := ⟨175,6,3,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir176 : Row := ⟨176,6,4,3,865245788348865845910094515449036271932042103810911498065418991435776,[0,546627824718,723715326752,1270343151470],[1000000000000000000000000000000,546627824718,723715326752,1000000000000000000000000000000]⟩ +def rfir177 : Row := ⟨177,6,4,4,866930785015562760897261203891974998849144425337320283845487967076352,[0,546627824718,706006576548,1252634401266,1412013153096],[1000000000000000000000000000000,546627824718,706006576548,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir178 : Row := ⟨178,6,5,4,866930785015562760897261203891974998849144425337320283845487967076352,[0,437302259774,596681011604,1033983271378,1193362023208],[1000000000000000000000000000000,437302259774,596681011604,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir179 : Row := ⟨179,6,6,2,871985775015653505858761269220791179600451389916546641185694893998080,[0,364418549812,541506051846],[1000000000000000000000000000000,364418549812,541506051846]⟩ +def rfir180 : Row := ⟨180,6,6,3,875355768349047335833094646106668633434656032969364212745832845279232,[0,364418549812,523797301642,888215851454],[1000000000000000000000000000000,364418549812,523797301642,1000000000000000000000000000000]⟩ +def rfir181 : Row := ⟨181,6,6,4,880410758349138080794594711435484814185962997548590570086039772200960,[0,364418549812,509308324202,873726874014,1018616648404],[1000000000000000000000000000000,364418549812,509308324202,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir182 : Row := ⟨182,6,7,2,870300778348956590871594580777852452683349068390137855405625918357504,[0,312358756981,489446259015],[1000000000000000000000000000000,312358756981,489446259015]⟩ +def rfir183 : Row := ⟨183,6,7,3,872828273349001963352344613442260543059002550679751034075729381818368,[0,312358756981,471737508811,784096265792],[1000000000000000000000000000000,312358756981,471737508811,1000000000000000000000000000000]⟩ +def rfir184 : Row := ⟨184,6,7,4,880410758349138080794594711435484814185962997548590570086039772200960,[0,312358756981,457248531371,769607288352,914497062742],[1000000000000000000000000000000,312358756981,457248531371,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir185 : Row := ⟨185,6,8,1,898103223349455688159844940086341446815537373575882820776764016427008,[0,273313912359],[1000000000000000000000000000000,273313912359]⟩ +def rfir186 : Row := ⟨186,6,8,2,902315715016197975627761661193688264108293177391904785226936455528448,[0,273313912359,432692664189],[1000000000000000000000000000000,273313912359,432692664189]⟩ +def rfir187 : Row := ⟨187,6,8,3,1293234941689882252650433379955472908876031771518743086202938804142080,[0,273313912359,406129538883,679443451242],[1000000000000000000000000000000,273313912359,406129538883,1000000000000000000000000000000]⟩ +def rfir188 : Row := ⟨188,6,8,4,934330651683439360383928741609524075533237286393671715048246992699392,[0,273313912359,406129538883,679443451242,812259077766],[1000000000000000000000000000000,273313912359,406129538883,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir189 : Row := ⟨189,6,9,2,900630718349501060640594972750749537191190855865495999446867479887872,[0,242945699874,402324451704],[1000000000000000000000000000000,242945699874,402324451704]⟩ +def rfir190 : Row := ⟨190,6,9,3,1291549945023185337663266691512534181958929449992334300422869828501504,[0,242945699874,375761326398,618707026272],[1000000000000000000000000000000,242945699874,375761326398,1000000000000000000000000000000]⟩ +def rfir191 : Row := ⟨191,6,9,4,934330651683439360383928741609524075533237286393671715048246992699392,[0,242945699874,375761326398,618707026272,751522652796],[1000000000000000000000000000000,242945699874,375761326398,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir192 : Row := ⟨192,6,10,1,1005943010018058247338513000434419969510085951266045110701178457423872,[0,218651129887],[1000000000000000000000000000000,218651129887]⟩ +def rfir193 : Row := ⟨193,6,10,2,1293234941689882252650433379955472908876031771518743086202938804142080,[0,218651129887,351466756411],[1000000000000000000000000000000,218651129887,351466756411]⟩ +def rfir194 : Row := ⟨194,6,10,3,1724594088364292489365105621347786999654226082279392245900596568129536,[0,218651129887,351466756411,570117886298],[1000000000000000000000000000000,218651129887,351466756411,1000000000000000000000000000000]⟩ +def rfir195 : Row := ⟨195,6,10,4,933488153350090902890345397388054712074686125630467322158212504879104,[0,218651129887,351466756411,570117886298,702933512822],[1000000000000000000000000000000,218651129887,351466756411,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir196 : Row := ⟨196,6,11,1,1004258013351361332351346311991481242592983629739636324921109481783296,[0,198773754442],[1000000000000000000000000000000,198773754442]⟩ +def rfir197 : Row := ⟨197,6,11,2,1291549945023185337663266691512534181958929449992334300422869828501504,[0,198773754442,331589380966],[1000000000000000000000000000000,198773754442,331589380966]⟩ +def rfir198 : Row := ⟨198,6,11,3,1722066593364247116884355588683378909278572599989779067230493104668672,[0,198773754442,331589380966,530363135408],[1000000000000000000000000000000,198773754442,331589380966,1000000000000000000000000000000]⟩ +def rfir199 : Row := ⟨199,6,11,4,930118160016697072916012020502177258240481482577649750598074553597952,[0,198773754442,331589380966,530363135408,663178761932],[1000000000000000000000000000000,198773754442,331589380966,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir200 : Row := ⟨200,6,12,1,1221622583355263365695849121130577014899183106646369690550007339417600,[0,182209274906],[1000000000000000000000000000000,182209274906]⟩ +def rfir201 : Row := ⟨201,6,12,2,1724594088364292489365105621347786999654226082279392245900596568129536,[0,182209274906,315024901430],[1000000000000000000000000000000,182209274906,315024901430]⟩ +def rfir202 : Row := ⟨202,6,12,3,1715326606697459456935688834911624001610163313884143924110217202106368,[0,182209274906,315024901430,497234176336],[1000000000000000000000000000000,182209274906,315024901430,1000000000000000000000000000000]⟩ +def rfir203 : Row := ⟨203,6,12,4,0,[0,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000],[1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfir204 : Row := ⟨204,6,13,1,1219937586688566450708682432687638287982080785119960904769938363777024,[0,168193176836],[1000000000000000000000000000000,168193176836]⟩ +def rfir205 : Row := ⟨205,6,13,2,1291549945023185337663266691512534181958929449992334300422869828501504,[0,168193176836,301008803360],[1000000000000000000000000000000,168193176836,301008803360]⟩ +def rfir206 : Row := ⟨206,6,13,3,1253637520022504750452016201546412826324127215648136620371317876588544,[0,168193176836,301008803360,469201980196],[1000000000000000000000000000000,168193176836,301008803360,1000000000000000000000000000000]⟩ +def rfir207 : Row := ⟨207,6,14,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,156179378490],[1000000000000000000000000000000,156179378490]⟩ +def rfir208 : Row := ⟨208,6,14,2,1722909091697595574377938932904848272737123760752983460120527592488960,[0,156179378490,288995005014],[1000000000000000000000000000000,156179378490,288995005014]⟩ +def rfir209 : Row := ⟨209,6,14,3,1577156880028312427988020382590648394407772948718623490144561199579136,[0,156179378490,288995005014,445174383504],[1000000000000000000000000000000,156179378490,288995005014,1000000000000000000000000000000]⟩ +def rfir210 : Row := ⟨210,6,15,1,1651296733362976687423354674079952378760275095880610064467596127764480,[0,145767419924],[1000000000000000000000000000000,145767419924]⟩ +def rfir211 : Row := ⟨211,6,15,2,1715326606697459456935688834911624001610163313884143924110217202106368,[0,145767419924,278583046448],[1000000000000000000000000000000,145767419924,278583046448]⟩ +def rfir212 : Row := ⟨212,6,15,3,1347997333357531989733350754350981533681857221127028624055180512460800,[0,145767419924,278583046448,424350466372],[1000000000000000000000000000000,145767419924,278583046448,1000000000000000000000000000000]⟩ +def rfir213 : Row := ⟨213,6,16,1,1652981730029673602410521362522891105677377417407018850247665103405056,[0,136656956179],[1000000000000000000000000000000,136656956179]⟩ +def rfir214 : Row := ⟨214,6,16,2,1688366660030308817141021819824604370936526169461603351629113591857152,[0,136656956179,269472582703],[1000000000000000000000000000000,136656956179,269472582703]⟩ +def rfir215 : Row := ⟨215,6,17,1,1186237653354628150965348663828863749640034354591785189168558850965504,[0,128618311698],[1000000000000000000000000000000,128618311698]⟩ +def rfir216 : Row := ⟨216,6,18,1,1617596800029038387680020905221177840418228665352434348866216614952960,[0,121472849937],[1000000000000000000000000000000,121472849937]⟩ +def rfir217 : Row := ⟨217,6,19,1,1509757013360435828501352844873099317723680087662272058941802173956096,[0,115079542045],[1000000000000000000000000000000,115079542045]⟩ +def rfir218 : Row := ⟨218,6,20,1,1509757013360435828501352844873099317723680087662272058941802173956096,[0,109325564943],[1000000000000000000000000000000,109325564943]⟩ +def rfir219 : Row := ⟨219,7,18,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,88543751017,177087502034],[1000000000000000000000000000000,88543751017,1000000000000000000000000000000]⟩ +def rfir220 : Row := ⟨220,7,20,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,79689375915],[1000000000000000000000000000000,79689375915]⟩ +def rfir221 : Row := ⟨221,7,20,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,79689375915,159378751830],[1000000000000000000000000000000,79689375915,1000000000000000000000000000000]⟩ +def rfir222 : Row := ⟨222,7,22,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,72444887195],[1000000000000000000000000000000,72444887195]⟩ +def rfir223 : Row := ⟨223,7,22,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,72444887195,144889774390],[1000000000000000000000000000000,72444887195,1000000000000000000000000000000]⟩ +def rfir224 : Row := ⟨224,7,24,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,66407813262],[1000000000000000000000000000000,66407813262]⟩ +def rfir225 : Row := ⟨225,7,24,2,862718293348820473429344482784628181556388621521298319395315527974912,[0,66407813262,132815626524],[1000000000000000000000000000000,66407813262,1000000000000000000000000000000]⟩ +def rfir226 : Row := ⟨226,7,26,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,61299519935],[1000000000000000000000000000000,61299519935]⟩ +def rfir227 : Row := ⟨227,7,28,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,56920982796],[1000000000000000000000000000000,56920982796]⟩ +def rfir228 : Row := ⟨228,7,30,1,862718293348820473429344482784628181556388621521298319395315527974912,[0,53126250610],[1000000000000000000000000000000,53126250610]⟩ +def rfir229 : Row := ⟨229,8,48,1,0,[0,0],[1000000000000000000000000000000,1000000000000000000000000000000]⟩ +def rfiR : List Row := [rfir0, rfir1, rfir2, rfir3, rfir4, rfir5, rfir6, rfir7, rfir8, rfir9, rfir10, rfir11, rfir12, rfir13, rfir14, rfir15, rfir16, rfir17, rfir18, rfir19, rfir20, rfir21, rfir22, rfir23, rfir24, rfir25, rfir26, rfir27, rfir28, rfir29, rfir30, rfir31, rfir32, rfir33, rfir34, rfir35, rfir36, rfir37, rfir38, rfir39, rfir40, rfir41, rfir42, rfir43, rfir44, rfir45, rfir46, rfir47, rfir48, rfir49, rfir50, rfir51, rfir52, rfir53, rfir54, rfir55, rfir56, rfir57, rfir58, rfir59, rfir60, rfir61, rfir62, rfir63, rfir64, rfir65, rfir66, rfir67, rfir68, rfir69, rfir70, rfir71, rfir72, rfir73, rfir74, rfir75, rfir76, rfir77, rfir78, rfir79, rfir80, rfir81, rfir82, rfir83, rfir84, rfir85, rfir86, rfir87, rfir88, rfir89, rfir90, rfir91, rfir92, rfir93, rfir94, rfir95, rfir96, rfir97, rfir98, rfir99, rfir100, rfir101, rfir102, rfir103, rfir104, rfir105, rfir106, rfir107, rfir108, rfir109, rfir110, rfir111, rfir112, rfir113, rfir114, rfir115, rfir116, rfir117, rfir118, rfir119, rfir120, rfir121, rfir122, rfir123, rfir124, rfir125, rfir126, rfir127, rfir128, rfir129, rfir130, rfir131, rfir132, rfir133, rfir134, rfir135, rfir136, rfir137, rfir138, rfir139, rfir140, rfir141, rfir142, rfir143, rfir144, rfir145, rfir146, rfir147, rfir148, rfir149, rfir150, rfir151, rfir152, rfir153, rfir154, rfir155, rfir156, rfir157, rfir158, rfir159, rfir160, rfir161, rfir162, rfir163, rfir164, rfir165, rfir166, rfir167, rfir168, rfir169, rfir170, rfir171, rfir172, rfir173, rfir174, rfir175, rfir176, rfir177, rfir178, rfir179, rfir180, rfir181, rfir182, rfir183, rfir184, rfir185, rfir186, rfir187, rfir188, rfir189, rfir190, rfir191, rfir192, rfir193, rfir194, rfir195, rfir196, rfir197, rfir198, rfir199, rfir200, rfir201, rfir202, rfir203, rfir204, rfir205, rfir206, rfir207, rfir208, rfir209, rfir210, rfir211, rfir212, rfir213, rfir214, rfir215, rfir216, rfir217, rfir218, rfir219, rfir220, rfir221, rfir222, rfir223, rfir224, rfir225, rfir226, rfir227, rfir228, rfir229] +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP0.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP0.lean new file mode 100644 index 0000000000..ff662bc4e6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP0.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic0 : Row.check rfiW rfiR rfir0 = true := by decide +kernel +theorem rfic1 : Row.check rfiW rfiR rfir1 = true := by decide +kernel +theorem rfic2 : Row.check rfiW rfiR rfir2 = true := by decide +kernel +theorem rfic3 : Row.check rfiW rfiR rfir3 = true := by decide +kernel +theorem rfic4 : Row.check rfiW rfiR rfir4 = true := by decide +kernel +theorem rfic5 : Row.check rfiW rfiR rfir5 = true := by decide +kernel +theorem rfic6 : Row.check rfiW rfiR rfir6 = true := by decide +kernel +theorem rfic7 : Row.check rfiW rfiR rfir7 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP1.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP1.lean new file mode 100644 index 0000000000..50ea1e79aa --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP1.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic8 : Row.check rfiW rfiR rfir8 = true := by decide +kernel +theorem rfic9 : Row.check rfiW rfiR rfir9 = true := by decide +kernel +theorem rfic10 : Row.check rfiW rfiR rfir10 = true := by decide +kernel +theorem rfic11 : Row.check rfiW rfiR rfir11 = true := by decide +kernel +theorem rfic12 : Row.check rfiW rfiR rfir12 = true := by decide +kernel +theorem rfic13 : Row.check rfiW rfiR rfir13 = true := by decide +kernel +theorem rfic14 : Row.check rfiW rfiR rfir14 = true := by decide +kernel +theorem rfic15 : Row.check rfiW rfiR rfir15 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP10.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP10.lean new file mode 100644 index 0000000000..e849041c88 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP10.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic80 : Row.check rfiW rfiR rfir80 = true := by decide +kernel +theorem rfic81 : Row.check rfiW rfiR rfir81 = true := by decide +kernel +theorem rfic82 : Row.check rfiW rfiR rfir82 = true := by decide +kernel +theorem rfic83 : Row.check rfiW rfiR rfir83 = true := by decide +kernel +theorem rfic84 : Row.check rfiW rfiR rfir84 = true := by decide +kernel +theorem rfic85 : Row.check rfiW rfiR rfir85 = true := by decide +kernel +theorem rfic86 : Row.check rfiW rfiR rfir86 = true := by decide +kernel +theorem rfic87 : Row.check rfiW rfiR rfir87 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP11.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP11.lean new file mode 100644 index 0000000000..7179b3f96c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP11.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic88 : Row.check rfiW rfiR rfir88 = true := by decide +kernel +theorem rfic89 : Row.check rfiW rfiR rfir89 = true := by decide +kernel +theorem rfic90 : Row.check rfiW rfiR rfir90 = true := by decide +kernel +theorem rfic91 : Row.check rfiW rfiR rfir91 = true := by decide +kernel +theorem rfic92 : Row.check rfiW rfiR rfir92 = true := by decide +kernel +theorem rfic93 : Row.check rfiW rfiR rfir93 = true := by decide +kernel +theorem rfic94 : Row.check rfiW rfiR rfir94 = true := by decide +kernel +theorem rfic95 : Row.check rfiW rfiR rfir95 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP12.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP12.lean new file mode 100644 index 0000000000..010072830c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP12.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic96 : Row.check rfiW rfiR rfir96 = true := by decide +kernel +theorem rfic97 : Row.check rfiW rfiR rfir97 = true := by decide +kernel +theorem rfic98 : Row.check rfiW rfiR rfir98 = true := by decide +kernel +theorem rfic99 : Row.check rfiW rfiR rfir99 = true := by decide +kernel +theorem rfic100 : Row.check rfiW rfiR rfir100 = true := by decide +kernel +theorem rfic101 : Row.check rfiW rfiR rfir101 = true := by decide +kernel +theorem rfic102 : Row.check rfiW rfiR rfir102 = true := by decide +kernel +theorem rfic103 : Row.check rfiW rfiR rfir103 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP13.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP13.lean new file mode 100644 index 0000000000..ba8b381ea0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP13.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic104 : Row.check rfiW rfiR rfir104 = true := by decide +kernel +theorem rfic105 : Row.check rfiW rfiR rfir105 = true := by decide +kernel +theorem rfic106 : Row.check rfiW rfiR rfir106 = true := by decide +kernel +theorem rfic107 : Row.check rfiW rfiR rfir107 = true := by decide +kernel +theorem rfic108 : Row.check rfiW rfiR rfir108 = true := by decide +kernel +theorem rfic109 : Row.check rfiW rfiR rfir109 = true := by decide +kernel +theorem rfic110 : Row.check rfiW rfiR rfir110 = true := by decide +kernel +theorem rfic111 : Row.check rfiW rfiR rfir111 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP14.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP14.lean new file mode 100644 index 0000000000..607af2c693 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP14.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic112 : Row.check rfiW rfiR rfir112 = true := by decide +kernel +theorem rfic113 : Row.check rfiW rfiR rfir113 = true := by decide +kernel +theorem rfic114 : Row.check rfiW rfiR rfir114 = true := by decide +kernel +theorem rfic115 : Row.check rfiW rfiR rfir115 = true := by decide +kernel +theorem rfic116 : Row.check rfiW rfiR rfir116 = true := by decide +kernel +theorem rfic117 : Row.check rfiW rfiR rfir117 = true := by decide +kernel +theorem rfic118 : Row.check rfiW rfiR rfir118 = true := by decide +kernel +theorem rfic119 : Row.check rfiW rfiR rfir119 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP15.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP15.lean new file mode 100644 index 0000000000..de66814f0b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP15.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic120 : Row.check rfiW rfiR rfir120 = true := by decide +kernel +theorem rfic121 : Row.check rfiW rfiR rfir121 = true := by decide +kernel +theorem rfic122 : Row.check rfiW rfiR rfir122 = true := by decide +kernel +theorem rfic123 : Row.check rfiW rfiR rfir123 = true := by decide +kernel +theorem rfic124 : Row.check rfiW rfiR rfir124 = true := by decide +kernel +theorem rfic125 : Row.check rfiW rfiR rfir125 = true := by decide +kernel +theorem rfic126 : Row.check rfiW rfiR rfir126 = true := by decide +kernel +theorem rfic127 : Row.check rfiW rfiR rfir127 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP16.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP16.lean new file mode 100644 index 0000000000..a12f5e1171 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP16.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic128 : Row.check rfiW rfiR rfir128 = true := by decide +kernel +theorem rfic129 : Row.check rfiW rfiR rfir129 = true := by decide +kernel +theorem rfic130 : Row.check rfiW rfiR rfir130 = true := by decide +kernel +theorem rfic131 : Row.check rfiW rfiR rfir131 = true := by decide +kernel +theorem rfic132 : Row.check rfiW rfiR rfir132 = true := by decide +kernel +theorem rfic133 : Row.check rfiW rfiR rfir133 = true := by decide +kernel +theorem rfic134 : Row.check rfiW rfiR rfir134 = true := by decide +kernel +theorem rfic135 : Row.check rfiW rfiR rfir135 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP17.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP17.lean new file mode 100644 index 0000000000..4e5fe874e6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP17.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic136 : Row.check rfiW rfiR rfir136 = true := by decide +kernel +theorem rfic137 : Row.check rfiW rfiR rfir137 = true := by decide +kernel +theorem rfic138 : Row.check rfiW rfiR rfir138 = true := by decide +kernel +theorem rfic139 : Row.check rfiW rfiR rfir139 = true := by decide +kernel +theorem rfic140 : Row.check rfiW rfiR rfir140 = true := by decide +kernel +theorem rfic141 : Row.check rfiW rfiR rfir141 = true := by decide +kernel +theorem rfic142 : Row.check rfiW rfiR rfir142 = true := by decide +kernel +theorem rfic143 : Row.check rfiW rfiR rfir143 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP18.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP18.lean new file mode 100644 index 0000000000..05e617354b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP18.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic144 : Row.check rfiW rfiR rfir144 = true := by decide +kernel +theorem rfic145 : Row.check rfiW rfiR rfir145 = true := by decide +kernel +theorem rfic146 : Row.check rfiW rfiR rfir146 = true := by decide +kernel +theorem rfic147 : Row.check rfiW rfiR rfir147 = true := by decide +kernel +theorem rfic148 : Row.check rfiW rfiR rfir148 = true := by decide +kernel +theorem rfic149 : Row.check rfiW rfiR rfir149 = true := by decide +kernel +theorem rfic150 : Row.check rfiW rfiR rfir150 = true := by decide +kernel +theorem rfic151 : Row.check rfiW rfiR rfir151 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP19.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP19.lean new file mode 100644 index 0000000000..10e6d98ef8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP19.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic152 : Row.check rfiW rfiR rfir152 = true := by decide +kernel +theorem rfic153 : Row.check rfiW rfiR rfir153 = true := by decide +kernel +theorem rfic154 : Row.check rfiW rfiR rfir154 = true := by decide +kernel +theorem rfic155 : Row.check rfiW rfiR rfir155 = true := by decide +kernel +theorem rfic156 : Row.check rfiW rfiR rfir156 = true := by decide +kernel +theorem rfic157 : Row.check rfiW rfiR rfir157 = true := by decide +kernel +theorem rfic158 : Row.check rfiW rfiR rfir158 = true := by decide +kernel +theorem rfic159 : Row.check rfiW rfiR rfir159 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP2.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP2.lean new file mode 100644 index 0000000000..792fd98a94 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP2.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic16 : Row.check rfiW rfiR rfir16 = true := by decide +kernel +theorem rfic17 : Row.check rfiW rfiR rfir17 = true := by decide +kernel +theorem rfic18 : Row.check rfiW rfiR rfir18 = true := by decide +kernel +theorem rfic19 : Row.check rfiW rfiR rfir19 = true := by decide +kernel +theorem rfic20 : Row.check rfiW rfiR rfir20 = true := by decide +kernel +theorem rfic21 : Row.check rfiW rfiR rfir21 = true := by decide +kernel +theorem rfic22 : Row.check rfiW rfiR rfir22 = true := by decide +kernel +theorem rfic23 : Row.check rfiW rfiR rfir23 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP20.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP20.lean new file mode 100644 index 0000000000..045bfb3e96 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP20.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic160 : Row.check rfiW rfiR rfir160 = true := by decide +kernel +theorem rfic161 : Row.check rfiW rfiR rfir161 = true := by decide +kernel +theorem rfic162 : Row.check rfiW rfiR rfir162 = true := by decide +kernel +theorem rfic163 : Row.check rfiW rfiR rfir163 = true := by decide +kernel +theorem rfic164 : Row.check rfiW rfiR rfir164 = true := by decide +kernel +theorem rfic165 : Row.check rfiW rfiR rfir165 = true := by decide +kernel +theorem rfic166 : Row.check rfiW rfiR rfir166 = true := by decide +kernel +theorem rfic167 : Row.check rfiW rfiR rfir167 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP21.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP21.lean new file mode 100644 index 0000000000..ac13413a28 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP21.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic168 : Row.check rfiW rfiR rfir168 = true := by decide +kernel +theorem rfic169 : Row.check rfiW rfiR rfir169 = true := by decide +kernel +theorem rfic170 : Row.check rfiW rfiR rfir170 = true := by decide +kernel +theorem rfic171 : Row.check rfiW rfiR rfir171 = true := by decide +kernel +theorem rfic172 : Row.check rfiW rfiR rfir172 = true := by decide +kernel +theorem rfic173 : Row.check rfiW rfiR rfir173 = true := by decide +kernel +theorem rfic174 : Row.check rfiW rfiR rfir174 = true := by decide +kernel +theorem rfic175 : Row.check rfiW rfiR rfir175 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP22.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP22.lean new file mode 100644 index 0000000000..433c9c6199 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP22.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic176 : Row.check rfiW rfiR rfir176 = true := by decide +kernel +theorem rfic177 : Row.check rfiW rfiR rfir177 = true := by decide +kernel +theorem rfic178 : Row.check rfiW rfiR rfir178 = true := by decide +kernel +theorem rfic179 : Row.check rfiW rfiR rfir179 = true := by decide +kernel +theorem rfic180 : Row.check rfiW rfiR rfir180 = true := by decide +kernel +theorem rfic181 : Row.check rfiW rfiR rfir181 = true := by decide +kernel +theorem rfic182 : Row.check rfiW rfiR rfir182 = true := by decide +kernel +theorem rfic183 : Row.check rfiW rfiR rfir183 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP23.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP23.lean new file mode 100644 index 0000000000..827d80cb68 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP23.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic184 : Row.check rfiW rfiR rfir184 = true := by decide +kernel +theorem rfic185 : Row.check rfiW rfiR rfir185 = true := by decide +kernel +theorem rfic186 : Row.check rfiW rfiR rfir186 = true := by decide +kernel +theorem rfic187 : Row.check rfiW rfiR rfir187 = true := by decide +kernel +theorem rfic188 : Row.check rfiW rfiR rfir188 = true := by decide +kernel +theorem rfic189 : Row.check rfiW rfiR rfir189 = true := by decide +kernel +theorem rfic190 : Row.check rfiW rfiR rfir190 = true := by decide +kernel +theorem rfic191 : Row.check rfiW rfiR rfir191 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP24.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP24.lean new file mode 100644 index 0000000000..3961ff64f4 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP24.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic192 : Row.check rfiW rfiR rfir192 = true := by decide +kernel +theorem rfic193 : Row.check rfiW rfiR rfir193 = true := by decide +kernel +theorem rfic194 : Row.check rfiW rfiR rfir194 = true := by decide +kernel +theorem rfic195 : Row.check rfiW rfiR rfir195 = true := by decide +kernel +theorem rfic196 : Row.check rfiW rfiR rfir196 = true := by decide +kernel +theorem rfic197 : Row.check rfiW rfiR rfir197 = true := by decide +kernel +theorem rfic198 : Row.check rfiW rfiR rfir198 = true := by decide +kernel +theorem rfic199 : Row.check rfiW rfiR rfir199 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP25.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP25.lean new file mode 100644 index 0000000000..ad7087925c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP25.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic200 : Row.check rfiW rfiR rfir200 = true := by decide +kernel +theorem rfic201 : Row.check rfiW rfiR rfir201 = true := by decide +kernel +theorem rfic202 : Row.check rfiW rfiR rfir202 = true := by decide +kernel +theorem rfic203 : Row.check rfiW rfiR rfir203 = true := by decide +kernel +theorem rfic204 : Row.check rfiW rfiR rfir204 = true := by decide +kernel +theorem rfic205 : Row.check rfiW rfiR rfir205 = true := by decide +kernel +theorem rfic206 : Row.check rfiW rfiR rfir206 = true := by decide +kernel +theorem rfic207 : Row.check rfiW rfiR rfir207 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP26.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP26.lean new file mode 100644 index 0000000000..f8565e1e0b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP26.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic208 : Row.check rfiW rfiR rfir208 = true := by decide +kernel +theorem rfic209 : Row.check rfiW rfiR rfir209 = true := by decide +kernel +theorem rfic210 : Row.check rfiW rfiR rfir210 = true := by decide +kernel +theorem rfic211 : Row.check rfiW rfiR rfir211 = true := by decide +kernel +theorem rfic212 : Row.check rfiW rfiR rfir212 = true := by decide +kernel +theorem rfic213 : Row.check rfiW rfiR rfir213 = true := by decide +kernel +theorem rfic214 : Row.check rfiW rfiR rfir214 = true := by decide +kernel +theorem rfic215 : Row.check rfiW rfiR rfir215 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP27.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP27.lean new file mode 100644 index 0000000000..0d4e27a89f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP27.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic216 : Row.check rfiW rfiR rfir216 = true := by decide +kernel +theorem rfic217 : Row.check rfiW rfiR rfir217 = true := by decide +kernel +theorem rfic218 : Row.check rfiW rfiR rfir218 = true := by decide +kernel +theorem rfic219 : Row.check rfiW rfiR rfir219 = true := by decide +kernel +theorem rfic220 : Row.check rfiW rfiR rfir220 = true := by decide +kernel +theorem rfic221 : Row.check rfiW rfiR rfir221 = true := by decide +kernel +theorem rfic222 : Row.check rfiW rfiR rfir222 = true := by decide +kernel +theorem rfic223 : Row.check rfiW rfiR rfir223 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP28.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP28.lean new file mode 100644 index 0000000000..99f51e89a5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP28.lean @@ -0,0 +1,9 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic224 : Row.check rfiW rfiR rfir224 = true := by decide +kernel +theorem rfic225 : Row.check rfiW rfiR rfir225 = true := by decide +kernel +theorem rfic226 : Row.check rfiW rfiR rfir226 = true := by decide +kernel +theorem rfic227 : Row.check rfiW rfiR rfir227 = true := by decide +kernel +theorem rfic228 : Row.check rfiW rfiR rfir228 = true := by decide +kernel +theorem rfic229 : Row.check rfiW rfiR rfir229 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP3.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP3.lean new file mode 100644 index 0000000000..ced8f70fd8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP3.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic24 : Row.check rfiW rfiR rfir24 = true := by decide +kernel +theorem rfic25 : Row.check rfiW rfiR rfir25 = true := by decide +kernel +theorem rfic26 : Row.check rfiW rfiR rfir26 = true := by decide +kernel +theorem rfic27 : Row.check rfiW rfiR rfir27 = true := by decide +kernel +theorem rfic28 : Row.check rfiW rfiR rfir28 = true := by decide +kernel +theorem rfic29 : Row.check rfiW rfiR rfir29 = true := by decide +kernel +theorem rfic30 : Row.check rfiW rfiR rfir30 = true := by decide +kernel +theorem rfic31 : Row.check rfiW rfiR rfir31 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP4.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP4.lean new file mode 100644 index 0000000000..c5ed0551a6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP4.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic32 : Row.check rfiW rfiR rfir32 = true := by decide +kernel +theorem rfic33 : Row.check rfiW rfiR rfir33 = true := by decide +kernel +theorem rfic34 : Row.check rfiW rfiR rfir34 = true := by decide +kernel +theorem rfic35 : Row.check rfiW rfiR rfir35 = true := by decide +kernel +theorem rfic36 : Row.check rfiW rfiR rfir36 = true := by decide +kernel +theorem rfic37 : Row.check rfiW rfiR rfir37 = true := by decide +kernel +theorem rfic38 : Row.check rfiW rfiR rfir38 = true := by decide +kernel +theorem rfic39 : Row.check rfiW rfiR rfir39 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP5.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP5.lean new file mode 100644 index 0000000000..adec714f43 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP5.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic40 : Row.check rfiW rfiR rfir40 = true := by decide +kernel +theorem rfic41 : Row.check rfiW rfiR rfir41 = true := by decide +kernel +theorem rfic42 : Row.check rfiW rfiR rfir42 = true := by decide +kernel +theorem rfic43 : Row.check rfiW rfiR rfir43 = true := by decide +kernel +theorem rfic44 : Row.check rfiW rfiR rfir44 = true := by decide +kernel +theorem rfic45 : Row.check rfiW rfiR rfir45 = true := by decide +kernel +theorem rfic46 : Row.check rfiW rfiR rfir46 = true := by decide +kernel +theorem rfic47 : Row.check rfiW rfiR rfir47 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP6.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP6.lean new file mode 100644 index 0000000000..7b5b331724 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP6.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic48 : Row.check rfiW rfiR rfir48 = true := by decide +kernel +theorem rfic49 : Row.check rfiW rfiR rfir49 = true := by decide +kernel +theorem rfic50 : Row.check rfiW rfiR rfir50 = true := by decide +kernel +theorem rfic51 : Row.check rfiW rfiR rfir51 = true := by decide +kernel +theorem rfic52 : Row.check rfiW rfiR rfir52 = true := by decide +kernel +theorem rfic53 : Row.check rfiW rfiR rfir53 = true := by decide +kernel +theorem rfic54 : Row.check rfiW rfiR rfir54 = true := by decide +kernel +theorem rfic55 : Row.check rfiW rfiR rfir55 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP7.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP7.lean new file mode 100644 index 0000000000..d571370a51 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP7.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic56 : Row.check rfiW rfiR rfir56 = true := by decide +kernel +theorem rfic57 : Row.check rfiW rfiR rfir57 = true := by decide +kernel +theorem rfic58 : Row.check rfiW rfiR rfir58 = true := by decide +kernel +theorem rfic59 : Row.check rfiW rfiR rfir59 = true := by decide +kernel +theorem rfic60 : Row.check rfiW rfiR rfir60 = true := by decide +kernel +theorem rfic61 : Row.check rfiW rfiR rfir61 = true := by decide +kernel +theorem rfic62 : Row.check rfiW rfiR rfir62 = true := by decide +kernel +theorem rfic63 : Row.check rfiW rfiR rfir63 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP8.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP8.lean new file mode 100644 index 0000000000..6a94211d61 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP8.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic64 : Row.check rfiW rfiR rfir64 = true := by decide +kernel +theorem rfic65 : Row.check rfiW rfiR rfir65 = true := by decide +kernel +theorem rfic66 : Row.check rfiW rfiR rfir66 = true := by decide +kernel +theorem rfic67 : Row.check rfiW rfiR rfir67 = true := by decide +kernel +theorem rfic68 : Row.check rfiW rfiR rfir68 = true := by decide +kernel +theorem rfic69 : Row.check rfiW rfiR rfir69 = true := by decide +kernel +theorem rfic70 : Row.check rfiW rfiR rfir70 = true := by decide +kernel +theorem rfic71 : Row.check rfiW rfiR rfir71 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CTreerfiP9.lean b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP9.lean new file mode 100644 index 0000000000..b063b88d16 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CTreerfiP9.lean @@ -0,0 +1,11 @@ +import Nov15.CTreerfiDefs +namespace CTree +theorem rfic72 : Row.check rfiW rfiR rfir72 = true := by decide +kernel +theorem rfic73 : Row.check rfiW rfiR rfir73 = true := by decide +kernel +theorem rfic74 : Row.check rfiW rfiR rfir74 = true := by decide +kernel +theorem rfic75 : Row.check rfiW rfiR rfir75 = true := by decide +kernel +theorem rfic76 : Row.check rfiW rfiR rfir76 = true := by decide +kernel +theorem rfic77 : Row.check rfiW rfiR rfir77 = true := by decide +kernel +theorem rfic78 : Row.check rfiW rfiR rfir78 = true := by decide +kernel +theorem rfic79 : Row.check rfiW rfiR rfir79 = true := by decide +kernel +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CallerCost.lean b/research/p104-reader-ceiling/lean/Nov15/CallerCost.lean new file mode 100644 index 0000000000..644e5b918d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CallerCost.lean @@ -0,0 +1,279 @@ +/- +CALLER-COST . Closed form of the CALLERCO caller invoice (internal notes `caller`, ck.py), +histograms as lists of (rank, count) terms, S = sum r*(T-P), D0 = sum (T-P)*f(r), f r = r ln r (FloorD0 convention), +invoice = caller + calls * native, reproduction of the #7113 caller at 8|9, S(k) = 3408 k - 208, single-crossing in the native +D0 per call, and the abstract composition lemma. Kernel only, no sorry / native_decide. +-/ +import Mathlib.Analysis.SpecialFunctions.Log.Basic +import Mathlib.Algebra.BigOperators.Group.Finset.Basic +import Mathlib.Algebra.Order.BigOperators.Group.Finset +import Mathlib.Tactic + +namespace CallerCost +open Real + +/-- a histogram: list of (rank, count) terms -/ +abbrev Hist := List (ℕ × ℕ) + +def cnt (l : Hist) (r : ℕ) : ℕ := (l.map fun p => if p.1 = r then p.2 else 0).sum +def Sh (l : Hist) : ℤ := (l.map fun p => (p.1 : ℤ) * p.2).sum +noncomputable def fL (r : ℕ) : ℝ := (r : ℝ) * Real.log r +noncomputable def Dh (l : Hist) : ℝ := (l.map fun p => (p.2 : ℝ) * fL p.1).sum +def scale (L : ℕ) (l : Hist) : Hist := l.map fun p => (p.1, L * p.2) + +structure Inv where + T : Hist + P : Hist + +def Sinv (i : Inv) : ℤ := Sh i.T - Sh i.P +noncomputable def Dinv (i : Inv) : ℝ := Dh i.T - Dh i.P +/-- invoice = caller + L * native (pricekit.invoice, counts scaled by L) -/ +def invoice (c n : Inv) (L : ℕ) : Inv := ⟨c.T ++ scale L n.T, c.P ++ scale L n.P⟩ + +theorem Sh_append (l m : Hist) : Sh (l ++ m) = Sh l + Sh m := by simp [Sh] +theorem Dh_append (l m : Hist) : Dh (l ++ m) = Dh l + Dh m := by simp [Dh] +theorem Sh_scale (L : ℕ) (l : Hist) : Sh (scale L l) = L * Sh l := by + induction l with + | nil => simp [Sh, scale] + | cons p l ih => + simp only [Sh, scale, List.map_cons, List.sum_cons] at ih ⊢ + rw [ih]; push_cast; ring +theorem Dh_scale (L : ℕ) (l : Hist) : Dh (scale L l) = L * Dh l := by + induction l with + | nil => simp [Dh, scale] + | cons p l ih => + simp only [Dh, scale, List.map_cons, List.sum_cons] at ih ⊢ + rw [ih]; push_cast; ring + +theorem invoice_S (c n : Inv) (L : ℕ) : Sinv (invoice c n L) = Sinv c + L * Sinv n := by + simp only [Sinv, invoice, Sh_append, Sh_scale]; ring +theorem invoice_D0 (c n : Inv) (L : ℕ) : Dinv (invoice c n L) = Dinv c + L * Dinv n := by + simp only [Dinv, invoice, Dh_append, Dh_scale]; ring + +/-! ### the caller family C(a|b): g = 8, 96 A ports x 4 thin queries, 8 B ports (s1.py) -/ +def armT (n c : ℕ) : Hist := (List.range n).map fun i => (8 * i + 9, c) +def armP (m c : ℕ) : Hist := (List.range m).map fun i => (8 * i + 16, c) +/-- C(a'+2 | b'+2); stage count k = a'+b'+4. 208 = 2 * 104 ports. -/ +def callerT (a b : ℕ) : Hist := armT (a + 2) 208 ++ armT (b + 2) 208 ++ [(8 * (a + b + 4) + 1, 208)] +def callerP (a b : ℕ) : Hist := + armP a 208 ++ armP b 208 ++ [(8, 384), (1, 384), (8, 16 * (a + b + 4)), (9, 32)] +def caller (a b : ℕ) : Inv := ⟨callerT a b, callerP a b⟩ + +/-- #7113 caller invoice (PRICEKIT caller_invoice of MONOCALLER/7113_CALLER.json), data; nJ = 17 -/ +def dataT : Hist := [(9,416),(17,416),(25,416),(33,416),(41,416),(49,416),(57,416),(65,416),(73,208),(137,208)] +def dataP : Hist := [(1,384),(8,656),(9,32),(16,416),(24,416),(32,416),(40,416),(48,416),(56,416),(64,208)] + +theorem cnt_zero {l : Hist} {r : ℕ} (h : ∀ p ∈ l, p.1 ≠ r) : cnt l r = 0 := by + unfold cnt + apply List.sum_eq_zero + intro x hx + obtain ⟨p, hp, rfl⟩ := List.mem_map.mp hx + simp [h p hp] + +theorem keys_T : ∀ p ∈ callerT 6 7, p.1 < 200 := by decide +theorem keys_P : ∀ p ∈ callerP 6 7, p.1 < 200 := by decide +theorem keys_dT : ∀ p ∈ dataT, p.1 < 200 := by decide +theorem keys_dP : ∀ p ∈ dataP, p.1 < 200 := by decide + +theorem cnt_big {l : Hist} (hl : ∀ p ∈ l, p.1 < 200) {r : ℕ} (hr : 200 ≤ r) : cnt l r = 0 := + cnt_zero fun p hp => by have := hl p hp; omega + +theorem repro_T : ∀ r, cnt (callerT 6 7) r = cnt dataT r := by + intro r + by_cases hr : r < 200 + · interval_cases r <;> decide + · rw [cnt_big keys_T (by omega), cnt_big keys_dT (by omega)] +theorem repro_P : ∀ r, cnt (callerP 6 7) r = cnt dataP r := by + intro r + by_cases hr : r < 200 + · interval_cases r <;> decide + · rw [cnt_big keys_P (by omega), cnt_big keys_dP (by omega)] + +/-- weighted sums depend only on the histogram (keys below N) -/ +theorem wsum_cnt (w : ℕ → ℝ) (N : ℕ) : ∀ l : Hist, (∀ p ∈ l, p.1 < N) → + (l.map fun p => (p.2 : ℝ) * w p.1).sum = ∑ r ∈ Finset.range N, (cnt l r : ℝ) * w r := by + intro l + induction l with + | nil => intro _; simp [cnt] + | cons p l ih => + intro h + have hp : p.1 < N := h p (by simp) + have ih' := ih (fun q hq => h q (by simp [hq])) + have hc : ∀ r, (cnt (p :: l) r : ℝ) = (if p.1 = r then (p.2 : ℝ) else 0) + cnt l r := by + intro r; simp only [cnt, List.map_cons, List.sum_cons]; split_ifs <;> simp + simp only [List.map_cons, List.sum_cons] + rw [ih'] + simp only [hc, add_mul, Finset.sum_add_distrib] + congr 1 + rw [Finset.sum_eq_single p.1] + · simp + · intro b _ hb; simp [Ne.symm hb] + · intro h'; exact absurd (Finset.mem_range.mpr hp) h' + +theorem Dh_congr (l m : Hist) (hl : ∀ p ∈ l, p.1 < 200) (hm : ∀ p ∈ m, p.1 < 200) + (h : ∀ r, cnt l r = cnt m r) : Dh l = Dh m := by + unfold Dh; rw [wsum_cnt fL 200 l hl, wsum_cnt fL 200 m hm] + exact Finset.sum_congr rfl fun r _ => by rw [h r] + +theorem caller89_D0 : + Dh (callerT 6 7) = Dh dataT ∧ Dh (callerP 6 7) = Dh dataP := + ⟨Dh_congr _ _ keys_T keys_dT repro_T, Dh_congr _ _ keys_P keys_dP repro_P⟩ + +theorem caller89_S : Sh (callerT 6 7) = Sh dataT ∧ Sh (callerP 6 7) = Sh dataP := by + constructor <;> decide + +/-- REPRODUCTION: C(8|9) equals the #7113 caller invoice (histograms term for term; hence S and D0). -/ +theorem reproduction : + (∀ r, cnt (caller 6 7).T r = cnt dataT r) ∧ (∀ r, cnt (caller 6 7).P r = cnt dataP r) ∧ + Sinv (caller 6 7) = Sh dataT - Sh dataP ∧ Dinv (caller 6 7) = Dh dataT - Dh dataP := by + refine ⟨repro_T, repro_P, ?_, ?_⟩ + · simp only [Sinv, caller, caller89_S.1, caller89_S.2] + · simp only [Dinv, caller, caller89_D0.1, caller89_D0.2] + +theorem S_data : Sh dataT - Sh dataP = 57728 := by decide + +/-! ### closed forms -/ +theorem Sh_armT (n c : ℕ) : Sh (armT n c) = c * (4 * n * n + 5 * n) := by + induction n with + | zero => simp [armT, Sh] + | succ n ih => + have : armT (n + 1) c = armT n c ++ [(8 * n + 9, c)] := by simp [armT, List.range_succ] + rw [this, Sh_append, ih]; simp [Sh]; push_cast; ring +theorem Sh_armP (m c : ℕ) : Sh (armP m c) = c * (4 * m * m + 12 * m) := by + induction m with + | zero => simp [armP, Sh] + | succ n ih => + have : armP (n + 1) c = armP n c ++ [(8 * n + 16, c)] := by simp [armP, List.range_succ] + rw [this, Sh_append, ih]; simp [Sh]; push_cast; ring + +/-- caller S is affine in the stage count k = a+b+4: S = 3408 k - 208 (96 A + 8 B ports; both arms >= 2) -/ +theorem S_caller (a b : ℕ) : Sinv (caller a b) = 3408 * ((a : ℤ) + b + 4) - 208 := by + simp only [Sinv, caller, callerT, callerP, Sh_append, Sh_armT, Sh_armP] + simp [Sh]; push_cast; ring + +/-- S of the whole invoice with calls = k: (3408 + Sn) k - 208 -/ +theorem S_invoice (a b : ℕ) (n : Inv) : + Sinv (invoice (caller a b) n (a + b + 4)) = (3408 + Sinv n) * ((a : ℤ) + b + 4) - 208 := by + rw [invoice_S, S_caller]; push_cast; ring + +/-- with the #7630 native (S per call = -3312, from S = 1424 at k = 17): S(k) = 96 k - 208 -/ +theorem S_7630 (a b : ℕ) (n : Inv) (hn : Sinv n = -3312) : + Sinv (invoice (caller a b) n (a + b + 4)) = 96 * ((a : ℤ) + b + 4) - 208 := by + rw [S_invoice, hn]; ring + +theorem S_7630_k17 (n : Inv) (hn : Sinv n = -3312) : + Sinv (invoice (caller 6 7) n 17) = 1424 := by + have := S_7630 6 7 n hn; simpa using this + +theorem Dh_armT (n c : ℕ) : Dh (armT n c) = c * ∑ i ∈ Finset.range n, fL (8 * i + 9) := by + induction n with + | zero => simp [armT, Dh] + | succ n ih => + have : armT (n + 1) c = armT n c ++ [(8 * n + 9, c)] := by simp [armT, List.range_succ] + rw [this, Dh_append, ih, Finset.sum_range_succ]; simp [Dh]; ring +theorem Dh_armP (n c : ℕ) : Dh (armP n c) = c * ∑ i ∈ Finset.range n, fL (8 * i + 16) := by + induction n with + | zero => simp [armP, Dh] + | succ n ih => + have : armP (n + 1) c = armP n c ++ [(8 * n + 16, c)] := by simp [armP, List.range_succ] + rw [this, Dh_append, ih, Finset.sum_range_succ]; simp [Dh]; ring + +theorem fL_one : fL 1 = 0 := by simp [fL] + +/-- caller D0 (the stage-count cost C(k), exact): the sums are over the ranks 8j+1 (T) and 8j (P) -/ +theorem D0_caller (a b : ℕ) : Dinv (caller a b) = + 208 * (∑ i ∈ Finset.range (a + 2), fL (8 * i + 9) + ∑ i ∈ Finset.range (b + 2), fL (8 * i + 9) + + fL (8 * (a + b + 4) + 1) + - ∑ i ∈ Finset.range a, fL (8 * i + 16) - ∑ i ∈ Finset.range b, fL (8 * i + 16)) + - (384 + 16 * ((a : ℝ) + b + 4)) * fL 8 - 32 * fL 9 := by + simp only [Dinv, caller, callerT, callerP, Dh_append, Dh_armT, Dh_armP] + simp [Dh, fL_one]; ring + +/-! ### single crossing: a cheaper native can only lower the best stage count (first-order proxy K = S/D0) -/ +section crossing +variable {s ρ Dc1 Dc2 k1 k2 d d' : ℝ} + +/-- proxy objective K_d(k) = S(k) / (Dc(k) + k d), S(k) = s k - ρ, d = native D0 per call, calls = k -/ +theorem single_crossing (hρ : 0 < ρ) (hk : k1 ≤ k2) (hd : d ≤ d') + (hD1 : 0 < Dc1 + k1 * d) (hD2 : 0 < Dc2 + k2 * d) + (hD1' : 0 < Dc1 + k1 * d') (hD2' : 0 < Dc2 + k2 * d') + (h : (s * k1 - ρ) / (Dc1 + k1 * d) ≤ (s * k2 - ρ) / (Dc2 + k2 * d)) : + (s * k1 - ρ) / (Dc1 + k1 * d') ≤ (s * k2 - ρ) / (Dc2 + k2 * d') := by + rw [div_le_div_iff₀ hD1 hD2] at h + rw [div_le_div_iff₀ hD1' hD2'] + have : 0 ≤ (d' - d) * (ρ * (k2 - k1)) := mul_nonneg (by linarith) (mul_nonneg hρ.le (by linarith)) + nlinarith + +/-- contrapositive form: if at the costlier native the smaller k is (weakly) preferred, it is at the cheaper native too; + equivalently the best k never goes up when D0 per call goes down -/ +theorem cheaper_native_lowers_k (hρ : 0 < ρ) (hk : k1 ≤ k2) (hd : d ≤ d') + (hD1 : 0 < Dc1 + k1 * d) (hD2 : 0 < Dc2 + k2 * d) + (hD1' : 0 < Dc1 + k1 * d') (hD2' : 0 < Dc2 + k2 * d') + (h : (s * k2 - ρ) / (Dc2 + k2 * d') < (s * k1 - ρ) / (Dc1 + k1 * d')) : + (s * k2 - ρ) / (Dc2 + k2 * d) < (s * k1 - ρ) / (Dc1 + k1 * d) := by + by_contra hn + exact absurd (single_crossing hρ hk hd hD1 hD2 hD1' hD2' (not_lt.mp hn)) (not_le.mpr h) + +/-- the crossing native D0 per call at which k1 and k2 tie (proxy): d* = (S1 Dc2 - S2 Dc1) / (ρ (k2 - k1)) -/ +theorem crossing_value (hρ : 0 < ρ) (hk : k1 < k2) : + (s * k1 - ρ) * (Dc2 + k2 * d) = (s * k2 - ρ) * (Dc1 + k1 * d) ↔ + d = ((s * k1 - ρ) * Dc2 - (s * k2 - ρ) * Dc1) / (ρ * (k2 - k1)) := by + have hne : ρ * (k2 - k1) ≠ 0 := (mul_pos hρ (by linarith)).ne' + rw [eq_div_iff hne] + constructor <;> intro h <;> nlinarith + +/-- sensitivity: d/dd of the stationarity numerator N = S'D - SD' (D = Dc + k d) is k S' - S = rho > 0. + (CALLERCO R1 sec 3 writes -(kS'-S); the sign convention there is reversed, the conclusion "cheaper native -> smaller k" is the same.) -/ +theorem stationarity_slope (s ρ Dc Dc' k d : ℝ) : + (s * (Dc + k * d) - (s * k - ρ) * (Dc' + d)) = (s * Dc - (s * k - ρ) * Dc') + ρ * d := by ring +end crossing + +/-! ### composition: invoice D0 >= caller floor + calls * native floor -/ +section composition +variable {Cl : Type} + +/-- Abstract composition. A caller class Cl with D0 cost Dc and call count `calls`; native per-call D0 Dn. + hc: caller floor as a function of the number of calls it makes; hn: a floor on the TOTAL native D0 per call. -/ +theorem composition (Dc : Cl → ℝ) (calls : Cl → ℕ) (Fc : ℕ → ℝ) (Dn Fn : ℝ) + (hc : ∀ c, Fc (calls c) ≤ Dc c) (hn : Fn ≤ Dn) (c : Cl) : + Fc (calls c) + calls c * Fn ≤ Dc c + calls c * Dn := by + have := hc c + have : (calls c : ℝ) * Fn ≤ calls c * Dn := mul_le_mul_of_nonneg_left hn (Nat.cast_nonneg _) + linarith + +/-- the native's D0 per call splits as helperD0 + rest (mains and owned MOVEs; these are CREDITS, rest <= 0 on #7630). + The helper-only floor therefore needs a cap R on the credits: rest >= -R. -/ +theorem composition_helper (Dc : Cl → ℝ) (calls : Cl → ℕ) (Fc : ℕ → ℝ) (H rest Hf R : ℝ) + (hc : ∀ c, Fc (calls c) ≤ Dc c) (hH : Hf ≤ H) (hR : -R ≤ rest) (c : Cl) : + Fc (calls c) + calls c * (Hf - R) ≤ Dc c + calls c * (H + rest) := + composition Dc calls Fc (H + rest) (Hf - R) hc (by linarith) c + +/-- the proxy kappa is bounded by S / (floor) when the floor is positive -/ +theorem kappa_proxy_le {S D F : ℝ} (hS : 0 ≤ S) (hF : 0 < F) (hFD : F ≤ D) : S / D ≤ S / F := + div_le_div_of_nonneg_left hS hF hFD + +/-- FALSE AS WRITTEN: "invoice D0 >= caller D0 + calls * helperD0-floor" (helper floor 9,928.76 per call on #7630, + caller D0 270,813, calls 17, invoice D0 391,295.63 (R1 sec 2; numbers are hypotheses/data)). The missing term is the + mains/owned MOVE credits (negative D0). Counterexample: -/ +theorem naive_composition_false : + ¬ ((270813 : ℝ) + 17 * 9928.76 ≤ 391295.63) := by norm_num + +/-- the credits implied by the data: rest per call = (391295.63 - 270813)/17 - 9928.76 < 0 -/ +theorem rest_negative : (391295.63 - 270813 : ℝ) / 17 - 9928.76 < 0 := by norm_num + +end composition + +#print axioms reproduction +#print axioms S_caller +#print axioms S_7630_k17 +#print axioms D0_caller +#print axioms invoice_S +#print axioms invoice_D0 +#print axioms single_crossing +#print axioms cheaper_native_lowers_k +#print axioms crossing_value +#print axioms composition +#print axioms composition_helper +#print axioms naive_composition_false + +end CallerCost diff --git a/research/p104-reader-ceiling/lean/Nov15/CallerCost.md b/research/p104-reader-ceiling/lean/Nov15/CallerCost.md new file mode 100644 index 0000000000..da373369e1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CallerCost.md @@ -0,0 +1,18 @@ +# CallerCost.lean: caller cost closed form, reproduction, single crossing, composition +Imports Mathlib only (no Nov15 deps).9 GB. 12 `#print axioms` within [propext, Classical.choice, Quot.sound]; no sorry, no native_decide. + +## Model +- Histograms = lists of (rank,count). S = sum r*(T-P) (Sinv), D0 = sum (T-P) f(r), f r = r ln r (fL, FloorD0 convention). invoice c n L = caller + L*native (counts scaled), `invoice_S`, `invoice_D0` exact. In the pricer the number of calls L = nJ = k = a+b (stage count). +- Caller family C(a|b), g=8, 96 A ports x 4 thin queries, 8 B ports (a,b >= 2; Lean params a'=a-2, b'=b-2, k = a'+b'+4). T: ranks 8j+1, j<=arm (and 8k+1), 208 = 2*104 each; P: ranks 8j, 2<=j<=arm-1, plus (8: 384+16k, 1: 384, 9: 32). +- The code does NOT use a Z^4 over ln 2/3/5/7 form (it works in Decimal over all ranks up to 137, which involve many primes). Exact form in Lean: `D0_caller`, a finite sum of f over the ranks 8j+1 and 8j, minus (384+16k) f(8) + 32 f(9) (f(1)=0). + +## Proved +- `reproduction`: C(8|9) = caller 6 7 equals the #7113 caller invoice (data lists dataT/dataP, transcribed from the pricer's invoice of the #7113 caller file) term for term as histograms (cnt equal at every rank), hence S and D0 equal (`caller89_S`, `caller89_D0`). S = 57728 (`S_data`). Data are transcribed; the Lean statement is about those lists. +- `S_caller`: S(caller) = 3408 k - 208. `S_invoice`: with calls = k, S = (3408 + S_n) k - 208. `S_7630`: S_n = -3312 gives 96 k - 208, and `S_7630_k17` gives 1424 (S' = 96, rho = 208 as in R1 sec 3). +- Single crossing (first-order proxy K = S/D0, S = sk - rho, D = Dc(k) + k d): `single_crossing`: for k1 <= k2, d <= d', K_d(k1) <= K_d(k2) implies K_d'(k1) <= K_d'(k2). `cheaper_native_lowers_k`: strict contrapositive, a cheaper native (d down) never favours a larger k. `crossing_value`: tie at d* = (S1 Dc2 - S2 Dc1)/(rho (k2-k1)). Convexity of C(k) not attempted (not clean: arm terms are sums of r ln r over unequal strides). +- `composition`: abstract caller class, caller floor Fc(calls) <= Dc, total native floor Fn <= Dn gives Fc(k) + k Fn <= invoice D0. `composition_helper`: with native D0 = helperD0 + rest, needs a cap rest >= -R on the mains/owned credits. `kappa_proxy_le`: S/D <= S/F. + +## Statements false / imprecise +1. FALSE as written: "invoice D0 >= caller floor + calls * (helperD0 floor)". With the numbers of the caller-floor note (helper floor 9,928.76 per call as helper D0 on #7630, caller D0 270,813 = 666,499 - 395,686, 17 calls, invoice D0 391,295.63): 270,813 + 17*9,928.76 = 439,602 > 391,296 (`naive_composition_false`). Reason: the native's main/owned MOVEs are credits (negative D0, `rest_negative`: about -2,842 per call). FloorD0's floor is on helperD0 only. Corrected: `composition` with a floor on TOTAL native D0 per call, or `composition_helper` with an explicit credit cap R. A caller-floor statement needs one of these. +2. Sign slip in the caller-ceiling note, section 3: d/dd of the numerator S'D - SD' is +(kS' - S) = +rho (`stationarity_slope`), not -rho. The conclusion (cheaper native lowers k*) is unchanged. +3. Scope: monotonicity is for the proxy S/D0 (kappa ~ S/D), not the exact root kappa of F(t) = 0; the exact-kappa version is not proved here. diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3.lean new file mode 100644 index 0000000000..3088163ca8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3.lean @@ -0,0 +1,377 @@ +import Nov15.CongestionI3Cfg +import Nov15.CongestionI3Mu +import Nov15.CongestionI3NumA +import Nov15.CongestionI3NumC4 +import Nov15.WholeFloorCover +import Mathlib.Analysis.Convex.SpecificFunctions.Pow +import Mathlib.Analysis.Convex.SpecificFunctions.Basic +import Mathlib.Analysis.SpecialFunctions.Log.Base + +/-! +CONGESTION-I3 : the I3 congestion bound and F1's restricted-class ceilings (internal notes: F1.md, +AUDIT.md, LIFT1.md, AUDIT-LIFT.md, LIFT2.md; JUNKINT I3). See CongestionI3.md for the scope list. Kernel only: no sorry, no native_decide. + +Sections: 1 per-pair bound (I3 is a HYPOTHESIS `I3Path`, in model M_V; the shape-DAG minimum is a data hypothesis), 2 forced junk >= 1936 +(kernel-checked configurations + census; per-chain flag-DP minima are a data hypothesis), 3 combination with R3 by MAX, 4 the ceilings. +-/ +namespace CongestionI3 +open NumCertK JointCeiling CallerCost + +/-! ### 1. I3: public excess >= per-pair distance, summed over supp J -/ + +/-- JUNKINT I3 (F1.md sec. 1): in model M_V (every public register except the Y mains ends at V; owned code fixed; X_q born at A_q) the public +excess `E` over R3's per-register floors is at least the sum over the junk pairs of the shortest-path distance. NOT derived here (the +telescoping I1/I2 and the path bound are not formalised): it is the hypothesis `I3Path`, always taken together with its scope. -/ +def I3Path (J : Finset (ℕ × ℕ)) (dist : ℕ × ℕ → ℝ) (E : ℝ) : Prop := ∑ p ∈ J, dist p ≤ E + +/-- per-pair minimum => E >= delta * |J| -/ +theorem pair_bound {J : Finset (ℕ × ℕ)} {dist : ℕ × ℕ → ℝ} {E δ : ℝ} (hd : ∀ p ∈ J, δ ≤ dist p) (h : I3Path J dist E) : + δ * J.card ≤ E := by + have := Finset.card_nsmul_le_sum J dist δ hd + rw [nsmul_eq_mul] at this + unfold I3Path at h + linarith + +/-- D0 currency: shape-DAG minimum 0.541495 per even pair (F1 sec. 1, reproduced by the auditor); 1936 pairs give >= 1048.33 D0 per call. -/ +theorem i3_D0_per_call {J : Finset (ℕ × ℕ)} {dist : ℕ × ℕ → ℝ} {E : ℝ} (hd : ∀ p ∈ J, (0.541495 : ℝ) ≤ dist p) + (h : I3Path J dist E) (hJ : 1936 ≤ J.card) : (1048.33 : ℝ) ≤ E := by + have h1 := pair_bound hd h + have h2 : (1936 : ℝ) ≤ J.card := by exact_mod_cast hJ + nlinarith + +/-! ### 2. forced junk >= 1936 pairs per call for rank-8 C = 56 decoders -/ + +def mu (i k : ℕ) : ℕ := (muTab.getD i []).getD k 0 +/-- every configuration's per-chain minima sum to >= 1936 (kernel) -/ +theorem mu_sum : ∀ i < 8, 1936 ≤ ∑ k ∈ Finset.range 8, mu i k := by decide +kernel + +/-- **forced junk >= 1936 pairs** for a rank-8, C = 56 decoder (one of the 8 configurations `i` of `cfgs`). Scope/hypotheses, all explicit: +* `hsub`: the chain-k forced cells `F k` are unique cells of chain k (exactly one chain can touch them; kernel-defined `uniqCells`); +* `hJ`: forced cells lie in supp J (a product forced non-zero on a cell no other chain touches cannot be cancelled); +* `hDP`: the per-chain flag-DP minimum (data, internal notes, python exact DP over the subspace lattice, NOT kernel-checked). +The decoder class itself (rank-8 on P104 labels, C = 56, rigidity M^ = D1 G D2 quoted numerically, enumeration exhaustive = 12,870 subsets) is the +hypothesis `i < 8`. -/ +theorem forced_junk_ge (i : ℕ) (hi : i < 8) (J : Finset (ℕ × ℕ)) (F : ℕ → Finset (ℕ × ℕ)) + (hsub : ∀ k < 8, F k ⊆ uniqCells (cfgs.getD i []) k) (hJ : ∀ k < 8, F k ⊆ J) + (hDP : ∀ k < 8, mu i k ≤ (F k).card) : 1936 ≤ J.card := by + have hdisj : ∀ k ∈ Finset.range 8, ∀ k' ∈ Finset.range 8, k ≠ k' → Disjoint (F k) (F k') := by + intro k hk k' hk' hne + exact (uniqCells_disjoint (cfgs.getD i []) hne).mono (hsub k (Finset.mem_range.mp hk)) (hsub k' (Finset.mem_range.mp hk')) + have h1 : (Finset.range 8).biUnion F ⊆ J := by + intro p hp + obtain ⟨k, hk, hp⟩ := Finset.mem_biUnion.mp hp + exact hJ k (Finset.mem_range.mp hk) hp + have h2 : ((Finset.range 8).biUnion F).card = ∑ k ∈ Finset.range 8, (F k).card := + Finset.card_biUnion (fun k hk k' hk' hne => hdisj k hk k' hk' hne) + have h3 : ∑ k ∈ Finset.range 8, mu i k ≤ ∑ k ∈ Finset.range 8, (F k).card := + Finset.sum_le_sum fun k hk => hDP k (Finset.mem_range.mp hk) + have h4 := mu_sum i hi + calc 1936 ≤ ∑ k ∈ Finset.range 8, (F k).card := le_trans h4 h3 + _ = ((Finset.range 8).biUnion F).card := h2.symm + _ ≤ J.card := Finset.card_le_card h1 + +/-! ### 3. combination with R3: by MAX, not sum -/ + +/-- **F1 floor in F currency (max rule).** The word's public overpay `E` (F currency) is priced by BOTH R3's forced stops (E >= (2 - 2^s) st, +st + mp >= 104 with lat = 0, nested words) and by I3 (E >= I). Both bound the SAME quantity, so the floor is R1/R2's owned 16 plus +`max (88 (2 - 2^s)) I`. I = 0 recovers R3's `-Nfl`. -/ +theorem f1_floor (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (mp st : ℕ) (Fn E I : ℝ) + (hF : Fn ≤ -400 * (8 : ℝ) ^ s - mp - E) (hmp : 16 ≤ mp) (hY : 104 ≤ st + mp) + (hst : (2 - (2 : ℝ) ^ s) * st ≤ E) (hI : I ≤ E) : + Fn ≤ -400 * (8 : ℝ) ^ s - 16 - max (88 * (2 - (2 : ℝ) ^ s)) I := by + have hu1 : (1 : ℝ) ≤ (2 : ℝ) ^ s := Real.one_le_rpow (by norm_num) hs0 + have hu2 : (2 : ℝ) ^ s ≤ 2 := by + have := Real.rpow_le_rpow_of_exponent_le (show (1 : ℝ) ≤ 2 by norm_num) hs1 + simpa using this + set c : ℝ := 2 - (2 : ℝ) ^ s with hc + have hc0 : 0 ≤ c := by linarith + have hc1 : c ≤ 1 := by linarith + have hm : (16 : ℝ) ≤ mp := by exact_mod_cast hmp + have hY' : (104 : ℝ) ≤ st + mp := by exact_mod_cast hY + have hst0 : (0 : ℝ) ≤ st := Nat.cast_nonneg _ + have hE0 : 0 ≤ E := le_trans (mul_nonneg hc0 hst0) hst + suffices h : (16 : ℝ) + max (88 * c) I ≤ mp + E by linarith + rcases le_total (88 * c) I with h | h + · rw [max_eq_right h]; linarith + · rw [max_eq_left h] + rcases le_or_gt (mp : ℝ) 104 with h2 | h2 + · have h3 : c * (104 - mp) ≤ c * st := mul_le_mul_of_nonneg_left (by linarith) hc0 + nlinarith + · nlinarith + +/-- the max rule is not a sum rule: both hypotheses hold with E = max and fail for the sum (so `max` is all the two bounds give). -/ +theorem sum_not_implied : ∃ E I R : ℝ, I ≤ E ∧ R ≤ E ∧ ¬ (I + R ≤ E) := ⟨1, 1, 1, le_refl _, le_refl _, by norm_num⟩ + +/-! ### 4. the ceiling kappa <= .0183952347 (8|9) -/ + +/-- the native of F1's relaxation: owned floor `400 * 8^s + 16`, no stops -/ +def natBase : Inv := ⟨[], [(8, 400), (1, 16)]⟩ +theorem natBase_F (s : ℝ) : Finv s natBase = -(400 * (8 : ℝ) ^ s + 16) := by + simp [Finv, natBase, Fh] + +theorem base_eq (s : ℝ) : Finv s (invoice (caller 6 7) natBase 17) = Fc cfB s := by + simp only [Finv, Fh, invoice, caller, callerT, callerP, armT, armP, natBase, scale, Fc, cfB, + List.range_succ, List.range_zero] + norm_num + ring + +/-- tbar = .0183952347 -/ +def tbarA : ℚ := 183952347 / 10 ^ 10 +theorem sA_eq : sA = 1 - tbarA := by unfold sA tbarA; norm_num + +/-- **F1 ceiling, 8|9 (kappa <= .0183952347)** for words in the restricted class, with every hypothesis explicit: +* scope (propositions the caller must supply): `MV` (model M_V), `Rank8C56` (rank-8 decoder, C = 56 on P104 labels, one of the 8 configurations `i`), + `PlaneSep` (no second-plane carrier of plane-1 content) -- under `PlaneSep` fails the junk bound collapses to 0 (F1 f1k2); LIFT1 replaces it by + the public-provenance direction law (see `ceiling_A_noSep`). `nested`: lat = 0 (verifier rule, WholeFloorNest). +* `hI3`: I3 in F currency, `E s >= sum of per-pair F-distances` (hypothesis `I3Path`, valid under the scope); +* `hdist`: per-pair shape-DAG minimum `sigma0 <= sp_F(t)` for t in [tbar, .1] (DATA: f1ceil.spF at tbar; monotone in t numerically, AUDIT: the + convex/superadditive proof of monotonicity was not re-derived); +* `hforced`/`hDP`: section 2 (|J| >= 1936). +Conclusion: F < 0 on the 17-call invoice of the #7113 caller for every t in [tbar, 1] -- the ceiling convention of JointCeiling/WholeFloorCover. -/ +theorem ceiling_A (MV Rank8C56 PlaneSep : Prop) (hMV : MV) (hR : Rank8C56) (hP : PlaneSep) + (n : Inv) (mp st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - mp - E s) + (hmp : 16 ≤ mp) (hY : 104 ≤ st + mp) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hI3 : MV → Rank8C56 → PlaneSep → ∀ s, 0 ≤ s → s ≤ 1 → I3Path J (distF s) (E s)) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ ((sA : ℚ) : ℝ) → ∀ p ∈ J, ((sigma0 : ℚ) : ℝ) ≤ distF s p) + (hJ : 1936 ≤ J.card) : + ∀ t : ℝ, ((tbarA : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + intro t ht ht1 + have hsA : ((sA : ℚ) : ℝ) = 1 - ((tbarA : ℚ) : ℝ) := by rw [sA_eq]; push_cast; ring + have htb0 : (0 : ℝ) ≤ ((tbarA : ℚ) : ℝ) := by unfold tbarA; norm_num + have hs0 : (0 : ℝ) ≤ 1 - t := by linarith + have htb1 : ((tbarA : ℚ) : ℝ) ≤ 1 / 10 := by unfold tbarA; norm_num + have hs1 : 1 - t ≤ 1 := by linarith + have hu1 : (1 : ℝ) ≤ (2 : ℝ) ^ (1 - t) := Real.one_le_rpow (by norm_num) hs0 + have hu2 : (2 : ℝ) ^ (1 - t) ≤ 2 := by + have := Real.rpow_le_rpow_of_exponent_le (show (1 : ℝ) ≤ 2 by norm_num) hs1; simpa using this + have hE0 : 0 ≤ E (1 - t) := + le_trans (mul_nonneg (by linarith) (Nat.cast_nonneg st)) (hst _ hs0 hs1) + rcases le_or_gt (1 / 10 : ℝ) t with h10 | h10 + · -- t >= .1: R3 (I = 0), then the WholeFloorCover cover + have h1 := f1_floor (1 - t) hs0 hs1 mp st (Finv (1 - t) n) (E (1 - t)) 0 (hF _ hs0 hs1) hmp hY (hst _ hs0 hs1) hE0 + have hc0 : (0 : ℝ) ≤ 88 * (2 - (2 : ℝ) ^ (1 - t)) := by linarith + rw [max_eq_left hc0] at h1 + have h2 := invoice_F (1 - t) (caller 6 7) n 17 + have h3 := invoice_F (1 - t) (caller 6 7) natFloor 17 + have h4 := natFloor_F (1 - t) + have h5 := WholeFloorCover.cover t (by linarith) ht1 + have h6 : Nfl (1 - t) = 400 * (8 : ℝ) ^ (1 - t) + 16 + 88 * (2 - (2 : ℝ) ^ (1 - t)) := rfl + push_cast at h2 h3 + nlinarith + · -- t in [tbar, .1): I3 lift + have hsl : (9 / 10 : ℝ) ≤ 1 - t := by linarith + have hsr : 1 - t ≤ ((sA : ℚ) : ℝ) := by rw [hsA]; linarith + have hsum := pair_bound (hdist _ hsl hsr) (hI3 hMV hR hP _ hs0 hs1) + have hE : (1936 : ℝ) * ((sigma0 : ℚ) : ℝ) ≤ E (1 - t) := by + have : (1936 : ℝ) ≤ J.card := by exact_mod_cast hJ + have h0 : (0 : ℝ) ≤ ((sigma0 : ℚ) : ℝ) := by unfold sigma0; norm_num + nlinarith + have h1 := f1_floor (1 - t) hs0 hs1 mp st (Finv (1 - t) n) (E (1 - t)) (1936 * ((sigma0 : ℚ) : ℝ)) (hF _ hs0 hs1) hmp hY + (hst _ hs0 hs1) hE + have h1' : Finv (1 - t) n ≤ -400 * (8 : ℝ) ^ (1 - t) - 16 - 1936 * ((sigma0 : ℚ) : ℝ) := by + have := le_max_right (88 * (2 - (2 : ℝ) ^ (1 - t))) (1936 * ((sigma0 : ℚ) : ℝ)) + linarith + have h2 := invoice_F (1 - t) (caller 6 7) n 17 + have h3 := invoice_F (1 - t) (caller 6 7) natBase 17 + have h4 := natBase_F (1 - t) + have h5 := cfB_neg (1 - t) hsl hsr + have h6 := base_eq (1 - t) + have h7 : ((liftA : ℚ) : ℝ) = 17 * 1936 * ((sigma0 : ℚ) : ℝ) := by unfold liftA; push_cast; ring + push_cast at h2 h3 + nlinarith + + +/-! ### 5. descent-mass >= 56 charge and the own56 ceiling (kappa <= .0134769139) -/ + +/-- F price of a descent list (owned MOVEs of ranks `k`): sum of k^s -/ +noncomputable def dprice (ks : List ℕ) (s : ℝ) : ℝ := (ks.map fun k : ℕ => ((k : ℕ) : ℝ) ^ s).sum + +/-- concavity chord on [1, 9] -/ +theorem chord_k (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (k : ℝ) (hk1 : 1 ≤ k) (hk9 : k ≤ 9) : + 1 + ((9 : ℝ) ^ s - 1) / 8 * (k - 1) ≤ k ^ s := by + have hc := (Real.concaveOn_rpow hs0 hs1).2 (show (1 : ℝ) ∈ Set.Ici 0 by simp) (show (9 : ℝ) ∈ Set.Ici 0 by simp) + (show 0 ≤ (9 - k) / 8 by linarith) (show 0 ≤ (k - 1) / 8 by linarith) (show (9 - k) / 8 + (k - 1) / 8 = 1 by ring) + simp only [smul_eq_mul, Real.one_rpow] at hc + have e : (9 - k) / 8 * 1 + (k - 1) / 8 * 9 = k := by ring + rw [e] at hc + nlinarith + +theorem dprice_ge (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (ks : List ℕ) (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) : + ks.length + ((9 : ℝ) ^ s - 1) / 8 * ((ks.sum : ℕ) - ks.length) ≤ dprice ks s := by + induction ks with + | nil => simp [dprice] + | cons a l ih => + have ha := hk a (by simp) + have hl : ∀ k ∈ l, 1 ≤ k ∧ k ≤ 9 := fun k hk' => hk k (by simp [hk']) + have ih := ih hl + have h1 := chord_k s hs0 hs1 (a : ℝ) (by exact_mod_cast ha.1) (by exact_mod_cast ha.2) + simp only [dprice, List.map_cons, List.sum_cons, List.length_cons] at ih ⊢ + simp only [Nat.cast_add, Nat.cast_one] + nlinarith + +/-- 9^s <= 8 * 2^s - 7 on [0,1] (convexity of u -> u^p, p = log_2 9, on [1,2]; equality at s = 0, 1). It gives +`(9 - 9^s)/8 >= 2 - 2^s`: an extra descent move is never cheaper than a forced stop it replaces. -/ +theorem nine_chord (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) : (9 : ℝ) ^ s ≤ 8 * (2 : ℝ) ^ s - 7 := by + set p : ℝ := Real.logb 2 9 with hp + have h2p : (2 : ℝ) ^ p = 9 := Real.rpow_logb (by norm_num) (by norm_num) (by norm_num) + have hp1 : 1 ≤ p := by + have : (2 : ℝ) ^ (1 : ℝ) ≤ (2 : ℝ) ^ p := by rw [Real.rpow_one, h2p]; norm_num + exact (Real.rpow_le_rpow_left_iff (by norm_num : (1 : ℝ) < 2)).mp this + have hu1 : (1 : ℝ) ≤ (2 : ℝ) ^ s := Real.one_le_rpow (by norm_num) hs0 + have hu2 : (2 : ℝ) ^ s ≤ 2 := by + have := Real.rpow_le_rpow_of_exponent_le (show (1 : ℝ) ≤ 2 by norm_num) hs1; simpa using this + have hc := (convexOn_rpow hp1).2 (show (1 : ℝ) ∈ Set.Ici 0 by simp) (show (2 : ℝ) ∈ Set.Ici 0 by simp) + (show 0 ≤ 2 - (2 : ℝ) ^ s by linarith) (show 0 ≤ (2 : ℝ) ^ s - 1 by linarith) + (show (2 - (2 : ℝ) ^ s) + ((2 : ℝ) ^ s - 1) = 1 by ring) + simp only [smul_eq_mul, Real.one_rpow] at hc + have e : (2 - (2 : ℝ) ^ s) * 1 + ((2 : ℝ) ^ s - 1) * 2 = (2 : ℝ) ^ s := by ring + rw [e, h2p] at hc + have e2 : ((2 : ℝ) ^ s) ^ p = (9 : ℝ) ^ s := by + rw [← Real.rpow_mul (by norm_num), mul_comm, Real.rpow_mul (by norm_num), h2p] + rw [e2] at hc + nlinarith + +/-- **own56 floor (F currency, max rule)**: a rank-8 C = 56 decoder has descent mass >= 56 (hypothesis `hmass`, the F1 premise; descents are owned +MOVEs of rank k in 1..9), at least 8 descents and 8 rises (R1/R2). Charging the descents at their true F price `sum k^s` (>= 6 * 9^s + 2) and the 8 +rises at 1 each gives the floor `-400 8^s - (6 9^s + 10) - max (88 (2 - 2^s)) I`; extra moves beyond 8 + 8 cost at least what the stops they remove +save (`nine_chord`). -/ +theorem own56_floor (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (ks : List ℕ) (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) + (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (mr st : ℕ) (hmr : 8 ≤ mr) (Fn E I : ℝ) + (hF : Fn ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E) (hY : 104 ≤ st + (ks.length + mr)) + (hst : (2 - (2 : ℝ) ^ s) * st ≤ E) (hI : I ≤ E) : + Fn ≤ -400 * (8 : ℝ) ^ s - (6 * (9 : ℝ) ^ s + 10) - max (88 * (2 - (2 : ℝ) ^ s)) I := by + have hu1 : (1 : ℝ) ≤ (2 : ℝ) ^ s := Real.one_le_rpow (by norm_num) hs0 + have hu2 : (2 : ℝ) ^ s ≤ 2 := by + have := Real.rpow_le_rpow_of_exponent_le (show (1 : ℝ) ≤ 2 by norm_num) hs1; simpa using this + have h9a : (1 : ℝ) ≤ (9 : ℝ) ^ s := Real.one_le_rpow (by norm_num) hs0 + have h9b : (9 : ℝ) ^ s ≤ 9 := by + have := Real.rpow_le_rpow_of_exponent_le (show (1 : ℝ) ≤ 9 by norm_num) hs1; simpa using this + have hch := nine_chord s hs0 hs1 + have hdp := dprice_ge s hs0 hs1 ks hk + set c : ℝ := 2 - (2 : ℝ) ^ s with hc + have hc0 : 0 ≤ c := by linarith + have hc1 : c ≤ 1 := by linarith + set b : ℝ := ((9 : ℝ) ^ s - 1) / 8 with hb + have hb0 : 0 ≤ b := by rw [hb]; linarith + have hcb : c ≤ 1 - b := by rw [hb, hc]; linarith + have hm : (8 : ℝ) ≤ ks.length := by exact_mod_cast hmd + have hmr' : (8 : ℝ) ≤ mr := by exact_mod_cast hmr + have hmass' : (56 : ℝ) ≤ ((ks.sum : ℕ) : ℝ) := by exact_mod_cast hmass + have hY' : (104 : ℝ) ≤ st + (ks.length + mr) := by exact_mod_cast hY + have hst0 : (0 : ℝ) ≤ st := Nat.cast_nonneg _ + have hE0 : 0 ≤ E := le_trans (mul_nonneg hc0 hst0) hst + have hA : (ks.length : ℝ) + b * (56 - ks.length) ≤ dprice ks s := by + have : b * (56 - ks.length) ≤ b * (((ks.sum : ℕ) : ℝ) - ks.length) := mul_le_mul_of_nonneg_left (by linarith) hb0 + linarith + have e9 : (9 : ℝ) ^ s = 8 * b + 1 := by rw [hb]; ring + rw [e9] + suffices h : (6 * (8 * b + 1) + 10) + max (88 * c) I ≤ dprice ks s + mr + E by linarith + have hx : 0 ≤ ((ks.length : ℝ) - 8) * (1 - b - c) := mul_nonneg (by linarith) (by linarith) + have hy : 0 ≤ ((mr : ℝ) - 8) * (1 - c) := mul_nonneg (by linarith) (by linarith) + have hxb : 0 ≤ ((ks.length : ℝ) - 8) * b := mul_nonneg (by linarith) hb0 + rcases le_total (88 * c) I with h | h + · rw [max_eq_right h] + have hx2 : 0 ≤ ((ks.length : ℝ) - 8) * (1 - b) := mul_nonneg (by linarith) (by linarith) + nlinarith + · rw [max_eq_left h] + have h3 : c * (104 - ks.length - mr) ≤ c * st := mul_le_mul_of_nonneg_left (by linarith) hc0 + nlinarith + +/-- the cap/correction form of I3 without plane separation (LIFT1 sec. 1; HYPOTHESIS, valid under the public-provenance direction law only): +transport by owned rank caps each pair's contribution at `cap` and the 8 relaxation rises save at most `corr`. -/ +def I3Cap (J : Finset (ℕ × ℕ)) (dist : ℕ × ℕ → ℝ) (cap corr E : ℝ) : Prop := ∑ p ∈ J, min (dist p) cap - corr ≤ E + +def tbarC : ℚ := 134769139 / 10 ^ 10 +theorem sC_eq : sC = 1 - tbarC := by unfold sC tbarC; norm_num + +def natBaseC : Inv := ⟨[], [(8, 400), (9, 6), (1, 10)]⟩ +theorem natBaseC_F (s : ℝ) : Finv s natBaseC = -(400 * (8 : ℝ) ^ s + (6 * (9 : ℝ) ^ s + 10)) := by + simp [Finv, natBaseC, Fh] +theorem baseC_eq (s : ℝ) : Finv s (invoice (caller 6 7) natBaseC 17) = Fc cfC s := by + simp only [Finv, Fh, invoice, caller, callerT, callerP, armT, armP, natBaseC, scale, Fc, cfC, + List.range_succ, List.range_zero] + norm_num + ring +theorem base88_eq (s : ℝ) : + Finv s (invoice (caller 6 7) natBaseC 17) - 17 * (88 * (2 - (2 : ℝ) ^ s)) = Fc cfC88 s := by + rw [baseC_eq] + simp only [Fc, cfC, cfC88, List.map_cons, List.sum_cons, List.map_nil, List.sum_nil] + push_cast + simp only [Real.one_rpow] + ring + +/-- **own56 ceiling, 8|9 (kappa <= .0134769139)**: as `ceiling_A` but (i) the descent mass >= 56 of the rank-8 C = 56 decoder is charged +(`own56_floor`), and (ii) plane separation is NOT assumed: the junk lift is the capped, corrected one (`I3Cap`, LIFT1), valid under the +public-provenance direction law `Prov` (LIFT1 (i) junk reflux, (ii) non-monotone owned lifetimes, (iii) >= 9-row/network decoders are OPEN and are +exactly what `Prov`/`Rank8C56` stand for here; rank-8 decoders with C = 57 do not exist and C >= 58 is not covered by the junk bound 1936). +Data hypotheses: `hdist` (per-pair `ell s <= min dist cap`, from sp_F and unit/48), `hLc` (1936 * ell - corr >= 13.64105 on [tbarC, .1], python, +monotone numerically). -/ +theorem ceiling_C (MV Rank8C56 Prov : Prop) (hMV : MV) (hR : Rank8C56) (hP : Prov) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E cap corr ell : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) (hcorr0 : ∀ s, 0 ≤ corr s) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hI3 : MV → Rank8C56 → Prov → ∀ s, 0 ≤ s → s ≤ 1 → I3Cap J (distF s) (cap s) (corr s) (E s)) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ ((sC : ℚ) : ℝ) → ∀ p ∈ J, ell s ≤ min (distF s p) (cap s)) + (hLc : ∀ s, 9 / 10 ≤ s → s ≤ ((sC : ℚ) : ℝ) → ((LcC : ℚ) : ℝ) ≤ 1936 * ell s - corr s) + (hJ : 1936 ≤ J.card) : + ∀ t : ℝ, ((tbarC : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + intro t ht ht1 + have hsC : ((sC : ℚ) : ℝ) = 1 - ((tbarC : ℚ) : ℝ) := by rw [sC_eq]; push_cast; ring + have htb0 : (0 : ℝ) ≤ ((tbarC : ℚ) : ℝ) := by unfold tbarC; norm_num + have htb1 : ((tbarC : ℚ) : ℝ) ≤ 1 / 10 := by unfold tbarC; norm_num + have hs0 : (0 : ℝ) ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + have hu1 : (1 : ℝ) ≤ (2 : ℝ) ^ (1 - t) := Real.one_le_rpow (by norm_num) hs0 + have hu2 : (2 : ℝ) ^ (1 - t) ≤ 2 := by + have := Real.rpow_le_rpow_of_exponent_le (show (1 : ℝ) ≤ 2 by norm_num) hs1; simpa using this + have hE0 : 0 ≤ E (1 - t) := + le_trans (mul_nonneg (by linarith) (Nat.cast_nonneg st)) (hst _ hs0 hs1) + have h2 := invoice_F (1 - t) (caller 6 7) n 17 + have h3 := invoice_F (1 - t) (caller 6 7) natBaseC 17 + have h4 := natBaseC_F (1 - t) + push_cast at h2 h3 + rcases le_or_gt (1 / 10 : ℝ) t with h10 | h10 + · have h1 := own56_floor (1 - t) hs0 hs1 ks hk hmass hmd mr st hmr (Finv (1 - t) n) (E (1 - t)) 0 (hF _ hs0 hs1) hY + (hst _ hs0 hs1) hE0 + have hc0 : (0 : ℝ) ≤ 88 * (2 - (2 : ℝ) ^ (1 - t)) := by linarith + rw [max_eq_left hc0] at h1 + have h5 := cfC88_neg (1 - t) hs0 (by linarith) + have h6 := base88_eq (1 - t) + nlinarith + · have hsl : (9 / 10 : ℝ) ≤ 1 - t := by linarith + have hsr : 1 - t ≤ ((sC : ℚ) : ℝ) := by rw [hsC]; linarith + have hcap := hI3 hMV hR hP _ hs0 hs1 + unfold I3Cap at hcap + have hLc' := hLc _ hsl hsr + have hLcpos : (0 : ℝ) < ((LcC : ℚ) : ℝ) := by unfold LcC; norm_num + have hell : 0 ≤ ell (1 - t) := by have := hcorr0 (1 - t); nlinarith + have hsum : (1936 : ℝ) * ell (1 - t) ≤ ∑ p ∈ J, min (distF (1 - t) p) (cap (1 - t)) := by + have := Finset.card_nsmul_le_sum J (fun p => min (distF (1 - t) p) (cap (1 - t))) (ell (1 - t)) (hdist _ hsl hsr) + rw [nsmul_eq_mul] at this + have hj : (1936 : ℝ) ≤ J.card := by exact_mod_cast hJ + nlinarith + have hE : ((LcC : ℚ) : ℝ) ≤ E (1 - t) := by linarith + have h1 := own56_floor (1 - t) hs0 hs1 ks hk hmass hmd mr st hmr (Finv (1 - t) n) (E (1 - t)) ((LcC : ℚ) : ℝ) (hF _ hs0 hs1) hY + (hst _ hs0 hs1) hE + have h1' : Finv (1 - t) n ≤ -400 * (8 : ℝ) ^ (1 - t) - (6 * (9 : ℝ) ^ (1 - t) + 10) - ((LcC : ℚ) : ℝ) := by + have := le_max_right (88 * (2 - (2 : ℝ) ^ (1 - t))) ((LcC : ℚ) : ℝ) + linarith + have h5 := cfC_neg (1 - t) hsl hsr + have h6 := baseC_eq (1 - t) + have h7 : ((liftC : ℚ) : ℝ) = 17 * ((LcC : ℚ) : ℝ) := by unfold liftC; push_cast; ring + nlinarith + +end CongestionI3 + +#print axioms CongestionI3.forced_junk_ge +#print axioms CongestionI3.f1_floor +#print axioms CongestionI3.ceiling_A +#print axioms CongestionI3.chord_k +#print axioms CongestionI3.dprice_ge +#print axioms CongestionI3.nine_chord +#print axioms CongestionI3.own56_floor +#print axioms CongestionI3.ceiling_C diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3.md b/research/p104-reader-ceiling/lean/Nov15/CongestionI3.md new file mode 100644 index 0000000000..f4043c17df --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3.md @@ -0,0 +1,21 @@ +# CongestionI3*.lean: the I3 congestion bound and F1's restricted-class ceilings in Lean +Files (build order, each with `-o .lake/build/lib/lean/Nov15/.olean`, the memory-guarded build script, <= 3.5 GB): CongestionI3Data (11 s), CongestionI3Cfg (121 s / 3.37 GB), CongestionI3Mu (5 s), CongestionI3NumA (35 s / 3.2 GB), CongestionI3NumC1..C4 (34/31/28/17 s, <= 3.2 GB), CongestionI3 (24 s / 3.0 GB). Kernel only: no sorry, no native_decide; every `#print axioms` is within [propext, Classical.choice, Quot.sound]. The numeric files are split only for the memory guard (NumCertK interval checks, as in WholeFloorCoverData). +Sources: internal notes (not included in this package). + +## What is proved (kernel) +- **(1) per pair.** `pair_bound`: per-pair minimum delta => E >= delta |J|; `i3_D0_per_call`: 0.541495 per pair and |J| >= 1936 give >= 1048.33 D0/call. I3 itself is the HYPOTHESIS `I3Path J dist E` (sum of path distances <= public excess, model M_V): the telescoping/path bound is NOT formalised, and the shape-DAG minimum (0.541495 in D0, `sigma0` = 9785438/10^9 <= sp_F(t) in F currency) is a data hypothesis (230-shape DAG, f1ceil.py). +- **(2) forced junk >= 1936.** `cfgs` = the 8 valid rank-8 C = 56 configurations (f1enum, z.z' = 0); kernel: `cfgs_ok` (8 rows each, z.z' = 0 on the F2^9 labels `Ulab`), `cfg_uniq0..7` (every chain of every configuration has exactly 330 unique cells = 2640 per configuration, recomputed from `Ulab`/`Gmask`), `uniqCells_disjoint` (a unique cell belongs to one chain). `forced_junk_ge`: if the forced cells F k of chain k are unique cells (hsub), lie in supp J (hJ) and number >= mu(i,k) (hDP), then |J| >= sum_k mu = 1936 (`mu_sum`, kernel on the table `muTab`, all entries 242, from the per-chain rerun f1dp_chain_*.log; per-config sums reproduce f1dp.log). hDP is the python flag-DP minimum over the subspace lattice: DATA, not kernel-checked (a kernel re-run would be ~64 chain DPs). +- **(3) max, not sum.** `f1_floor`: from hF (F <= -400 8^s - mp - E), mp >= 16, st + mp >= 104 (lat = 0, nested words), E >= (2 - 2^s) st (R3's stops) and E >= I (I3): F <= -400 8^s - 16 - max(88 (2 - 2^s), I). I = 0 is R3's -Nfl. `sum_not_implied` records that the sum is not a consequence (E = max satisfies both bounds). +- **(4a) ceiling 8|9, kappa <= .0183952347.** `ceiling_A`: for t in [tbarA = .0183952347, 1], F(1 - t) < 0 on the 17-call #7113 invoice. t >= .1: f1_floor with I = 0 + WholeFloorCover.cover (R3). t in [tbar, .1): lift 17 * 1936 * sigma0 against `cfB_neg`: three Fup pieces on [.9, .93], dF/ds > 0 on [.93, 1 - tbar] (`Fc_mono`) and F_base(s0) < 17 * 1936 * sigma0 at the endpoint (true F_base(s0) = 322.05830, lift 322.05834; python root .0183952344, so .0183952347 is rounded up). +- **(4b) ceiling with descent mass >= 56, kappa <= .0134769139.** `own56_floor`: descents are owned MOVEs of rank k in 1..9 with sum >= 56 (rank-8 C = 56 premise), >= 8 descents and >= 8 rises: F price sum k^s >= 6 9^s + 2 (`chord_k`, `dprice_ge`: concavity chord on [1,9]); extra moves beyond 8 + 8 cost at least the stops they remove save, by `nine_chord` (9^s <= 8 2^s - 7 on [0,1], convexity of u -> u^(log_2 9); so (9 - 9^s)/8 >= 2 - 2^s). This RE-DERIVES the m-tradeoff at the own56 base, which LIFT1/f1ceil only assume (python charges the fixed 6x9 + 2x1 + 8 rises; the Lean statement shows it is sound). `ceiling_C`: F < 0 on [tbarC = .0134769139, 1]: t >= .1 by cfC88_neg (13 pieces, = base + 88 stops), t in [tbar, .1) by cfC_neg (lift 17 * 13.64105; true F_base(sC) = 231.89777, lift 231.89785). + +## Scope and hypotheses (stated in the theorems; none discharged by the kernel unless marked) +- **M_V**: every public register except Y mains ends at V, owned code fixed, X_q born at A_q (AUDIT (1)). Hypothesis `MV` in `hI3`. NO known native is in M_V (224 of 1,501 public registers end at dim <= 7): the ceilings are NOT a floor on the native class; the control pass (S22/#7641/#7637 under both ceilings) is feasibility only. +- **rank-8, C = 56** decoder on P104 labels, one of the 8 enumerated configurations (index i < 8): exhaustiveness over the 12,870 subsets and rigidity M^ = D1 G D2 are quoted/numerical. LIFT2: C = 57 impossible; C = 58 elementary mixes give junk >= 2093 >= 1936, C = 60 sampled; C >= 59 general X only sampled; >= 9-row and network decoders open. The junk bound 1936 is the min over C = 56 EXACTLY (AUDIT-LIFT (3)): a C >= 58 decoder is not covered. `hJ`/`Rank8C56` carry this. +- **plane separation** (`PlaneSep`, ceiling_A): without it the LB collapses to 0 (f1k2). ceiling_C does not assume it but replaces it by the **public-provenance direction law** `Prov` + the cap/correction inequality `I3Cap` (LIFT1 sec. 1; AUDIT-LIFT (1): holders with owned origin/reflux (i), non-monotone owned lifetimes (ii), >= 9-row/network decoders (iii) are OPEN; the split LB 242 < break-even 578 is a count, not a proof). +- **data hypotheses**: `hdist` (per-pair sp_F lower bound on [tbar, .1]; sp_F increasing in t is numerical, the convex/superadditive proof was not re-derived, AUDIT (1)); `hLc` (N min(sp_F, unit/48) - corr >= 13.64105 on [tbarC, .1]; python lift1c, monotone numerically); `hDP` (flag-DP minima); `corr >= 0`. +- **nested** (lat = 0): `hY : 104 <= st + mp` is Theorem Y with lateral owned MOVEs excluded by the verifier nesting rule (WholeFloorNest); R3's port lemma/Theorem Y and slack-rank independence stay upstream. +- The D0 floor 171,478.76 is not formalised (LIFT1: it does not survive without plane separation: owned mass is a D0 credit). + +## Statements false as written +None found. Two points to read carefully: (a) the sum of I3 and R3's stops is NOT implied (`sum_not_implied`); only max is (F1 uses max). (b) F1.md's "k <= 4" for the joint table is not a restriction (AUDIT: k <= 17), not touched here. The own56 ceiling's R3 trade-off is TRUE (nine_chord). diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3Cfg.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3Cfg.lean new file mode 100644 index 0000000000..4d50ff918d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3Cfg.lean @@ -0,0 +1,73 @@ +import Nov15.CongestionI3Data + +/-! +CONGESTION-I3 configuration half . Kernel-checked facts about the 8 rank-8 C=56 decoder configurations +(internal notes sec. 2): z.z' = 0, and the census of the "unique" even cells (cells that exactly one chain can touch). +`dot` = F2 dot product of 9-bit labels; chain k = (z_k, z'_k) (virtual lines 104..119, labels `Ulab`); the chain k's support on the +cell (t, s) (t, s < 104) is G[t, z_k] * G[s, z'_k] (nonzero pattern `Gmask`). +-/ +set_option linter.constructorNameAsVariable false +namespace CongestionI3 + +/-- parity of the 9 low bits -/ +def par (x : ℕ) : ℕ := + let a := (x ^^^ (x >>> 4)) &&& 15 + let b := a ^^^ (a >>> 2) + ((b ^^^ (b >>> 1)) ^^^ (x >>> 8)) &&& 1 +theorem par_test : (List.range 512).all (fun x => par x == ((List.range 9).foldl (fun acc i => acc + (x >>> i) % 2) 0) % 2) = true := by decide +kernel +def dot (a b : ℕ) : ℕ := par (a &&& b) +def lab (i : ℕ) : ℕ := Ulab.getD i 0 +/-- G[t, z] ≠ 0 for t < 104, z in 104..119 -/ +def gnz (t z : ℕ) : Bool := ((Gmask.getD t 0) >>> (z - 104)) % 2 == 1 + +/-- the even cells: t ≠ s, q_t . q_s = 0 -/ +def even (t s : ℕ) : Bool := t != s && dot (lab t) (lab s) == 0 +/-- chains that may touch (t,s): q_t ⊥ z_k and q_s ⊥ z'_k (frames of the chain) -/ +def Kset (c : List (ℕ × ℕ)) (t s : ℕ) : List ℕ := + (List.range c.length).filter fun k => + dot (lab t) (lab (c.getD k (0, 0)).1) == 0 && dot (lab s) (lab (c.getD k (0, 0)).2) == 0 +/-- chains whose product is nonzero at (t,s) -/ +def Tset (c : List (ℕ × ℕ)) (t s : ℕ) : List ℕ := + (List.range c.length).filter fun k => gnz t (c.getD k (0, 0)).1 && gnz s (c.getD k (0, 0)).2 +/-- the unique cells of chain k: even, exactly one chain (k) may touch them, and it does -/ +def isUniq (c : List (ℕ × ℕ)) (k t s : ℕ) : Bool := even t s && Kset c t s == [k] && Tset c t s == [k] +def uniqCells (c : List (ℕ × ℕ)) (k : ℕ) : Finset (ℕ × ℕ) := + (Finset.range 104 ×ˢ Finset.range 104).filter fun p => isUniq c k p.1 p.2 = true + +/-- orthogonality z.z' = 0 for all rows -/ +def cfgOK (c : List (ℕ × ℕ)) : Bool := c.length == 8 && c.all fun p => dot (lab p.1) (lab p.2) == 0 +/-- chain index of every unique cell, one pass over the 104 x 104 cells -/ +def uniqOwners (c : List (ℕ × ℕ)) : List ℕ := + (List.range 104).flatMap fun t => (List.range 104).filterMap fun s => + if even t s then + (match Kset c t s with + | [k] => if Tset c t s == [k] then some k else none + | _ => none) + else none +def uniqCensus (c : List (ℕ × ℕ)) : List ℕ := (List.range 8).map fun k => (uniqOwners c).count k + +theorem cfgs_len : cfgs.length = 8 := by decide +kernel +theorem cfgs_ok : cfgs.all cfgOK = true := by decide +kernel +/-- every chain of every configuration has exactly 330 unique cells (2640 = 8 * 330 per configuration, F1 sec. 2); one theorem per +configuration (kernel memory is per declaration). -/ +theorem cfg_uniq0 : uniqCensus (cfgs.getD 0 []) = List.replicate 8 330 := by decide +kernel +theorem cfg_uniq1 : uniqCensus (cfgs.getD 1 []) = List.replicate 8 330 := by decide +kernel +theorem cfg_uniq2 : uniqCensus (cfgs.getD 2 []) = List.replicate 8 330 := by decide +kernel +theorem cfg_uniq3 : uniqCensus (cfgs.getD 3 []) = List.replicate 8 330 := by decide +kernel +theorem cfg_uniq4 : uniqCensus (cfgs.getD 4 []) = List.replicate 8 330 := by decide +kernel +theorem cfg_uniq5 : uniqCensus (cfgs.getD 5 []) = List.replicate 8 330 := by decide +kernel +theorem cfg_uniq6 : uniqCensus (cfgs.getD 6 []) = List.replicate 8 330 := by decide +kernel +theorem cfg_uniq7 : uniqCensus (cfgs.getD 7 []) = List.replicate 8 330 := by decide +kernel + +theorem uniqCells_disjoint (c : List (ℕ × ℕ)) {k k' : ℕ} (h : k ≠ k') : Disjoint (uniqCells c k) (uniqCells c k') := by + rw [Finset.disjoint_left] + intro p hp hp' + simp only [uniqCells, Finset.mem_filter, isUniq, Bool.and_eq_true, beq_iff_eq] at hp hp' + have := hp.2.1.2.symm.trans hp'.2.1.2 + simp at this + exact h this + +end CongestionI3 + +#print axioms CongestionI3.cfg_uniq7 +#print axioms CongestionI3.uniqCells_disjoint diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3Data.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3Data.lean new file mode 100644 index 0000000000..4f0921cc87 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3Data.lean @@ -0,0 +1,26 @@ +import Mathlib.Data.Finset.Basic +import Mathlib.Data.Finset.Card +import Mathlib.Data.Finset.Prod +import Mathlib.Data.Finset.Powerset +import Mathlib.Algebra.BigOperators.Group.Finset.Basic +import Mathlib.Order.Interval.Finset.Nat + +/-! +CONGESTION-I3 data : the 8 valid rank-8 C=56 decoder configurations of internal notes (f1enum.py, z.z'=0), +the F2^9 labels U of the 120 E8 lines (PORTSET geo.py), the nonzero pattern of G[t,z] for t<104, z in 104..119, and the per-chain +flag-DP minima mu (internal notes,b}.log, a rerun of f1dp.py printing per-chain values). +-/ +namespace CongestionI3 + +def Ulab : List ℕ := [11, 19, 35, 131, 259, 13, 21, 37, 69, 133, 261, 41, 73, 265, 49, 145, 161, 193, 321, 385, 14, 22, 38, 70, 134, 26, 74, 138, 50, 146, 274, 194, 322, 386, 28, 44, 140, 84, 148, 276, 100, 292, 196, 324, 388, 56, 88, 152, 168, 296, 200, 328, 392, 112, 176, 304, 208, 336, 400, 224, 352, 416, 508, 506, 502, 494, 478, 446, 382, 254, 505, 501, 493, 477, 445, 381, 253, 499, 475, 443, 379, 251, 487, 471, 439, 375, 247, 463, 431, 367, 239, 415, 351, 223, 319, 191, 81, 98, 164, 262, 268, 273, 280, 290, 42, 266, 25, 137, 7, 67, 448, 104, 76, 82, 162, 97, 289, 127, 52, 491] +def Gmask : List ℕ := [16511, 33780, 7537, 26040, 29106, 34652, 17623, 55890, 36147, 41627, 46737, 6861, 19884, 30222, 55622, 41359, 16138, 26731, 31841, 21449, 39251, 23256, 50269, 37692, 48276, 39495, 21411, 31755, 51017, 49024, 43914, 30308, 25198, 19910, 23908, 50145, 47912, 22283, 30883, 27817, 51598, 61996, 45383, 42317, 35557, 49397, 38804, 47164, 9913, 12979, 29144, 26066, 19066, 51866, 58674, 61752, 45651, 42585, 35313, 11478, 14556, 6004, 7695, 55596, 6579, 55864, 17597, 5084, 15476, 10366, 50979, 1980, 50231, 23218, 3539, 8827, 13937, 49311, 40337, 51952, 58712, 61778, 50059, 23822, 2671, 9671, 12749, 40581, 51684, 58956, 62022, 22369, 30921, 27843, 12200, 15266, 36391, 3757, 58918, 43166, 44834, 46469, 44086, 13583] +def cfgs : List (List (ℕ × ℕ)) := [[(104, 105), (106, 107), (108, 109), (110, 118), (111, 115), (112, 116), (114, 117), (119, 113)], + [(104, 110), (105, 118), (111, 108), (112, 119), (114, 106), (115, 109), (116, 113), (117, 107)], + [(104, 111), (105, 115), (106, 119), (107, 113), (110, 108), (114, 112), (117, 116), (118, 109)], + [(104, 114), (105, 117), (108, 119), (109, 113), (110, 106), (111, 112), (115, 116), (118, 107)], + [(105, 104), (107, 106), (109, 108), (113, 119), (115, 111), (116, 112), (117, 114), (118, 110)], + [(106, 110), (107, 118), (112, 111), (113, 109), (114, 104), (116, 115), (117, 105), (119, 108)], + [(106, 114), (107, 117), (108, 111), (109, 115), (110, 104), (113, 116), (118, 105), (119, 112)], + [(108, 110), (109, 118), (111, 104), (112, 114), (113, 107), (115, 105), (116, 117), (119, 106)]] + +end CongestionI3 diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualAlg.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualAlg.lean new file mode 100644 index 0000000000..47362970ba --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualAlg.lean @@ -0,0 +1,224 @@ +import Nov15.WordDuality +import Mathlib.Analysis.MeanInequalitiesPow +import Mathlib.Analysis.SpecialFunctions.Pow.NNReal + +/-! +CONGESTION-I3-DUAL, algebra half. Source: internal notes (audited SOUND, i3dual/audit/AUD.md). +Two-sided I3: the excess of one public register is telescoped from the END (h9 charge, needs e = 9) or from the BIRTH (k0 charge, needs d0 = 0); +every move of a non-mixed register carries a charge >= c2 = min (h9, k0), and a mixed register (d0 >= 1, e <= 8) loses at most c2 (d0, e). +Kernel only; no sorry, no native_decide. `g` is an arbitrary price function with g 0 = 0 (instance: `gs s x = x^s`, s = 1 - t). +Nothing numeric here. See CongestionI3Dual.md. +-/ +namespace CongestionI3Dual +open Finset WordDuality + +/-! ### 1. move prices -/ + +/-- end-anchored move price (target V = dim 9): g(b-a) + g(9-b) - g(9-a) -/ +def h9 (g : ℝ → ℝ) (a b : ℝ) : ℝ := g (b - a) + g (9 - b) - g (9 - a) +/-- start-anchored move price (birth {0}): g(b-a) + g(a) - g(b) -/ +def k0 (g : ℝ → ℝ) (a b : ℝ) : ℝ := g (b - a) + g a - g b +/-- the uniform charge of ID1 sec. 1 -/ +def c2 (g : ℝ → ℝ) (a b : ℝ) : ℝ := min (h9 g a b) (k0 g a b) + +/-- the price function of the F currency: x^s on x > 0, and 0 at 0 -/ +noncomputable def gs (s : ℝ) (x : ℝ) : ℝ := if 0 < x then x ^ s else 0 +theorem gs_zero (s : ℝ) : gs s 0 = 0 := by simp [gs] + +/-- x^s is subadditive on [0, inf) for 0 <= s <= 1 -/ +theorem gs_subadd (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (x y : ℝ) (hx : 0 ≤ x) (hy : 0 ≤ y) : + gs s (x + y) ≤ gs s x + gs s y := by + have key : (x + y) ^ s ≤ x ^ s + y ^ s := by + have := NNReal.rpow_add_le_add_rpow x.toNNReal y.toNNReal hs0 hs1 + have h3 : ((x.toNNReal + y.toNNReal) ^ s : NNReal) ≤ (x.toNNReal ^ s + y.toNNReal ^ s : NNReal) := this + have h4 := (NNReal.coe_le_coe.mpr h3) + simpa [NNReal.coe_rpow, Real.coe_toNNReal _ hx, Real.coe_toNNReal _ hy] using h4 + unfold gs + by_cases hx0 : 0 < x + · by_cases hy0 : 0 < y + · rw [if_pos hx0, if_pos hy0, if_pos (by linarith)]; exact key + · have : y = 0 := le_antisymm (not_lt.mp hy0) hy + subst this; simp + · have : x = 0 := le_antisymm (not_lt.mp hx0) hx + subst this; simp + +/-- the two prices are >= 0 for a subadditive g with g 0 = 0 on 0 <= a <= b <= 9 -/ +theorem h9_nonneg (g : ℝ → ℝ) (hg : ∀ x y, 0 ≤ x → 0 ≤ y → g (x + y) ≤ g x + g y) (a b : ℝ) (hab : a ≤ b) (hb : b ≤ 9) : + 0 ≤ h9 g a b := by + have := hg (b - a) (9 - b) (by linarith) (by linarith) + have e : b - a + (9 - b) = 9 - a := by ring + rw [e] at this; unfold h9; linarith +theorem k0_nonneg (g : ℝ → ℝ) (hg : ∀ x y, 0 ≤ x → 0 ≤ y → g (x + y) ≤ g x + g y) (a b : ℝ) (ha : 0 ≤ a) (hab : a ≤ b) : + 0 ≤ k0 g a b := by + have := hg (b - a) a (by linarith) ha + have e : b - a + a = b := by ring + rw [e] at this; unfold k0; linarith + +/-- duality at the level of move prices (DU1): the start-anchored price of (a,b) is the end-anchored price of the swapped move +`swapN 9 (a,b) = (9-b, 9-a)` of WordDuality. -/ +theorem k0_eq_h9_swapN (g : ℝ → ℝ) (a b : ℕ) (hb : b ≤ 9) (hab : a ≤ b) : + k0 g a b = h9 g (swapN 9 (a, b)).1 (swapN 9 (a, b)).2 := by + simp only [swapN, k0, h9] + have h1 : (((9 - b : ℕ) : ℕ) : ℝ) = 9 - b := by rw [Nat.cast_sub hb]; norm_num + have h2 : (((9 - a : ℕ) : ℕ) : ℝ) = 9 - a := by rw [Nat.cast_sub (le_trans hab hb)]; norm_num + rw [h1, h2] + have e1 : (9 - (a : ℝ)) - (9 - b) = b - a := by ring + have e2 : (9 : ℝ) - (9 - a) = a := by ring + have e3 : (9 : ℝ) - (9 - b) = b := by ring + rw [e1, e2, e3] + +/-- the dual helper (WordDuality `dualH 9`) has the same move prices: its end-anchored charge list is the start-anchored charge list of the +original (reversed order, equal sum). -/ +theorem dualH_charge (g : ℝ → ℝ) (h : FibreK.Helper) (hs : ∀ s ∈ h.steps, s.2 ≤ 9 ∧ s.1 ≤ s.2) : + (((dualH 9 h).steps).map fun s : ℕ × ℕ => h9 g s.1 s.2).sum = (h.steps.map fun s : ℕ × ℕ => k0 g s.1 s.2).sum := by + simp only [dualH, List.map_reverse, List.sum_reverse, List.map_map] + congr 1 + apply List.map_congr_left + intro s hs' + obtain ⟨h1, h2⟩ := hs s hs' + simp only [Function.comp] + exact (k0_eq_h9_swapN g s.1 s.2 h1 h2).symm + +/-! ### 2. one register: telescoping -/ + +/-- a register path: levels `d 0, ..., d n` (born at `d 0`, ending at `d n`); its excess over R3's floor is +`ex = sum g(gaps) - g(e - d0)` (ID1 sec. 1). -/ +def gsum (g : ℝ → ℝ) (d : ℕ → ℝ) (n : ℕ) : ℝ := ∑ i ∈ range n, g (d (i + 1) - d i) +def ex (g : ℝ → ℝ) (d : ℕ → ℝ) (n : ℕ) : ℝ := gsum g d n - g (d n - d 0) + +/-- end-anchored telescoping: for e = 9 the h9 charges sum to the excess -/ +theorem sum_h9_eq (g : ℝ → ℝ) (hg0 : g 0 = 0) (d : ℕ → ℝ) (n : ℕ) (he : d n = 9) : + ∑ i ∈ range n, h9 g (d i) (d (i + 1)) = ex g d n := by + have t : ∑ i ∈ range n, (g (9 - d (i + 1)) - g (9 - d i)) = g (9 - d n) - g (9 - d 0) := + Finset.sum_range_sub (fun i => g (9 - d i)) n + have h : ∑ i ∈ range n, h9 g (d i) (d (i + 1)) = gsum g d n + ∑ i ∈ range n, (g (9 - d (i + 1)) - g (9 - d i)) := by + unfold h9 gsum; rw [← Finset.sum_add_distrib]; apply Finset.sum_congr rfl; intro i _; ring + rw [h, t, he]; unfold ex + have e : (9 : ℝ) - 9 = 0 := by ring + rw [e, hg0, he]; ring + +/-- start-anchored telescoping: for d0 = 0 the k0 charges sum to the excess -/ +theorem sum_k0_eq (g : ℝ → ℝ) (hg0 : g 0 = 0) (d : ℕ → ℝ) (n : ℕ) (hd : d 0 = 0) : + ∑ i ∈ range n, k0 g (d i) (d (i + 1)) = ex g d n := by + have t : ∑ i ∈ range n, (g (d i) - g (d (i + 1))) = g (d 0) - g (d n) := by + have := Finset.sum_range_sub (fun i => g (d i)) n + have h2 : ∑ i ∈ range n, (g (d i) - g (d (i + 1))) = -∑ i ∈ range n, (g (d (i + 1)) - g (d i)) := by + rw [← Finset.sum_neg_distrib]; apply Finset.sum_congr rfl; intro i _; ring + rw [h2, this]; ring + have h : ∑ i ∈ range n, k0 g (d i) (d (i + 1)) = gsum g d n + ∑ i ∈ range n, (g (d i) - g (d (i + 1))) := by + unfold k0 gsum; rw [← Finset.sum_add_distrib]; apply Finset.sum_congr rfl; intro i _; ring + rw [h, t, hd]; unfold ex + rw [hd, hg0]; ring_nf + +/-- **non-mixed register: every move is charged >= c2 and the charges sum to the excess** (ID1 sec. 1, `charge_V`/`charge_Z`). -/ +theorem nonmixed_charge (g : ℝ → ℝ) (hg0 : g 0 = 0) (d : ℕ → ℝ) (n : ℕ) (h : d n = 9 ∨ d 0 = 0) : + ∃ w : ℕ → ℝ, (∀ i ∈ range n, c2 g (d i) (d (i + 1)) ≤ w i) ∧ ∑ i ∈ range n, w i = ex g d n := by + rcases h with h | h + · exact ⟨fun i => h9 g (d i) (d (i + 1)), fun i _ => min_le_left _ _, sum_h9_eq g hg0 d n h⟩ + · exact ⟨fun i => k0 g (d i) (d (i + 1)), fun i _ => min_le_right _ _, sum_k0_eq g hg0 d n h⟩ + +/-- **the slack of any register** (covers mixed registers, ID1 sec. 2): the c2-charges sum to at most the excess plus c2 of the whole register. +No hypothesis on g or on the levels: pointwise `c2 <= g(gap) - max (g(9-a)-g(9-b), g(b)-g(a))`, and both maxima telescope. -/ +theorem sum_c2_le (g : ℝ → ℝ) (d : ℕ → ℝ) (n : ℕ) : + ∑ i ∈ range n, c2 g (d i) (d (i + 1)) ≤ ex g d n + c2 g (d 0) (d n) := by + have t1 : ∑ i ∈ range n, (g (9 - d (i + 1)) - g (9 - d i)) = g (9 - d n) - g (9 - d 0) := + Finset.sum_range_sub (fun i => g (9 - d i)) n + have t2 : ∑ i ∈ range n, (g (d i) - g (d (i + 1))) = g (d 0) - g (d n) := by + have := Finset.sum_range_sub (fun i => g (d i)) n + have h2 : ∑ i ∈ range n, (g (d i) - g (d (i + 1))) = -∑ i ∈ range n, (g (d (i + 1)) - g (d i)) := by + rw [← Finset.sum_neg_distrib]; apply Finset.sum_congr rfl; intro i _; ring + rw [h2, this]; ring + have A : ∑ i ∈ range n, c2 g (d i) (d (i + 1)) ≤ ex g d n + h9 g (d 0) (d n) := by + have : ∑ i ∈ range n, c2 g (d i) (d (i + 1)) ≤ ∑ i ∈ range n, (g (d (i + 1) - d i) + (g (9 - d (i + 1)) - g (9 - d i))) := by + apply Finset.sum_le_sum; intro i _ + have : c2 g (d i) (d (i + 1)) ≤ h9 g (d i) (d (i + 1)) := min_le_left _ _ + unfold h9 at this; linarith + rw [Finset.sum_add_distrib, t1] at this + unfold ex gsum h9 at *; linarith + have B : ∑ i ∈ range n, c2 g (d i) (d (i + 1)) ≤ ex g d n + k0 g (d 0) (d n) := by + have : ∑ i ∈ range n, c2 g (d i) (d (i + 1)) ≤ ∑ i ∈ range n, (g (d (i + 1) - d i) + (g (d i) - g (d (i + 1)))) := by + apply Finset.sum_le_sum; intro i _ + have : c2 g (d i) (d (i + 1)) ≤ k0 g (d i) (d (i + 1)) := min_le_right _ _ + unfold k0 at this; linarith + rw [Finset.sum_add_distrib, t2] at this + unfold ex gsum k0 at *; linarith + unfold c2 + rcases le_total (h9 g (d 0) (d n)) (k0 g (d 0) (d n)) with h | h + · rw [min_eq_left h]; exact A + · rw [min_eq_right h]; exact B + +/-- non-mixed (born at 0 or ending at 9): c2 of the whole register vanishes -/ +theorem c2_total_nonmixed (g : ℝ → ℝ) (hg0 : g 0 = 0) (a e : ℝ) (h : e = 9 ∨ a = 0) : c2 g a e ≤ 0 := by + unfold c2 + rcases h with h | h + · subst h; have : h9 g a 9 = g 0 := by unfold h9; simp + rw [hg0] at this; exact le_trans (min_le_left _ _) this.le + · subst h; have : k0 g 0 e = g 0 := by unfold k0; simp + rw [hg0] at this; exact le_trans (min_le_right _ _) this.le + +/-! ### 3. many registers: <= m mixed -/ + +section Many +variable {ι : Type*} [DecidableEq ι] + +/-- a register is MIXED if it is born above {0} and ends below V (levels are dims) -/ +def Mixed (d : ι → ℕ → ℕ) (n : ι → ℕ) (r : ι) : Prop := 1 ≤ d r 0 ∧ d r (n r) ≤ 8 +instance (d : ι → ℕ → ℕ) (n : ι → ℕ) (r : ι) : Decidable (Mixed d n r) := by unfold Mixed; infer_instance + +/-- the dim sequence of register `r` as reals -/ +def lev (d : ι → ℕ → ℕ) (r : ι) : ℕ → ℝ := fun i => (d r i : ℝ) + +/-- **summing over registers**: c2-charges of all moves <= total excess + (number of mixed registers) * sigma, where `sigma` bounds c2 of one +mixed register (dims 1 <= a <= b <= 8). -/ +theorem sum_all_c2_le (g : ℝ → ℝ) (hg0 : g 0 = 0) (R : Finset ι) (n : ι → ℕ) (d : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < n r, d r i ≤ d r (i + 1)) (hd9 : ∀ r ∈ R, d r (n r) ≤ 9) + (m : ℕ) (hm : (R.filter fun r => Mixed d n r).card ≤ m) (σ : ℝ) (hσ0 : 0 ≤ σ) + (hσ : ∀ a b : ℕ, 1 ≤ a → a ≤ b → b ≤ 8 → c2 g (a : ℝ) (b : ℝ) ≤ σ) : + ∑ r ∈ R, ∑ i ∈ range (n r), c2 g (lev d r i) (lev d r (i + 1)) ≤ ∑ r ∈ R, ex g (lev d r) (n r) + m * σ := by + have step : ∀ r ∈ R, ∑ i ∈ range (n r), c2 g (lev d r i) (lev d r (i + 1)) ≤ + ex g (lev d r) (n r) + (if Mixed d n r then σ else 0) := by + intro r hr + have h1 := sum_c2_le g (lev d r) (n r) + have hle : ∀ k ≤ n r, d r 0 ≤ d r k := by + intro k + induction k with + | zero => intro _; exact le_refl _ + | succ k ih => intro hk; exact le_trans (ih (by omega)) (hmono r hr k (by omega)) + have h0e := hle (n r) (le_refl _) + by_cases hmx : Mixed d n r + · rw [if_pos hmx] + have := hσ (d r 0) (d r (n r)) hmx.1 h0e hmx.2 + simp only [lev] at h1 ⊢ + linarith + · rw [if_neg hmx] + have hne : d r (n r) = 9 ∨ d r 0 = 0 := by + unfold Mixed at hmx + have := hd9 r hr + omega + have h2 := c2_total_nonmixed g hg0 (lev d r 0) (lev d r (n r)) + (by + rcases hne with h | h + · left; simp [lev, h] + · right; simp [lev, h]) + simp only [lev] at h1 h2 ⊢ + linarith + calc ∑ r ∈ R, ∑ i ∈ range (n r), c2 g (lev d r i) (lev d r (i + 1)) + ≤ ∑ r ∈ R, (ex g (lev d r) (n r) + (if Mixed d n r then σ else 0)) := Finset.sum_le_sum step + _ = ∑ r ∈ R, ex g (lev d r) (n r) + ∑ r ∈ R, (if Mixed d n r then σ else 0) := Finset.sum_add_distrib + _ ≤ ∑ r ∈ R, ex g (lev d r) (n r) + m * σ := by + have : ∑ r ∈ R, (if Mixed d n r then σ else 0) = ((R.filter fun r => Mixed d n r).card : ℝ) * σ := by + rw [← Finset.sum_filter]; simp + rw [this] + have hm' : ((R.filter fun r => Mixed d n r).card : ℝ) ≤ m := by exact_mod_cast hm + nlinarith + +end Many + +end CongestionI3Dual + +#print axioms CongestionI3Dual.gs_subadd +#print axioms CongestionI3Dual.k0_eq_h9_swapN +#print axioms CongestionI3Dual.dualH_charge +#print axioms CongestionI3Dual.nonmixed_charge +#print axioms CongestionI3Dual.sum_c2_le +#print axioms CongestionI3Dual.sum_all_c2_le diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC0.lean new file mode 100644 index 0000000000..75912b05b7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionI3DualSig +namespace CongestionI3Dual +open NumCertK +theorem sigC0 : sigOK (1 - tC1) (1 - tC0) sgC0 = true := by decide +kernel +end CongestionI3Dual diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC1.lean new file mode 100644 index 0000000000..55e0eb46d3 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionI3DualSig +namespace CongestionI3Dual +open NumCertK +theorem sigC1 : sigOK (1 - tC2) (1 - tC1) sgC1 = true := by decide +kernel +end CongestionI3Dual diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC2.lean new file mode 100644 index 0000000000..87999f43fe --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC2.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionI3DualSig +namespace CongestionI3Dual +open NumCertK +theorem sigC2 : sigOK (1 - tC3) (1 - tC2) sgC2 = true := by decide +kernel +end CongestionI3Dual diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC3.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC3.lean new file mode 100644 index 0000000000..ae82c32969 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualCertC3.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionI3DualSig +namespace CongestionI3Dual +open NumCertK +theorem sigC3 : sigOK (9 / 10) (1 - tC3) sgC3 = true := by decide +kernel +end CongestionI3Dual diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualConst.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualConst.lean new file mode 100644 index 0000000000..192da15a75 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualConst.lean @@ -0,0 +1,43 @@ +import Mathlib.Data.Rat.Defs + +/-! CONGESTION-I3-DUAL constants: t-breakpoints of the pieces, certified sigma_j (Sig/Cert*), data lower bounds lcp_j +(python: internal notes; lcp_j = lower bound of 1936 spF(t_j) [8|9] resp. 1936 min(sp, cap) - 8 cst [own56], rounded down), L_j = lcp_j - 5 sigma_j. -/ +namespace CongestionI3Dual +-- 8|9 plain, m = 5: t-breakpoints +def tA0 : ℚ := 186470 / 10 ^ 7 +def tA1 : ℚ := 186490 / 10 ^ 7 +def tA2 : ℚ := 187490 / 10 ^ 7 +def tA3 : ℚ := 287490 / 10 ^ 7 +-- own56, m = 5 +def tC0 : ℚ := 136564 / 10 ^ 7 +def tC1 : ℚ := 136584 / 10 ^ 7 +def tC2 : ℚ := 137584 / 10 ^ 7 +def tC3 : ℚ := 237584 / 10 ^ 7 +def sgA0 : ℚ := 37981 / 500000 +def sgA1 : ℚ := 77257 / 10 ^ 6 +def sgA2 : ℚ := 213457 / 10 ^ 6 +def sgA3 : ℚ := 560567 / 500000 +def sgC0 : ℚ := 28029 / 500000 +def sgC1 : ℚ := 28683 / 500000 +def sgC2 : ℚ := 200709 / 10 ^ 6 +def sgC3 : ℚ := 1185727 / 10 ^ 6 + + +def lcpA0 : ℚ := 862761 / 50000 +def lcpA1 : ℚ := 17257043 / 10 ^ 6 +def lcpA2 : ℚ := 3469639 / 200000 +def lcpA3 : ℚ := 6597489 / 250000 +def LA0 : ℚ := lcpA0 - 5 * sgA0 +def LA1 : ℚ := lcpA1 - 5 * sgA1 +def LA2 : ℚ := lcpA2 - 5 * sgA2 +def LA3 : ℚ := lcpA3 - 5 * sgA3 +def lcpC0 : ℚ := 12418057 / 10 ^ 6 +def lcpC1 : ℚ := 248359 / 20000 +def lcpC2 : ℚ := 3079357 / 250000 +def lcpC3 : ℚ := 5022921 / 250000 +def LC0 : ℚ := lcpC0 - 5 * sgC0 +def LC1 : ℚ := lcpC1 - 5 * sgC1 +def LC2 : ℚ := lcpC2 - 5 * sgC2 +def LC3 : ℚ := lcpC3 - 5 * sgC3 + +end CongestionI3Dual diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualData.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualData.lean new file mode 100644 index 0000000000..ffe636e516 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualData.lean @@ -0,0 +1,12 @@ +import Nov15.CongestionI3DualConst +import Nov15.CongestionI3NumC4 +import Nov15.CongestionI3NumA + +namespace CongestionI3Dual +open NumCertK CongestionI3 + +/-- the tail pieces are covered by the F1 theorems `cfB_neg` / `cfC_neg` -/ +theorem LA3_ge : liftA ≤ 17 * LA3 := by unfold liftA sigma0 LA3 lcpA3 sgA3; norm_num +theorem LC3_ge : liftC ≤ 17 * LC3 := by unfold liftC LcC LC3 lcpC3 sgC3; norm_num + +end CongestionI3Dual diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualNumC.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualNumC.lean new file mode 100644 index 0000000000..965d2006a9 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualNumC.lean @@ -0,0 +1,8 @@ +import Nov15.CongestionI3DualConst +import Nov15.CongestionI3NumC4 +namespace CongestionI3Dual +open NumCertK CongestionI3 +theorem ptC0 : Fup cfC (1 - tC0) (1 - tC0) < 17 * LC0 := by unfold tC0 LC0 lcpC0 sgC0; decide +kernel +theorem ptC1 : Fup cfC (1 - tC1) (1 - tC1) < 17 * LC1 := by unfold tC1 LC1 lcpC1 sgC1; decide +kernel +theorem ptC2 : Fup cfC (1 - tC2) (1 - tC2) < 17 * LC2 := by unfold tC2 LC2 lcpC2 sgC2; decide +kernel +end CongestionI3Dual diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualSig.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualSig.lean new file mode 100644 index 0000000000..4f46eb66c0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3DualSig.lean @@ -0,0 +1,78 @@ +import Nov15.CongestionI3DualAlg +import Nov15.NumCertK +import Nov15.CongestionI3DualConst + +/-! +CONGESTION-I3-DUAL, sigma certificates. `sigma(t)` = the largest c2 of one mixed register (dims 1 <= a <= b <= 8) is CERTIFIED here +on each t-piece by `NumCertK.Fup` (kernel interval arithmetic): for every pair (a,b), min(Fup h9, Fup k0) < sigma on the whole s-interval. So sigma needs +no monotonicity hypothesis: each piece carries its own certified bound. +-/ +namespace CongestionI3Dual +open NumCertK + +def h9CF (a b : ℕ) : CF := [(b - a, 1), (9 - b, 1), (9 - a, -1)] +def k0CF (a b : ℕ) : CF := [(b - a, 1), (a, 1), (b, -1)] + +theorem gs_nat (s : ℝ) (k : ℕ) (hk : 1 ≤ k) : gs s (k : ℝ) = (k : ℝ) ^ s := by + have : (0 : ℝ) < k := by exact_mod_cast hk + simp [gs, this] + +theorem h9_Fc (s : ℝ) (a b : ℕ) (ha : 1 ≤ a) (hab : a < b) (hb : b ≤ 8) : + h9 (gs s) (a : ℝ) (b : ℝ) = Fc (h9CF a b) s := by + have e1 : (b : ℝ) - a = ((b - a : ℕ) : ℝ) := by rw [Nat.cast_sub hab.le] + have e2 : (9 : ℝ) - b = ((9 - b : ℕ) : ℝ) := by rw [Nat.cast_sub (by omega)]; norm_num + have e3 : (9 : ℝ) - a = ((9 - a : ℕ) : ℝ) := by rw [Nat.cast_sub (by omega)]; norm_num + unfold h9; rw [e1, e2, e3, gs_nat s _ (by omega), gs_nat s _ (by omega), gs_nat s _ (by omega)] + simp [Fc, h9CF]; ring + +theorem k0_Fc (s : ℝ) (a b : ℕ) (ha : 1 ≤ a) (hab : a < b) (hb : b ≤ 8) : + k0 (gs s) (a : ℝ) (b : ℝ) = Fc (k0CF a b) s := by + have e1 : (b : ℝ) - a = ((b - a : ℕ) : ℝ) := by rw [Nat.cast_sub hab.le] + unfold k0; rw [e1, gs_nat s _ (by omega), gs_nat s _ ha, gs_nat s _ (by omega)] + simp [Fc, k0CF]; ring + +def pairs : List (ℕ × ℕ) := [(1,2),(1,3),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,4),(2,5),(2,6),(2,7),(2,8),(3,4),(3,5),(3,6),(3,7),(3,8), + (4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)] +theorem mem_pairs (a : ℕ) (ha : a < 9) (b : ℕ) (hb : b < 9) (h : 1 ≤ a ∧ a < b ∧ b ≤ 8) : (a, b) ∈ pairs := by + obtain ⟨h1, h2, h3⟩ := h + interval_cases a <;> interval_cases b <;> simp [pairs] at h2 h3 ⊢ + +def sigOK (lo hi σ : ℚ) : Bool := + pairs.all fun p => decide (Fup (h9CF p.1 p.2) lo hi < σ) || decide (Fup (k0CF p.1 p.2) lo hi < σ) + +theorem okR_h9CF (a b : ℕ) (ha : 1 ≤ a) (hab : a < b) (hb : b ≤ 8) : okR (h9CF a b) := by + intro p hp; simp [h9CF] at hp + rcases hp with h | h | h <;> subst h <;> simp <;> omega +theorem okR_k0CF (a b : ℕ) (ha : 1 ≤ a) (hab : a < b) (hb : b ≤ 8) : okR (k0CF a b) := by + intro p hp; simp [k0CF] at hp + rcases hp with h | h | h <;> subst h <;> simp <;> omega + +/-- **sigma certificate**: if `sigOK lo hi σ`, then for every s in [lo, hi], every 1 <= a <= b <= 8: c2 (gs s) a b <= σ (σ >= 0). -/ +theorem sig_of_ok (lo hi σ : ℚ) (hok : sigOK lo hi σ = true) (hlo : 0 ≤ lo) (hhi : hi ≤ 1) (hσ : 0 ≤ σ) (s : ℝ) + (h1 : (lo : ℝ) ≤ s) (h2 : s ≤ (hi : ℝ)) (a b : ℕ) (ha : 1 ≤ a) (hab : a ≤ b) (hb : b ≤ 8) : + c2 (gs s) (a : ℝ) (b : ℝ) ≤ (σ : ℝ) := by + rcases Nat.lt_or_ge a b with h | h + · have hm : (a, b) ∈ pairs := mem_pairs a (by omega) b (by omega) ⟨ha, h, hb⟩ + have := List.all_eq_true.mp hok (a, b) hm + simp only [Bool.or_eq_true, decide_eq_true_eq] at this + unfold c2 + rcases this with hh | hh + · have := Fc_le (h9CF a b) (okR_h9CF a b ha h hb) lo hi hlo hhi s h1 h2 + have h' : ((Fup (h9CF a b) lo hi : ℚ) : ℝ) < σ := by exact_mod_cast hh + rw [← h9_Fc s a b ha h hb] at this + exact le_trans (min_le_left _ _) (by linarith) + · have := Fc_le (k0CF a b) (okR_k0CF a b ha h hb) lo hi hlo hhi s h1 h2 + have h' : ((Fup (k0CF a b) lo hi : ℚ) : ℝ) < σ := by exact_mod_cast hh + rw [← k0_Fc s a b ha h hb] at this + exact le_trans (min_le_right _ _) (by linarith) + · have hba : a = b := le_antisymm hab h + subst hba + have h0 : h9 (gs s) (a : ℝ) (a : ℝ) = 0 := by unfold h9; simp [gs_zero] + have : c2 (gs s) (a : ℝ) (a : ℝ) ≤ 0 := by unfold c2; rw [h0]; exact min_le_left _ _ + have hσ' : (0 : ℝ) ≤ σ := by exact_mod_cast hσ + linarith + +/-! ### the pieces (t in [t_j, t_{j+1}], s in [1 - t_{j+1}, 1 - t_j]) -/ +end CongestionI3Dual + +#print axioms CongestionI3Dual.sig_of_ok diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3Mu.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3Mu.lean new file mode 100644 index 0000000000..b64a8e7023 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3Mu.lean @@ -0,0 +1,10 @@ +import Nov15.CongestionI3Data + +/-! +Per-chain flag-DP minima mu[i][k] (config i of `cfgs`, chain k): the minimum, over complete flags < ... < z_k^perp, of the number of +FORCED unique cells of chain k (F1 f1dp.py `flagdp(zp, z, cu)`). DATA from internal notes,b}.log (a rerun of f1dp.py with per-chain +printing; per-config sums reproduce f1dp.log: 1936 each). Python exact DP over the 29k-subspace lattice; NOT kernel-checked. +-/ +namespace CongestionI3 +def muTab : List (List ℕ) := [[242, 242, 242, 242, 242, 242, 242, 242], [242, 242, 242, 242, 242, 242, 242, 242], [242, 242, 242, 242, 242, 242, 242, 242], [242, 242, 242, 242, 242, 242, 242, 242], [242, 242, 242, 242, 242, 242, 242, 242], [242, 242, 242, 242, 242, 242, 242, 242], [242, 242, 242, 242, 242, 242, 242, 242], [242, 242, 242, 242, 242, 242, 242, 242]] +end CongestionI3 diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumA.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumA.lean new file mode 100644 index 0000000000..f31be96ce8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumA.lean @@ -0,0 +1,47 @@ +import Nov15.NumCertK + +/-! +CONGESTION-I3 numeric half A : the 8|9 crossing of F1 (internal notes sec. 3) with NumCertK. +F_base = F of the #7113 caller C(8|9) (caller 6 7) at 17 calls with the native replaced by R1/R2's owned floor (400 * 8^s + 16) and NO stops +(`cfB`; = WholeFloorCover.cfW with the 17 * 88 stop terms (1, -2992), (2, +1496) removed). The I3 lift is the constant 17 * 1936 * sigma0, +sigma0 = 9785438/10^9 <= sp_F(t) (shape-DAG path bound in F currency, F1 f1ceil.spF at t = tbar = .0183952347; DATA, python). +Crossing: dF_base/ds > 0 on [.9, s0] (dLo, kernel), F_base(s0) < 17 * 1936 * sigma0 (kernel), s0 = 1 - tbar, tbar = .0183952347. +-/ +namespace CongestionI3 +open NumCertK + +def cfB : CF := [(1, -656), (8, -7456), (9, 384), (16, -416), (17, 416), (24, -416), (25, 416), (32, -416), (33, 416), + (40, -416), (41, 416), (48, -416), (49, 416), (56, -416), (57, 416), (64, -208), (65, 416), (73, 208), (137, 208)] +def sigma0 : ℚ := 9785438 / 10 ^ 9 +def sA : ℚ := 9816047653 / 10 ^ 10 +def liftA : ℚ := 17 * 1936 * sigma0 + +theorem cfB_ok : okR cfB := by decide +kernel +theorem cfB_p1 : Fup cfB (90 / 100) (91 / 100) < liftA := by decide +kernel +theorem cfB_p2 : Fup cfB (91 / 100) (92 / 100) < liftA := by decide +kernel +theorem cfB_p3 : Fup cfB (92 / 100) (93 / 100) < liftA := by decide +kernel +theorem cfB_d : 0 < dLo cfB (93 / 100) sA := by decide +kernel +theorem cfB_end : Fup cfB sA sA < liftA := by decide +kernel + +/-- F_base(s) < 17 * 1936 * sigma0 on s in [.9, 1 - tbar] -/ +theorem cfB_neg (s : ℝ) (h1 : (9 / 10 : ℝ) ≤ s) (h2 : s ≤ ((sA : ℚ) : ℝ)) : Fc cfB s < ((liftA : ℚ) : ℝ) := by + have piece : ∀ a b : ℚ, 0 ≤ a → b ≤ 1 → Fup cfB a b < liftA → (a : ℝ) ≤ s → s ≤ b → Fc cfB s < ((liftA : ℚ) : ℝ) := by + intro a b ha hb hF h1 h2 + have := Fc_le cfB cfB_ok a b ha hb s h1 h2 + have h' : ((Fup cfB a b : ℚ) : ℝ) < ((liftA : ℚ) : ℝ) := by exact_mod_cast hF + linarith + by_cases c1 : s ≤ (((91 / 100 : ℚ)) : ℝ) + · exact piece (90 / 100) (91 / 100) (by norm_num) (by norm_num) cfB_p1 (by push_cast; linarith) c1 + by_cases c2 : s ≤ (((92 / 100 : ℚ)) : ℝ) + · exact piece (91 / 100) (92 / 100) (by norm_num) (by norm_num) cfB_p2 (by push_neg at c1; exact c1.le) c2 + by_cases hc : s ≤ (((93 / 100 : ℚ)) : ℝ) + · exact piece (92 / 100) (93 / 100) (by norm_num) (by norm_num) cfB_p3 (by push_neg at c2; exact c2.le) hc + have h1' : (((93 / 100 : ℚ)) : ℝ) ≤ s := by push_neg at hc; exact hc.le + have hm := Fc_mono cfB cfB_ok (93 / 100) sA (by norm_num) (by unfold sA; norm_num) cfB_d s h1' h2 + have he := Fc_le cfB cfB_ok sA sA (by unfold sA; norm_num) (by unfold sA; norm_num) sA (le_refl _) (le_refl _) + have he' : ((Fup cfB sA sA : ℚ) : ℝ) < ((liftA : ℚ) : ℝ) := by exact_mod_cast cfB_end + linarith + +end CongestionI3 + +#print axioms CongestionI3.cfB_neg diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC1.lean new file mode 100644 index 0000000000..2533bd0108 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC1.lean @@ -0,0 +1,23 @@ +import Nov15.NumCertK + +/-! +CONGESTION-I3 numeric half C1 : own56 ceiling data, part 1. With the decoder's descent mass >= 56 charged (LIFT1 sec. 3: +cheapest F form 6 * 9^s + 2 * 1 plus 8 rises), the 17-call base is F_base = F(caller 6 7) - 17 (400 * 8^s + 6 * 9^s + 10) (`cfC`). `cfC88` +adds R3's 88 forced stops (-17 * 88 * (2 - 2^s): (1, -2992), (2, +1496)); F < 0 on s in [0, .9] (t >= .1) is covered here and in C2. +-/ +namespace CongestionI3 +open NumCertK + +def cfC : CF := [(1, -554), (8, -7456), (9, 282), (16, -416), (17, 416), (24, -416), (25, 416), (32, -416), (33, 416), + (40, -416), (41, 416), (48, -416), (49, 416), (56, -416), (57, 416), (64, -208), (65, 416), (73, 208), (137, 208)] +def cfC88 : CF := [(1, -3546), (2, 1496), (8, -7456), (9, 282), (16, -416), (17, 416), (24, -416), (25, 416), (32, -416), (33, 416), + (40, -416), (41, 416), (48, -416), (49, 416), (56, -416), (57, 416), (64, -208), (65, 416), (73, 208), (137, 208)] +theorem cfC_ok : okR cfC := by decide +kernel +theorem cfC88_ok : okR cfC88 := by decide +kernel +theorem cfC88_p1 : Fup cfC88 (0) (22/100) < 0 := by decide +kernel +theorem cfC88_p2 : Fup cfC88 (22/100) (39/100) < 0 := by decide +kernel +theorem cfC88_p3 : Fup cfC88 (39/100) (51/100) < 0 := by decide +kernel +theorem cfC88_p4 : Fup cfC88 (51/100) (6/10) < 0 := by decide +kernel +theorem cfC88_p5 : Fup cfC88 (6/10) (67/100) < 0 := by decide +kernel + +end CongestionI3 diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC2.lean new file mode 100644 index 0000000000..00254cf788 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC2.lean @@ -0,0 +1,13 @@ +import Nov15.CongestionI3NumC1 + +/-! CONGESTION-I3 numeric part C2 : kernel interval pieces for the own56 ceiling; see CongestionI3NumC1 and CongestionI3.md. -/ +namespace CongestionI3 +open NumCertK + +theorem cfC88_p6 : Fup cfC88 (67/100) (72/100) < 0 := by decide +kernel +theorem cfC88_p7 : Fup cfC88 (72/100) (76/100) < 0 := by decide +kernel +theorem cfC88_p8 : Fup cfC88 (76/100) (79/100) < 0 := by decide +kernel +theorem cfC88_p9 : Fup cfC88 (79/100) (81/100) < 0 := by decide +kernel +theorem cfC88_p10 : Fup cfC88 (81/100) (83/100) < 0 := by decide +kernel + +end CongestionI3 diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC3.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC3.lean new file mode 100644 index 0000000000..ddb23f0913 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC3.lean @@ -0,0 +1,17 @@ +import Nov15.CongestionI3NumC2 + +/-! CONGESTION-I3 numeric part C3 : kernel interval pieces for the own56 ceiling; see CongestionI3NumC1 and CongestionI3.md. -/ +namespace CongestionI3 +open NumCertK + +def sC : ℚ := 1 - 134769139 / 10 ^ 10 +def LcC : ℚ := 1364105 / 10 ^ 5 +def liftC : ℚ := 17 * LcC + +theorem cfC88_p11 : Fup cfC88 (83/100) (86/100) < 0 := by decide +kernel +theorem cfC88_p12 : Fup cfC88 (86/100) (88/100) < 0 := by decide +kernel +theorem cfC88_p13 : Fup cfC88 (88/100) (9/10) < 0 := by decide +kernel +theorem cfC_q1 : Fup cfC (90 / 100) (915 / 1000) < liftC := by decide +kernel +theorem cfC_q2 : Fup cfC (915 / 1000) (93 / 100) < liftC := by decide +kernel + +end CongestionI3 diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC4.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC4.lean new file mode 100644 index 0000000000..b6b5c40c1d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionI3NumC4.lean @@ -0,0 +1,59 @@ +import Nov15.CongestionI3NumC3 + +/-! CONGESTION-I3 numeric part C4 : kernel interval pieces for the own56 ceiling; see CongestionI3NumC1 and CongestionI3.md. -/ +namespace CongestionI3 +open NumCertK + +theorem cfC_d : 0 < dLo cfC (93 / 100) sC := by decide +kernel +theorem cfC_end : Fup cfC sC sC < liftC := by decide +kernel + +theorem cfC88_neg (s : ℝ) (h0 : 0 ≤ s) (hs : s ≤ (9 / 10 : ℝ)) : Fc cfC88 s < 0 := by + have piece : ∀ a b : ℚ, 0 ≤ a → b ≤ 1 → Fup cfC88 a b < 0 → (a : ℝ) ≤ s → s ≤ b → Fc cfC88 s < 0 := + fun a b ha hb hF h1 h2 => Fc_neg_piece cfC88 cfC88_ok a b ha hb hF s h1 h2 + by_cases c1 : s ≤ (((22/100) : ℚ) : ℝ) + · exact piece (0) (22/100) (by norm_num) (by norm_num) cfC88_p1 (by simpa using h0) c1 + by_cases c2 : s ≤ (((39/100) : ℚ) : ℝ) + · exact piece (22/100) (39/100) (by norm_num) (by norm_num) cfC88_p2 (by push_cast; push_neg at c1; linarith) c2 + by_cases c3 : s ≤ (((51/100) : ℚ) : ℝ) + · exact piece (39/100) (51/100) (by norm_num) (by norm_num) cfC88_p3 (by push_cast; push_neg at c2; linarith) c3 + by_cases c4 : s ≤ (((6/10) : ℚ) : ℝ) + · exact piece (51/100) (6/10) (by norm_num) (by norm_num) cfC88_p4 (by push_cast; push_neg at c3; linarith) c4 + by_cases c5 : s ≤ (((67/100) : ℚ) : ℝ) + · exact piece (6/10) (67/100) (by norm_num) (by norm_num) cfC88_p5 (by push_cast; push_neg at c4; linarith) c5 + by_cases c6 : s ≤ (((72/100) : ℚ) : ℝ) + · exact piece (67/100) (72/100) (by norm_num) (by norm_num) cfC88_p6 (by push_cast; push_neg at c5; linarith) c6 + by_cases c7 : s ≤ (((76/100) : ℚ) : ℝ) + · exact piece (72/100) (76/100) (by norm_num) (by norm_num) cfC88_p7 (by push_cast; push_neg at c6; linarith) c7 + by_cases c8 : s ≤ (((79/100) : ℚ) : ℝ) + · exact piece (76/100) (79/100) (by norm_num) (by norm_num) cfC88_p8 (by push_cast; push_neg at c7; linarith) c8 + by_cases c9 : s ≤ (((81/100) : ℚ) : ℝ) + · exact piece (79/100) (81/100) (by norm_num) (by norm_num) cfC88_p9 (by push_cast; push_neg at c8; linarith) c9 + by_cases c10 : s ≤ (((83/100) : ℚ) : ℝ) + · exact piece (81/100) (83/100) (by norm_num) (by norm_num) cfC88_p10 (by push_cast; push_neg at c9; linarith) c10 + by_cases c11 : s ≤ (((86/100) : ℚ) : ℝ) + · exact piece (83/100) (86/100) (by norm_num) (by norm_num) cfC88_p11 (by push_cast; push_neg at c10; linarith) c11 + by_cases c12 : s ≤ (((88/100) : ℚ) : ℝ) + · exact piece (86/100) (88/100) (by norm_num) (by norm_num) cfC88_p12 (by push_cast; push_neg at c11; linarith) c12 + exact piece (88/100) (9/10) (by norm_num) (by norm_num) cfC88_p13 (by push_cast; push_neg at c12; linarith) (by push_cast; linarith) + +/-- F_base < 17 * LcC on s in [.9, 1 - tbarC] (the lift is the constant 17 * LcC) -/ +theorem cfC_neg (s : ℝ) (h1 : (9 / 10 : ℝ) ≤ s) (h2 : s ≤ ((sC : ℚ) : ℝ)) : Fc cfC s < ((liftC : ℚ) : ℝ) := by + have piece : ∀ a b : ℚ, 0 ≤ a → b ≤ 1 → Fup cfC a b < liftC → (a : ℝ) ≤ s → s ≤ b → Fc cfC s < ((liftC : ℚ) : ℝ) := by + intro a b ha hb hF h1 h2 + have := Fc_le cfC cfC_ok a b ha hb s h1 h2 + have h' : ((Fup cfC a b : ℚ) : ℝ) < ((liftC : ℚ) : ℝ) := by exact_mod_cast hF + linarith + by_cases c1 : s ≤ (((915 / 1000 : ℚ)) : ℝ) + · exact piece (90 / 100) (915 / 1000) (by norm_num) (by norm_num) cfC_q1 (by push_cast; linarith) c1 + by_cases c2 : s ≤ (((93 / 100 : ℚ)) : ℝ) + · exact piece (915 / 1000) (93 / 100) (by norm_num) (by norm_num) cfC_q2 (by push_neg at c1; exact c1.le) c2 + have h1' : (((93 / 100 : ℚ)) : ℝ) ≤ s := by push_neg at c2; exact c2.le + have hm := Fc_mono cfC cfC_ok (93 / 100) sC (by norm_num) (by unfold sC; norm_num) cfC_d s h1' h2 + have he := Fc_le cfC cfC_ok sC sC (by unfold sC; norm_num) (by unfold sC; norm_num) sC (le_refl _) (le_refl _) + have he' : ((Fup cfC sC sC : ℚ) : ℝ) < ((liftC : ℚ) : ℝ) := by exact_mod_cast cfC_end + linarith + +end CongestionI3 + +#print axioms CongestionI3.cfC88_neg +#print axioms CongestionI3.cfC_neg diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNative.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNative.lean new file mode 100644 index 0000000000..899afcb54b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNative.lean @@ -0,0 +1,319 @@ +import Nov15.CongestionI3 +import Nov15.CongestionI3DualAlg +import Nov15.CongestionI3DualSig +import Nov15.CongestionI3DualConst +import Nov15.CongestionI3DualData +import Nov15.CongestionI3DualNumC +import Nov15.CongestionI3DualCertC0 +import Nov15.CongestionI3DualCertC1 +import Nov15.CongestionI3DualCertC2 +import Nov15.CongestionI3DualCertC3 +import Nov15.CongestionNativeTab + +/-! +CONGESTION-NATIVE: the native-covering ceiling kappa <= .0136564 (own56, 8|9, m <= 5), the corrected form of +`CongestionI3Dual.ceiling_C2` (a COPY; the shipped files are unchanged). See CongestionNative.md for the hypothesis ledger. +Changes against ceiling_C2 (HC1-HC4, AUD, AUD2 FIX A-C): +* hcong* carries the owned surplus `Omega = dprice ks s + mr - (6 * 9^s + 10)` on the right (ks = descents + non-unit rises, mr = unit rises: FIX-1) and is + stated only for s in [.9, 1 - tC0]; `hE` is generalised to `Lj <= E + Omega` (`branchC_om`, `E_lower_cap_om`). +* ONE J throughout (J = J^arr, the arrival residual): hcong*, hdist and hJ all use the same variable `J`. +* The placeholder Props (Rank8C56, Prov) are gone; `ell`, `corr`, `cap` are concrete (`ellC`, `corrC`, `capC`); `LcTabC` is DERIVED from + rational tables (CongestionNativeTab) and the hypotheses hspMono/hcstMono/hspTab/hcstTab/hunitTab. +* `hcong_of_capclass` (+ PathCut.lean) formalises the accounting that proves hcong* from the Cap class. +-/ +namespace CongestionNative +open NumCertK JointCeiling CallerCost CongestionI3 CongestionI3Dual Finset + +/-! ### 0. copied from CongestionI3Dual (F_base monotonicity and point enclosures, own56 side) -/ +theorem Fc_monoOn (cf : CF) (hok : okR cf) (a b : ℚ) (ha : 0 ≤ a) (hb1 : b ≤ 1) (hd : 0 < dLo cf a b) + (s s' : ℝ) (h1 : (a : ℝ) ≤ s) (hss : s ≤ s') (h2 : s' ≤ (b : ℝ)) : Fc cf s ≤ Fc cf s' := by + have hab : (a : ℝ) ≤ b := le_trans h1 (le_trans hss h2) + have hcont : ContinuousOn (Fc cf) (Set.Icc (a : ℝ) b) := + fun x _ => (Fc_hasDerivAt cf hok x).continuousAt.continuousWithinAt + have hm : StrictMonoOn (Fc cf) (Set.Icc (a : ℝ) b) := by + apply strictMonoOn_of_deriv_pos (convex_Icc _ _) hcont + intro x hx + rw [interior_Icc] at hx + rw [(Fc_hasDerivAt cf hok x).deriv] + have := dFc_ge cf hok a b ha hb1 x hx.1.le hx.2.le + have hd' : (0:ℝ) < ((dLo cf a b : ℚ) : ℝ) := by exact_mod_cast hd + linarith + exact hm.monotoneOn ⟨h1, le_trans hss h2⟩ ⟨le_trans h1 hss, h2⟩ hss + +theorem cfC_monoOn (s s' : ℝ) (h1 : (93 / 100 : ℝ) ≤ s) (hss : s ≤ s') (h2 : s' ≤ ((sC : ℚ) : ℝ)) : Fc cfC s ≤ Fc cfC s' := + Fc_monoOn cfC cfC_ok (93 / 100) sC (by norm_num) (by unfold sC; norm_num) cfC_d s s' + (by rw [show (((93 / 100 : ℚ)) : ℝ) = 93 / 100 by norm_num]; exact h1) hss h2 + +theorem pt_of_Fup (cf : CF) (hok : okR cf) (q L : ℚ) (hq0 : 0 ≤ q) (hq1 : q ≤ 1) (h : Fup cf q q < 17 * L) : + Fc cf (q : ℝ) < 17 * (L : ℝ) := by + have h1 := Fc_le cf hok q q hq0 hq1 (q : ℝ) (le_refl _) (le_refl _) + have h2 : ((Fup cf q q : ℚ) : ℝ) < ((17 * L : ℚ) : ℝ) := by exact_mod_cast h + push_cast at h2 + linarith + +theorem hFbC_of (a b L : ℚ) (hb93 : 93 / 100 ≤ 1 - b) (hab : a ≤ b) (haA : 1 - a ≤ sC) (ha0 : 0 ≤ a) + (hpt : Fup cfC (1 - a) (1 - a) < 17 * L) : + ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (L : ℝ) := by + intro s h1 h2 + have hb : (((93 / 100 : ℚ)) : ℝ) ≤ s := le_trans (by exact_mod_cast hb93) h1 + have hb' : (93 / 100 : ℝ) ≤ s := by rwa [show (((93 / 100 : ℚ)) : ℝ) = 93 / 100 by norm_num] at hb + have hm := cfC_monoOn s ((1 - a : ℚ) : ℝ) hb' h2 (by exact_mod_cast haA) + exact lt_of_le_of_lt hm (pt_of_Fup cfC cfC_ok (1 - a) L (by linarith [(by exact_mod_cast hab : (a : ℚ) ≤ b)]) (by linarith) hpt) + +/-! ### 1. concrete definitions -/ + +/-- owned surplus: all owned moves `|k|^s` (ks = descents + non-unit rises, mr = unit rises, price 1 each) minus what `own56_floor` charges (6 * 9^s + 10). -/ +noncomputable def Omega (ks : List ℕ) (mr : ℕ) (s : ℝ) : ℝ := dprice ks s + mr - (6 * (9 : ℝ) ^ s + 10) +/-- per-cell cap `(9^s - 8^s) / 48` -/ +noncomputable def capC (s : ℝ) : ℝ := ((9 : ℝ) ^ s - (8 : ℝ) ^ s) / 48 +/-- lower bound of the capped per-cell distance: `min (spF (1 - s)) (cap s)` -/ +noncomputable def ellC (spF : ℝ → ℝ) (s : ℝ) : ℝ := min (spF (1 - s)) (capC s) +/-- LIFT1 rise correction `8 * cst(1 - s)` -/ +noncomputable def corrC (cstF : ℝ → ℝ) (s : ℝ) : ℝ := 8 * cstF (1 - s) + +/-! ### 2. two-sided I3 with the owned surplus on the right -/ +section Elower +variable {ι : Type*} [DecidableEq ι] + +/-- two-sided I3, cap/correction form with surplus: `sum min (dist, cap) - corr <= charges + Om` gives `E + Om >= 1936 ell - corr - m sigma`. -/ +theorem E_lower_cap_om (R : Finset ι) (n : ι → ℕ) (d : ι → ℕ → ℕ) (J : Finset (ℕ × ℕ)) (dist : ℕ × ℕ → ℝ) + (E s cap corr ell σ Om : ℝ) (m : ℕ) + (hmono : ∀ r ∈ R, ∀ i < n r, d r i ≤ d r (i + 1)) (hd9 : ∀ r ∈ R, d r (n r) ≤ 9) + (hm : (R.filter fun r => Mixed d n r).card ≤ m) (hσ0 : 0 ≤ σ) + (hσ : ∀ a b : ℕ, 1 ≤ a → a ≤ b → b ≤ 8 → c2 (gs s) (a : ℝ) (b : ℝ) ≤ σ) + (hcong : ∑ p ∈ J, min (dist p) cap - corr ≤ ∑ r ∈ R, ∑ i ∈ range (n r), c2 (gs s) (lev d r i) (lev d r (i + 1)) + Om) + (hEex : ∑ r ∈ R, ex (gs s) (lev d r) (n r) ≤ E) (hdist : ∀ p ∈ J, ell ≤ min (dist p) cap) (hJ : 1936 ≤ J.card) (hell : 0 ≤ ell) : + 1936 * ell - corr - m * σ ≤ E + Om := by + have h1 := sum_all_c2_le (gs s) (gs_zero s) R n d hmono hd9 m hm σ hσ0 hσ + have h2 := Finset.card_nsmul_le_sum J (fun p => min (dist p) cap) ell hdist + rw [nsmul_eq_mul] at h2 + have hj : (1936 : ℝ) ≤ J.card := by exact_mod_cast hJ + nlinarith + +end Elower + +/-! ### 3. the branch with the surplus (the 88c branch is only needed for t >= .1) -/ + +theorem branchC_om (n : Inv) (ks : List ℕ) (mr : ℕ) (E Lj s : ℝ) + (hF : Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E) + (hE : Lj ≤ E + Omega ks mr s) (hFb : Fc cfC s < 17 * Lj) : + Finv s (invoice (caller 6 7) n 17) < 0 := by + have h1' : Finv s n ≤ -400 * (8 : ℝ) ^ s - (6 * (9 : ℝ) ^ s + 10) - Lj := by + unfold Omega at hE; linarith + have h2 := invoice_F s (caller 6 7) n 17 + have h3 := invoice_F s (caller 6 7) natBaseC 17 + have h4 := natBaseC_F s + have h6 := baseC_eq s + push_cast at h2 h3 + nlinarith + +/-! ### 4. the Cap-class accounting (HC1 sec. 2): hcong* from legal + transported cells -/ + +/-- `J` splits into LEGAL cells (a descent-free D_t-confined path: I3 charge + rise saving `cst * Rm`) and TRANSPORTED cells (cut at an owned descent, `<= 48 * Nf` of them, each at most `cap = U/48`). +Then `sum min - 8 cst <= Pub + Om` as soon as the Cap class inequality `cst (Rm - 8) + U Nf <= Om` holds. -/ +theorem hcong_of_capclass (J : Finset (ℕ × ℕ)) (leg : ℕ × ℕ → Prop) [DecidablePred leg] (dist : ℕ × ℕ → ℝ) + (cap U Pub cst Rm Nf Om : ℝ) (hcap : cap = U / 48) (hU : 0 ≤ U) + (hleg : ∑ p ∈ J.filter leg, dist p ≤ Pub + cst * Rm) + (hT : ((J.filter fun p => ¬ leg p).card : ℝ) ≤ 48 * Nf) + (hclass : cst * (Rm - 8) + U * Nf ≤ Om) : + ∑ p ∈ J, min (dist p) cap - 8 * cst ≤ Pub + Om := by + have hsplit := Finset.sum_filter_add_sum_filter_not J leg (fun p => min (dist p) cap) + have h1 : ∑ p ∈ J.filter leg, min (dist p) cap ≤ ∑ p ∈ J.filter leg, dist p := + Finset.sum_le_sum fun p _ => min_le_left _ _ + have h2 : ∑ p ∈ J.filter (fun p => ¬ leg p), min (dist p) cap ≤ ∑ _p ∈ J.filter (fun p => ¬ leg p), cap := + Finset.sum_le_sum fun p _ => min_le_right _ _ + rw [Finset.sum_const, nsmul_eq_mul] at h2 + have hc0 : 0 ≤ cap := by rw [hcap]; positivity + have h3 : ((J.filter fun p => ¬ leg p).card : ℝ) * cap ≤ 48 * Nf * cap := mul_le_mul_of_nonneg_right hT hc0 + have h4 : 48 * Nf * cap = U * Nf := by rw [hcap]; ring + nlinarith + +/-! ### 5. the derived table `LcTabC` -/ + +theorem unit_mono (s s' : ℝ) (hs : 0 ≤ s) (h : s ≤ s') : (9 : ℝ) ^ s - (8 : ℝ) ^ s ≤ (9 : ℝ) ^ s' - (8 : ℝ) ^ s' := by + have e : ∀ x : ℝ, (9 : ℝ) ^ x - (8 : ℝ) ^ x = (8 : ℝ) ^ x * (((9 : ℝ) / 8) ^ x - 1) := by + intro x + have h9 : (9 : ℝ) ^ x = (8 : ℝ) ^ x * ((9 : ℝ) / 8) ^ x := by + rw [← Real.mul_rpow (by norm_num) (by norm_num)]; norm_num + rw [h9]; ring + rw [e, e] + have h1 : (8 : ℝ) ^ s ≤ (8 : ℝ) ^ s' := Real.rpow_le_rpow_of_exponent_le (by norm_num) h + have h2 : ((9 : ℝ) / 8) ^ s ≤ ((9 : ℝ) / 8) ^ s' := Real.rpow_le_rpow_of_exponent_le (by norm_num) h + have h3 : (1 : ℝ) ≤ ((9 : ℝ) / 8) ^ s := Real.one_le_rpow (by norm_num) hs + exact mul_le_mul h1 (by linarith) (by linarith) (by positivity) + +/-- one t-piece `[a, b]` of the own56 table: `lcp <= 1936 ell - corr` follows from the rational table and endpoint hypotheses (monotonicity of spF and cst in t). -/ +theorem tab_piece (spF cstF : ℝ → ℝ) (a b : ℚ) (lcp cH spLo unLo : ℚ) (hlcp : 0 ≤ lcp) (hcH : 0 ≤ cH) (ha0 : tC0 ≤ a) (hab : a ≤ b) (hb : b ≤ 1 / 10) + (hmS : MonotoneOn spF (Set.Icc ((tC0 : ℚ) : ℝ) (1 / 10))) (hmC : MonotoneOn cstF (Set.Icc ((tC0 : ℚ) : ℝ) (1 / 10))) + (hsp : (spLo : ℝ) ≤ spF (a : ℝ)) (hcs : cstF (b : ℝ) ≤ cH) + (hun : (unLo : ℝ) ≤ (9 : ℝ) ^ (1 - (b : ℝ)) - (8 : ℝ) ^ (1 - (b : ℝ))) + (hn1 : lcp + 8 * cH ≤ 1936 * spLo) (hn2 : lcp + 8 * cH ≤ 1936 * (unLo / 48)) : + ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → (lcp : ℝ) ≤ 1936 * ellC spF s - corrC cstF s ∧ 0 ≤ ellC spF s := by + intro s h1 h2 + push_cast at h1 h2 + have ha' : ((tC0 : ℚ) : ℝ) ≤ a := by exact_mod_cast ha0 + have hab' : (a : ℝ) ≤ b := by exact_mod_cast hab + have hb' : (b : ℝ) ≤ 1 / 10 := by + have := (Rat.cast_le (K := ℝ)).mpr hb + push_cast at this; exact this + have htl : (a : ℝ) ≤ 1 - s := by linarith + have htu : 1 - s ≤ (b : ℝ) := by linarith + have hspt : spF a ≤ spF (1 - s) := hmS ⟨ha', by linarith⟩ ⟨by linarith, by linarith⟩ htl + have hcst : cstF (1 - s) ≤ cstF b := hmC ⟨by linarith, by linarith⟩ ⟨by linarith, hb'⟩ htu + have hcap : (unLo : ℝ) / 48 ≤ capC s := by + have := unit_mono (1 - b) s (by linarith) h1 + unfold capC; linarith + have hell : min (spLo : ℝ) ((unLo : ℝ) / 48) ≤ ellC spF s := by + unfold ellC + exact le_min (le_trans (min_le_left _ _) (by linarith)) (le_trans (min_le_right _ _) hcap) + have hcorr : corrC cstF s ≤ 8 * (cH : ℝ) := by unfold corrC; linarith + have hn1' : (lcp : ℝ) + 8 * cH ≤ 1936 * spLo := by exact_mod_cast hn1 + have hn2' : (lcp : ℝ) + 8 * cH ≤ 1936 * ((unLo : ℝ) / 48) := by exact_mod_cast hn2 + have hl0 : (0 : ℝ) ≤ lcp := by exact_mod_cast hlcp + have hc0 : (0 : ℝ) ≤ cH := by exact_mod_cast hcH + rcases le_total (spLo : ℝ) ((unLo : ℝ) / 48) with hh | hh + · rw [min_eq_left hh] at hell; exact ⟨by linarith, by linarith⟩ + · rw [min_eq_right hh] at hell; exact ⟨by linarith, by linarith⟩ + +/-! ### 6. the native-covering ceiling -/ + +/-- **native-covering ceiling.** For a word whose public registers have at most 5 mixed registers (`hmix`) and whose owned layer splits as `ks` (descents + non-unit rises) and `mr` (unit rises), +if the congestion step `hcong` (with the owned surplus), the distance floor `hdist`, `hJ` (|J| >= 1936) hold for ONE set `J` (= J^arr), together with the accounting identities and the +certified tables, then `F(1 - t, invoice (caller 6 7) n 17) < 0` for all t in [tC0, 1], i.e. kappa <= tC0 = .0136564 (8|9). Every hypothesis is listed in CongestionNative.md. -/ +theorem ceiling_native {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tC0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tC0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 1936 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tC0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tC0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hunitTab : ((unitLoC0 : ℚ) : ℝ) ≤ (9 : ℝ) ^ (1 - ((tC1 : ℚ) : ℝ)) - (8 : ℝ) ^ (1 - ((tC1 : ℚ) : ℝ)) ∧ + ((unitLoC1 : ℚ) : ℝ) ≤ (9 : ℝ) ^ (1 - ((tC2 : ℚ) : ℝ)) - (8 : ℝ) ^ (1 - ((tC2 : ℚ) : ℝ)) ∧ + ((unitLoC2 : ℚ) : ℝ) ≤ (9 : ℝ) ^ (1 - ((tC3 : ℚ) : ℝ)) - (8 : ℝ) ^ (1 - ((tC3 : ℚ) : ℝ)) ∧ + ((unitLoC3 : ℚ) : ℝ) ≤ (9 : ℝ) ^ (1 - (1 / 10 : ℝ)) - (8 : ℝ) ^ (1 - (1 / 10 : ℝ))) : + ∀ t : ℝ, ((tC0 : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + have piece : ∀ (a b lcp σ : ℚ), sigOK (1 - b) (1 - a) σ = true → 0 ≤ σ → tC0 ≤ a → a ≤ b → b ≤ 1 / 10 → 0 ≤ lcp → + (∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → (lcp : ℝ) ≤ 1936 * ellC spF s - corrC cstF s ∧ 0 ≤ ellC spF s) → + (∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (((lcp - 5 * σ : ℚ)) : ℝ)) → + ∀ t : ℝ, (a : ℝ) ≤ t → t ≤ (b : ℝ) → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + intro a b lcp σ hσc hσ0 ha0 hab hb hl0 hLcp hFb t h1 h2 + have ha0q : (0 : ℚ) ≤ a := le_trans (by unfold tC0; norm_num) ha0 + have ha0' : ((tC0 : ℚ) : ℝ) ≤ a := by exact_mod_cast ha0 + have hb' : (b : ℝ) ≤ 1 / 10 := by + have := (Rat.cast_le (K := ℝ)).mpr hb + push_cast at this; exact this + have hab' : (a : ℝ) ≤ b := by exact_mod_cast hab + have hA0 : (0 : ℝ) ≤ a := by exact_mod_cast ha0q + have hs0 : 0 ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + have hσ : ∀ a' b' : ℕ, 1 ≤ a' → a' ≤ b' → b' ≤ 8 → c2 (gs (1 - t)) (a' : ℝ) (b' : ℝ) ≤ (σ : ℝ) := by + intro a' b' h1' h2' h3' + exact sig_of_ok (1 - b) (1 - a) σ hσc (by linarith) (by linarith) hσ0 (1 - t) + (by push_cast; linarith) (by push_cast; linarith) a' b' h1' h2' h3' + have hl0' : (0 : ℝ) ≤ lcp := by exact_mod_cast hl0 + have hLcp' := hLcp (1 - t) (by push_cast; linarith) (by push_cast; linarith) + have hslo : (9 / 10 : ℝ) ≤ 1 - t := by linarith + have hshi : 1 - t ≤ 1 - ((tC0 : ℚ) : ℝ) := by linarith + have hell : 0 ≤ ellC spF (1 - t) := hLcp'.2 + have hE := E_lower_cap_om R nR dR J (distF (1 - t)) (E (1 - t)) (1 - t) (capC (1 - t)) (corrC cstF (1 - t)) (ellC spF (1 - t)) + (σ : ℝ) (Omega ks mr (1 - t)) 5 hmono hd9 hmix (by exact_mod_cast hσ0) hσ (hcong (1 - t) hslo hshi) (hEex _ hs0 hs1) + (fun p hp => le_min (le_trans (min_le_left _ _) (hdist (1 - t) hslo hshi p hp)) (min_le_right _ _)) hJ hell + have hE' : (((lcp - 5 * σ : ℚ)) : ℝ) ≤ E (1 - t) + Omega ks mr (1 - t) := by push_cast; push_cast at hE; linarith [hLcp'.1] + exact branchC_om n ks mr (E (1 - t)) _ (1 - t) (hF _ hs0 hs1) hE' + (hFb (1 - t) (by push_cast; linarith) (by push_cast; linarith)) + intro t ht ht1 + have htC0 : (0 : ℝ) ≤ ((tC0 : ℚ) : ℝ) := by unfold tC0; norm_num + have hs0 : (0 : ℝ) ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + have hu1 : (1 : ℝ) ≤ (2 : ℝ) ^ (1 - t) := Real.one_le_rpow (by norm_num) hs0 + have hu2 : (2 : ℝ) ^ (1 - t) ≤ 2 := by + have := Real.rpow_le_rpow_of_exponent_le (show (1 : ℝ) ≤ 2 by norm_num) hs1; simpa using this + have hE0 : 0 ≤ E (1 - t) := + le_trans (mul_nonneg (by linarith) (Nat.cast_nonneg st)) (hst _ hs0 hs1) + rcases le_or_gt (1 / 10 : ℝ) t with h10 | h10 + · have h2 := invoice_F (1 - t) (caller 6 7) n 17 + have h3 := invoice_F (1 - t) (caller 6 7) natBaseC 17 + have h4 := natBaseC_F (1 - t) + push_cast at h2 h3 + have h1 := own56_floor (1 - t) hs0 hs1 ks hk hmass hmd mr st hmr (Finv (1 - t) n) (E (1 - t)) 0 (hF _ hs0 hs1) hY + (hst _ hs0 hs1) hE0 + have hc0 : (0 : ℝ) ≤ 88 * (2 - (2 : ℝ) ^ (1 - t)) := by linarith + rw [max_eq_left hc0] at h1 + have h5 := cfC88_neg (1 - t) hs0 (by linarith) + have h6 := base88_eq (1 - t) + nlinarith + · obtain ⟨sp0, sp1, sp2, sp3⟩ := hspTab + obtain ⟨cs0, cs1, cs2, cs3⟩ := hcstTab + obtain ⟨un0, un1, un2, un3⟩ := hunitTab + have q01 : tC0 ≤ tC1 := by unfold tC0 tC1; norm_num + have q12 : tC1 ≤ tC2 := by unfold tC1 tC2; norm_num + have q23 : tC2 ≤ tC3 := by unfold tC2 tC3; norm_num + have q3 : tC3 ≤ 1 / 10 := by unfold tC3; norm_num + have lcp0 : ∀ q : ℚ, q = lcpC0 ∨ q = lcpC1 ∨ q = lcpC2 ∨ q = lcpC3 → 0 ≤ q := by + intro q h; unfold lcpC0 lcpC1 lcpC2 lcpC3 at h; rcases h with h | h | h | h <;> rw [h] <;> norm_num + have cH0 : ∀ q : ℚ, q = cHC0 ∨ q = cHC1 ∨ q = cHC2 ∨ q = cHC3 → 0 ≤ q := by + intro q h; unfold cHC0 cHC1 cHC2 cHC3 at h; rcases h with h | h | h | h <;> rw [h] <;> norm_num + have e1 : ((tC0 : ℚ) : ℝ) ≤ ((tC1 : ℚ) : ℝ) := by exact_mod_cast q01 + have e2 : ((tC1 : ℚ) : ℝ) ≤ ((tC2 : ℚ) : ℝ) := by exact_mod_cast q12 + have e3 : ((tC2 : ℚ) : ℝ) ≤ ((tC3 : ℚ) : ℝ) := by exact_mod_cast q23 + by_cases k1 : t ≤ ((tC1 : ℚ) : ℝ) + · exact piece tC0 tC1 lcpC0 sgC0 sigC0 (by unfold sgC0; norm_num) (le_refl _) q01 (by linarith) (lcp0 _ (Or.inl rfl)) + (tab_piece spF cstF tC0 tC1 lcpC0 cHC0 spFloC0 unitLoC0 (lcp0 _ (Or.inl rfl)) (cH0 _ (Or.inl rfl)) (le_refl _) q01 (by linarith) + hspMono hcstMono sp0 cs0 un0 tabC0.1 tabC0.2) + (hFbC_of tC0 tC1 LC0 (by unfold tC1; norm_num) q01 (by unfold tC0 sC; norm_num) (by unfold tC0; norm_num) ptC0) t ht k1 + by_cases k2 : t ≤ ((tC2 : ℚ) : ℝ) + · exact piece tC1 tC2 lcpC1 sgC1 sigC1 (by unfold sgC1; norm_num) q01 q12 (by linarith) (lcp0 _ (Or.inr (Or.inl rfl))) + (tab_piece spF cstF tC1 tC2 lcpC1 cHC1 spFloC1 unitLoC1 (lcp0 _ (Or.inr (Or.inl rfl))) (cH0 _ (Or.inr (Or.inl rfl))) q01 q12 (by linarith) + hspMono hcstMono sp1 cs1 un1 tabC1.1 tabC1.2) + (hFbC_of tC1 tC2 LC1 (by unfold tC2; norm_num) q12 (by unfold tC1 sC; norm_num) (by unfold tC1; norm_num) ptC1) t + (by push Not at k1; exact k1.le) k2 + by_cases k3 : t ≤ ((tC3 : ℚ) : ℝ) + · exact piece tC2 tC3 lcpC2 sgC2 sigC2 (by unfold sgC2; norm_num) (le_trans q01 q12) q23 (by linarith) (lcp0 _ (Or.inr (Or.inr (Or.inl rfl)))) + (tab_piece spF cstF tC2 tC3 lcpC2 cHC2 spFloC2 unitLoC2 (lcp0 _ (Or.inr (Or.inr (Or.inl rfl)))) (cH0 _ (Or.inr (Or.inr (Or.inl rfl)))) + (le_trans q01 q12) q23 (by linarith) hspMono hcstMono sp2 cs2 un2 tabC2.1 tabC2.2) + (hFbC_of tC2 tC3 LC2 (by unfold tC3; norm_num) q23 (by unfold tC2 sC; norm_num) (by unfold tC2; norm_num) ptC2) t + (by push Not at k2; exact k2.le) k3 + · have h110 : (((1 / 10 : ℚ)) : ℝ) = 1 / 10 := by norm_num + refine piece tC3 (1 / 10) lcpC3 sgC3 ?_ (by unfold sgC3; norm_num) (le_trans q01 (le_trans q12 q23)) q3 (le_refl _) + (lcp0 _ (Or.inr (Or.inr (Or.inr rfl)))) ?_ ?_ t (by push Not at k3; exact k3.le) (by push_cast; exact h10.le) + · rw [show (1 - 1 / 10 : ℚ) = 9 / 10 by norm_num]; exact sigC3 + · refine tab_piece spF cstF tC3 (1 / 10) lcpC3 cHC3 spFloC3 unitLoC3 (lcp0 _ (Or.inr (Or.inr (Or.inr rfl)))) (cH0 _ (Or.inr (Or.inr (Or.inr rfl)))) + (le_trans q01 (le_trans q12 q23)) q3 (le_refl _) hspMono hcstMono sp3 ?_ ?_ tabC3.1 tabC3.2 + · rw [h110]; exact cs3 + · rw [h110]; exact un3 + · intro s hs1' hs2' + have hsC' : s ≤ ((sC : ℚ) : ℝ) := by + have : (1 : ℚ) - tC3 ≤ sC := by unfold tC3 sC; norm_num + have h' : (((1 - tC3 : ℚ)) : ℝ) ≤ ((sC : ℚ) : ℝ) := by exact_mod_cast this + linarith + have h9 : (9 / 10 : ℝ) ≤ s := by + have : ((((1 - 1 / 10 : ℚ)) : ℚ) : ℝ) = 9 / 10 := by norm_num + linarith + have := cfC_neg s h9 hsC' + have h7 : ((liftC : ℚ) : ℝ) ≤ 17 * (((lcpC3 - 5 * sgC3 : ℚ)) : ℝ) := by + have : liftC ≤ 17 * LC3 := LC3_ge + exact_mod_cast this + linarith + +end CongestionNative + +#print axioms CongestionNative.E_lower_cap_om +#print axioms CongestionNative.branchC_om +#print axioms CongestionNative.hcong_of_capclass +#print axioms CongestionNative.unit_mono +#print axioms CongestionNative.tab_piece +#print axioms CongestionNative.ceiling_native diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNative.md b/research/p104-reader-ceiling/lean/Nov15/CongestionNative.md new file mode 100644 index 0000000000..ea9a98b175 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNative.md @@ -0,0 +1,33 @@ +# CongestionNative.lean (+ CongestionNativeTab.lean, PathCut.lean): the native-covering ceiling kappa <= .0136564 +Copy of the own56 half of CongestionI3Dual*.lean (shipped files untouched), with the HC1-HC4 / AUD / AUD2 edits. Kernel only: no sorry, no native_decide; `#print axioms` of every theorem = [propext, Classical.choice, Quot.sound]. Builds (runlean.sh, one at a time): CongestionNativeTab 10 s / 1.3 GB, PathCut 4 s / 1.4 GB, CongestionNative 11 s / 3.0 GB. + +## What changed against `ceiling_C2` (all done) +- hcong* has the owned surplus on the right: `Omega ks mr s = dprice ks s + mr - (6*9^s+10)`; ks = 24 descents + 13 non-unit rises (sum 102), mr = 10 unit rises (AUD FIX-1; the literal split gives Omega 16.1 < 24.8 and is out of class); stated only for s in [.9, 1 - tC0]. +- `hE` generalised to `Lj <= E + Omega` (`E_lower_cap_om`, `branchC_om`). Omega cancels, so tC0 = .0136564 is unchanged. `branchC_om` needs no ks-hypotheses; hk/hmass/hmd/hmr are used only in the t >= .1 branch (own56_floor, 88c). +- ONE J: a single `J : Finset (ℕ × ℕ)` in hcong, hdist, hJ. It is J^arr (the arrival residual) by interpretation; Lean cannot see that, it is a name for the set the data hypotheses are about. +- FIX C: `Rank8C56`, `Prov`, `PlaneSep`, `MV` are gone. No bare `Prop` stands in for a condition. `ell`, `corr`, `cap` are concrete: `ellC spF s = min (spF (1-s)) (capC s)`, `capC s = (9^s-8^s)/48`, `corrC cstF s = 8 * cstF (1-s)`. +- `LcTabC` is no longer a hypothesis: it is DERIVED (`tab_piece`, `unit_mono` proved) from the rational tables of CongestionNativeTab (outward-rounded, emitted from hc9's 80-digit Decimals; the arithmetic `lcp_j + 8 cH_j <= 1936 min(spFlo_j, unitLo_j/48)` is norm_num-proved) and the hypotheses 11-13 below. +- PathCut.lean: `path_cut` PROVED (abstract: preorder of charts, monotone `Hold`, public edges ascend, owned edges NESTED (FIX A), confinement to G; conclusion: legal path, or a first owned strict descent dropping u_s with all earlier charts holding u_s and c_i <= G). `nested_needed`: Lean counterexample (lateral owned move {0} -> {1}) showing the nestedness premise cannot be dropped. `transported_card_le`: |Jt| <= 48 |V| from the 48-law and "every transported cell lies in cells(visit)". +- `hcong_of_capclass` PROVED: legal cells (charge `Pub + cst*Rm`) + transported cells (`<= 48 Nf`, cap U/48) + Cap class `cst (Rm-8) + U Nf <= Omega` give hcong*. It is the accounting of HC1 sec. 2, not used inside `ceiling_native` (which takes hcong* itself). +No paper statement was found false as written. Known and already encoded: hcong* fails for the natives at t > ~.507 (hence the s-range); the literal ks/mr split is out of class (hence FIX-1). + +## `ceiling_native`: EVERY hypothesis (status for st1 / #7637 / x1t2a; "Lean" = what the kernel checked) +Lean treats R, n, ks, mr, st, E, J, distF, spF, cstF as abstract data. The statement is: IF the listed facts hold for these objects THEN F(1-t, invoice (caller 6 7) n 17) < 0 for t in [tC0, 1]. **That st1, #7637 and x1t2a satisfy the hypotheses (class membership) rests on the computed facts below, not on Lean.** One owned layer is shared by all three words (one data point, not three). +1. hmono, hd9 (public registers ascend, end <= 9): natives: computed fact (0 non-ascending public moves; WHOLEFLOOR/hcong/audit/au2.py, audit2/aud2a.py). +2. hmix (<= 5 mixed registers): natives: computed fact (hmix = 5, aud2a.py). +3. hk, hmass, hmd, hmr (ks/mr split, ranks <= 6 in [1,9], sum 102 >= 56, length 37 >= 8, mr 10 >= 8): natives: computed fact (au1.py, aud2a.py). +4. hF (F-currency identity, equality up to float noise): natives: computed fact (hc6.py, aud2a.py; needs all 400 mains to span 8). +5. hY (104 <= st + 47, st = 1266): natives: computed fact (aud2a.py). +6. hst (slack >= 158 on the grid; 0 only at s = 1): natives: computed fact (hc6.py, aud2a.py). +7. hEex (E >= sum of register excesses; identity): proved as an identity on the natives (hc6.py); open as a general lemma outside the natives. +8. **hcong\*** (sum_J min(dist,cap) - 8 cst <= sum_pub c2 + Omega, s in [.9, 1-tC0]): paper-proved on the Cap class from Path-Cut + I3 + rise charge (PV1 sec. 3, HC1 sec. 2); in Lean only `path_cut`, `transported_card_le`, `hcong_of_capclass` (the combinatorial/arithmetic parts) are proved; the register-machine facts (SP span law, D_t-confined ADD path, I3 distance bound) are NOT formalised. Natives: computed fact: Cap margin Omega - cst(Rm-8) - U Nf >= 19.356 on [.9, 1-tC0] (Omega 47.995, Nf 24, Rm 56); 6124 public moves nested strict ascents, 47 owned moves nested (23 up, 24 down), 207,881 ADDs same chart; all 4962 cells have a legal owned-descent-free path (WHOLEFLOOR/hcong/audit/au1.py, audit2/aud2a.py, prov/pv1-pv4.py). 48-law: computed exhaustively (aud2d.py, max n*m = 48 over all 1,398,491 port-spanned subspaces of dim <= 4; natives max 24, hc8.py). +9. hdist (spF(1-s) <= distF s p for p in J): paper-proved (I3 path bound, ID1, audited); Lean: hypothesis. Natives: covered by the same computed census as 8. +10. **hJ (1936 <= |J^arr|)**: HYPOTHESIS, and for the general Desc56 class a CONJECTURE (AUD2 FIX B: rigidity is numerical, span-form L1-L3 and shared carriers open). Natives: computed fact: |J^arr| = 4962 (aud2b.py exact mod 2^61-1; hc11.py; 2536 forced cells on route flags). +11. hspMono, hcstMono (spF, cst nondecreasing in t on [tC0, 1/10]): paper-proved (HC3: psi = x^s ln x convex, superadditive, so c2 nondecreasing in t); Lean: NOT proved (spF is a min over a 230+dual shape DAG, not defined in Lean); kept as named hypotheses. +12. hspTab, hcstTab (spFlo_j <= spF(tC_j); cst(t_{j+1}) <= cH_j): computed fact, outward-rounded (hc9.py / hc9.log "ALL TABLE ENTRIES CERTIFIED", relative slack ~1e-9); Lean: hypotheses over certified rationals, arithmetic proved (CongestionNativeTab). +13. hunitTab (unitLo_j <= 9^s - 8^s at s = 1 - t_{j+1}): computed fact (hc9.py unit_lo, Decimal 80 digits, outward); Lean: hypothesis (rpow numerics not kernel-checked). +Proved inside Lean (not hypotheses): sigma certificates sigC0..3, F_base point enclosures ptC0..2, tail cfC_neg/cfC88_neg, own56_floor, two-sided I3 (`E_lower_cap_om`), branches, table derivation. + +## Not covered / open +- Class extension (Desc56 in general, >= 9-row and network decoders, non-Desc56 words): open; Rank8C56 rigidity [Q] enters only through hJ. +- Hypotheses 8, 9, 11 are the formalisation gaps (statements about the register machine and the shape DAG); 10 is a conjecture beyond the natives; 12-13 are certified numerics outside the kernel. diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJ.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJ.lean new file mode 100644 index 0000000000..67279ebd4c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJ.lean @@ -0,0 +1,213 @@ +import Nov15.CongestionNative +import Nov15.CongestionNativeJSig0 +import Nov15.CongestionNativeJSig1 +import Nov15.CongestionNativeJSig2 +import Nov15.CongestionNativeJPt0 +import Nov15.CongestionNativeJPt1 +import Nov15.CongestionNativeJPt2 +import Nov15.CongestionNativeJD +import Nov15.CongestionNativeJUnit + +/-! +CONGESTION-NATIVE-J: `ceiling_native` with the junk count hypothesis raised to `hJ : 4962 ≤ |J|` +(the COMPUTED |J^arr| of the natives st1 / #7637 / x1t2a / #7660-e1). Conclusion: F(1 - t, invoice (caller 6 7) n 17) < 0 for t in [tJ0, 1], +tJ0 = .0118103, i.e. kappa <= .0118103 (own56, m <= 5) for every word satisfying the hypotheses. +* [tC0, 1]: `ceiling_native` itself (its hypotheses are restrictions of the ones here; its unit table is now kernel-proved, `unit_of_Fup`). +* [tJ0, tC0]: three new pieces (CongestionNativeJ{Defs,Sig*,Pt*,D,Unit}): kernel sigma certificates, kernel F_base point enclosures, + kernel derivative bound of F_base on [.93, 1 - tJ0], kernel unit lower bounds, norm_num table arithmetic with N = 4962. +Hypotheses that are still data (same status as in ceiling_native): hcong*, hdist (now on s in [.9, 1 - tJ0]), hJ (now 4962), hspMono/hcstMono +(now on [tJ0, 1/10]), hspTab/hcstTab (+ the three new spF / cst endpoint brackets). hunitTab is GONE (kernel). +The junk count `hJ`, `hcong` and `hdist` all refer to the same `J`; Lean does not tie `J` to any word. -/ +namespace CongestionNative +open NumCertK JointCeiling CallerCost CongestionI3 CongestionI3Dual Finset + +/-- kernel unit lower bound: `lo <= 9^(1-t) - 8^(1-t)` from a `Fup` enclosure of `8^s - 9^s`. -/ +theorem unit_of_Fup (t lo : ℚ) (h0 : 0 ≤ 1 - t) (h1 : 1 - t ≤ 1) (h : Fup unitCF (1 - t) (1 - t) < -lo) : + (lo : ℝ) ≤ (9 : ℝ) ^ (1 - (t : ℝ)) - (8 : ℝ) ^ (1 - (t : ℝ)) := by + have hF := Fc_le unitCF unitCF_ok (1 - t) (1 - t) h0 h1 (((1 - t : ℚ)) : ℝ) (le_refl _) (le_refl _) + have h2 : ((Fup unitCF (1 - t) (1 - t) : ℚ) : ℝ) < ((-lo : ℚ) : ℝ) := by exact_mod_cast h + have hc : (((1 - t : ℚ)) : ℝ) = 1 - (t : ℝ) := by push_cast; ring + rw [hc] at hF + have e : Fc unitCF (1 - (t : ℝ)) = (8 : ℝ) ^ (1 - (t : ℝ)) - (9 : ℝ) ^ (1 - (t : ℝ)) := by + simp [Fc, unitCF]; ring + rw [e] at hF + push_cast at h2 + linarith + +/-- two-sided I3 with a general junk count `Nn` in place of 1936. -/ +theorem E_lower_cap_omN {ι : Type*} [DecidableEq ι] (R : Finset ι) (n : ι → ℕ) (d : ι → ℕ → ℕ) (J : Finset (ℕ × ℕ)) (dist : ℕ × ℕ → ℝ) + (E s cap corr ell σ Om : ℝ) (m Nn : ℕ) + (hmono : ∀ r ∈ R, ∀ i < n r, d r i ≤ d r (i + 1)) (hd9 : ∀ r ∈ R, d r (n r) ≤ 9) + (hm : (R.filter fun r => Mixed d n r).card ≤ m) (hσ0 : 0 ≤ σ) + (hσ : ∀ a b : ℕ, 1 ≤ a → a ≤ b → b ≤ 8 → c2 (gs s) (a : ℝ) (b : ℝ) ≤ σ) + (hcong : ∑ p ∈ J, min (dist p) cap - corr ≤ ∑ r ∈ R, ∑ i ∈ range (n r), c2 (gs s) (lev d r i) (lev d r (i + 1)) + Om) + (hEex : ∑ r ∈ R, ex (gs s) (lev d r) (n r) ≤ E) (hdist : ∀ p ∈ J, ell ≤ min (dist p) cap) (hJ : Nn ≤ J.card) (hell : 0 ≤ ell) : + (Nn : ℝ) * ell - corr - m * σ ≤ E + Om := by + have h1 := sum_all_c2_le (gs s) (gs_zero s) R n d hmono hd9 m hm σ hσ0 hσ + have h2 := Finset.card_nsmul_le_sum J (fun p => min (dist p) cap) ell hdist + rw [nsmul_eq_mul] at h2 + have hj : (Nn : ℝ) ≤ J.card := by exact_mod_cast hJ + have h3 : (Nn : ℝ) * ell ≤ (J.card : ℝ) * ell := mul_le_mul_of_nonneg_right hj hell + linarith + +/-- one t-piece `[a, b]` with N = 4962 (copy of `tab_piece`, domain [tJ0, 1/10]). -/ +theorem tab_pieceJ (spF cstF : ℝ → ℝ) (a b : ℚ) (lcp cH spLo unLo : ℚ) (hlcp : 0 ≤ lcp) (hcH : 0 ≤ cH) (ha0 : tJ0 ≤ a) (hab : a ≤ b) (hb : b ≤ 1 / 10) + (hmS : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) (hmC : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hsp : (spLo : ℝ) ≤ spF (a : ℝ)) (hcs : cstF (b : ℝ) ≤ cH) + (hun : (unLo : ℝ) ≤ (9 : ℝ) ^ (1 - (b : ℝ)) - (8 : ℝ) ^ (1 - (b : ℝ))) + (hn1 : lcp + 8 * cH ≤ 4962 * spLo) (hn2 : lcp + 8 * cH ≤ 4962 * (unLo / 48)) : + ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → (lcp : ℝ) ≤ 4962 * ellC spF s - corrC cstF s ∧ 0 ≤ ellC spF s := by + intro s h1 h2 + push_cast at h1 h2 + have ha' : ((tJ0 : ℚ) : ℝ) ≤ a := by exact_mod_cast ha0 + have hab' : (a : ℝ) ≤ b := by exact_mod_cast hab + have hb' : (b : ℝ) ≤ 1 / 10 := by + have := (Rat.cast_le (K := ℝ)).mpr hb + push_cast at this; exact this + have htl : (a : ℝ) ≤ 1 - s := by linarith + have htu : 1 - s ≤ (b : ℝ) := by linarith + have hspt : spF a ≤ spF (1 - s) := hmS ⟨ha', by linarith⟩ ⟨by linarith, by linarith⟩ htl + have hcst : cstF (1 - s) ≤ cstF b := hmC ⟨by linarith, by linarith⟩ ⟨by linarith, hb'⟩ htu + have hcap : (unLo : ℝ) / 48 ≤ capC s := by + have := unit_mono (1 - b) s (by linarith) h1 + unfold capC; linarith + have hell : min (spLo : ℝ) ((unLo : ℝ) / 48) ≤ ellC spF s := by + unfold ellC + exact le_min (le_trans (min_le_left _ _) (by linarith)) (le_trans (min_le_right _ _) hcap) + have hcorr : corrC cstF s ≤ 8 * (cH : ℝ) := by unfold corrC; linarith + have hn1' : (lcp : ℝ) + 8 * cH ≤ 4962 * spLo := by exact_mod_cast hn1 + have hn2' : (lcp : ℝ) + 8 * cH ≤ 4962 * ((unLo : ℝ) / 48) := by exact_mod_cast hn2 + have hl0 : (0 : ℝ) ≤ lcp := by exact_mod_cast hlcp + have hc0 : (0 : ℝ) ≤ cH := by exact_mod_cast hcH + rcases le_total (spLo : ℝ) ((unLo : ℝ) / 48) with hh | hh + · rw [min_eq_left hh] at hell; exact ⟨by linarith, by linarith⟩ + · rw [min_eq_right hh] at hell; exact ⟨by linarith, by linarith⟩ + +theorem cfC_monoOnJ (s s' : ℝ) (h1 : (93 / 100 : ℝ) ≤ s) (hss : s ≤ s') (h2 : s' ≤ ((1 - tJ0 : ℚ) : ℝ)) : Fc cfC s ≤ Fc cfC s' := + Fc_monoOn cfC cfC_ok (93 / 100) (1 - tJ0) (by norm_num) (by unfold tJ0; norm_num) cfC_dJ s s' + (by rw [show (((93 / 100 : ℚ)) : ℝ) = 93 / 100 by norm_num]; exact h1) hss h2 + +theorem hFbJ_of (a b L : ℚ) (hb93 : 93 / 100 ≤ 1 - b) (hab : a ≤ b) (haJ : tJ0 ≤ a) + (hpt : Fup cfC (1 - a) (1 - a) < 17 * L) : + ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (L : ℝ) := by + intro s h1 h2 + have hb : (((93 / 100 : ℚ)) : ℝ) ≤ s := le_trans (by exact_mod_cast hb93) h1 + have hb' : (93 / 100 : ℝ) ≤ s := by rwa [show (((93 / 100 : ℚ)) : ℝ) = 93 / 100 by norm_num] at hb + have haA : (1 - a : ℚ) ≤ 1 - tJ0 := by linarith + have hm := cfC_monoOnJ s ((1 - a : ℚ) : ℝ) hb' h2 (by exact_mod_cast haA) + have hJ0 : (0 : ℚ) ≤ tJ0 := by unfold tJ0; norm_num + exact lt_of_le_of_lt hm (pt_of_Fup cfC cfC_ok (1 - a) L (by linarith) (by linarith) hpt) + +/-- **native-covering ceiling at the computed junk count.** Same statement as `ceiling_native` with `hJ : 4962 ≤ |J|`; hcong*/hdist on +s in [.9, 1 - tJ0]; monotonicity on [tJ0, 1/10]; three more endpoint brackets of spF / cst. Conclusion on t in [tJ0, 1]: kappa <= .0118103. -/ +theorem ceiling_native_J {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 4962 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hspTabJ : ((spFloJ0 : ℚ) : ℝ) ≤ spF ((tJ0 : ℚ) : ℝ) ∧ ((spFloJ1 : ℚ) : ℝ) ≤ spF ((tJ1 : ℚ) : ℝ) ∧ + ((spFloJ2 : ℚ) : ℝ) ≤ spF ((tJ2 : ℚ) : ℝ)) + (hcstTabJ : cstF ((tJ1 : ℚ) : ℝ) ≤ ((cHJ0 : ℚ) : ℝ) ∧ cstF ((tJ2 : ℚ) : ℝ) ≤ ((cHJ1 : ℚ) : ℝ) ∧ + cstF ((tC0 : ℚ) : ℝ) ≤ ((cHJ2 : ℚ) : ℝ)) : + ∀ t : ℝ, ((tJ0 : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + have qJC : tJ0 ≤ tC0 := by unfold tJ0 tC0; norm_num + have eJC : ((tJ0 : ℚ) : ℝ) ≤ ((tC0 : ℚ) : ℝ) := by exact_mod_cast qJC + intro t ht ht1 + rcases le_or_gt ((tC0 : ℚ) : ℝ) t with hC | hC + · -- [tC0, 1]: the shipped `ceiling_native` + have u0 := unit_of_Fup tC1 unitLoC0 (by unfold tC1; norm_num) (by unfold tC1; norm_num) unitC0' + have u1 := unit_of_Fup tC2 unitLoC1 (by unfold tC2; norm_num) (by unfold tC2; norm_num) unitC1' + have u2 := unit_of_Fup tC3 unitLoC2 (by unfold tC3; norm_num) (by unfold tC3; norm_num) unitC2' + have u3 := unit_of_Fup (1 / 10) unitLoC3 (by norm_num) (by norm_num) unitC3' + have h110 : (((1 / 10 : ℚ)) : ℝ) = 1 / 10 := by norm_num + rw [h110] at u3 + exact ceiling_native R nR dR hmono hd9 hmix n ks mr st E J distF spF cstF hk hmass hmd hmr hF hY hst hEex + (fun s h1 h2 => hcong s h1 (by linarith)) (fun s h1 h2 => hdist s h1 (by linarith)) (le_trans (by norm_num) hJ) + (hspMono.mono (Set.Icc_subset_Icc eJC (le_refl _))) (hcstMono.mono (Set.Icc_subset_Icc eJC (le_refl _))) + hspTab hcstTab ⟨u0, u1, u2, u3⟩ t hC ht1 + · -- [tJ0, tC0]: three new pieces with N = 4962 + have piece : ∀ (a b lcp σ : ℚ), sigOK (1 - b) (1 - a) σ = true → 0 ≤ σ → tJ0 ≤ a → a ≤ b → b ≤ tC0 → 0 ≤ lcp → + (∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → (lcp : ℝ) ≤ 4962 * ellC spF s - corrC cstF s ∧ 0 ≤ ellC spF s) → + (∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (((lcp - 5 * σ : ℚ)) : ℝ)) → + ∀ t : ℝ, (a : ℝ) ≤ t → t ≤ (b : ℝ) → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + intro a b lcp σ hσc hσ0 ha0 hab hb hl0 hLcp hFb t h1 h2 + have ha0q : (0 : ℚ) ≤ a := le_trans (by unfold tJ0; norm_num) ha0 + have ha0' : ((tJ0 : ℚ) : ℝ) ≤ a := by exact_mod_cast ha0 + have hbC : (b : ℝ) ≤ ((tC0 : ℚ) : ℝ) := by exact_mod_cast hb + have hC1 : ((tC0 : ℚ) : ℝ) ≤ 1 / 10 := by + have : tC0 ≤ 1 / 10 := by unfold tC0; norm_num + have := (Rat.cast_le (K := ℝ)).mpr this + push_cast at this; exact this + have hb' : (b : ℝ) ≤ 1 / 10 := le_trans hbC hC1 + have hA0 : (0 : ℝ) ≤ a := by exact_mod_cast ha0q + have hs0 : 0 ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + have hbq : b ≤ 1 / 10 := le_trans hb (by unfold tC0; norm_num) + have hσ : ∀ a' b' : ℕ, 1 ≤ a' → a' ≤ b' → b' ≤ 8 → c2 (gs (1 - t)) (a' : ℝ) (b' : ℝ) ≤ (σ : ℝ) := by + intro a' b' h1' h2' h3' + exact sig_of_ok (1 - b) (1 - a) σ hσc (by linarith) (by linarith) hσ0 (1 - t) + (by push_cast; linarith) (by push_cast; linarith) a' b' h1' h2' h3' + have hLcp' := hLcp (1 - t) (by push_cast; linarith) (by push_cast; linarith) + have hslo : (9 / 10 : ℝ) ≤ 1 - t := by linarith + have hshi : 1 - t ≤ 1 - ((tJ0 : ℚ) : ℝ) := by linarith + have hell : 0 ≤ ellC spF (1 - t) := hLcp'.2 + have hE := E_lower_cap_omN R nR dR J (distF (1 - t)) (E (1 - t)) (1 - t) (capC (1 - t)) (corrC cstF (1 - t)) (ellC spF (1 - t)) + (σ : ℝ) (Omega ks mr (1 - t)) 5 4962 hmono hd9 hmix (by exact_mod_cast hσ0) hσ (hcong (1 - t) hslo hshi) (hEex _ hs0 hs1) + (fun p hp => le_min (le_trans (min_le_left _ _) (hdist (1 - t) hslo hshi p hp)) (min_le_right _ _)) hJ hell + have hE' : (((lcp - 5 * σ : ℚ)) : ℝ) ≤ E (1 - t) + Omega ks mr (1 - t) := by + push_cast; push_cast at hE; linarith [hLcp'.1] + exact branchC_om n ks mr (E (1 - t)) _ (1 - t) (hF _ hs0 hs1) hE' + (hFb (1 - t) (by push_cast; linarith) (by push_cast; linarith)) + obtain ⟨sp0, sp1, sp2⟩ := hspTabJ + obtain ⟨cs0, cs1, cs2⟩ := hcstTabJ + have q01 : tJ0 ≤ tJ1 := by unfold tJ0 tJ1; norm_num + have q12 : tJ1 ≤ tJ2 := by unfold tJ1 tJ2; norm_num + have q2C : tJ2 ≤ tC0 := by unfold tJ2 tC0; norm_num + have qC : tC0 ≤ 1 / 10 := by unfold tC0; norm_num + have un0 := unit_of_Fup tJ1 unitLoJ0 (by unfold tJ1; norm_num) (by unfold tJ1; norm_num) unitJ0 + have un1 := unit_of_Fup tJ2 unitLoJ1 (by unfold tJ2; norm_num) (by unfold tJ2; norm_num) unitJ1 + have un2 := unit_of_Fup tC0 unitLoJ2 (by unfold tC0; norm_num) (by unfold tC0; norm_num) unitJ2 + have l0 : (0 : ℚ) ≤ lcpJ0 := by unfold lcpJ0; norm_num + have l1 : (0 : ℚ) ≤ lcpJ1 := by unfold lcpJ1; norm_num + have l2 : (0 : ℚ) ≤ lcpJ2 := by unfold lcpJ2; norm_num + have c0 : (0 : ℚ) ≤ cHJ0 := by unfold cHJ0; norm_num + have c1 : (0 : ℚ) ≤ cHJ1 := by unfold cHJ1; norm_num + have c2' : (0 : ℚ) ≤ cHJ2 := by unfold cHJ2; norm_num + have e1 : ((tJ1 : ℚ) : ℝ) ≤ ((tJ2 : ℚ) : ℝ) := by exact_mod_cast q12 + by_cases k1 : t ≤ ((tJ1 : ℚ) : ℝ) + · exact piece tJ0 tJ1 lcpJ0 sgJ0 sigJ0 (by unfold sgJ0; norm_num) (le_refl _) q01 (le_trans q12 q2C) l0 + (tab_pieceJ spF cstF tJ0 tJ1 lcpJ0 cHJ0 spFloJ0 unitLoJ0 l0 c0 (le_refl _) q01 (le_trans (le_trans q12 q2C) qC) + hspMono hcstMono sp0 cs0 un0 tabJ0.1 tabJ0.2) + (hFbJ_of tJ0 tJ1 LJ0 (by unfold tJ1; norm_num) q01 (le_refl _) ptJ0) t ht k1 + by_cases k2 : t ≤ ((tJ2 : ℚ) : ℝ) + · exact piece tJ1 tJ2 lcpJ1 sgJ1 sigJ1 (by unfold sgJ1; norm_num) q01 q12 q2C l1 + (tab_pieceJ spF cstF tJ1 tJ2 lcpJ1 cHJ1 spFloJ1 unitLoJ1 l1 c1 q01 q12 (le_trans q2C qC) + hspMono hcstMono sp1 cs1 un1 tabJ1.1 tabJ1.2) + (hFbJ_of tJ1 tJ2 LJ1 (by unfold tJ2; norm_num) q12 q01 ptJ1) t (by push Not at k1; exact k1.le) k2 + · exact piece tJ2 tC0 lcpJ2 sgJ2 sigJ2 (by unfold sgJ2; norm_num) (le_trans q01 q12) q2C (le_refl _) l2 + (tab_pieceJ spF cstF tJ2 tC0 lcpJ2 cHJ2 spFloJ2 unitLoJ2 l2 c2' (le_trans q01 q12) q2C qC + hspMono hcstMono sp2 cs2 un2 tabJ2.1 tabJ2.2) + (hFbJ_of tJ2 tC0 LJ2 (by unfold tC0; norm_num) q2C (le_trans q01 q12) ptJ2) t (by push Not at k2; exact k2.le) hC.le + +end CongestionNative + +#print axioms CongestionNative.unit_of_Fup +#print axioms CongestionNative.E_lower_cap_omN +#print axioms CongestionNative.tab_pieceJ +#print axioms CongestionNative.ceiling_native_J diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJD.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJD.lean new file mode 100644 index 0000000000..3060b75a60 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJD.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem cfC_dJ : 0 < dLo cfC (93 / 100) (1 - tJ0) := by unfold tJ0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJDefs.lean new file mode 100644 index 0000000000..c70a731406 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJDefs.lean @@ -0,0 +1,43 @@ +import Nov15.CongestionI3DualConst +import Nov15.CongestionI3NumC1 +import Nov15.CongestionNativeTab + +/-! CONGESTION-NATIVE-J certificates: the three own56 t-pieces on [tJ0, tC0] for the junk count N = 4962. +Source: internal table generators (Decimal 80 digits, +-1e-70 brackets; spF DAG weights rounded DOWN, cst rounded UP, +unit_lo = 9^s lower - 8^s upper; all rounded outward to 14 / 6 / 7 digits). Kernel-checked here: sigma certificates (`sigOK`), F_base point +enclosures (`Fup`), the derivative bound of F_base on [.93, 1 - tJ0], the rational table arithmetic, and ALL unit lower bounds (old and new). -/ +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual + +def tJ0 : ℚ := 118103 / 10 ^ 7 +def tJ1 : ℚ := 118123 / 10 ^ 7 +def tJ2 : ℚ := 120123 / 10 ^ 7 +def sgJ0 : ℚ := 24309 / 500000 +def sgJ1 : ℚ := 25631 / 500000 +def sgJ2 : ℚ := 57 / 800 +def cHJ0 : ℚ := 291901 / 10 ^ 7 +def cHJ1 : ℚ := 296781 / 10 ^ 7 +def cHJ2 : ℚ := 336819 / 10 ^ 7 +def lcpJ0 : ℚ := 27930489 / 10 ^ 6 +def lcpJ1 : ℚ := 2793131 / 10 ^ 5 +def lcpJ2 : ℚ := 28371641 / 10 ^ 6 +def LJ0 : ℚ := lcpJ0 - 5 * sgJ0 +def LJ1 : ℚ := lcpJ1 - 5 * sgJ1 +def LJ2 : ℚ := lcpJ2 - 5 * sgJ2 +/-- lower bounds of spF(tJ_j) -/ +def spFloJ0 : ℚ := 113518785551 / 20000000000000 +def spFloJ1 : ℚ := 17740285593 / 3125000000000 +def spFloJ2 : ℚ := 577208719357 / 100000000000000 +/-- lower bounds of 9^(1-t_{j+1}) - 8^(1-t_{j+1}) (t_{j+1} = tJ1, tJ2, tC0) -/ +def unitLoJ0 : ℚ := 48176347373057 / 50000000000000 +def unitLoJ1 : ℚ := 96291982180651 / 100000000000000 +def unitLoJ2 : ℚ := 95794193417421 / 100000000000000 + +theorem tabJ0 : lcpJ0 + 8 * cHJ0 ≤ 4962 * spFloJ0 ∧ lcpJ0 + 8 * cHJ0 ≤ 4962 * (unitLoJ0 / 48) := by + unfold lcpJ0 cHJ0 spFloJ0 unitLoJ0; constructor <;> norm_num +theorem tabJ1 : lcpJ1 + 8 * cHJ1 ≤ 4962 * spFloJ1 ∧ lcpJ1 + 8 * cHJ1 ≤ 4962 * (unitLoJ1 / 48) := by + unfold lcpJ1 cHJ1 spFloJ1 unitLoJ1; constructor <;> norm_num +theorem tabJ2 : lcpJ2 + 8 * cHJ2 ≤ 4962 * spFloJ2 ∧ lcpJ2 + 8 * cHJ2 ≤ 4962 * (unitLoJ2 / 48) := by + unfold lcpJ2 cHJ2 spFloJ2 unitLoJ2; constructor <;> norm_num + +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt0.lean new file mode 100644 index 0000000000..d28bdf6efc --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem ptJ0 : Fup cfC (1 - tJ0) (1 - tJ0) < 17 * LJ0 := by unfold tJ0 LJ0 lcpJ0 sgJ0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt1.lean new file mode 100644 index 0000000000..9bbcfbdafe --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem ptJ1 : Fup cfC (1 - tJ1) (1 - tJ1) < 17 * LJ1 := by unfold tJ1 LJ1 lcpJ1 sgJ1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt2.lean new file mode 100644 index 0000000000..885ad815aa --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJPt2.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem ptJ2 : Fup cfC (1 - tJ2) (1 - tJ2) < 17 * LJ2 := by unfold tJ2 LJ2 lcpJ2 sgJ2; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig0.lean new file mode 100644 index 0000000000..8b0742d04e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig0.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionI3DualSig +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigJ0 : sigOK (1 - tJ1) (1 - tJ0) sgJ0 = true := by decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig1.lean new file mode 100644 index 0000000000..405bf16d0a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig1.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionI3DualSig +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigJ1 : sigOK (1 - tJ2) (1 - tJ1) sgJ1 = true := by decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig2.lean new file mode 100644 index 0000000000..19afd04daa --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJSig2.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionI3DualSig +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigJ2 : sigOK (1 - tC0) (1 - tJ2) sgJ2 = true := by decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJUnit.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJUnit.lean new file mode 100644 index 0000000000..f4ed40d499 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeJUnit.lean @@ -0,0 +1,14 @@ +import Nov15.CongestionNativeJDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +/-- `8^s - 9^s` as an exponential polynomial -/ +def unitCF : CF := [(8, 1), (9, -1)] +theorem unitCF_ok : okR unitCF := by decide +kernel +theorem unitJ0 : Fup unitCF (1 - tJ1) (1 - tJ1) < -unitLoJ0 := by unfold tJ1 unitLoJ0; decide +kernel +theorem unitJ1 : Fup unitCF (1 - tJ2) (1 - tJ2) < -unitLoJ1 := by unfold tJ2 unitLoJ1; decide +kernel +theorem unitJ2 : Fup unitCF (1 - tC0) (1 - tC0) < -unitLoJ2 := by unfold tC0 unitLoJ2; decide +kernel +theorem unitC0' : Fup unitCF (1 - tC1) (1 - tC1) < -unitLoC0 := by unfold tC1 unitLoC0; decide +kernel +theorem unitC1' : Fup unitCF (1 - tC2) (1 - tC2) < -unitLoC1 := by unfold tC2 unitLoC1; decide +kernel +theorem unitC2' : Fup unitCF (1 - tC3) (1 - tC3) < -unitLoC2 := by unfold tC3 unitLoC2; decide +kernel +theorem unitC3' : Fup unitCF (1 - 1 / 10) (1 - 1 / 10) < -unitLoC3 := by unfold unitLoC3; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionNativeTab.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeTab.lean new file mode 100644 index 0000000000..bb00941798 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionNativeTab.lean @@ -0,0 +1,38 @@ +import Mathlib.Data.Rat.Defs +import Mathlib.Tactic.NormNum +import Nov15.CongestionI3DualConst + +/-! CONGESTION-NATIVE certified rational tables. +Source: internal notes (Decimal exp/ln at 80 digits, +-1e-70 brackets; every weight of the spF DAG rounded DOWN, +cst rounded UP, unit_lo = 9^s lower - 8^s upper). The values below were emitted by re-running hc9's `spF_lo` / `unit_lo` and converting the +80-digit Decimals to exact rationals, rounded DOWN to 14 digits (outward). `cHC_j` are hc9's own rounded-UP cst brackets. +Here only the pure arithmetic is proved (kernel, norm_num): lcpC_j + 8 cHC_j <= 1936 * min(spFloC_j, unitLoC_j / 48). +The statements `spFloC_j <= spF(tC_j)`, `cst(t_{j+1}) <= cHC_j`, `unitLoC_j <= 9^s - 8^s` are HYPOTHESES of the ceiling (computed, hc9.log). -/ +namespace CongestionNative +open CongestionI3Dual + +def spFloC0 : ℚ := 131069767447 / 20000000000000 +def spFloC1 : ℚ := 655443767027 / 100000000000000 +def spFloC2 : ℚ := 26407594739 / 4000000000000 +def spFloC3 : ℚ := 141372084217 / 12500000000000 +/-- lower bound of 9^(1-t_{j+1}) - 8^(1-t_{j+1}) (t_1, t_2, t_3, 1/10) -/ +def unitLoC0 : ℚ := 11974198659989 / 12500000000000 +def unitLoC1 : ℚ := 95763386760327 / 100000000000000 +def unitLoC2 : ℚ := 23196470570391 / 25000000000000 +def unitLoC3 : ℚ := 72665488499219 / 100000000000000 +/-- upper brackets of cst(t_{j+1}) -/ +def cHC0 : ℚ := 84217 / 2500000 +def cHC1 : ℚ := 339299 / 10 ^ 7 +def cHC2 : ℚ := 579807 / 10 ^ 7 +def cHC3 : ℚ := 2255027 / 10 ^ 7 + +theorem tabC0 : lcpC0 + 8 * cHC0 ≤ 1936 * spFloC0 ∧ lcpC0 + 8 * cHC0 ≤ 1936 * (unitLoC0 / 48) := by + unfold lcpC0 cHC0 spFloC0 unitLoC0; constructor <;> norm_num +theorem tabC1 : lcpC1 + 8 * cHC1 ≤ 1936 * spFloC1 ∧ lcpC1 + 8 * cHC1 ≤ 1936 * (unitLoC1 / 48) := by + unfold lcpC1 cHC1 spFloC1 unitLoC1; constructor <;> norm_num +theorem tabC2 : lcpC2 + 8 * cHC2 ≤ 1936 * spFloC2 ∧ lcpC2 + 8 * cHC2 ≤ 1936 * (unitLoC2 / 48) := by + unfold lcpC2 cHC2 spFloC2 unitLoC2; constructor <;> norm_num +theorem tabC3 : lcpC3 + 8 * cHC3 ≤ 1936 * spFloC3 ∧ lcpC3 + 8 * cHC3 ≤ 1936 * (unitLoC3 / 48) := by + unfold lcpC3 cHC3 spFloC3 unitLoC3; constructor <;> norm_num + +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReader.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReader.lean new file mode 100644 index 0000000000..396ab751d8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReader.lean @@ -0,0 +1,154 @@ +import Nov15.CongestionReaderPiece +import Nov15.CTreeDataRDA +import Nov15.CTreeDataRDI +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionReaderCertRDWt +import Nov15.CongestionReaderCertRDD +import Nov15.CongestionReaderCertRDDl +import Nov15.CongestionReaderCertRDS0 +import Nov15.CongestionReaderCertRDT0 +import Nov15.CongestionReaderCertRDU0 +import Nov15.CongestionReaderCertRDL0 +import Nov15.CongestionReaderCertRDS1 +import Nov15.CongestionReaderCertRDT1 +import Nov15.CongestionReaderCertRDU1 +import Nov15.CongestionReaderCertRDL1 +import Nov15.CongestionReaderCertRDS2 +import Nov15.CongestionReaderCertRDT2 +import Nov15.CongestionReaderCertRDU2 +import Nov15.CongestionReaderCertRDL2 + +/-! +CONGESTION-READER. Reader-charge refinement of the tree ceiling `ceiling_tree_GD` (#7678, Nov15/CongestionTree.lean): +CG2's per-reader endpoint charge (IN' = sum_t min(H_t + delta, K_t min(c18, capv)) - 15 delta, delta = beta(7) - beta(8)) in the audited shippable form. +`ceiling_reader_GD` (omega <= 0) : F(1 - t, invoice (caller 6 7) n 17) < 0 for t in [a0RD, 1], a0RD = 57631/5000000 = .01152620. Lean-proved: the register identity +(`resid_V`, `resid_Z`, `tied_rho`: a tied register has residual >= delta), the payer summation (`sum_c2_pay`), the reader line bound +(`tree_lower_reader`), the piece lemma, all numerics (kernel). NAMED hypotheses (see CongestionReader.md): hTied/hcase/hUc (reader structure = +CG2 sec. 2 + F2 lineage lemma + TL-a/b/c + own56 + X born at dim 1), plus the tree hypotheses of #7678 (CongestionTree.md there). +-/ +namespace CongestionNative +open NumCertK JointCeiling CallerCost CongestionI3 CongestionI3Dual Finset + +theorem hdelRD : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → + (dIRD : ℝ) ≤ CTree.SCr * CongestionReader.deltaF s := by + intro s h1 h2 + have hok : okR cfDelRD := by + intro p hp + simp only [cfDelRD, List.mem_cons, List.not_mem_nil, or_false] at hp + rcases hp with rfl | rfl | rfl | rfl <;> norm_num + have hd : 0 < dLo (CTree.negCF cfDelRD) (1 - tJ0) (1 - a0RD) := dlDRD + have hp : Fup (CTree.negCF cfDelRD) (1 - a0RD) (1 - a0RD) ≤ -((dIRD : ℚ) / 10 ^ 14) := dlPRD + have := CTree.cf_lower cfDelRD hok (1 - tJ0) (1 - a0RD) (by unfold tJ0; norm_num) (by unfold a0RD; norm_num) hd + ((dIRD : ℚ) / 10 ^ 14) hp s h1 h2 + have e : Fc cfDelRD s = CongestionReader.deltaF s := by + simp [Fc, cfDelRD, CongestionReader.deltaF, Real.one_rpow] + ring + rw [e] at this + have hS : CTree.SCr = ((10 ^ 14 : ℚ) : ℝ) := by unfold CTree.SCr; push_cast; ring + rw [hS] + push_cast at this ⊢ + have := mul_le_mul_of_nonneg_left this (by norm_num : (0 : ℝ) ≤ 10 ^ 14) + have h14 : (10 : ℝ) ^ 14 * ((dIRD : ℝ) / 10 ^ 14) = dIRD := by field_simp + linarith + +theorem corr_nonnegRD (cstF : ℝ → ℝ) (hcstLo : ∀ t : ℝ, ((a0RD : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) : + ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → 0 ≤ corrC cstF s := by + intro s h1 h2 + unfold corrC + have ha : ((a0RD : ℚ) : ℝ) ≤ 1 - s := by push_cast at h2 ⊢; linarith + have hb : 1 - s ≤ 1 / 10 := by + have : ((1 - tJ0 : ℚ) : ℝ) = 1 - 118103 / 10 ^ 7 := by unfold tJ0; push_cast; norm_num + rw [this] at h1; linarith + have := hcstLo (1 - s) ha hb + linarith + +theorem hFbT_ofRRD (a0 a b L : ℚ) (hd : 0 < dLo cfC (93 / 100) (1 - a0)) (ha00 : 0 ≤ a0) (hb93 : 93 / 100 ≤ 1 - b) (hab : a ≤ b) + (haJ : a0 ≤ a) (hpt : Fup cfC (1 - a) (1 - a) < 17 * L) : + ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (L : ℝ) := by + intro s h1 h2 + have hb : (((93 / 100 : ℚ)) : ℝ) ≤ s := le_trans (by exact_mod_cast hb93) h1 + have haA : (1 - a : ℚ) ≤ 1 - a0 := by linarith + have hA : ((1 - a : ℚ) : ℝ) ≤ ((1 - a0 : ℚ) : ℝ) := by exact_mod_cast haA + have hm := Fc_monoOn cfC cfC_ok (93 / 100) (1 - a0) (by norm_num) (by linarith) hd s ((1 - a : ℚ) : ℝ) hb h2 hA + exact lt_of_le_of_lt hm (pt_of_Fup cfC cfC_ok (1 - a) L (by linarith) (by linarith) hpt) + +theorem ceiling_reader_GD + {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 4962 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hspTabJ : ((spFloJ0 : ℚ) : ℝ) ≤ spF ((tJ0 : ℚ) : ℝ) ∧ ((spFloJ1 : ℚ) : ℝ) ≤ spF ((tJ1 : ℚ) : ℝ) ∧ + ((spFloJ2 : ℚ) : ℝ) ≤ spF ((tJ2 : ℚ) : ℝ)) + (hcstTabJ : cstF ((tJ1 : ℚ) : ℝ) ≤ ((cHJ0 : ℚ) : ℝ) ∧ cstF ((tJ2 : ℚ) : ℝ) ≤ ((cHJ1 : ℚ) : ℝ) ∧ + cstF ((tC0 : ℚ) : ℝ) ≤ ((cHJ2 : ℚ) : ℝ)) + {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (T : CTree.TreeData σ ρ μ CTree.rdaR CTree.rdiR CTree.rdar0 CTree.rdir0 48) + (hcstLo : ∀ t : ℝ, ((a0RD : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) + (hcstMonoT : MonotoneOn cstF (Set.Icc ((a0RD : ℚ) : ℝ) (1 / 10))) + (hcst0 : cstF ((tRD1 : ℚ) : ℝ) ≤ ((cHRD0 : ℚ) : ℝ)) + (hcst1 : cstF ((tRD2 : ℚ) : ℝ) ≤ ((cHRD1 : ℚ) : ℝ)) + (hcst2 : cstF ((tRD3 : ℚ) : ℝ) ≤ ((cHRD2 : ℚ) : ℝ)) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RD : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (ω : ℕ) (hω : ω ≤ 0) (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ 15 + ω) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (π : σ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) (hTied : ∀ t ∈ Q, CongestionReader.Tied nR dR (π t)) : + ∀ t : ℝ, ((a0RD : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + have eJ : tTJ0RD = tJ0 := rfl + have hwin := wtRD + rw [eJ] at hwin + have hdd := cfC_dRD + have hdel := hdelRD + have hUc' : Uo.card ≤ 15 := by omega + intro t ht ht1 + rcases le_or_gt ((tJ0 : ℚ) : ℝ) t with hC | hC + · exact ceiling_native_J R nR dR hmono hd9 hmix n ks mr st E J distF spF cstF hk hmass hmd hmr hF hY hst hEex hcong hdist hJ hspMono hcstMono hspTab hcstTab hspTabJ hcstTabJ t hC ht1 + have p0 := CTree.reader_piece R nR dR hmono hd9 hmix n ks mr E cstF hF hEex CTree.rdaW CTree.rdaR CTree.rdiR CTree.rdar0 CTree.rdir0 48 T + CTree.rda_all (by have h := CTree.rdi_all; rwa [show CTree.rdiW = CTree.rdaW from rfl] at h) (by decide) (by decide) a0RD tRD0 tRD1 lcpRD0 sgRD0 cHRD0 unLoRD0 capIRD0 dIRD lamRD0 gARD0 gBRD0 15 + hwin (by unfold tRD0 a0RD; norm_num) (by unfold tRD0 tRD1; norm_num) (by unfold tRD1 tJ0; norm_num) (by unfold a0RD; norm_num) sigRD0 (by unfold sgRD0; norm_num) lineRD0 numRD0 capRD0 + (unit_of_Fup tRD1 unLoRD0 (by unfold tRD1; norm_num) (by unfold tRD1; norm_num) (by have := unRD0; exact this)) hcst0 hcstMonoT hdel hP1 hP2 + Q Uo hUo hUc' hQ hcase π hπR hπinj hTied + (hFbT_ofRRD a0RD tRD0 tRD1 _ hdd (by unfold a0RD; norm_num) (by unfold tRD1; norm_num) (by unfold tRD0 tRD1; norm_num) (by unfold tRD0 a0RD; norm_num) ptRD0) + have p1 := CTree.reader_piece R nR dR hmono hd9 hmix n ks mr E cstF hF hEex CTree.rdaW CTree.rdaR CTree.rdiR CTree.rdar0 CTree.rdir0 48 T + CTree.rda_all (by have h := CTree.rdi_all; rwa [show CTree.rdiW = CTree.rdaW from rfl] at h) (by decide) (by decide) a0RD tRD1 tRD2 lcpRD1 sgRD1 cHRD1 unLoRD1 capIRD1 dIRD lamRD1 gARD1 gBRD1 15 + hwin (by unfold tRD1 a0RD; norm_num) (by unfold tRD1 tRD2; norm_num) (by unfold tRD2 tJ0; norm_num) (by unfold a0RD; norm_num) sigRD1 (by unfold sgRD1; norm_num) lineRD1 numRD1 capRD1 + (unit_of_Fup tRD2 unLoRD1 (by unfold tRD2; norm_num) (by unfold tRD2; norm_num) (by have := unRD1; exact this)) hcst1 hcstMonoT hdel hP1 hP2 + Q Uo hUo hUc' hQ hcase π hπR hπinj hTied + (hFbT_ofRRD a0RD tRD1 tRD2 _ hdd (by unfold a0RD; norm_num) (by unfold tRD2; norm_num) (by unfold tRD1 tRD2; norm_num) (by unfold tRD1 a0RD; norm_num) ptRD1) + have p2 := CTree.reader_piece R nR dR hmono hd9 hmix n ks mr E cstF hF hEex CTree.rdaW CTree.rdaR CTree.rdiR CTree.rdar0 CTree.rdir0 48 T + CTree.rda_all (by have h := CTree.rdi_all; rwa [show CTree.rdiW = CTree.rdaW from rfl] at h) (by decide) (by decide) a0RD tRD2 tRD3 lcpRD2 sgRD2 cHRD2 unLoRD2 capIRD2 dIRD lamRD2 gARD2 gBRD2 15 + hwin (by unfold tRD2 a0RD; norm_num) (by unfold tRD2 tRD3; norm_num) (tRDend.trans eJ).le (by unfold a0RD; norm_num) sigRD2 (by unfold sgRD2; norm_num) lineRD2 numRD2 capRD2 + (unit_of_Fup tRD3 unLoRD2 (by unfold tRD3; norm_num) (by unfold tRD3; norm_num) (by have := unRD2; exact this)) hcst2 hcstMonoT hdel hP1 hP2 + Q Uo hUo hUc' hQ hcase π hπR hπinj hTied + (hFbT_ofRRD a0RD tRD2 tRD3 _ hdd (by unfold a0RD; norm_num) (by unfold tRD3; norm_num) (by unfold tRD2 tRD3; norm_num) (by unfold tRD2 a0RD; norm_num) ptRD2) + rcases le_or_gt t ((tRD1 : ℚ) : ℝ) with h1 | h1 + · exact p0 t (by rw [tRDstart]; exact ht) h1 + rcases le_or_gt t ((tRD2 : ℚ) : ℝ) with h2 | h2 + · exact p1 t h1.le h2 + exact p2 t h2.le (by rw [show tRD3 = tJ0 from tRDend.trans eJ]; exact hC.le) + +end CongestionNative + +#print axioms CongestionNative.corr_nonnegRD +#print axioms CongestionNative.hdelRD +#print axioms CongestionNative.ceiling_reader_GD diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReader.md b/research/p104-reader-ceiling/lean/Nov15/CongestionReader.md new file mode 100644 index 0000000000..1892d1f971 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReader.md @@ -0,0 +1,39 @@ +# CongestionReader: a per-reader endpoint charge on top of the tree ceiling of #7678 (labels CG2, AUD, F1, F2, F2b, TL-a/b/c, EP3 are internal note labels; those notes are not part of this package) + +Files (`Nov15/`, kernel only: no sorry, no native_decide; axioms propext, Classical.choice, Quot.sound; each file built alone under runlean.sh, peak <= 3.2 GB; the generators of the data files are not part of this package): +`CongestionReaderCore` (registers + payers), `CongestionReaderTree` (`lineOKR`, `tree_lower_reader`), `CongestionReaderPiece` (`reader_regs_lower`, `reader_piece`), +data `CTree{rd,re,rf}{a,i}*` / `CTreeData{RD,RE,RF}{A,I}` (the two 230-row DP tables per variant, `decide +kernel` per row; ALL edges, and the I-class 48-port edge set), +`CongestionReaderCert{RD,RE,RF}*` (weights, delta, line, sigma, point, unit certs), finals `CongestionReader` / `CongestionReaderW10` / `CongestionReaderW16`. + +## Certified results (true digits) +| theorem | w0 (omega <= w0) | allowances NDL = 15 + w0 | kappa <= (certified, t in [a0, 1]) | paper figure | +|---|---|---|---|---| +| `ceiling_reader_GD` | 0 | 15 | **.0115262** | AUD2 .0115250 | +| `ceiling_reader_GD_w10` (HEADLINE, F2b) | 10 | 25 | **.0115428** | .0115417 | +| `ceiling_reader_GD_w16` | 16 | 31 | **.0115528** | .0115516 | +Each is `F(1 - t, invoice (caller 6 7) n 17) < 0` for t in [a0, 1], by `ceiling_native_J` on [tJ0, 1] and by 2-3 `reader_piece`s on [a0, tJ0]. +The certified digit is 1.0-1.2e-6 above the paper digit in each case (t quantised to 1e-7 after piece margins >= .002; lcp rounded down; weights/delta rounded outward). For comparison `ceiling_tree_GD` is .0116750. + +## What is Lean-proved (CongestionReaderCore/Tree/Piece) +* `resid_V`, `resid_Z` (EP3 identity, inequality form): residual `rho = ex - sum path c2`; V-class (ends at 9): `rho >= beta(d_j) - beta(d_0)`; Z-class (born 0): `rho >= beta(d_j) - beta(d_n)`, `beta a = g a + g (9-a)`; from `h9 - k0 = beta b - beta a`. +* `beta_ge` (concavity of x^s, `Real.concaveOn_rpow`): beta(a) >= beta(7) for a in [2,7]; `beta_one_eight`; `tied_rho`: a TIED register (Z, ends at 8, or V born at 1 ending at 9, with a stop at dim in [2,7]) has `rho >= delta = 7^s + 2^s - 8^s - 1`. +* `sum_c2_pay`: distinct readers tied to distinct registers of residual >= delta, <= m mixed: `sum path c2 + delta |Q| <= sum ex + m sigma` (non-payer registers keep `rho >= -sigma [mixed]`, from the `sum_all_c2_le` step). +* `tree_lower_reader`: `tree_lower` with the per-reader allowance: every reader is tied (in Q: line with +dI, dI <= SC delta), all-transported (x = k: needs only lam <= capI, tree >= 0), or in Uo (|Uo| <= NDL: allowance subtracted). Conclusion `lam*4962 - gamma-sum - NDL*dI <= SC(sum w + cap sum x + delta |Q|)`. `lineOKR` = the 49x49 integer check with `+ dI` and `gA, gB >= 0, lam <= capI`. +* `reader_regs_lower`, `reader_piece`: shape of `tree_piece`; the delta|Q| term cancels between the tree side and `sum_c2_pay`, so |Q| never needs a lower bound. +* Numerics: `hdel*` (dI <= SC delta on the window: `dLo (negCF cfDel) > 0` + point `Fup`, via `cf_lower`), `corr_nonneg*`, weight tables, line/num/cap/sigma/point/unit certs per piece. The kernel-checked IN table is a DIFFERENT table from the OUT one in the I-class 48-port set (18 of 230 rows differ) but has the same root value. +* Floor on `gB`: gamma must be >= 0 (a reader with no cells); the first draft allowed gB < 0, which is unsound for k_s = 0 readers (caught by the Lean `ℕ` type), so `gamma = max(0, ...)`. + +## Hypotheses generated from the Lean text (status) +Old (as `ceiling_tree_GD`, unchanged; see CongestionTree.md of #7678): hmono, hd9, hmix (<= 5 mixed), hk, hmass, hmd, hmr, hF, hY, hst, hEex = natives computed facts; hcong*, hdist, hJ (t >= tJ0 only) = open paper (I2); hspMono/hcstMono (HC3 paper); hspTab/hcstTab* (data brackets); `T : TreeData` (htree*, hcap, hMv..., hdim) and hP1, hP2 = open paper (CG1 sec. 2b; nested moves), `hcst0/1/2` (`hcst0/1` in the w10 and w16 variants: two pieces, not three), `hcstMonoT` data. +New: +1. `T` is now the READERS' tree data (IN side: `T.S` = readers, `T.J` = (reader, source) cells, `T.R` = sources of non-transported cells). The IN DP table is the reflection of the OUT table (paper: F equal at every k; c2 is reflection symmetric, `k0_eq_h9_swapN`), the reflection is folded into `T.dA/T.dB`. OPEN (paper). Class counts: 104 readers, 48 partners, sum 4962 = natives (KS_IN = 101x48 + 3x38). The restricted-edge set for 48 readers is the I-class set `E48^I` (natives computed, GD1 sec. 3-4, not enumerated in Lean). +2. `Q, Uo, hUo, hQ, hcase`: every reader is tied (Q), all-transported (`x = k`), or untied (Uo). This is the CG2 dichotomy (sec. 2): cells on dim-1 moves carry <= 1 cell each at cost >= min(c18, capv) = capC (the cap class), else a dedicated register pays. OPEN (paper; CG2 + AUD2 check (2) numerics: the dim-1 branch never binds). +3. `ω, hω : ω ≤ W0, hUc : Uo.card ≤ 15 + ω`: |Uo| <= 5 mixed + 10 owned last movers (AUD2 F1) + omega, omega = net G'-token rank absorbed by owned rows. Review (F2 note): the F2 lemma as posed is FALSE (5-register token-swap counterexample, payer X_s outside S_t); correct form F2*: payers >= N_high - 15 - omega. TL-a's "only public registers hold e_g" is FALSE on the natives (owned rows hold G' tokens) and is NOT used. omega = 0 on all four natives -> w0 = 0 variant; F2b proved omega <= 10 for the class under two premises (no owned register rises to V from dim <= 7; every owned lifetime ends in CLEAR; both hold on the natives) -> w0 = 10 HEADLINE; w0 = 16 kept as the wide variant. Status: omega <= w0 is a NAMED hypothesis (F2b is on paper; the CLEAR-certificate module (ClearCert, not part of this package) is not wired in). +4. `π, hπR, hπinj, hTied`: each tied reader has a distinct register `π t` in R with `Tied` (Z-class ending at dim 8 or V-class born at dim 1 ending at 9, with a stop at a dim in [2,7]). `tied_rho` is Lean-proved, so the residual >= delta is NOT a hypothesis; what is assumed is the existence/uniqueness of the tied register = CG2 sec. 2 case analysis [premises: CG1 cell paths, own56 (<= 5 mixed; owned moves 6x9 + 2x1 descents + 8 unit rises), X/X2 born at dim 1 (audited as a restriction, holds on st1, x1t2a, e1, t7669), TL-b/TL-c (TL1)] + the F2* lineage step (public relays). Per-reader uniqueness ("a payer tied to u_t^perp serves one reader") uses: every register visits <= 1 dim-8 chart. OPEN (paper). +5. `hcstLo : 0 <= cstF t` on [a0, 1/10] (added after review; makes `corr_nonneg*`, i.e. the sign `0 <= corrC cstF s` needed for hP2, a Lean fact). `cstF` is a free function in the Lean text with upper brackets only, so the lower bracket is a hypothesis: it follows from cst(t) = max c2(p,q)/(q-p) >= c2(7,8) > 0 (the weight table W(7,8) > 0 on the window, `W_lower`). Word-side premises of hP1/hP2 and the tree: see NATIVES.md (the tree-premise script `tp1.py`, both primes): all five words (st1, w7637, x1t2a, e1, t7669) meet them except the sign now covered here. +6. `hdel*`/numeric certs: no hypotheses. + +## Paper checks +* No false step found in the shippable formula once the F1 fix (NDL 15) is in; the old 99 delta / .0115086 form is not formalised (needs owned moves barred from dim-8 charts). +* F2 as posed is false (F2LEMMA counterexample); the Lean statement therefore never uses a per-reader lineage lemma, only the existence of a tied register (hypothesis 4) and the count bound omega (hypothesis 3). If hypothesis 4 is replaced by the weaker F2* count `|Q| >= N_high - 15 - omega`, the Lean proof is unchanged (Uo absorbs the shortfall). +* Lean counterexample found: none needed for the paper steps; the one false statement found in the first draft was the sign of gamma (above). diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDD.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDD.lean new file mode 100644 index 0000000000..32800fc9ea --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDD.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRDDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem cfC_dRD : 0 < dLo cfC (93 / 100) (1 - a0RD) := by unfold a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDDefs.lean new file mode 100644 index 0000000000..ee37042d96 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDDefs.lean @@ -0,0 +1,38 @@ +import Nov15.NumCertK +import Nov15.CongestionI3NumC1 +namespace CongestionNative +open NumCertK CongestionI3 +def tTJ0RD : ℚ := 118103 / 10 ^ 7 +def a0RD : ℚ := (57631 : ℚ) / 5000000 +def dIRD : ℕ := 1829476964867 +def tRD0 : ℚ := (57631 : ℚ) / 5000000 +def tRD1 : ℚ := (14409 : ℚ) / 1250000 +def sgRD0 : ℚ := (1483 : ℚ) / 31250 +def cHRD0 : ℚ := (284941 : ℚ) / 10000000 +def lcpRD0 : ℚ := (6066973 : ℚ) / 200000 +def unLoRD0 : ℚ := (96439299869701 : ℚ) / 100000000000000 +def capIRD0 : ℕ := 2009152080618 +def lamRD0 : ℕ := 645764760052 +def gARD0 : ℕ := 2152870912751 +def gBRD0 : ℕ := 31 +def tRD2 : ℚ := (7267 : ℚ) / 625000 +def sgRD1 : ℚ := (48779 : ℚ) / 1000000 +def cHRD1 : ℚ := (287383 : ℚ) / 10000000 +def lcpRD1 : ℚ := (30332911 : ℚ) / 1000000 +def unLoRD1 : ℚ := (96408914818159 : ℚ) / 100000000000000 +def capIRD1 : ℕ := 2008519058711 +def lamRD1 : ℕ := 645764760052 +def gARD1 : ℕ := 2152870912751 +def gBRD1 : ℕ := 31 +def tRD3 : ℚ := (118103 : ℚ) / 10000000 +def sgRD2 : ℚ := (50289 : ℚ) / 1000000 +def cHRD2 : ℚ := (72963 : ℚ) / 2500000 +def lcpRD2 : ℚ := (3791167 : ℚ) / 125000 +def unLoRD2 : ℚ := (12044162755641 : ℚ) / 12500000000000 +def capIRD2 : ℕ := 2007360459273 +def lamRD2 : ℕ := 645764760052 +def gARD2 : ℕ := 2152870912751 +def gBRD2 : ℕ := 31 +theorem tRDend : tRD3 = tTJ0RD := by unfold tRD3 tTJ0RD; norm_num +theorem tRDstart : tRD0 = a0RD := by unfold tRD0 a0RD; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDDl.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDDl.lean new file mode 100644 index 0000000000..2e5888eb5c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDDl.lean @@ -0,0 +1,8 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +namespace CongestionNative +open NumCertK CongestionI3 +def cfDelRD : CF := [(7, 1), (2, 1), (8, -1), (1, -1)] +theorem dlDRD : 0 < dLo (CTree.negCF cfDelRD) (1 - tTJ0RD) (1 - a0RD) := by unfold tTJ0RD a0RD cfDelRD CTree.negCF; decide +kernel +theorem dlPRD : Fup (CTree.negCF cfDelRD) (1 - a0RD) (1 - a0RD) ≤ -((dIRD : ℚ) / 10 ^ 14) := by unfold a0RD dIRD cfDelRD CTree.negCF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL0.lean new file mode 100644 index 0000000000..7ce98d0dd2 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL0.lean @@ -0,0 +1,11 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionReaderTree +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem lineRD0 : CTree.lineOKR CTree.rdar0 CTree.rdir0 capIRD0 dIRD lamRD0 gARD0 gBRD0 = true := by unfold capIRD0 dIRD lamRD0 gARD0 gBRD0; decide +kernel +theorem numRD0 : lcpRD0 + 8 * cHRD0 ≤ (((lamRD0 : ℚ) * 4962 - ((gARD0 : ℚ) * 104 - ((gARD0 : ℚ) - gBRD0) * 48) - ((15 : ℕ) : ℚ) * dIRD) / 10 ^ 14) := by + unfold lcpRD0 cHRD0 lamRD0 gARD0 gBRD0 dIRD; norm_num +theorem capRD0 : (capIRD0 : ℚ) ≤ unLoRD0 * 10 ^ 14 / 48 := by unfold capIRD0 unLoRD0; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL1.lean new file mode 100644 index 0000000000..6aee70f940 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL1.lean @@ -0,0 +1,11 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionReaderTree +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem lineRD1 : CTree.lineOKR CTree.rdar0 CTree.rdir0 capIRD1 dIRD lamRD1 gARD1 gBRD1 = true := by unfold capIRD1 dIRD lamRD1 gARD1 gBRD1; decide +kernel +theorem numRD1 : lcpRD1 + 8 * cHRD1 ≤ (((lamRD1 : ℚ) * 4962 - ((gARD1 : ℚ) * 104 - ((gARD1 : ℚ) - gBRD1) * 48) - ((15 : ℕ) : ℚ) * dIRD) / 10 ^ 14) := by + unfold lcpRD1 cHRD1 lamRD1 gARD1 gBRD1 dIRD; norm_num +theorem capRD1 : (capIRD1 : ℚ) ≤ unLoRD1 * 10 ^ 14 / 48 := by unfold capIRD1 unLoRD1; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL2.lean new file mode 100644 index 0000000000..611ffd10aa --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDL2.lean @@ -0,0 +1,11 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionReaderTree +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem lineRD2 : CTree.lineOKR CTree.rdar0 CTree.rdir0 capIRD2 dIRD lamRD2 gARD2 gBRD2 = true := by unfold capIRD2 dIRD lamRD2 gARD2 gBRD2; decide +kernel +theorem numRD2 : lcpRD2 + 8 * cHRD2 ≤ (((lamRD2 : ℚ) * 4962 - ((gARD2 : ℚ) * 104 - ((gARD2 : ℚ) - gBRD2) * 48) - ((15 : ℕ) : ℚ) * dIRD) / 10 ^ 14) := by + unfold lcpRD2 cHRD2 lamRD2 gARD2 gBRD2 dIRD; norm_num +theorem capRD2 : (capIRD2 : ℚ) ≤ unLoRD2 * 10 ^ 14 / 48 := by unfold capIRD2 unLoRD2; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS0.lean new file mode 100644 index 0000000000..8be94ffd7a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS0.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionI3DualSig +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigRD0 : sigOK (1 - tRD1) (1 - tRD0) sgRD0 = true := by unfold tRD0 tRD1 sgRD0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS1.lean new file mode 100644 index 0000000000..5170e6bc69 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS1.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionI3DualSig +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigRD1 : sigOK (1 - tRD2) (1 - tRD1) sgRD1 = true := by unfold tRD1 tRD2 sgRD1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS2.lean new file mode 100644 index 0000000000..fca5edb543 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDS2.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionI3DualSig +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigRD2 : sigOK (1 - tRD3) (1 - tRD2) sgRD2 = true := by unfold tRD2 tRD3 sgRD2; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT0.lean new file mode 100644 index 0000000000..1770cc1215 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRDDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem ptRD0 : Fup cfC (1 - tRD0) (1 - tRD0) < 17 * (lcpRD0 - 5 * sgRD0) := by unfold tRD0 lcpRD0 sgRD0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT1.lean new file mode 100644 index 0000000000..1ae47b71f4 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRDDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem ptRD1 : Fup cfC (1 - tRD1) (1 - tRD1) < 17 * (lcpRD1 - 5 * sgRD1) := by unfold tRD1 lcpRD1 sgRD1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT2.lean new file mode 100644 index 0000000000..97f4f06821 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDT2.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRDDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem ptRD2 : Fup cfC (1 - tRD2) (1 - tRD2) < 17 * (lcpRD2 - 5 * sgRD2) := by unfold tRD2 lcpRD2 sgRD2; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU0.lean new file mode 100644 index 0000000000..6cbe9a4802 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRDDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem unRD0 : Fup [(8, 1), (9, -1)] (1 - tRD1) (1 - tRD1) < -unLoRD0 := by unfold tRD1 unLoRD0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU1.lean new file mode 100644 index 0000000000..084622d6b7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRDDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem unRD1 : Fup [(8, 1), (9, -1)] (1 - tRD2) (1 - tRD2) < -unLoRD1 := by unfold tRD2 unLoRD1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU2.lean new file mode 100644 index 0000000000..1b20b3b9a9 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDU2.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRDDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem unRD2 : Fup [(8, 1), (9, -1)] (1 - tRD3) (1 - tRD3) < -unLoRD2 := by unfold tRD3 unLoRD2; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt.lean new file mode 100644 index 0000000000..2e1f03d6d3 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt.lean @@ -0,0 +1,52 @@ +import Nov15.CongestionReaderCertRDWt0 +import Nov15.CongestionReaderCertRDWt1 +import Nov15.CongestionReaderCertRDWt2 +import Nov15.CongestionReaderCertRDWt3 +import Nov15.CongestionReaderCertRDWt4 +import Nov15.CongestionReaderCertRDWt5 +import Nov15.CongestionReaderCertRDWt6 +import Nov15.CongestionReaderCertRDWt7 +import Nov15.CongestionReaderCertRDWt8 +import Nov15.CongestionReaderCertRDWt9 +import Nov15.CongestionReaderCertRDWt10 +import Nov15.CongestionReaderCertRDWt11 +import Nov15.CongestionReaderCertRDWt12 +import Nov15.CongestionReaderCertRDWt13 +import Nov15.CongestionTreeW +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD : CTree.wtOK CTree.rdaW (1 - tTJ0RD) (1 - a0RD) = true := by + unfold CTree.wtOK + rw [List.all_eq_true] + intro p hp + simp only [pairs, List.mem_cons, List.not_mem_nil, or_false] at hp + rcases hp with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl + · exact wtRD_1_2 + · exact wtRD_1_3 + · exact wtRD_1_4 + · exact wtRD_1_5 + · exact wtRD_1_6 + · exact wtRD_1_7 + · exact wtRD_1_8 + · exact wtRD_2_3 + · exact wtRD_2_4 + · exact wtRD_2_5 + · exact wtRD_2_6 + · exact wtRD_2_7 + · exact wtRD_2_8 + · exact wtRD_3_4 + · exact wtRD_3_5 + · exact wtRD_3_6 + · exact wtRD_3_7 + · exact wtRD_3_8 + · exact wtRD_4_5 + · exact wtRD_4_6 + · exact wtRD_4_7 + · exact wtRD_4_8 + · exact wtRD_5_6 + · exact wtRD_5_7 + · exact wtRD_5_8 + · exact wtRD_6_7 + · exact wtRD_6_8 + · exact wtRD_7_8 +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt0.lean new file mode 100644 index 0000000000..8e07b79862 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt0.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_1_2 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (1, 2) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_1_3 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (1, 3) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt1.lean new file mode 100644 index 0000000000..0322dbe5a9 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt1.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_1_4 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (1, 4) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_1_5 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (1, 5) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt10.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt10.lean new file mode 100644 index 0000000000..91b6b5536f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt10.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_4_7 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (4, 7) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_4_8 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (4, 8) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt11.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt11.lean new file mode 100644 index 0000000000..a4ff4d364b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt11.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_5_6 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (5, 6) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_5_7 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (5, 7) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt12.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt12.lean new file mode 100644 index 0000000000..3af4327803 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt12.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_5_8 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (5, 8) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_6_7 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (6, 7) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt13.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt13.lean new file mode 100644 index 0000000000..60e70f76d1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt13.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_6_8 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (6, 8) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_7_8 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (7, 8) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt2.lean new file mode 100644 index 0000000000..45c860c839 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt2.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_1_6 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (1, 6) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_1_7 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (1, 7) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt3.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt3.lean new file mode 100644 index 0000000000..fac6093cd2 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt3.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_1_8 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (1, 8) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_2_3 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (2, 3) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt4.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt4.lean new file mode 100644 index 0000000000..e216df9c32 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt4.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_2_4 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (2, 4) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_2_5 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (2, 5) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt5.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt5.lean new file mode 100644 index 0000000000..88114273be --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt5.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_2_6 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (2, 6) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_2_7 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (2, 7) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt6.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt6.lean new file mode 100644 index 0000000000..010f7dd0a7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt6.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_2_8 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (2, 8) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_3_4 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (3, 4) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt7.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt7.lean new file mode 100644 index 0000000000..07e1dcd123 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt7.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_3_5 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (3, 5) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_3_6 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (3, 6) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt8.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt8.lean new file mode 100644 index 0000000000..245fbf5420 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt8.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_3_7 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (3, 7) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_3_8 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (3, 8) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt9.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt9.lean new file mode 100644 index 0000000000..368a25bb07 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRDWt9.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRDDefs +import Nov15.CongestionTreeW +import Nov15.CTreerdaDefs +import Nov15.CTreerdiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRD_4_5 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (4, 5) = true := by unfold tTJ0RD a0RD; decide +kernel +theorem wtRD_4_6 : CTree.wtPair CTree.rdaW (1 - tTJ0RD) (1 - a0RD) (4, 6) = true := by unfold tTJ0RD a0RD; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRED.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRED.lean new file mode 100644 index 0000000000..04016ddc2f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRED.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertREDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem cfC_dRE : 0 < dLo cfC (93 / 100) (1 - a0RE) := by unfold a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREDefs.lean new file mode 100644 index 0000000000..bf960576da --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREDefs.lean @@ -0,0 +1,29 @@ +import Nov15.NumCertK +import Nov15.CongestionI3NumC1 +namespace CongestionNative +open NumCertK CongestionI3 +def tTJ0RE : ℚ := 118103 / 10 ^ 7 +def a0RE : ℚ := (14441 : ℚ) / 1250000 +def dIRE : ℕ := 1833591819603 +def tRE0 : ℚ := (14441 : ℚ) / 1250000 +def tRE1 : ℚ := (28907 : ℚ) / 2500000 +def sgRE0 : ℚ := (11921 : ℚ) / 250000 +def cHRE0 : ℚ := (28581 : ℚ) / 1000000 +def lcpRE0 : ℚ := (6022117 : ℚ) / 200000 +def unLoRE0 : ℚ := (96428481806759 : ℚ) / 100000000000000 +def capIRE0 : ℕ := 2008926704307 +def lamRE0 : ℕ := 647239006391 +def gARE0 : ℕ := 2157772800171 +def gBRE0 : ℕ := 1 +def tRE2 : ℚ := (118103 : ℚ) / 10000000 +def sgRE1 : ℚ := (50887 : ℚ) / 1000000 +def cHRE1 : ℚ := (72963 : ℚ) / 2500000 +def lcpRE1 : ℚ := (30105751 : ℚ) / 1000000 +def unLoRE1 : ℚ := (12044162755641 : ℚ) / 12500000000000 +def capIRE1 : ℕ := 2007360459273 +def lamRE1 : ℕ := 647239006391 +def gARE1 : ℕ := 2157772800171 +def gBRE1 : ℕ := 1 +theorem tREend : tRE2 = tTJ0RE := by unfold tRE2 tTJ0RE; norm_num +theorem tREstart : tRE0 = a0RE := by unfold tRE0 a0RE; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREDl.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREDl.lean new file mode 100644 index 0000000000..9f7b9bd945 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREDl.lean @@ -0,0 +1,8 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +namespace CongestionNative +open NumCertK CongestionI3 +def cfDelRE : CF := [(7, 1), (2, 1), (8, -1), (1, -1)] +theorem dlDRE : 0 < dLo (CTree.negCF cfDelRE) (1 - tTJ0RE) (1 - a0RE) := by unfold tTJ0RE a0RE cfDelRE CTree.negCF; decide +kernel +theorem dlPRE : Fup (CTree.negCF cfDelRE) (1 - a0RE) (1 - a0RE) ≤ -((dIRE : ℚ) / 10 ^ 14) := by unfold a0RE dIRE cfDelRE CTree.negCF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREL0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREL0.lean new file mode 100644 index 0000000000..c85861e37e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREL0.lean @@ -0,0 +1,11 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionReaderTree +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem lineRE0 : CTree.lineOKR CTree.rear0 CTree.reir0 capIRE0 dIRE lamRE0 gARE0 gBRE0 = true := by unfold capIRE0 dIRE lamRE0 gARE0 gBRE0; decide +kernel +theorem numRE0 : lcpRE0 + 8 * cHRE0 ≤ (((lamRE0 : ℚ) * 4962 - ((gARE0 : ℚ) * 104 - ((gARE0 : ℚ) - gBRE0) * 48) - ((31 : ℕ) : ℚ) * dIRE) / 10 ^ 14) := by + unfold lcpRE0 cHRE0 lamRE0 gARE0 gBRE0 dIRE; norm_num +theorem capRE0 : (capIRE0 : ℚ) ≤ unLoRE0 * 10 ^ 14 / 48 := by unfold capIRE0 unLoRE0; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREL1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREL1.lean new file mode 100644 index 0000000000..54a342ea03 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREL1.lean @@ -0,0 +1,11 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionReaderTree +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem lineRE1 : CTree.lineOKR CTree.rear0 CTree.reir0 capIRE1 dIRE lamRE1 gARE1 gBRE1 = true := by unfold capIRE1 dIRE lamRE1 gARE1 gBRE1; decide +kernel +theorem numRE1 : lcpRE1 + 8 * cHRE1 ≤ (((lamRE1 : ℚ) * 4962 - ((gARE1 : ℚ) * 104 - ((gARE1 : ℚ) - gBRE1) * 48) - ((31 : ℕ) : ℚ) * dIRE) / 10 ^ 14) := by + unfold lcpRE1 cHRE1 lamRE1 gARE1 gBRE1 dIRE; norm_num +theorem capRE1 : (capIRE1 : ℚ) ≤ unLoRE1 * 10 ^ 14 / 48 := by unfold capIRE1 unLoRE1; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRES0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRES0.lean new file mode 100644 index 0000000000..1451a4cc70 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRES0.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionI3DualSig +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigRE0 : sigOK (1 - tRE1) (1 - tRE0) sgRE0 = true := by unfold tRE0 tRE1 sgRE0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRES1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRES1.lean new file mode 100644 index 0000000000..a87fa72569 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRES1.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionI3DualSig +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigRE1 : sigOK (1 - tRE2) (1 - tRE1) sgRE1 = true := by unfold tRE1 tRE2 sgRE1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRET0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRET0.lean new file mode 100644 index 0000000000..997e963da1 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRET0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertREDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem ptRE0 : Fup cfC (1 - tRE0) (1 - tRE0) < 17 * (lcpRE0 - 5 * sgRE0) := by unfold tRE0 lcpRE0 sgRE0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRET1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRET1.lean new file mode 100644 index 0000000000..a9b1a8d238 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRET1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertREDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem ptRE1 : Fup cfC (1 - tRE1) (1 - tRE1) < 17 * (lcpRE1 - 5 * sgRE1) := by unfold tRE1 lcpRE1 sgRE1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREU0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREU0.lean new file mode 100644 index 0000000000..481385bde5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREU0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertREDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem unRE0 : Fup [(8, 1), (9, -1)] (1 - tRE1) (1 - tRE1) < -unLoRE0 := by unfold tRE1 unLoRE0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREU1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREU1.lean new file mode 100644 index 0000000000..bd194b6a3d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREU1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertREDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem unRE1 : Fup [(8, 1), (9, -1)] (1 - tRE2) (1 - tRE2) < -unLoRE1 := by unfold tRE2 unLoRE1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt.lean new file mode 100644 index 0000000000..571f21a35a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt.lean @@ -0,0 +1,52 @@ +import Nov15.CongestionReaderCertREWt0 +import Nov15.CongestionReaderCertREWt1 +import Nov15.CongestionReaderCertREWt2 +import Nov15.CongestionReaderCertREWt3 +import Nov15.CongestionReaderCertREWt4 +import Nov15.CongestionReaderCertREWt5 +import Nov15.CongestionReaderCertREWt6 +import Nov15.CongestionReaderCertREWt7 +import Nov15.CongestionReaderCertREWt8 +import Nov15.CongestionReaderCertREWt9 +import Nov15.CongestionReaderCertREWt10 +import Nov15.CongestionReaderCertREWt11 +import Nov15.CongestionReaderCertREWt12 +import Nov15.CongestionReaderCertREWt13 +import Nov15.CongestionTreeW +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE : CTree.wtOK CTree.reaW (1 - tTJ0RE) (1 - a0RE) = true := by + unfold CTree.wtOK + rw [List.all_eq_true] + intro p hp + simp only [pairs, List.mem_cons, List.not_mem_nil, or_false] at hp + rcases hp with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl + · exact wtRE_1_2 + · exact wtRE_1_3 + · exact wtRE_1_4 + · exact wtRE_1_5 + · exact wtRE_1_6 + · exact wtRE_1_7 + · exact wtRE_1_8 + · exact wtRE_2_3 + · exact wtRE_2_4 + · exact wtRE_2_5 + · exact wtRE_2_6 + · exact wtRE_2_7 + · exact wtRE_2_8 + · exact wtRE_3_4 + · exact wtRE_3_5 + · exact wtRE_3_6 + · exact wtRE_3_7 + · exact wtRE_3_8 + · exact wtRE_4_5 + · exact wtRE_4_6 + · exact wtRE_4_7 + · exact wtRE_4_8 + · exact wtRE_5_6 + · exact wtRE_5_7 + · exact wtRE_5_8 + · exact wtRE_6_7 + · exact wtRE_6_8 + · exact wtRE_7_8 +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt0.lean new file mode 100644 index 0000000000..5e8aeddb34 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt0.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_1_2 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (1, 2) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_1_3 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (1, 3) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt1.lean new file mode 100644 index 0000000000..204612480a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt1.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_1_4 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (1, 4) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_1_5 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (1, 5) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt10.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt10.lean new file mode 100644 index 0000000000..ffbb0e970f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt10.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_4_7 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (4, 7) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_4_8 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (4, 8) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt11.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt11.lean new file mode 100644 index 0000000000..28bc192eea --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt11.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_5_6 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (5, 6) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_5_7 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (5, 7) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt12.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt12.lean new file mode 100644 index 0000000000..fb185079fa --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt12.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_5_8 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (5, 8) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_6_7 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (6, 7) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt13.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt13.lean new file mode 100644 index 0000000000..112868409f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt13.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_6_8 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (6, 8) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_7_8 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (7, 8) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt2.lean new file mode 100644 index 0000000000..4fb18dcca6 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt2.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_1_6 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (1, 6) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_1_7 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (1, 7) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt3.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt3.lean new file mode 100644 index 0000000000..83d57c7ead --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt3.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_1_8 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (1, 8) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_2_3 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (2, 3) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt4.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt4.lean new file mode 100644 index 0000000000..93c761726b --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt4.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_2_4 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (2, 4) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_2_5 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (2, 5) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt5.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt5.lean new file mode 100644 index 0000000000..79fce7d5a7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt5.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_2_6 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (2, 6) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_2_7 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (2, 7) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt6.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt6.lean new file mode 100644 index 0000000000..444d64e804 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt6.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_2_8 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (2, 8) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_3_4 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (3, 4) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt7.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt7.lean new file mode 100644 index 0000000000..4515b7075e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt7.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_3_5 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (3, 5) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_3_6 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (3, 6) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt8.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt8.lean new file mode 100644 index 0000000000..9d4277584d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt8.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_3_7 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (3, 7) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_3_8 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (3, 8) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt9.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt9.lean new file mode 100644 index 0000000000..127c63a4a5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertREWt9.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionTreeW +import Nov15.CTreereaDefs +import Nov15.CTreereiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRE_4_5 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (4, 5) = true := by unfold tTJ0RE a0RE; decide +kernel +theorem wtRE_4_6 : CTree.wtPair CTree.reaW (1 - tTJ0RE) (1 - a0RE) (4, 6) = true := by unfold tTJ0RE a0RE; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFD.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFD.lean new file mode 100644 index 0000000000..98ceaad5e4 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFD.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRFDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem cfC_dRF : 0 < dLo cfC (93 / 100) (1 - a0RF) := by unfold a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFDefs.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFDefs.lean new file mode 100644 index 0000000000..d606117176 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFDefs.lean @@ -0,0 +1,29 @@ +import Nov15.NumCertK +import Nov15.CongestionI3NumC1 +namespace CongestionNative +open NumCertK CongestionI3 +def tTJ0RF : ℚ := 118103 / 10 ^ 7 +def a0RF : ℚ := (28857 : ℚ) / 2500000 +def dIRF : ℕ := 1832044939017 +def tRF0 : ℚ := (28857 : ℚ) / 2500000 +def tRF1 : ℚ := (14441 : ℚ) / 1250000 +def sgRF0 : ℚ := (47643 : ℚ) / 1000000 +def cHRF0 : ℚ := (142783 : ℚ) / 5000000 +def lcpRF0 : ℚ := (15097357 : ℚ) / 500000 +def unLoRF0 : ℚ := (12053940059817 : ℚ) / 12500000000000 +def capIRF0 : ℕ := 2008990009969 +def lamRF0 : ℕ := 646684787048 +def gARF0 : ℕ := 2155930020953 +def gBRF0 : ℕ := 3 +def tRF2 : ℚ := (118103 : ℚ) / 10000000 +def sgRF1 : ℚ := (50979 : ℚ) / 1000000 +def cHRF1 : ℚ := (72963 : ℚ) / 2500000 +def lcpRF1 : ℚ := (6037937 : ℚ) / 200000 +def unLoRF1 : ℚ := (12044162755641 : ℚ) / 12500000000000 +def capIRF1 : ℕ := 2007360459273 +def lamRF1 : ℕ := 646684787048 +def gARF1 : ℕ := 2155930020953 +def gBRF1 : ℕ := 3 +theorem tRFend : tRF2 = tTJ0RF := by unfold tRF2 tTJ0RF; norm_num +theorem tRFstart : tRF0 = a0RF := by unfold tRF0 a0RF; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFDl.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFDl.lean new file mode 100644 index 0000000000..1a477758a4 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFDl.lean @@ -0,0 +1,8 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +namespace CongestionNative +open NumCertK CongestionI3 +def cfDelRF : CF := [(7, 1), (2, 1), (8, -1), (1, -1)] +theorem dlDRF : 0 < dLo (CTree.negCF cfDelRF) (1 - tTJ0RF) (1 - a0RF) := by unfold tTJ0RF a0RF cfDelRF CTree.negCF; decide +kernel +theorem dlPRF : Fup (CTree.negCF cfDelRF) (1 - a0RF) (1 - a0RF) ≤ -((dIRF : ℚ) / 10 ^ 14) := by unfold a0RF dIRF cfDelRF CTree.negCF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFL0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFL0.lean new file mode 100644 index 0000000000..e9f718a03e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFL0.lean @@ -0,0 +1,11 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionReaderTree +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem lineRF0 : CTree.lineOKR CTree.rfar0 CTree.rfir0 capIRF0 dIRF lamRF0 gARF0 gBRF0 = true := by unfold capIRF0 dIRF lamRF0 gARF0 gBRF0; decide +kernel +theorem numRF0 : lcpRF0 + 8 * cHRF0 ≤ (((lamRF0 : ℚ) * 4962 - ((gARF0 : ℚ) * 104 - ((gARF0 : ℚ) - gBRF0) * 48) - ((25 : ℕ) : ℚ) * dIRF) / 10 ^ 14) := by + unfold lcpRF0 cHRF0 lamRF0 gARF0 gBRF0 dIRF; norm_num +theorem capRF0 : (capIRF0 : ℚ) ≤ unLoRF0 * 10 ^ 14 / 48 := by unfold capIRF0 unLoRF0; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFL1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFL1.lean new file mode 100644 index 0000000000..9bed633068 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFL1.lean @@ -0,0 +1,11 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionReaderTree +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem lineRF1 : CTree.lineOKR CTree.rfar0 CTree.rfir0 capIRF1 dIRF lamRF1 gARF1 gBRF1 = true := by unfold capIRF1 dIRF lamRF1 gARF1 gBRF1; decide +kernel +theorem numRF1 : lcpRF1 + 8 * cHRF1 ≤ (((lamRF1 : ℚ) * 4962 - ((gARF1 : ℚ) * 104 - ((gARF1 : ℚ) - gBRF1) * 48) - ((25 : ℕ) : ℚ) * dIRF) / 10 ^ 14) := by + unfold lcpRF1 cHRF1 lamRF1 gARF1 gBRF1 dIRF; norm_num +theorem capRF1 : (capIRF1 : ℚ) ≤ unLoRF1 * 10 ^ 14 / 48 := by unfold capIRF1 unLoRF1; norm_num +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFS0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFS0.lean new file mode 100644 index 0000000000..d18dc01ba7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFS0.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionI3DualSig +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigRF0 : sigOK (1 - tRF1) (1 - tRF0) sgRF0 = true := by unfold tRF0 tRF1 sgRF0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFS1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFS1.lean new file mode 100644 index 0000000000..9b6df3a174 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFS1.lean @@ -0,0 +1,6 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionI3DualSig +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem sigRF1 : sigOK (1 - tRF2) (1 - tRF1) sgRF1 = true := by unfold tRF1 tRF2 sgRF1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFT0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFT0.lean new file mode 100644 index 0000000000..4bd1ea8969 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFT0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRFDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem ptRF0 : Fup cfC (1 - tRF0) (1 - tRF0) < 17 * (lcpRF0 - 5 * sgRF0) := by unfold tRF0 lcpRF0 sgRF0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFT1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFT1.lean new file mode 100644 index 0000000000..0f43313ddb --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFT1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRFDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem ptRF1 : Fup cfC (1 - tRF1) (1 - tRF1) < 17 * (lcpRF1 - 5 * sgRF1) := by unfold tRF1 lcpRF1 sgRF1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFU0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFU0.lean new file mode 100644 index 0000000000..db06306b06 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFU0.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRFDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem unRF0 : Fup [(8, 1), (9, -1)] (1 - tRF1) (1 - tRF1) < -unLoRF0 := by unfold tRF1 unLoRF0; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFU1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFU1.lean new file mode 100644 index 0000000000..2a09f96c9a --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFU1.lean @@ -0,0 +1,5 @@ +import Nov15.CongestionReaderCertRFDefs +namespace CongestionNative +open NumCertK CongestionI3 +theorem unRF1 : Fup [(8, 1), (9, -1)] (1 - tRF2) (1 - tRF2) < -unLoRF1 := by unfold tRF2 unLoRF1; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt.lean new file mode 100644 index 0000000000..85ef143105 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt.lean @@ -0,0 +1,52 @@ +import Nov15.CongestionReaderCertRFWt0 +import Nov15.CongestionReaderCertRFWt1 +import Nov15.CongestionReaderCertRFWt2 +import Nov15.CongestionReaderCertRFWt3 +import Nov15.CongestionReaderCertRFWt4 +import Nov15.CongestionReaderCertRFWt5 +import Nov15.CongestionReaderCertRFWt6 +import Nov15.CongestionReaderCertRFWt7 +import Nov15.CongestionReaderCertRFWt8 +import Nov15.CongestionReaderCertRFWt9 +import Nov15.CongestionReaderCertRFWt10 +import Nov15.CongestionReaderCertRFWt11 +import Nov15.CongestionReaderCertRFWt12 +import Nov15.CongestionReaderCertRFWt13 +import Nov15.CongestionTreeW +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF : CTree.wtOK CTree.rfaW (1 - tTJ0RF) (1 - a0RF) = true := by + unfold CTree.wtOK + rw [List.all_eq_true] + intro p hp + simp only [pairs, List.mem_cons, List.not_mem_nil, or_false] at hp + rcases hp with rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl | rfl + · exact wtRF_1_2 + · exact wtRF_1_3 + · exact wtRF_1_4 + · exact wtRF_1_5 + · exact wtRF_1_6 + · exact wtRF_1_7 + · exact wtRF_1_8 + · exact wtRF_2_3 + · exact wtRF_2_4 + · exact wtRF_2_5 + · exact wtRF_2_6 + · exact wtRF_2_7 + · exact wtRF_2_8 + · exact wtRF_3_4 + · exact wtRF_3_5 + · exact wtRF_3_6 + · exact wtRF_3_7 + · exact wtRF_3_8 + · exact wtRF_4_5 + · exact wtRF_4_6 + · exact wtRF_4_7 + · exact wtRF_4_8 + · exact wtRF_5_6 + · exact wtRF_5_7 + · exact wtRF_5_8 + · exact wtRF_6_7 + · exact wtRF_6_8 + · exact wtRF_7_8 +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt0.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt0.lean new file mode 100644 index 0000000000..50dc806ff9 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt0.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_1_2 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (1, 2) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_1_3 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (1, 3) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt1.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt1.lean new file mode 100644 index 0000000000..1b09d83f22 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt1.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_1_4 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (1, 4) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_1_5 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (1, 5) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt10.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt10.lean new file mode 100644 index 0000000000..d74c87d757 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt10.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_4_7 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (4, 7) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_4_8 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (4, 8) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt11.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt11.lean new file mode 100644 index 0000000000..2ce8f3e996 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt11.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_5_6 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (5, 6) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_5_7 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (5, 7) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt12.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt12.lean new file mode 100644 index 0000000000..e5e913e938 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt12.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_5_8 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (5, 8) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_6_7 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (6, 7) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt13.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt13.lean new file mode 100644 index 0000000000..bab13f8ad8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt13.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_6_8 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (6, 8) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_7_8 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (7, 8) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt2.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt2.lean new file mode 100644 index 0000000000..08526de98c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt2.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_1_6 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (1, 6) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_1_7 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (1, 7) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt3.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt3.lean new file mode 100644 index 0000000000..8e8fab65fa --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt3.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_1_8 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (1, 8) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_2_3 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (2, 3) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt4.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt4.lean new file mode 100644 index 0000000000..f203a358b8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt4.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_2_4 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (2, 4) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_2_5 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (2, 5) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt5.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt5.lean new file mode 100644 index 0000000000..ade48e48e2 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt5.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_2_6 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (2, 6) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_2_7 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (2, 7) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt6.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt6.lean new file mode 100644 index 0000000000..8157515288 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt6.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_2_8 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (2, 8) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_3_4 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (3, 4) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt7.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt7.lean new file mode 100644 index 0000000000..22541e3011 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt7.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_3_5 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (3, 5) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_3_6 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (3, 6) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt8.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt8.lean new file mode 100644 index 0000000000..d9508c8750 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt8.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_3_7 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (3, 7) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_3_8 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (3, 8) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt9.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt9.lean new file mode 100644 index 0000000000..eeec9e4f29 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCertRFWt9.lean @@ -0,0 +1,9 @@ +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionTreeW +import Nov15.CTreerfaDefs +import Nov15.CTreerfiDefs +namespace CongestionNative +open NumCertK CongestionI3 CongestionI3Dual +theorem wtRF_4_5 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (4, 5) = true := by unfold tTJ0RF a0RF; decide +kernel +theorem wtRF_4_6 : CTree.wtPair CTree.rfaW (1 - tTJ0RF) (1 - a0RF) (4, 6) = true := by unfold tTJ0RF a0RF; decide +kernel +end CongestionNative diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCore.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCore.lean new file mode 100644 index 0000000000..e7edb1765c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderCore.lean @@ -0,0 +1,224 @@ +import Nov15.CongestionTreePiece + +/-! +CONGESTION-READER-CORE. Abstract half of the per-reader endpoint charge (CG2 + AUDIT-CG2 + EP3). +Part 1 (registers, EP3): the residual `rho r = ex r - sum of path c2` of a monotone register is a sum of positive parts of the `beta`-variation, + `beta a = g a + g (9-a)`; a Z register (born 0) or a V register born at dim 1 that STOPS at a dim in [2,7] has `rho >= beta(7) - beta(8) = delta`. +Part 2 (payers): if distinct readers are tied to distinct registers with `rho >= delta`, then `regs + delta * |Q| <= sum ex + (#mixed) sigma`. +Part 3 (trees): `tree_lower_reader`: the line bound of `tree_lower` with the per-reader allowance `dI <= delta` for tied readers (set Q) and the + allowance subtracted for the <= 15 untied readers (set Uo: <= 5 mixed + <= 10 owned last movers, AUDIT-CG2 F1). +No sorry, no native_decide. +-/ +namespace CongestionReader +open Finset CongestionI3Dual CongestionNative CTree + +/-! ### 1. residual of a register -/ + +def beta (g : ℝ → ℝ) (a : ℝ) : ℝ := g a + g (9 - a) + +theorem h9_sub_k0 (g : ℝ → ℝ) (a b : ℝ) : h9 g a b - k0 g a b = beta g b - beta g a := by + unfold h9 k0 beta; ring + +theorem tel_Ico (u : ℕ → ℝ) (j : ℕ) : ∀ n, j ≤ n → ∑ i ∈ Finset.Ico j n, (u i - u (i + 1)) = u j - u n := by + intro n hn + induction n, hn using Nat.le_induction with + | base => simp + | succ n hn ih => rw [Finset.sum_Ico_succ_top hn, ih]; ring + +/-- V-class (ends at 9): the residual is at least the net rise of `beta` from birth to any stop. -/ +theorem resid_V (g : ℝ → ℝ) (hg0 : g 0 = 0) (d : ℕ → ℝ) (n : ℕ) (he : d n = 9) (j : ℕ) (hj : j ≤ n) : + beta g (d j) - beta g (d 0) ≤ ex g d n - ∑ i ∈ range n, c2 g (d i) (d (i + 1)) := by + have h1 := sum_h9_eq g hg0 d n he + have hf : ∀ i, 0 ≤ h9 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1)) := fun i => by + have : c2 g (d i) (d (i + 1)) ≤ h9 g (d i) (d (i + 1)) := min_le_left _ _ + linarith + have hu : ∀ i, beta g (d (i + 1)) - beta g (d i) ≤ h9 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1)) := fun i => by + have := h9_sub_k0 g (d i) (d (i + 1)) + have h2 : c2 g (d i) (d (i + 1)) ≤ k0 g (d i) (d (i + 1)) := min_le_right _ _ + linarith + have hsub : ∑ i ∈ range j, (h9 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) ≤ + ∑ i ∈ range n, (h9 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) := + Finset.sum_le_sum_of_subset_of_nonneg (Finset.range_subset_range.2 hj) (fun i _ _ => hf i) + have ht : ∑ i ∈ range j, (beta g (d (i + 1)) - beta g (d i)) = beta g (d j) - beta g (d 0) := + Finset.sum_range_sub (fun i => beta g (d i)) j + have hle : ∑ i ∈ range j, (beta g (d (i + 1)) - beta g (d i)) ≤ + ∑ i ∈ range j, (h9 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) := Finset.sum_le_sum fun i _ => hu i + have e : ∑ i ∈ range n, (h9 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) = + ex g d n - ∑ i ∈ range n, c2 g (d i) (d (i + 1)) := by + rw [Finset.sum_sub_distrib, h1] + linarith + +/-- Z-class (born at 0): the residual is at least the net fall of `beta` from any stop to the end. -/ +theorem resid_Z (g : ℝ → ℝ) (hg0 : g 0 = 0) (d : ℕ → ℝ) (n : ℕ) (h0 : d 0 = 0) (j : ℕ) (hj : j ≤ n) : + beta g (d j) - beta g (d n) ≤ ex g d n - ∑ i ∈ range n, c2 g (d i) (d (i + 1)) := by + have h1 := sum_k0_eq g hg0 d n h0 + have hf : ∀ i, 0 ≤ k0 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1)) := fun i => by + have : c2 g (d i) (d (i + 1)) ≤ k0 g (d i) (d (i + 1)) := min_le_right _ _ + linarith + have hu : ∀ i, beta g (d i) - beta g (d (i + 1)) ≤ k0 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1)) := fun i => by + have := h9_sub_k0 g (d i) (d (i + 1)) + have h2 : c2 g (d i) (d (i + 1)) ≤ h9 g (d i) (d (i + 1)) := min_le_left _ _ + linarith + have hsub : ∑ i ∈ Finset.Ico j n, (k0 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) ≤ + ∑ i ∈ range n, (k0 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) := by + apply Finset.sum_le_sum_of_subset_of_nonneg _ (fun i _ _ => hf i) + intro i hi + rw [Finset.mem_Ico] at hi + exact Finset.mem_range.2 hi.2 + have ht := tel_Ico (fun i => beta g (d i)) j n hj + have hle : ∑ i ∈ Finset.Ico j n, (beta g (d i) - beta g (d (i + 1))) ≤ + ∑ i ∈ Finset.Ico j n, (k0 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) := Finset.sum_le_sum fun i _ => hu i + have e : ∑ i ∈ range n, (k0 g (d i) (d (i + 1)) - c2 g (d i) (d (i + 1))) = + ex g d n - ∑ i ∈ range n, c2 g (d i) (d (i + 1)) := by + rw [Finset.sum_sub_distrib, h1] + linarith + +/-! ### 2. the numeric core: beta(a) >= beta(7) on [2,7], beta(1) = beta(8) -/ + +/-- `delta s = beta(7) - beta(8)` for the price `gs s`. -/ +noncomputable def deltaF (s : ℝ) : ℝ := (7 : ℝ) ^ s + (2 : ℝ) ^ s - (8 : ℝ) ^ s - 1 + +theorem delta_eq (s : ℝ) : beta (gs s) 7 - beta (gs s) 8 = deltaF s := by + unfold beta deltaF gs + norm_num + ring + +theorem beta_ge (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (a : ℝ) (ha : 2 ≤ a) (ha' : a ≤ 7) : + beta (gs s) 7 ≤ beta (gs s) a := by + have hc := (Real.concaveOn_rpow hs0 hs1).2 + have e1 : a = ((7 - a) / 5) * 2 + ((a - 2) / 5) * 7 := by ring + have e2 : 9 - a = ((a - 2) / 5) * 2 + ((7 - a) / 5) * 7 := by ring + have c1 := hc (x := 2) (y := 7) (by norm_num : (2 : ℝ) ∈ Set.Ici (0 : ℝ)) (by norm_num : (7 : ℝ) ∈ Set.Ici (0 : ℝ)) + (a := (7 - a) / 5) (b := (a - 2) / 5) (by linarith) (by linarith) (by ring) + have c2' := hc (x := 2) (y := 7) (by norm_num : (2 : ℝ) ∈ Set.Ici (0 : ℝ)) (by norm_num : (7 : ℝ) ∈ Set.Ici (0 : ℝ)) + (a := (a - 2) / 5) (b := (7 - a) / 5) (by linarith) (by linarith) (by ring) + simp only [smul_eq_mul] at c1 c2' + rw [← e1] at c1 + rw [← e2] at c2' + have p1 : 0 < a := by linarith + have p2 : 0 < 9 - a := by linarith + unfold beta gs + rw [if_pos p1, if_pos p2, if_pos (by norm_num : (0 : ℝ) < 7), if_pos (by norm_num : (0 : ℝ) < 9 - 7)] + norm_num + linarith + +theorem beta_one_eight (s : ℝ) : beta (gs s) 1 = beta (gs s) 8 := by + unfold beta gs + norm_num + ring + +/-! ### 3. tied registers have residual >= delta -/ + +/-- the residual of register `r` -/ +noncomputable def rho {ι : Type*} (s : ℝ) (n : ι → ℕ) (d : ι → ℕ → ℕ) (r : ι) : ℝ := + ex (gs s) (lev d r) (n r) - ∑ i ∈ range (n r), c2 (gs s) (lev d r i) (lev d r (i + 1)) + +/-- A register TIED to a reader (the payer of CG2): either Z-class (born at {0}) ending at dim 8 with a stop at a dim in [2,7], or V-class born at +dim 1 ending at 9 with a stop in [2,7]. Its residual is at least `delta`. (Lean-proved part of CG2 sec. 2; the existence of the tied register +is the hypothesis `hTied` of the theorems.) -/ +def Tied {ι : Type*} (n : ι → ℕ) (d : ι → ℕ → ℕ) (r : ι) : Prop := + (d r 0 = 0 ∧ d r (n r) = 8 ∨ d r 0 = 1 ∧ d r (n r) = 9) ∧ ∃ j ≤ n r, 2 ≤ d r j ∧ d r j ≤ 7 + +theorem tied_rho {ι : Type*} (s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) (n : ι → ℕ) (d : ι → ℕ → ℕ) (r : ι) + (h : Tied n d r) : deltaF s ≤ rho s n d r := by + obtain ⟨hc, j, hj, hj2, hj7⟩ := h + have hb := beta_ge s hs0 hs1 (d r j) (by exact_mod_cast hj2) (by exact_mod_cast hj7) + rw [← sub_nonneg] at hb + have hb' : 0 ≤ beta (gs s) (lev d r j) - beta (gs s) 7 := hb + have e := delta_eq s + unfold rho + rcases hc with ⟨h0, h8⟩ | ⟨h1, h9⟩ + · have := resid_Z (gs s) (gs_zero s) (lev d r) (n r) (by simp [lev, h0]) j hj + have h8' : lev d r (n r) = 8 := by simp [lev, h8] + rw [h8'] at this + linarith + · have := resid_V (gs s) (gs_zero s) (lev d r) (n r) (by simp [lev, h9]) j hj + have h1' : lev d r 0 = 1 := by simp [lev, h1] + rw [h1'] at this + have := beta_one_eight s + linarith + +/-! ### 4. summing over registers with payers -/ + +section Pay +variable {ι : Type*} [DecidableEq ι] + +theorem resid_ge (s : ℝ) (R : Finset ι) (n : ι → ℕ) (d : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < n r, d r i ≤ d r (i + 1)) (hd9 : ∀ r ∈ R, d r (n r) ≤ 9) + (σ : ℝ) (hσ0 : 0 ≤ σ) (hσ : ∀ a b : ℕ, 1 ≤ a → a ≤ b → b ≤ 8 → c2 (gs s) (a : ℝ) (b : ℝ) ≤ σ) : + ∀ r ∈ R, -(if Mixed d n r then σ else 0) ≤ rho s n d r := by + intro r hr + have h1 := sum_c2_le (gs s) (lev d r) (n r) + have hle : ∀ k ≤ n r, d r 0 ≤ d r k := by + intro k + induction k with + | zero => intro _; exact le_refl _ + | succ k ih => intro hk; exact le_trans (ih (by omega)) (hmono r hr k (by omega)) + have h0e := hle (n r) (le_refl _) + unfold rho + by_cases hmx : Mixed d n r + · rw [if_pos hmx] + have := hσ (d r 0) (d r (n r)) hmx.1 h0e hmx.2 + simp only [lev] at h1 ⊢ + linarith + · rw [if_neg hmx] + have hne : d r (n r) = 9 ∨ d r 0 = 0 := by + unfold Mixed at hmx + have := hd9 r hr + omega + have h2 := c2_total_nonmixed (gs s) (gs_zero s) (lev d r 0) (lev d r (n r)) + (by + rcases hne with h | h + · left; simp [lev, h] + · right; simp [lev, h]) + simp only [lev] at h1 h2 ⊢ + linarith + +/-- **payers**: distinct readers `t in Q` tied to distinct registers `pi t` of residual >= delta. Then +`sum of path c2 + delta |Q| <= sum ex + m sigma`. -/ +theorem sum_c2_pay {κ : Type*} [DecidableEq κ] (s : ℝ) (R : Finset ι) (n : ι → ℕ) (d : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < n r, d r i ≤ d r (i + 1)) (hd9 : ∀ r ∈ R, d r (n r) ≤ 9) + (m : ℕ) (hm : (R.filter fun r => Mixed d n r).card ≤ m) (σ : ℝ) (hσ0 : 0 ≤ σ) + (hσ : ∀ a b : ℕ, 1 ≤ a → a ≤ b → b ≤ 8 → c2 (gs s) (a : ℝ) (b : ℝ) ≤ σ) + (δ : ℝ) (hδ0 : 0 ≤ δ) (Q : Finset κ) (π : κ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) + (hπρ : ∀ t ∈ Q, δ ≤ rho s n d (π t)) : + ∑ r ∈ R, ∑ i ∈ range (n r), c2 (gs s) (lev d r i) (lev d r (i + 1)) + δ * Q.card ≤ + ∑ r ∈ R, ex (gs s) (lev d r) (n r) + m * σ := by + classical + have hg := resid_ge s R n d hmono hd9 σ hσ0 hσ + have hstep : ∀ r ∈ R, -(if Mixed d n r then σ else 0) + (if r ∈ Q.image π then δ else 0) ≤ rho s n d r := by + intro r hr + by_cases hq : r ∈ Q.image π + · rw [if_pos hq] + obtain ⟨t, ht, rfl⟩ := Finset.mem_image.1 hq + have := hπρ t ht + have : (0 : ℝ) ≤ (if Mixed d n (π t) then σ else 0) := by split_ifs <;> linarith + linarith + · rw [if_neg hq]; simpa using hg r hr + have hsum := Finset.sum_le_sum hstep + rw [Finset.sum_add_distrib, Finset.sum_neg_distrib] at hsum + have e1 : ∑ r ∈ R, (if r ∈ Q.image π then δ else 0) = δ * Q.card := by + rw [Finset.sum_ite_mem, Finset.inter_eq_right.2 (by + intro r hr; obtain ⟨t, ht, rfl⟩ := Finset.mem_image.1 hr; exact hπR t ht), + Finset.sum_const, nsmul_eq_mul, Finset.card_image_of_injOn hπinj] + ring + have e2 : ∑ r ∈ R, (if Mixed d n r then σ else 0) ≤ m * σ := by + have : ∑ r ∈ R, (if Mixed d n r then σ else 0) = ((R.filter fun r => Mixed d n r).card : ℝ) * σ := by + rw [← Finset.sum_filter]; simp + rw [this] + have hm' : ((R.filter fun r => Mixed d n r).card : ℝ) ≤ m := by exact_mod_cast hm + nlinarith + have e3 : ∑ r ∈ R, rho s n d r = ∑ r ∈ R, ex (gs s) (lev d r) (n r) - + ∑ r ∈ R, ∑ i ∈ range (n r), c2 (gs s) (lev d r i) (lev d r (i + 1)) := by + unfold rho; rw [Finset.sum_sub_distrib] + linarith + +end Pay + +end CongestionReader + +#print axioms CongestionReader.resid_V +#print axioms CongestionReader.resid_Z +#print axioms CongestionReader.beta_ge +#print axioms CongestionReader.tied_rho +#print axioms CongestionReader.sum_c2_pay diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderPiece.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderPiece.lean new file mode 100644 index 0000000000..b6a55b3e79 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderPiece.lean @@ -0,0 +1,153 @@ +import Nov15.CongestionReaderCore +import Nov15.CongestionReaderTree + +/-! +CONGESTION-READER-PIECE: one t-piece of the reader-charge ceiling (analogue of `CTree.tree_piece`). +Differences to `tree_piece`: the tree data `T` are the READERS' trees; the line bound is `tree_lower_reader` (allowance `dI <= SC delta` per tied reader, +15 allowances subtracted); the register side uses `sum_c2_pay` (residual of the payers) instead of `sum_all_c2_le`. +-/ +namespace CTree +open NumCertK JointCeiling CallerCost CongestionI3 CongestionI3Dual CongestionNative CongestionReader Finset + +theorem reader_regs_lower {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (W : List (List ℕ)) (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) (T : TreeData σ ρ μ rsA rsB rootA rootB nB) + (hcA : ∀ r ∈ rsA, Row.check W rsA r = true) (hcB : ∀ r ∈ rsB, Row.check W rsB r = true) + (hrA : rootA.m ≤ 48) (hrB : rootB.m ≤ 48) (capI dI lam gA gB NDL : ℕ) (hline : lineOKR rootA rootB capI dI lam gA gB = true) + (lo hi : ℚ) (hwin : wtOK W lo hi = true) (hlo : 0 ≤ lo) (hhi : hi ≤ 1) (s : ℝ) (h1 : (lo : ℝ) ≤ s) (h2 : s ≤ (hi : ℝ)) + (capR corr Om regs δ : ℝ) (hcap : (capI : ℝ) ≤ SCr * capR) (hδ : (dI : ℝ) ≤ SCr * δ) + (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ NDL) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (hP1 : ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capR * ∑ x ∈ T.S, (T.x x : ℝ) ≤ regs + Om) + (hP2 : ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corr) : + ((lam : ℝ) * 4962 - ((gA : ℝ) * 104 - ((gA : ℝ) - gB) * nB) - NDL * dI) / SCr - corr ≤ regs + Om + δ * Q.card := by + have hSC : (0 : ℝ) < SCr := by unfold SCr; positivity + set w : μ → ℝ := fun e => c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) with hw + have hWl : ∀ e, 1 ≤ T.dA e → T.dA e < T.dB e → T.dB e ≤ 8 → + (((W.getD (T.dA e) []).getD (T.dB e) 0 : ℕ) : ℝ) ≤ SCr * w e := by + intro e ha hab hb + have := W_lower W lo hi hwin hlo hhi s h1 h2 (T.dA e) (T.dB e) ha hab hb + have h' := (div_le_iff₀ hSC).1 this + simp only [hw] + rw [mul_comm]; exact h' + have hw0 : ∀ e ∈ T.Mreg ∪ T.Mun, 0 ≤ w e := by + intro e he + obtain ⟨ha, hab, hb⟩ := T.hdim e he + have := W_lower W lo hi hwin hlo hhi s h1 h2 (T.dA e) (T.dB e) ha hab hb + exact le_trans (div_nonneg (Nat.cast_nonneg _) hSC.le) this + have tl := tree_lower_reader W rsA rsB rootA rootB nB T hcA hcB hrA hrB capI dI lam gA gB NDL hline w hWl + (fun e he => hw0 e (T.hMsub he)) capR δ hcap hδ Q Uo hUo hUc hQ hcase + have u1 : ∑ e ∈ T.Mv, w e ≤ ∑ e ∈ T.Mreg ∪ T.Mun, w e := + Finset.sum_le_sum_of_subset_of_nonneg T.hMsub (fun e he _ => hw0 e he) + have u2 : ∑ e ∈ T.Mreg ∪ T.Mun, w e ≤ ∑ e ∈ T.Mreg, w e + ∑ e ∈ T.Mun, w e := by + have h := Finset.sum_union_inter (s₁ := T.Mreg) (s₂ := T.Mun) (f := w) + have h0 : 0 ≤ ∑ e ∈ T.Mreg ∩ T.Mun, w e := + Finset.sum_nonneg (fun e he => hw0 e (Finset.mem_union_left _ (Finset.mem_of_mem_inter_left he))) + linarith + have h3 : ∑ e ∈ T.Mv, w e + capR * ∑ x ∈ T.S, (T.x x : ℝ) ≤ regs + Om + corr := by + have : ∑ e ∈ T.Mreg, w e = ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) := rfl + have : ∑ e ∈ T.Mun, w e = ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) := rfl + linarith + have hQc : (0 : ℝ) ≤ δ * Q.card := by + have : (0 : ℝ) ≤ δ := by + have : (0 : ℝ) ≤ SCr * δ := le_trans (by positivity) hδ + exact nonneg_of_mul_nonneg_right (by linarith) hSC + positivity + have h4 : SCr * (∑ e ∈ T.Mv, w e + capR * ∑ x ∈ T.S, (T.x x : ℝ) + δ * Q.card) ≤ SCr * (regs + Om + corr + δ * Q.card) := + mul_le_mul_of_nonneg_left (by linarith) hSC.le + rw [sub_le_iff_le_add, div_le_iff₀ hSC] + nlinarith + +/-- one t-piece [a, b] of the reader-charge ceiling, inside [a0, tJ0] (shape of `tree_piece`). New hypotheses: `hdel` (certified `dI <= SC delta` on the window), +`hline` (`lineOKR`), `hnum` (15 allowances subtracted), and the READER STRUCTURE `Q, Uo, pi` with `hTied` (named hypothesis, F2 lineage lemma + TL-a/b/c + +CG1 + own56 + X-born-at-1; see CongestionReader.md). -/ +theorem reader_piece {ι : Type*} [DecidableEq ι] {σ' ρ' μ' : Type} [DecidableEq σ'] [DecidableEq ρ'] [DecidableEq μ'] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr : ℕ) (E : ℝ → ℝ) (cstF : ℝ → ℝ) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (W : List (List ℕ)) (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) (T : TreeData σ' ρ' μ' rsA rsB rootA rootB nB) + (hcA : ∀ r ∈ rsA, Row.check W rsA r = true) (hcB : ∀ r ∈ rsB, Row.check W rsB r = true) + (hrA : rootA.m ≤ 48) (hrB : rootB.m ≤ 48) + (a0 a b lcp σc cH unLo : ℚ) (capI dI lam gA gB NDL : ℕ) + (hwin : wtOK W (1 - tJ0) (1 - a0) = true) (ha0 : a0 ≤ a) (hab : a ≤ b) (hb : b ≤ tJ0) (ha00 : 0 ≤ a0) + (hσc : sigOK (1 - b) (1 - a) σc = true) (hσ0 : 0 ≤ σc) + (hline : lineOKR rootA rootB capI dI lam gA gB = true) + (hnum : lcp + 8 * cH ≤ (((lam : ℚ) * 4962 - ((gA : ℚ) * 104 - ((gA : ℚ) - gB) * nB) - NDL * dI) / 10 ^ 14)) + (hcapI : (capI : ℚ) ≤ unLo * 10 ^ 14 / 48) (hun : (unLo : ℝ) ≤ (9 : ℝ) ^ (1 - (b : ℝ)) - (8 : ℝ) ^ (1 - (b : ℝ))) + (hcst : cstF (b : ℝ) ≤ (cH : ℝ)) (hcstMono : MonotoneOn cstF (Set.Icc ((a0 : ℚ) : ℝ) (1 / 10))) + (hdel : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0 : ℚ) : ℝ) → (dI : ℝ) ≤ SCr * deltaF s) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0 : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0 : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (Q Uo : Finset σ') (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ NDL) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (π : σ' → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) (hTied : ∀ t ∈ Q, Tied nR dR (π t)) + (hFb : ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (((lcp - 5 * σc : ℚ)) : ℝ)) : + ∀ t : ℝ, (a : ℝ) ≤ t → t ≤ (b : ℝ) → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + intro t h1 h2 + have hbJ : b ≤ tJ0 := hb + have htJ : tJ0 ≤ 1 / 10 := by unfold tJ0; norm_num + have hbq : (b : ℝ) ≤ ((tJ0 : ℚ) : ℝ) := by exact_mod_cast hb + have hbq' : (b : ℝ) ≤ 1 / 10 := by + have := (Rat.cast_le (K := ℝ)).mpr (le_trans hb htJ); push_cast at this; exact this + have haq : ((a0 : ℚ) : ℝ) ≤ a := by exact_mod_cast ha0 + have hab' : (a : ℝ) ≤ b := by exact_mod_cast hab + have hA0 : (0 : ℝ) ≤ a0 := by exact_mod_cast ha00 + have hs0 : 0 ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + have hσ : ∀ a' b' : ℕ, 1 ≤ a' → a' ≤ b' → b' ≤ 8 → c2 (gs (1 - t)) (a' : ℝ) (b' : ℝ) ≤ (σc : ℝ) := by + intro a' b' h1' h2' h3' + have hb0 : 0 ≤ 1 - b := by + have : b ≤ 1 := le_trans hb (by unfold tJ0; norm_num) + linarith + exact sig_of_ok (1 - b) (1 - a) σc hσc hb0 (by linarith) hσ0 (1 - t) + (by push_cast; linarith) (by push_cast; linarith) a' b' h1' h2' h3' + have hlo : (0 : ℚ) ≤ 1 - tJ0 := by unfold tJ0; norm_num + have hhi : (1 - a0 : ℚ) ≤ 1 := by linarith + have hw1 : ((1 - tJ0 : ℚ) : ℝ) ≤ 1 - t := by push_cast; linarith + have hw2 : 1 - t ≤ ((1 - a0 : ℚ) : ℝ) := by push_cast; linarith + have hcap : (capI : ℝ) ≤ SCr * capC (1 - t) := by + have hu : (unLo : ℝ) ≤ (9 : ℝ) ^ (1 - t) - (8 : ℝ) ^ (1 - t) := by + have := unit_mono (1 - (b : ℝ)) (1 - t) (by linarith) (by linarith) + linarith + have hc : (capI : ℝ) ≤ (unLo : ℝ) * 10 ^ 14 / 48 := by exact_mod_cast hcapI + unfold SCr capC + have : (unLo : ℝ) * 10 ^ 14 / 48 ≤ 10 ^ 14 * (((9 : ℝ) ^ (1 - t) - (8 : ℝ) ^ (1 - t)) / 48) := by nlinarith + linarith + have hcorr : corrC cstF (1 - t) ≤ 8 * (cH : ℝ) := by + unfold corrC + have e : 1 - (1 - t) = t := by ring + rw [e] + have : cstF t ≤ cstF (b : ℝ) := + hcstMono ⟨le_trans haq h1, by linarith⟩ ⟨le_trans haq hab', hbq'⟩ h2 + linarith + have hδs := hdel (1 - t) hw1 hw2 + have hSC : (0 : ℝ) < SCr := by unfold SCr; positivity + have hδ0 : 0 ≤ deltaF (1 - t) := by + have : (0 : ℝ) ≤ SCr * deltaF (1 - t) := le_trans (by positivity) hδs + exact nonneg_of_mul_nonneg_right (by linarith) hSC + have hT := reader_regs_lower W rsA rsB rootA rootB nB T hcA hcB hrA hrB capI dI lam gA gB NDL hline (1 - tJ0) (1 - a0) hwin hlo hhi + (1 - t) hw1 hw2 (capC (1 - t)) (corrC cstF (1 - t)) (Omega ks mr (1 - t)) + (∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs (1 - t)) (lev dR r i) (lev dR r (i + 1))) (deltaF (1 - t)) hcap hδs + Q Uo hUo hUc hQ hcase (hP1 (1 - t) hw1 hw2) (hP2 (1 - t) hw1 hw2) + have hnum' : (lcp : ℝ) + 8 * cH ≤ ((lam : ℝ) * 4962 - ((gA : ℝ) * 104 - ((gA : ℝ) - gB) * nB) - NDL * dI) / SCr := by + have := (Rat.cast_le (K := ℝ)).mpr hnum + push_cast at this + unfold SCr; linarith + have hpay := sum_c2_pay (1 - t) R nR dR hmono hd9 5 hmix (σc : ℝ) (by exact_mod_cast hσ0) hσ (deltaF (1 - t)) hδ0 Q π hπR hπinj + (fun t' ht' => tied_rho (1 - t) hs0 hs1 nR dR (π t') (hTied t' ht')) + push_cast at hpay + have hE' : (((lcp - 5 * σc : ℚ)) : ℝ) ≤ E (1 - t) + Omega ks mr (1 - t) := by + have := hEex (1 - t) hs0 hs1 + push_cast + linarith + exact branchC_om n ks mr (E (1 - t)) _ (1 - t) (hF _ hs0 hs1) hE' (hFb (1 - t) (by push_cast; linarith) (by push_cast; linarith)) + +end CTree + +#print axioms CTree.reader_regs_lower +#print axioms CTree.reader_piece diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderTree.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderTree.lean new file mode 100644 index 0000000000..eb172f271f --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderTree.lean @@ -0,0 +1,132 @@ +import Nov15.CongestionTreePiece + +/-! +CONGESTION-READER-TREE: the line bound of `tree_lower` with a per-reader allowance. +`T.S` are the READERS (IN side; the IN DP table is the reflection of the OUT table, c2 is reflection symmetric), `T.J` the junk cells (reader, source). +`Q` = readers tied to a register with residual >= delta, `Uo` = the <= NDL = 15 + omega untied readers (mixed payers / owned last movers). +Every reader is tied, all-transported (x = k), or in Uo. `lineOKR` has the allowance `dI <= SC delta` in the tied case. +-/ +namespace CTree +open Finset + +def lineOKR (rA rB : Row) (capI dI lam gA gB : ℕ) : Bool := + (List.range 49).all (fun x => (List.range 49).all (fun r => + decide (lam * min 48 (x + r) ≤ gv rA r + x * capI + dI + gA) && + decide (lam * min 48 (x + r) ≤ gv rB r + x * capI + dI + gB))) + && decide (gB ≤ gA) && decide (lam ≤ capI) + +theorem tree_lower_reader {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (W : List (List ℕ)) (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) (T : TreeData σ ρ μ rsA rsB rootA rootB nB) + (hcA : ∀ r ∈ rsA, Row.check W rsA r = true) (hcB : ∀ r ∈ rsB, Row.check W rsB r = true) + (hrA : rootA.m ≤ 48) (hrB : rootB.m ≤ 48) (capI dI lam gA gB NDL : ℕ) + (hline : lineOKR rootA rootB capI dI lam gA gB = true) + (w : μ → ℝ) + (hW : ∀ e, 1 ≤ T.dA e → T.dA e < T.dB e → T.dB e ≤ 8 → + (((W.getD (T.dA e) []).getD (T.dB e) 0 : ℕ) : ℝ) ≤ SCr * w e) + (hw0 : ∀ e ∈ T.Mv, 0 ≤ w e) (cap δ : ℝ) (hcap : (capI : ℝ) ≤ SCr * cap) (hδ : (dI : ℝ) ≤ SCr * δ) + (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ NDL) (hQ : Q ⊆ T.S) + (hcase : ∀ s ∈ T.S, s ∈ Q ∨ T.x s = (T.J.filter fun p => p.1 = s).card ∨ s ∈ Uo) : + (lam : ℝ) * 4962 - ((gA : ℝ) * 104 - ((gA : ℝ) - gB) * nB) - NDL * dI ≤ + SCr * (∑ e ∈ T.Mv, w e + cap * ∑ s ∈ T.S, (T.x s : ℝ) + δ * Q.card) := by + have hred := reduction T.S T.ms T.nm w T.Mv T.hnd T.hMv T.hcap hw0 + have hSC : (0 : ℝ) < SCr := by unfold SCr; positivity + unfold lineOKR at hline + simp only [Bool.and_eq_true, List.all_eq_true, List.mem_range, decide_eq_true_eq] at hline + obtain ⟨⟨hline, hBA⟩, hlc⟩ := hline + set k : σ → ℕ := fun s => (T.J.filter fun p => p.1 = s).card with hk + set γ : σ → ℕ := fun s => if s ∈ T.Bset then gB else gA with hγ + have hlcR : (lam : ℝ) ≤ capI := by exact_mod_cast hlc + have per : ∀ s ∈ T.S, (lam : ℝ) * k s - γ s - (if s ∈ Uo then (dI : ℝ) else 0) ≤ + SCr * (((T.ms s).map fun e => w e / T.nm e).sum + cap * T.x s) + (if s ∈ Q then (dI : ℝ) else 0) := by + intro s hs + have hk48 : k s ≤ 48 := T.hfib s hs + have hx := T.hxk s hs + have hc := T.hcell s hs + have key : ∀ (root : Row) (rs : List Row) (g : ℕ), (∀ r ∈ rs, Row.check W rs r = true) → root.m ≤ 48 → + (∀ x < 49, ∀ r < 49, lam * min 48 (x + r) ≤ gv root r + x * capI + dI + g) → + Tr rs T.nm T.dA T.dB root (T.R s) (T.ms s) → + (lam : ℝ) * k s - g - (if s ∈ Uo then (dI : ℝ) else 0) ≤ + SCr * (((T.ms s).map fun e => w e / T.nm e).sum + cap * T.x s) + (if s ∈ Q then (dI : ℝ) else 0) := by + intro root rs g hcert hr48 hl htr + have hcost := tree_cost_ge W rs hcert T.nm T.dA T.dB w hW htr + have hrc := htr.card_le + have hgv : (0 : ℝ) ≤ ((gv root (T.R s).card : ℕ) : ℝ) := Nat.cast_nonneg _ + have hcx : (T.x s : ℝ) * capI ≤ SCr * (cap * T.x s) := by + have : (0 : ℝ) ≤ T.x s := by positivity + nlinarith + have hdQ : (0 : ℝ) ≤ (if s ∈ Q then (dI : ℝ) else 0) := by split_ifs <;> positivity + have hdU : (0 : ℝ) ≤ (if s ∈ Uo then (dI : ℝ) else 0) := by split_ifs <;> positivity + have hl' := hl (T.x s) (by have := T.hfib s hs; omega) (T.R s).card (by omega) + have hn : lam * k s ≤ gv root (T.R s).card + T.x s * capI + dI + g := by + have : k s ≤ min 48 (T.x s + (T.R s).card) := le_min hk48 hc + exact le_trans (Nat.mul_le_mul_left _ this) hl' + have hr : (lam : ℝ) * k s ≤ ((gv root (T.R s).card : ℕ) : ℝ) + T.x s * capI + dI + g := by exact_mod_cast hn + by_cases hU : s ∈ Uo + · rw [if_pos hU]; linarith + · rw [if_neg hU] + rcases hcase s hs with hq | hxk | hu + · rw [if_pos hq]; linarith + · -- all transported: k <= x, lam <= capI + have hkx : (k s : ℝ) ≤ T.x s := by + have : k s ≤ T.x s := hxk ▸ le_refl _ + exact_mod_cast this + have hlk : (lam : ℝ) * k s ≤ capI * T.x s := by + have h0 : (0 : ℝ) ≤ k s := by positivity + have h1 : (0 : ℝ) ≤ T.x s := by positivity + nlinarith + have hg0 : (0 : ℝ) ≤ g := by positivity + have : (0 : ℝ) ≤ SCr * (((T.ms s).map fun e => w e / T.nm e).sum) := le_trans hgv hcost + split_ifs <;> nlinarith + · exact absurd hu hU + by_cases hb : s ∈ T.Bset + · have := key rootB rsB gB hcB hrB (fun x hx r hr => (hline x hx r hr).2) (T.htreeB s hb) + simpa [hγ, hb] using this + · have := key rootA rsA gA hcA hrA (fun x hx r hr => (hline x hx r hr).1) (T.htreeA s hs hb) + simpa [hγ, hb] using this + have hsum := Finset.sum_le_sum per + have hJ : (T.J.card : ℝ) = ∑ s ∈ T.S, (k s : ℝ) := by + have := Finset.card_eq_sum_card_fiberwise (f := Prod.fst) (s := T.J) (t := T.S) T.hJS + exact_mod_cast this + have hJge : (4962 : ℝ) ≤ ∑ s ∈ T.S, (k s : ℝ) := by rw [← hJ]; exact_mod_cast T.hJcard + have hγs : ∑ s ∈ T.S, (γ s : ℝ) ≤ gA * 104 - (gA - gB) * nB := by + have e : ∀ s, (γ s : ℝ) = gA - (if s ∈ T.Bset then ((gA : ℝ) - gB) else 0) := by + intro s; simp only [hγ]; split_ifs <;> push_cast <;> ring + rw [Finset.sum_congr rfl (fun s _ => e s), Finset.sum_sub_distrib, Finset.sum_const, Finset.sum_ite_mem, + Finset.inter_eq_right.2 T.hB, Finset.sum_const, nsmul_eq_mul, nsmul_eq_mul] + have h1 : (T.S.card : ℝ) ≤ 104 := by exact_mod_cast T.hScard + have h2 : (nB : ℝ) ≤ T.Bset.card := by exact_mod_cast T.hBcard + have h3 : (gB : ℝ) ≤ gA := by exact_mod_cast hBA + have h4 : (0 : ℝ) ≤ gA := by positivity + nlinarith [mul_nonneg h4 (sub_nonneg.2 h1), mul_nonneg (sub_nonneg.2 h3) (sub_nonneg.2 h2)] + have hlam : (0 : ℝ) ≤ lam := by positivity + have hgl : (lam : ℝ) * 4962 ≤ lam * ∑ s ∈ T.S, (k s : ℝ) := mul_le_mul_of_nonneg_left hJge hlam + have eU : ∑ s ∈ T.S, (if s ∈ Uo then (dI : ℝ) else 0) = Uo.card * dI := by + rw [Finset.sum_ite_mem, Finset.inter_eq_right.2 hUo, Finset.sum_const, nsmul_eq_mul] + have eQ : ∑ s ∈ T.S, (if s ∈ Q then (dI : ℝ) else 0) = Q.card * dI := by + rw [Finset.sum_ite_mem, Finset.inter_eq_right.2 hQ, Finset.sum_const, nsmul_eq_mul] + have e1 : ∑ s ∈ T.S, ((lam : ℝ) * k s - γ s - (if s ∈ Uo then (dI : ℝ) else 0)) = + lam * ∑ s ∈ T.S, (k s : ℝ) - ∑ s ∈ T.S, (γ s : ℝ) - Uo.card * dI := by + rw [Finset.sum_sub_distrib, Finset.sum_sub_distrib, ← Finset.mul_sum, eU] + have e2 : ∑ s ∈ T.S, (SCr * (((T.ms s).map fun e => w e / T.nm e).sum + cap * T.x s) + + (if s ∈ Q then (dI : ℝ) else 0)) = + SCr * (∑ s ∈ T.S, ((T.ms s).map fun e => w e / T.nm e).sum + cap * ∑ s ∈ T.S, (T.x s : ℝ)) + Q.card * dI := by + rw [Finset.sum_add_distrib, eQ, ← Finset.mul_sum, Finset.sum_add_distrib, ← Finset.mul_sum] + rw [e1, e2] at hsum + have h5 : SCr * (∑ s ∈ T.S, ((T.ms s).map fun e => w e / T.nm e).sum + cap * ∑ s ∈ T.S, (T.x s : ℝ)) ≤ + SCr * (∑ e ∈ T.Mv, w e + cap * ∑ s ∈ T.S, (T.x s : ℝ)) := + mul_le_mul_of_nonneg_left (add_le_add_left hred _ |> fun h => by linarith) hSC.le + have hUc' : (Uo.card : ℝ) ≤ NDL := by exact_mod_cast hUc + have hdI0 : (0 : ℝ) ≤ dI := by positivity + have hQd : (Q.card : ℝ) * dI ≤ SCr * (δ * Q.card) := by + have h0 : (0 : ℝ) ≤ (Q.card : ℝ) := by positivity + have := mul_le_mul_of_nonneg_left hδ h0 + nlinarith + have hC : (Uo.card : ℝ) * dI ≤ NDL * dI := mul_le_mul_of_nonneg_right hUc' hdI0 + have h6 : SCr * (∑ e ∈ T.Mv, w e + cap * ∑ s ∈ T.S, (T.x s : ℝ) + δ * Q.card) = + SCr * (∑ e ∈ T.Mv, w e + cap * ∑ s ∈ T.S, (T.x s : ℝ)) + SCr * (δ * Q.card) := by ring + rw [h6] + linarith + +end CTree + +#print axioms CTree.tree_lower_reader diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderW10.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderW10.lean new file mode 100644 index 0000000000..3a996b9d59 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderW10.lean @@ -0,0 +1,141 @@ +import Nov15.CongestionReaderPiece +import Nov15.CTreeDataRFA +import Nov15.CTreeDataRFI +import Nov15.CongestionReaderCertRFDefs +import Nov15.CongestionReaderCertRFWt +import Nov15.CongestionReaderCertRFD +import Nov15.CongestionReaderCertRFDl +import Nov15.CongestionReaderCertRFS0 +import Nov15.CongestionReaderCertRFT0 +import Nov15.CongestionReaderCertRFU0 +import Nov15.CongestionReaderCertRFL0 +import Nov15.CongestionReaderCertRFS1 +import Nov15.CongestionReaderCertRFT1 +import Nov15.CongestionReaderCertRFU1 +import Nov15.CongestionReaderCertRFL1 + +/-! +CONGESTION-READER. Reader-charge refinement of the tree ceiling `ceiling_tree_GD` (#7678, Nov15/CongestionTree.lean): +CG2's per-reader endpoint charge (IN' = sum_t min(H_t + delta, K_t min(c18, capv)) - 15 delta, delta = beta(7) - beta(8)) in the audited shippable form. +`ceiling_reader_GD_w10` (omega <= 10) : F(1 - t, invoice (caller 6 7) n 17) < 0 for t in [a0RF, 1], a0RF = 28857/2500000 = .01154280. Lean-proved: the register identity +(`resid_V`, `resid_Z`, `tied_rho`: a tied register has residual >= delta), the payer summation (`sum_c2_pay`), the reader line bound +(`tree_lower_reader`), the piece lemma, all numerics (kernel). NAMED hypotheses (see CongestionReader.md): hTied/hcase/hUc (reader structure = +CG2 sec. 2 + F2 lineage lemma + TL-a/b/c + own56 + X born at dim 1), plus the tree hypotheses of #7678 (CongestionTree.md there). +-/ +namespace CongestionNative +open NumCertK JointCeiling CallerCost CongestionI3 CongestionI3Dual Finset + +theorem hdelRF : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RF : ℚ) : ℝ) → + (dIRF : ℝ) ≤ CTree.SCr * CongestionReader.deltaF s := by + intro s h1 h2 + have hok : okR cfDelRF := by + intro p hp + simp only [cfDelRF, List.mem_cons, List.not_mem_nil, or_false] at hp + rcases hp with rfl | rfl | rfl | rfl <;> norm_num + have hd : 0 < dLo (CTree.negCF cfDelRF) (1 - tJ0) (1 - a0RF) := dlDRF + have hp : Fup (CTree.negCF cfDelRF) (1 - a0RF) (1 - a0RF) ≤ -((dIRF : ℚ) / 10 ^ 14) := dlPRF + have := CTree.cf_lower cfDelRF hok (1 - tJ0) (1 - a0RF) (by unfold tJ0; norm_num) (by unfold a0RF; norm_num) hd + ((dIRF : ℚ) / 10 ^ 14) hp s h1 h2 + have e : Fc cfDelRF s = CongestionReader.deltaF s := by + simp [Fc, cfDelRF, CongestionReader.deltaF, Real.one_rpow] + ring + rw [e] at this + have hS : CTree.SCr = ((10 ^ 14 : ℚ) : ℝ) := by unfold CTree.SCr; push_cast; ring + rw [hS] + push_cast at this ⊢ + have := mul_le_mul_of_nonneg_left this (by norm_num : (0 : ℝ) ≤ 10 ^ 14) + have h14 : (10 : ℝ) ^ 14 * ((dIRF : ℝ) / 10 ^ 14) = dIRF := by field_simp + linarith + +theorem corr_nonnegRF (cstF : ℝ → ℝ) (hcstLo : ∀ t : ℝ, ((a0RF : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) : + ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RF : ℚ) : ℝ) → 0 ≤ corrC cstF s := by + intro s h1 h2 + unfold corrC + have ha : ((a0RF : ℚ) : ℝ) ≤ 1 - s := by push_cast at h2 ⊢; linarith + have hb : 1 - s ≤ 1 / 10 := by + have : ((1 - tJ0 : ℚ) : ℝ) = 1 - 118103 / 10 ^ 7 := by unfold tJ0; push_cast; norm_num + rw [this] at h1; linarith + have := hcstLo (1 - s) ha hb + linarith + +theorem hFbT_ofRRF (a0 a b L : ℚ) (hd : 0 < dLo cfC (93 / 100) (1 - a0)) (ha00 : 0 ≤ a0) (hb93 : 93 / 100 ≤ 1 - b) (hab : a ≤ b) + (haJ : a0 ≤ a) (hpt : Fup cfC (1 - a) (1 - a) < 17 * L) : + ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (L : ℝ) := by + intro s h1 h2 + have hb : (((93 / 100 : ℚ)) : ℝ) ≤ s := le_trans (by exact_mod_cast hb93) h1 + have haA : (1 - a : ℚ) ≤ 1 - a0 := by linarith + have hA : ((1 - a : ℚ) : ℝ) ≤ ((1 - a0 : ℚ) : ℝ) := by exact_mod_cast haA + have hm := Fc_monoOn cfC cfC_ok (93 / 100) (1 - a0) (by norm_num) (by linarith) hd s ((1 - a : ℚ) : ℝ) hb h2 hA + exact lt_of_le_of_lt hm (pt_of_Fup cfC cfC_ok (1 - a) L (by linarith) (by linarith) hpt) + +theorem ceiling_reader_GD_w10 + {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 4962 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hspTabJ : ((spFloJ0 : ℚ) : ℝ) ≤ spF ((tJ0 : ℚ) : ℝ) ∧ ((spFloJ1 : ℚ) : ℝ) ≤ spF ((tJ1 : ℚ) : ℝ) ∧ + ((spFloJ2 : ℚ) : ℝ) ≤ spF ((tJ2 : ℚ) : ℝ)) + (hcstTabJ : cstF ((tJ1 : ℚ) : ℝ) ≤ ((cHJ0 : ℚ) : ℝ) ∧ cstF ((tJ2 : ℚ) : ℝ) ≤ ((cHJ1 : ℚ) : ℝ) ∧ + cstF ((tC0 : ℚ) : ℝ) ≤ ((cHJ2 : ℚ) : ℝ)) + {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (T : CTree.TreeData σ ρ μ CTree.rfaR CTree.rfiR CTree.rfar0 CTree.rfir0 48) + (hcstLo : ∀ t : ℝ, ((a0RF : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) + (hcstMonoT : MonotoneOn cstF (Set.Icc ((a0RF : ℚ) : ℝ) (1 / 10))) + (hcst0 : cstF ((tRF1 : ℚ) : ℝ) ≤ ((cHRF0 : ℚ) : ℝ)) + (hcst1 : cstF ((tRF2 : ℚ) : ℝ) ≤ ((cHRF1 : ℚ) : ℝ)) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RF : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RF : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (ω : ℕ) (hω : ω ≤ 10) (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ 15 + ω) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (π : σ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) (hTied : ∀ t ∈ Q, CongestionReader.Tied nR dR (π t)) : + ∀ t : ℝ, ((a0RF : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + have eJ : tTJ0RF = tJ0 := rfl + have hwin := wtRF + rw [eJ] at hwin + have hdd := cfC_dRF + have hdel := hdelRF + have hUc' : Uo.card ≤ 25 := by omega + intro t ht ht1 + rcases le_or_gt ((tJ0 : ℚ) : ℝ) t with hC | hC + · exact ceiling_native_J R nR dR hmono hd9 hmix n ks mr st E J distF spF cstF hk hmass hmd hmr hF hY hst hEex hcong hdist hJ hspMono hcstMono hspTab hcstTab hspTabJ hcstTabJ t hC ht1 + have p0 := CTree.reader_piece R nR dR hmono hd9 hmix n ks mr E cstF hF hEex CTree.rfaW CTree.rfaR CTree.rfiR CTree.rfar0 CTree.rfir0 48 T + CTree.rfa_all (by have h := CTree.rfi_all; rwa [show CTree.rfiW = CTree.rfaW from rfl] at h) (by decide) (by decide) a0RF tRF0 tRF1 lcpRF0 sgRF0 cHRF0 unLoRF0 capIRF0 dIRF lamRF0 gARF0 gBRF0 25 + hwin (by unfold tRF0 a0RF; norm_num) (by unfold tRF0 tRF1; norm_num) (by unfold tRF1 tJ0; norm_num) (by unfold a0RF; norm_num) sigRF0 (by unfold sgRF0; norm_num) lineRF0 numRF0 capRF0 + (unit_of_Fup tRF1 unLoRF0 (by unfold tRF1; norm_num) (by unfold tRF1; norm_num) (by have := unRF0; exact this)) hcst0 hcstMonoT hdel hP1 hP2 + Q Uo hUo hUc' hQ hcase π hπR hπinj hTied + (hFbT_ofRRF a0RF tRF0 tRF1 _ hdd (by unfold a0RF; norm_num) (by unfold tRF1; norm_num) (by unfold tRF0 tRF1; norm_num) (by unfold tRF0 a0RF; norm_num) ptRF0) + have p1 := CTree.reader_piece R nR dR hmono hd9 hmix n ks mr E cstF hF hEex CTree.rfaW CTree.rfaR CTree.rfiR CTree.rfar0 CTree.rfir0 48 T + CTree.rfa_all (by have h := CTree.rfi_all; rwa [show CTree.rfiW = CTree.rfaW from rfl] at h) (by decide) (by decide) a0RF tRF1 tRF2 lcpRF1 sgRF1 cHRF1 unLoRF1 capIRF1 dIRF lamRF1 gARF1 gBRF1 25 + hwin (by unfold tRF1 a0RF; norm_num) (by unfold tRF1 tRF2; norm_num) (tRFend.trans eJ).le (by unfold a0RF; norm_num) sigRF1 (by unfold sgRF1; norm_num) lineRF1 numRF1 capRF1 + (unit_of_Fup tRF2 unLoRF1 (by unfold tRF2; norm_num) (by unfold tRF2; norm_num) (by have := unRF1; exact this)) hcst1 hcstMonoT hdel hP1 hP2 + Q Uo hUo hUc' hQ hcase π hπR hπinj hTied + (hFbT_ofRRF a0RF tRF1 tRF2 _ hdd (by unfold a0RF; norm_num) (by unfold tRF2; norm_num) (by unfold tRF1 tRF2; norm_num) (by unfold tRF1 a0RF; norm_num) ptRF1) + rcases le_or_gt t ((tRF1 : ℚ) : ℝ) with h1 | h1 + · exact p0 t (by rw [tRFstart]; exact ht) h1 + exact p1 t h1.le (by rw [show tRF2 = tJ0 from tRFend.trans eJ]; exact hC.le) + +end CongestionNative + +#print axioms CongestionNative.corr_nonnegRF +#print axioms CongestionNative.hdelRF +#print axioms CongestionNative.ceiling_reader_GD_w10 diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionReaderW16.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderW16.lean new file mode 100644 index 0000000000..8084360048 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionReaderW16.lean @@ -0,0 +1,141 @@ +import Nov15.CongestionReaderPiece +import Nov15.CTreeDataREA +import Nov15.CTreeDataREI +import Nov15.CongestionReaderCertREDefs +import Nov15.CongestionReaderCertREWt +import Nov15.CongestionReaderCertRED +import Nov15.CongestionReaderCertREDl +import Nov15.CongestionReaderCertRES0 +import Nov15.CongestionReaderCertRET0 +import Nov15.CongestionReaderCertREU0 +import Nov15.CongestionReaderCertREL0 +import Nov15.CongestionReaderCertRES1 +import Nov15.CongestionReaderCertRET1 +import Nov15.CongestionReaderCertREU1 +import Nov15.CongestionReaderCertREL1 + +/-! +CONGESTION-READER. Reader-charge refinement of the tree ceiling `ceiling_tree_GD` (#7678, Nov15/CongestionTree.lean): +CG2's per-reader endpoint charge (IN' = sum_t min(H_t + delta, K_t min(c18, capv)) - 15 delta, delta = beta(7) - beta(8)) in the audited shippable form. +`ceiling_reader_GD_w16` (omega <= 16) : F(1 - t, invoice (caller 6 7) n 17) < 0 for t in [a0RE, 1], a0RE = 14441/1250000 = .01155280. Lean-proved: the register identity +(`resid_V`, `resid_Z`, `tied_rho`: a tied register has residual >= delta), the payer summation (`sum_c2_pay`), the reader line bound +(`tree_lower_reader`), the piece lemma, all numerics (kernel). NAMED hypotheses (see CongestionReader.md): hTied/hcase/hUc (reader structure = +CG2 sec. 2 + F2 lineage lemma + TL-a/b/c + own56 + X born at dim 1), plus the tree hypotheses of #7678 (CongestionTree.md there). +-/ +namespace CongestionNative +open NumCertK JointCeiling CallerCost CongestionI3 CongestionI3Dual Finset + +theorem hdelRE : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RE : ℚ) : ℝ) → + (dIRE : ℝ) ≤ CTree.SCr * CongestionReader.deltaF s := by + intro s h1 h2 + have hok : okR cfDelRE := by + intro p hp + simp only [cfDelRE, List.mem_cons, List.not_mem_nil, or_false] at hp + rcases hp with rfl | rfl | rfl | rfl <;> norm_num + have hd : 0 < dLo (CTree.negCF cfDelRE) (1 - tJ0) (1 - a0RE) := dlDRE + have hp : Fup (CTree.negCF cfDelRE) (1 - a0RE) (1 - a0RE) ≤ -((dIRE : ℚ) / 10 ^ 14) := dlPRE + have := CTree.cf_lower cfDelRE hok (1 - tJ0) (1 - a0RE) (by unfold tJ0; norm_num) (by unfold a0RE; norm_num) hd + ((dIRE : ℚ) / 10 ^ 14) hp s h1 h2 + have e : Fc cfDelRE s = CongestionReader.deltaF s := by + simp [Fc, cfDelRE, CongestionReader.deltaF, Real.one_rpow] + ring + rw [e] at this + have hS : CTree.SCr = ((10 ^ 14 : ℚ) : ℝ) := by unfold CTree.SCr; push_cast; ring + rw [hS] + push_cast at this ⊢ + have := mul_le_mul_of_nonneg_left this (by norm_num : (0 : ℝ) ≤ 10 ^ 14) + have h14 : (10 : ℝ) ^ 14 * ((dIRE : ℝ) / 10 ^ 14) = dIRE := by field_simp + linarith + +theorem corr_nonnegRE (cstF : ℝ → ℝ) (hcstLo : ∀ t : ℝ, ((a0RE : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) : + ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RE : ℚ) : ℝ) → 0 ≤ corrC cstF s := by + intro s h1 h2 + unfold corrC + have ha : ((a0RE : ℚ) : ℝ) ≤ 1 - s := by push_cast at h2 ⊢; linarith + have hb : 1 - s ≤ 1 / 10 := by + have : ((1 - tJ0 : ℚ) : ℝ) = 1 - 118103 / 10 ^ 7 := by unfold tJ0; push_cast; norm_num + rw [this] at h1; linarith + have := hcstLo (1 - s) ha hb + linarith + +theorem hFbT_ofRRE (a0 a b L : ℚ) (hd : 0 < dLo cfC (93 / 100) (1 - a0)) (ha00 : 0 ≤ a0) (hb93 : 93 / 100 ≤ 1 - b) (hab : a ≤ b) + (haJ : a0 ≤ a) (hpt : Fup cfC (1 - a) (1 - a) < 17 * L) : + ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (L : ℝ) := by + intro s h1 h2 + have hb : (((93 / 100 : ℚ)) : ℝ) ≤ s := le_trans (by exact_mod_cast hb93) h1 + have haA : (1 - a : ℚ) ≤ 1 - a0 := by linarith + have hA : ((1 - a : ℚ) : ℝ) ≤ ((1 - a0 : ℚ) : ℝ) := by exact_mod_cast haA + have hm := Fc_monoOn cfC cfC_ok (93 / 100) (1 - a0) (by norm_num) (by linarith) hd s ((1 - a : ℚ) : ℝ) hb h2 hA + exact lt_of_le_of_lt hm (pt_of_Fup cfC cfC_ok (1 - a) L (by linarith) (by linarith) hpt) + +theorem ceiling_reader_GD_w16 + {ι : Type*} [DecidableEq ι] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr st : ℕ) (E : ℝ → ℝ) (J : Finset (ℕ × ℕ)) (distF : ℝ → ℕ × ℕ → ℝ) (spF cstF : ℝ → ℝ) + (hk : ∀ k ∈ ks, 1 ≤ k ∧ k ≤ 9) (hmass : 56 ≤ ks.sum) (hmd : 8 ≤ ks.length) (hmr : 8 ≤ mr) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hY : 104 ≤ st + (ks.length + mr)) + (hst : ∀ s, 0 ≤ s → s ≤ 1 → (2 - (2 : ℝ) ^ s) * st ≤ E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (hcong : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → + ∑ p ∈ J, min (distF s p) (capC s) - corrC cstF s ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hdist : ∀ s, 9 / 10 ≤ s → s ≤ 1 - ((tJ0 : ℚ) : ℝ) → ∀ p ∈ J, spF (1 - s) ≤ distF s p) + (hJ : 4962 ≤ J.card) + (hspMono : MonotoneOn spF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hcstMono : MonotoneOn cstF (Set.Icc ((tJ0 : ℚ) : ℝ) (1 / 10))) + (hspTab : ((spFloC0 : ℚ) : ℝ) ≤ spF ((tC0 : ℚ) : ℝ) ∧ ((spFloC1 : ℚ) : ℝ) ≤ spF ((tC1 : ℚ) : ℝ) ∧ + ((spFloC2 : ℚ) : ℝ) ≤ spF ((tC2 : ℚ) : ℝ) ∧ ((spFloC3 : ℚ) : ℝ) ≤ spF ((tC3 : ℚ) : ℝ)) + (hcstTab : cstF ((tC1 : ℚ) : ℝ) ≤ ((cHC0 : ℚ) : ℝ) ∧ cstF ((tC2 : ℚ) : ℝ) ≤ ((cHC1 : ℚ) : ℝ) ∧ + cstF ((tC3 : ℚ) : ℝ) ≤ ((cHC2 : ℚ) : ℝ) ∧ cstF (1 / 10) ≤ ((cHC3 : ℚ) : ℝ)) + (hspTabJ : ((spFloJ0 : ℚ) : ℝ) ≤ spF ((tJ0 : ℚ) : ℝ) ∧ ((spFloJ1 : ℚ) : ℝ) ≤ spF ((tJ1 : ℚ) : ℝ) ∧ + ((spFloJ2 : ℚ) : ℝ) ≤ spF ((tJ2 : ℚ) : ℝ)) + (hcstTabJ : cstF ((tJ1 : ℚ) : ℝ) ≤ ((cHJ0 : ℚ) : ℝ) ∧ cstF ((tJ2 : ℚ) : ℝ) ≤ ((cHJ1 : ℚ) : ℝ) ∧ + cstF ((tC0 : ℚ) : ℝ) ≤ ((cHJ2 : ℚ) : ℝ)) + {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (T : CTree.TreeData σ ρ μ CTree.reaR CTree.reiR CTree.rear0 CTree.reir0 48) + (hcstLo : ∀ t : ℝ, ((a0RE : ℚ) : ℝ) ≤ t → t ≤ 1 / 10 → 0 ≤ cstF t) + (hcstMonoT : MonotoneOn cstF (Set.Icc ((a0RE : ℚ) : ℝ) (1 / 10))) + (hcst0 : cstF ((tRE1 : ℚ) : ℝ) ≤ ((cHRE0 : ℚ) : ℝ)) + (hcst1 : cstF ((tRE2 : ℚ) : ℝ) ≤ ((cHRE1 : ℚ) : ℝ)) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RE : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0RE : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (ω : ℕ) (hω : ω ≤ 16) (Q Uo : Finset σ) (hUo : Uo ⊆ T.S) (hUc : Uo.card ≤ 15 + ω) (hQ : Q ⊆ T.S) + (hcase : ∀ x ∈ T.S, x ∈ Q ∨ T.x x = (T.J.filter fun p => p.1 = x).card ∨ x ∈ Uo) + (π : σ → ι) (hπR : ∀ t ∈ Q, π t ∈ R) (hπinj : Set.InjOn π Q) (hTied : ∀ t ∈ Q, CongestionReader.Tied nR dR (π t)) : + ∀ t : ℝ, ((a0RE : ℚ) : ℝ) ≤ t → t ≤ 1 → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + have eJ : tTJ0RE = tJ0 := rfl + have hwin := wtRE + rw [eJ] at hwin + have hdd := cfC_dRE + have hdel := hdelRE + have hUc' : Uo.card ≤ 31 := by omega + intro t ht ht1 + rcases le_or_gt ((tJ0 : ℚ) : ℝ) t with hC | hC + · exact ceiling_native_J R nR dR hmono hd9 hmix n ks mr st E J distF spF cstF hk hmass hmd hmr hF hY hst hEex hcong hdist hJ hspMono hcstMono hspTab hcstTab hspTabJ hcstTabJ t hC ht1 + have p0 := CTree.reader_piece R nR dR hmono hd9 hmix n ks mr E cstF hF hEex CTree.reaW CTree.reaR CTree.reiR CTree.rear0 CTree.reir0 48 T + CTree.rea_all (by have h := CTree.rei_all; rwa [show CTree.reiW = CTree.reaW from rfl] at h) (by decide) (by decide) a0RE tRE0 tRE1 lcpRE0 sgRE0 cHRE0 unLoRE0 capIRE0 dIRE lamRE0 gARE0 gBRE0 31 + hwin (by unfold tRE0 a0RE; norm_num) (by unfold tRE0 tRE1; norm_num) (by unfold tRE1 tJ0; norm_num) (by unfold a0RE; norm_num) sigRE0 (by unfold sgRE0; norm_num) lineRE0 numRE0 capRE0 + (unit_of_Fup tRE1 unLoRE0 (by unfold tRE1; norm_num) (by unfold tRE1; norm_num) (by have := unRE0; exact this)) hcst0 hcstMonoT hdel hP1 hP2 + Q Uo hUo hUc' hQ hcase π hπR hπinj hTied + (hFbT_ofRRE a0RE tRE0 tRE1 _ hdd (by unfold a0RE; norm_num) (by unfold tRE1; norm_num) (by unfold tRE0 tRE1; norm_num) (by unfold tRE0 a0RE; norm_num) ptRE0) + have p1 := CTree.reader_piece R nR dR hmono hd9 hmix n ks mr E cstF hF hEex CTree.reaW CTree.reaR CTree.reiR CTree.rear0 CTree.reir0 48 T + CTree.rea_all (by have h := CTree.rei_all; rwa [show CTree.reiW = CTree.reaW from rfl] at h) (by decide) (by decide) a0RE tRE1 tRE2 lcpRE1 sgRE1 cHRE1 unLoRE1 capIRE1 dIRE lamRE1 gARE1 gBRE1 31 + hwin (by unfold tRE1 a0RE; norm_num) (by unfold tRE1 tRE2; norm_num) (tREend.trans eJ).le (by unfold a0RE; norm_num) sigRE1 (by unfold sgRE1; norm_num) lineRE1 numRE1 capRE1 + (unit_of_Fup tRE2 unLoRE1 (by unfold tRE2; norm_num) (by unfold tRE2; norm_num) (by have := unRE1; exact this)) hcst1 hcstMonoT hdel hP1 hP2 + Q Uo hUo hUc' hQ hcase π hπR hπinj hTied + (hFbT_ofRRE a0RE tRE1 tRE2 _ hdd (by unfold a0RE; norm_num) (by unfold tRE2; norm_num) (by unfold tRE1 tRE2; norm_num) (by unfold tRE1 a0RE; norm_num) ptRE1) + rcases le_or_gt t ((tRE1 : ℚ) : ℝ) with h1 | h1 + · exact p0 t (by rw [tREstart]; exact ht) h1 + exact p1 t h1.le (by rw [show tRE2 = tJ0 from tREend.trans eJ]; exact hC.le) + +end CongestionNative + +#print axioms CongestionNative.corr_nonnegRE +#print axioms CongestionNative.hdelRE +#print axioms CongestionNative.ceiling_reader_GD_w16 diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionTreeCore.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionTreeCore.lean new file mode 100644 index 0000000000..ac07cdcdd0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionTreeCore.lean @@ -0,0 +1,421 @@ +import Nov15.NumCertK +import Nov15.CTreeCore + +/-! +CONGESTION-TREE-CORE. Abstract part of the node-partition (whole-meeting) tree bound and its port-realised refinement: +* soundness of the kernel-checked DP rows (`Row.check`, file `CTreeCore`) as lower bounds `G(x,k)` for the cost of out-trees; +* the inductive predicate `Tr` (an out-tree of charts: shapes in a given shape list, children = nested moves, readers covered); +* `tree_cost_ge` : a `Tr` tree delivering `R` readers from shape `r` costs at least `G(r, |R|) / SC` (each edge charged `w e / nm e`); +* `reduction` : double counting (every move carries at most `nm e` sources) `sum_s tree_s <= sum_e w e`; +* `tree_lower` : the Lagrange/line bound over the 104 sources with `sum |J_s| >= 4962`, `|J_s| <= 48`, transported cells pay `cap`. +No sorry, no native_decide. +-/ +namespace CTree +open Finset + +def SCn : ℕ := 10 ^ 14 +noncomputable def SCr : ℝ := 10 ^ 14 + +def gv (r : Row) (k : ℕ) : ℕ := r.g.getD k 0 + +theorem rowLe_sound : ∀ (a b : List ℕ) (w : ℕ), rowLe a b w = true → + ∀ j, j < b.length → j < a.length → a.getD j 0 ≤ w + b.getD j 0 := by + intro a + induction a with + | nil => intro b w _ j _ hj; simp at hj + | cons a as ih => + intro b w h j hjb hja + cases b with + | nil => simp at hjb + | cons b bs => + simp only [rowLe, Bool.and_eq_true, decide_eq_true_eq] at h + cases j with + | zero => simpa using h.1 + | succ j => + have := ih bs w h.2 j (by simpa using hjb) (by simpa using hja) + simpa using this + +theorem monoB_adj : ∀ (l : List ℕ), monoB l = true → ∀ i, i + 1 < l.length → l.getD i 0 ≤ l.getD (i + 1) 0 := by + intro l + induction l with + | nil => intro _ i hi; simp at hi + | cons a t ih => + intro h i hi + cases t with + | nil => simp at hi + | cons b t' => + simp only [monoB, Bool.and_eq_true, decide_eq_true_eq] at h + cases i with + | zero => simpa using h.1 + | succ i => simpa using ih h.2 i (by simpa using hi) + +theorem monoB_mono (l : List ℕ) (h : monoB l = true) : ∀ i j, i ≤ j → j < l.length → l.getD i 0 ≤ l.getD j 0 := by + intro i j hij hj + induction j, hij using Nat.le_induction with + | base => exact le_refl _ + | succ j hij ih => exact le_trans (ih (by omega)) (monoB_adj l h j hj) + +theorem getD_zero_of_all (l : List ℕ) (h : ∀ v ∈ l, v = 0) (k : ℕ) : l.getD k 0 = 0 := by + by_cases hk : k < l.length + · rw [List.getD_eq_getElem?_getD, List.getElem?_eq_getElem hk]; exact h _ (List.getElem_mem hk) + · rw [List.getD_eq_getElem?_getD, List.getElem?_eq_none (by omega)]; rfl + +/-- the facts packed in `Row.check` -/ +structure RowOK (W : List (List ℕ)) (rs : List Row) (r : Row) : Prop where + dim1 : 1 ≤ r.dim + dim8 : r.dim ≤ 8 + n1 : 1 ≤ r.n + glen : r.g.length = r.m + 1 + gelen : r.ge.length = r.m + 1 + g0 : r.g.getD 0 0 = 0 + mono : monoB r.g = true + leaf : r.dim = 8 → r.m ≤ 1 ∧ ∀ v ∈ r.g, v = 0 + edge : r.dim ≠ 8 → ∀ r' ∈ rs, r.ok r' = true → rowLe (r.ge.drop 1) (r'.g.drop 1) (ew W r r') = true + c4 : r.dim ≠ 8 → r.c4 = true + +theorem rowOK_of_check (W : List (List ℕ)) (rs : List Row) (r : Row) (h : r.check W rs = true) : RowOK W rs r := by + unfold Row.check at h + simp only [Bool.and_eq_true, decide_eq_true_eq, beq_iff_eq] at h + obtain ⟨⟨⟨⟨⟨⟨⟨h1, h2⟩, h3⟩, h4⟩, h5⟩, h6⟩, h7⟩, h8⟩ := h + refine ⟨h1, h2, h3, h4, h5, h6, h7, ?_, ?_, ?_⟩ + · intro h8' + rw [if_pos h8'] at h8 + simp only [Bool.and_eq_true, decide_eq_true_eq, List.all_eq_true, beq_iff_eq] at h8 + exact ⟨h8.1, h8.2⟩ + · intro hne r' hr' hok + rw [if_neg hne] at h8 + simp only [Bool.and_eq_true, List.all_eq_true] at h8 + have := h8.1 r' hr' + simp only [Bool.or_eq_true, Bool.not_eq_true'] at this + rcases this with h | h + · rw [h] at hok; exact absurd hok (by simp) + · exact h + · intro hne + rw [if_neg hne] at h8 + simp only [Bool.and_eq_true] at h8 + exact h8.2 + +theorem gv_zero {W rs r} (h : RowOK W rs r) : gv r 0 = 0 := h.g0 + +theorem gv_mono {W rs r} (h : RowOK W rs r) {i j : ℕ} (hij : i ≤ j) (hj : j ≤ r.m) : gv r i ≤ gv r j := + monoB_mono r.g h.mono i j hij (by rw [h.glen]; omega) + +theorem edge_sem {W rs r} (hr : RowOK W rs r) (hne : r.dim ≠ 8) {r' : Row} (hr' : r' ∈ rs) (hr'ok : RowOK W rs r') + (hok : r.ok r' = true) {j : ℕ} (hj1 : 1 ≤ j) (hj : j ≤ r'.m) : + r.ge.getD j 0 ≤ ew W r r' + gv r' j := by + have hm : r'.m ≤ r.m := by + simp only [Row.ok, Bool.and_eq_true, decide_eq_true_eq] at hok; exact hok.1.2 + have := rowLe_sound _ _ _ (hr.edge hne r' hr' hok) (j - 1) (by simp [List.length_drop, hr'ok.glen]; omega) + (by simp [List.length_drop, hr.gelen]; omega) + have e1 : (r.ge.drop 1).getD (j - 1) 0 = r.ge.getD j 0 := by + simp [List.getD_eq_getElem?_getD, List.getElem?_drop]; congr 2; omega + have e2 : (r'.g.drop 1).getD (j - 1) 0 = gv r' j := by + simp [gv, List.getD_eq_getElem?_getD, List.getElem?_drop]; congr 2; omega + rw [e1, e2] at this; exact this + +theorem c4_sem {r : Row} (h : r.c4 = true) {k : ℕ} (hk1 : 1 ≤ k) (hk : k ≤ r.m) {j : ℕ} (hj1 : 1 ≤ j) (hjk : j ≤ k) : + gv r k ≤ r.ge.getD j 0 + gv r (k - j) := by + unfold Row.c4 at h + simp only [List.all_eq_true, List.mem_range, decide_eq_true_eq] at h + have := h (k - 1) (by omega) (j - 1) (by omega) + have e1 : k - 1 + 1 = k := by omega + have e2 : j - 1 + 1 = j := by omega + have e3 : k - 1 - (j - 1) = k - j := by omega + rw [e1, e2, e3] at this; exact this + +theorem list_card_foldr (l : List (Finset ρ)) [DecidableEq ρ] : (l.foldr (· ∪ ·) ∅).card ≤ (l.map Finset.card).sum := by + induction l with + | nil => simp + | cons a t ih => + simp only [List.foldr_cons, List.map_cons, List.sum_cons] + exact le_trans (Finset.card_union_le _ _) (by omega) + +/-- the DP step: children `(row, count, cost)` deliver `k` readers at cost at least `G(r,k)` (costs in units of 1/SC). -/ +theorem step {W rs r} (hr : RowOK W rs r) (hne : r.dim ≠ 8) (cs : List (Row × ℕ × ℝ)) + (hcs : ∀ c ∈ cs, c.1 ∈ rs ∧ RowOK W rs c.1 ∧ r.ok c.1 = true ∧ c.2.1 ≤ c.1.m ∧ + (((ew W r c.1 + gv c.1 c.2.1 : ℕ)) : ℝ) ≤ c.2.2) : + ∀ k, k ≤ r.m → k ≤ (cs.map fun c => c.2.1).sum → ((gv r k : ℕ) : ℝ) ≤ (cs.map fun c => c.2.2).sum := by + induction cs with + | nil => + intro k _ hk + simp at hk + subst hk + simp [gv_zero hr] + | cons c cs ih => + intro k hkm hk + simp only [List.map_cons, List.sum_cons] at hk ⊢ + have hc := hcs c (by simp) + have hcs' : ∀ c' ∈ cs, c'.1 ∈ rs ∧ RowOK W rs c'.1 ∧ r.ok c'.1 = true ∧ c'.2.1 ≤ c'.1.m ∧ + (((ew W r c'.1 + gv c'.1 c'.2.1 : ℕ)) : ℝ) ≤ c'.2.2 := fun c' hc' => hcs c' (by simp [hc']) + have ih' := ih hcs' + have hnn : ∀ l : List (Row × ℕ × ℝ), (∀ c' ∈ l, (0 : ℝ) ≤ c'.2.2) → 0 ≤ (l.map fun c => c.2.2).sum := by + intro l hl + induction l with + | nil => simp + | cons a t iht => + simp only [List.map_cons, List.sum_cons] + have h1 := hl a (by simp) + have h2 := iht (fun c' hc' => hl c' (by simp [hc'])) + linarith + have hcost0 : ∀ c' ∈ cs, (0 : ℝ) ≤ c'.2.2 := fun c' hc' => le_trans (Nat.cast_nonneg _) (hcs' c' hc').2.2.2.2 + have hS0 := hnn cs hcost0 + have hc0 : (0 : ℝ) ≤ c.2.2 := le_trans (Nat.cast_nonneg _) hc.2.2.2.2 + by_cases hk0 : k = 0 + · subst hk0; simp [gv_zero hr]; linarith + by_cases hcnt : c.2.1 = 0 + · have := ih' k hkm (by omega) + linarith + · set j := min k c.2.1 with hj + have hj1 : 1 ≤ j := by omega + have hjk : j ≤ k := min_le_left _ _ + have hjc : j ≤ c.2.1 := min_le_right _ _ + have h4 := c4_sem (hr.c4 hne) (by omega) hkm hj1 hjk + have he := edge_sem hr hne hc.1 hc.2.1 hc.2.2.1 hj1 (le_trans hjc hc.2.2.2.1) + have hmo := gv_mono hc.2.1 hjc hc.2.2.2.1 + have ih2 := ih' (k - j) (by omega) (by omega) + have hnat : gv r k ≤ ew W r c.1 + gv c.1 c.2.1 + gv r (k - j) := by omega + have hr' : ((gv r k : ℕ) : ℝ) ≤ ((ew W r c.1 + gv c.1 c.2.1 : ℕ) : ℝ) + ((gv r (k - j) : ℕ) : ℝ) := by + exact_mod_cast hnat + have := hc.2.2.2.2 + linarith + +variable {ρ μ : Type} [DecidableEq ρ] + +/-- out-trees of charts. A node is a chart of shape `r` (a row of the shape list `rs`), delivering readers `R`; +its children are `(row, readers, move, moves-below)`; the edge to a child is the move `e` with source capacity `nm e = n(r)` +and dimensions `dA e = dim r`, `dB e = dim child`. `moves` lists the moves of the tree (edge, then the subtree). -/ +inductive Tr (rs : List Row) (nm dA dB : μ → ℕ) : Row → Finset ρ → List μ → Prop + | node (r : Row) (R : Finset ρ) (ch : List (Row × Finset ρ × μ × List μ)) + (hr : r ∈ rs) + (hsub : ∀ c ∈ ch, Tr rs nm dA dB c.1 c.2.1 c.2.2.2) + (hside : ∀ c ∈ ch, c.1 ∈ rs ∧ r.ok c.1 = true ∧ nm c.2.2.1 = r.n ∧ dA c.2.2.1 = r.dim ∧ + dB c.2.2.1 = c.1.dim ∧ c.2.1.card ≤ c.1.m) + (hm : R.card ≤ r.m) + (hcov : r.dim ≠ 8 → R ⊆ (ch.map fun c => c.2.1).foldr (· ∪ ·) ∅) : + Tr rs nm dA dB r R (ch.flatMap fun c => c.2.2.1 :: c.2.2.2) + +theorem sum_flatMap_eq (ch : List (Row × Finset ρ × μ × List μ)) (f : μ → ℝ) : + (((ch.flatMap fun c => c.2.2.1 :: c.2.2.2).map f).sum) = + (ch.map fun c => f c.2.2.1 + ((c.2.2.2.map f).sum)).sum := by + induction ch with + | nil => simp + | cons c t ih => simp [List.flatMap_cons, List.map_append, List.sum_append, ih]; ring + +/-- **tree DP lower bound**: a tree from shape `r` delivering `R` costs at least `G(r,|R|)/SC`, edge `e` charged `w e / nm e`. -/ +theorem tree_cost_ge (W : List (List ℕ)) (rs : List Row) (hcert : ∀ r ∈ rs, r.check W rs = true) + (nm dA dB : μ → ℕ) (w : μ → ℝ) + (hW : ∀ e, 1 ≤ dA e → dA e < dB e → dB e ≤ 8 → (((W.getD (dA e) []).getD (dB e) 0 : ℕ) : ℝ) ≤ SCr * w e) + {r : Row} {R : Finset ρ} {ms : List μ} (h : Tr rs nm dA dB r R ms) : + ((gv r R.card : ℕ) : ℝ) ≤ SCr * (ms.map fun e => w e / nm e).sum := by + induction h with + | node r R ch hr hsub hside hm hcov ih => + have hro := rowOK_of_check W rs r (hcert r hr) + by_cases h8 : r.dim = 8 + · have hch : ch = [] := by + cases ch with + | nil => rfl + | cons c t => + exfalso + have h1 := hside c (by simp) + have hco := rowOK_of_check W rs c.1 (hcert c.1 h1.1) + have h3 := h1.2.1 + simp only [Row.ok, Bool.and_eq_true, decide_eq_true_eq] at h3 + have := hco.dim8 + omega + subst hch + have hz := getD_zero_of_all r.g (hro.leaf h8).2 R.card + have hz' : gv r R.card = 0 := hz + rw [hz']; simp + · set F : Row × Finset ρ × μ × List μ → ℝ := fun c => w c.2.2.1 / nm c.2.2.1 + (c.2.2.2.map fun e => w e / nm e).sum with hF + set cs : List (Row × ℕ × ℝ) := ch.map fun c => (c.1, c.2.1.card, SCr * F c) with hcs + have key := step hro h8 cs ?_ R.card hm ?_ + · rw [sum_flatMap_eq] + have e1 : (cs.map fun c => c.2.2).sum = SCr * (ch.map F).sum := by + rw [hcs, List.map_map] + have : ((fun c : Row × ℕ × ℝ => c.2.2) ∘ fun c : Row × Finset ρ × μ × List μ => (c.1, c.2.1.card, SCr * F c)) = + fun c => SCr * F c := rfl + rw [this, List.sum_map_mul_left] + rw [e1] at key + exact key + · intro c' hc' + rw [hcs, List.mem_map] at hc' + obtain ⟨c0, hc0, rfl⟩ := hc' + have hs := hside c0 hc0 + have hco := rowOK_of_check W rs c0.1 (hcert c0.1 hs.1) + have hokc := hs.2.1 + have hd : r.dim < c0.1.dim := by + simp only [Row.ok, Bool.and_eq_true, decide_eq_true_eq] at hokc; exact hokc.1.1.1 + have hwe := hW c0.2.2.1 (by rw [hs.2.2.2.1]; exact hro.dim1) (by rw [hs.2.2.2.1, hs.2.2.2.2.1]; exact hd) + (by rw [hs.2.2.2.2.1]; exact hco.dim8) + rw [hs.2.2.2.1, hs.2.2.2.2.1] at hwe + have hn : (0 : ℝ) < r.n := by exact_mod_cast hro.n1 + have hdiv : ((ew W r c0.1 : ℕ) : ℝ) ≤ SCr * (w c0.2.2.1 / nm c0.2.2.1) := by + have h1 : ((ew W r c0.1 : ℕ) : ℝ) ≤ (((W.getD r.dim []).getD c0.1.dim 0 : ℕ) : ℝ) / r.n := Nat.cast_div_le + have h2 : SCr * (w c0.2.2.1 / nm c0.2.2.1) = SCr * w c0.2.2.1 / r.n := by rw [hs.2.2.1]; ring + rw [h2] + exact le_trans h1 (div_le_div_of_nonneg_right hwe hn.le) + have hih := ih c0 hc0 + refine ⟨hs.1, hco, hokc, hs.2.2.2.2.2, ?_⟩ + show (((ew W r c0.1 + gv c0.1 c0.2.1.card : ℕ)) : ℝ) ≤ SCr * F c0 + push_cast + rw [hF]; simp only [] + rw [mul_add] + linarith + · have h1 : R ⊆ _ := hcov h8 + have h2 := le_trans (Finset.card_le_card h1) (list_card_foldr (ch.map fun c => c.2.1)) + have : (cs.map fun c => c.2.1) = ch.map fun c => c.2.1.card := by simp [hcs, List.map_map] + have h3 : (((ch.map fun c => c.2.1)).map Finset.card).sum = (ch.map fun c => c.2.1.card).sum := by + simp [List.map_map, Function.comp_def] + rw [this, ← h3] + exact h2 + + +theorem Tr.card_le {rs : List Row} {nm dA dB : μ → ℕ} {r : Row} {R : Finset ρ} {ms : List μ} + (h : Tr rs nm dA dB r R ms) : R.card ≤ r.m := by + cases h with + | node r R ch hr hsub hside hm hcov => exact hm + +theorem reduction {σ : Type} [DecidableEq σ] [DecidableEq μ] (S : Finset σ) (ms : σ → List μ) (nm : μ → ℕ) (w : μ → ℝ) + (Mv : Finset μ) (hnd : ∀ s ∈ S, (ms s).Nodup) (hsub : ∀ s ∈ S, ∀ e ∈ ms s, e ∈ Mv) + (hcap : ∀ e ∈ Mv, (S.filter fun s => e ∈ ms s).card ≤ nm e) (hw0 : ∀ e ∈ Mv, 0 ≤ w e) : + ∑ s ∈ S, ((ms s).map fun e => w e / nm e).sum ≤ ∑ e ∈ Mv, w e := by + have h1 : ∑ s ∈ S, ((ms s).map fun e => w e / nm e).sum = ∑ s ∈ S, ∑ e ∈ (ms s).toFinset, w e / nm e := by + apply Finset.sum_congr rfl + intro s hs + rw [List.sum_toFinset _ (hnd s hs)] + have h2 : ∑ s ∈ S, ∑ e ∈ (ms s).toFinset, w e / nm e = ∑ e ∈ Mv, ∑ s ∈ S.filter (fun s => e ∈ ms s), w e / nm e := by + apply Finset.sum_comm' + intro s e + constructor + · rintro ⟨hs, he⟩ + have he' : e ∈ ms s := List.mem_toFinset.mp he + exact ⟨Finset.mem_filter.2 ⟨hs, he'⟩, hsub s hs e he'⟩ + · rintro ⟨hs, he⟩ + have := Finset.mem_filter.1 hs + exact ⟨this.1, List.mem_toFinset.2 this.2⟩ + rw [h1, h2] + apply Finset.sum_le_sum + intro e he + rw [Finset.sum_const, nsmul_eq_mul] + have hc := hcap e he + have hw := hw0 e he + by_cases h0 : nm e = 0 + · have : (S.filter fun s => e ∈ ms s).card = 0 := by omega + rw [this]; simpa using hw + · have hpos : (0 : ℝ) < nm e := by exact_mod_cast Nat.pos_of_ne_zero h0 + have hcr : (((S.filter fun s => e ∈ ms s).card : ℕ) : ℝ) ≤ nm e := by exact_mod_cast hc + calc (((S.filter fun s => e ∈ ms s).card : ℕ) : ℝ) * (w e / nm e) ≤ (nm e : ℝ) * (w e / nm e) := + mul_le_mul_of_nonneg_right hcr (div_nonneg hw hpos.le) + _ = w e := by field_simp + +def lineOK (rA rB : Row) (capI lam gA gB : ℕ) : Bool := + (List.range 49).all (fun x => (List.range 49).all (fun r => + decide (lam * min 48 (x + r) ≤ gv rA r + x * capI + gA) && decide (lam * min 48 (x + r) ≤ gv rB r + x * capI + gB))) + && decide (gB ≤ gA) + +/-- the combinatorial data of the whole-meeting tree reduction (all hypotheses named; none depends on the weights). +`S` = source ports (<= 104), `Bset` = the sources whose trees use only the port-realised (restricted) shape edges (`rsB`), `J` = junk cells (source, reader), +`R s` = readers of the non-transported cells of source `s`, `x s` = transported cells, `ms s` = moves of the out-tree of `s`. -/ +structure TreeData (σ ρ μ : Type) [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) where + J : Finset (σ × ρ) + S : Finset σ + Bset : Finset σ + Mv : Finset μ + Mreg : Finset μ + Mun : Finset μ + dA : μ → ℕ + dB : μ → ℕ + nm : μ → ℕ + ms : σ → List μ + R : σ → Finset ρ + x : σ → ℕ + hJS : ∀ p ∈ J, p.1 ∈ S + hScard : S.card ≤ 104 + hfib : ∀ s ∈ S, (J.filter fun p => p.1 = s).card ≤ 48 + hJcard : 4962 ≤ J.card + hB : Bset ⊆ S + hBcard : nB ≤ Bset.card + hcell : ∀ s ∈ S, (J.filter fun p => p.1 = s).card ≤ x s + (R s).card + hxk : ∀ s ∈ S, x s ≤ (J.filter fun p => p.1 = s).card + htreeA : ∀ s ∈ S, s ∉ Bset → Tr rsA nm dA dB rootA (R s) (ms s) + htreeB : ∀ s ∈ Bset, Tr rsB nm dA dB rootB (R s) (ms s) + hnd : ∀ s ∈ S, (ms s).Nodup + hMv : ∀ s ∈ S, ∀ e ∈ ms s, e ∈ Mv + hcap : ∀ e ∈ Mv, (S.filter fun s => e ∈ ms s).card ≤ nm e + hMsub : Mv ⊆ Mreg ∪ Mun + hdim : ∀ e ∈ Mreg ∪ Mun, 1 ≤ dA e ∧ dA e < dB e ∧ dB e ≤ 8 + +theorem tree_lower {σ : Type} [DecidableEq σ] [DecidableEq μ] + (W : List (List ℕ)) (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) (T : TreeData σ ρ μ rsA rsB rootA rootB nB) + (hcA : ∀ r ∈ rsA, Row.check W rsA r = true) (hcB : ∀ r ∈ rsB, Row.check W rsB r = true) + (hrA : rootA.m ≤ 48) (hrB : rootB.m ≤ 48) (capI lam gA gB : ℕ) (hline : lineOK rootA rootB capI lam gA gB = true) + (w : μ → ℝ) + (hW : ∀ e, 1 ≤ T.dA e → T.dA e < T.dB e → T.dB e ≤ 8 → + (((W.getD (T.dA e) []).getD (T.dB e) 0 : ℕ) : ℝ) ≤ SCr * w e) + (hw0 : ∀ e ∈ T.Mv, 0 ≤ w e) (cap : ℝ) (hcap : (capI : ℝ) ≤ SCr * cap) : + (lam : ℝ) * 4962 - ((gA : ℝ) * 104 - ((gA : ℝ) - gB) * nB) ≤ + SCr * (∑ e ∈ T.Mv, w e + cap * ∑ s ∈ T.S, (T.x s : ℝ)) := by + have hred := reduction T.S T.ms T.nm w T.Mv T.hnd T.hMv T.hcap hw0 + have hSC : (0 : ℝ) < SCr := by unfold SCr; positivity + unfold lineOK at hline + simp only [Bool.and_eq_true, List.all_eq_true, List.mem_range, decide_eq_true_eq] at hline + obtain ⟨hline, hBA⟩ := hline + set k : σ → ℕ := fun s => (T.J.filter fun p => p.1 = s).card with hk + set γ : σ → ℕ := fun s => if s ∈ T.Bset then gB else gA with hγ + have per : ∀ s ∈ T.S, (lam : ℝ) * k s - γ s ≤ SCr * (((T.ms s).map fun e => w e / T.nm e).sum + cap * T.x s) := by + intro s hs + have hk48 : k s ≤ 48 := T.hfib s hs + have hx := T.hxk s hs + have hc := T.hcell s hs + -- tree bound and line bound + have key : ∀ (root : Row) (rs : List Row) (g : ℕ), (∀ r ∈ rs, Row.check W rs r = true) → root.m ≤ 48 → + (∀ x < 49, ∀ r < 49, lam * min 48 (x + r) ≤ gv root r + x * capI + g) → + Tr rs T.nm T.dA T.dB root (T.R s) (T.ms s) → + (lam : ℝ) * k s - g ≤ SCr * (((T.ms s).map fun e => w e / T.nm e).sum + cap * T.x s) := by + intro root rs g hcert hr48 hl htr + have hcost := tree_cost_ge W rs hcert T.nm T.dA T.dB w hW htr + have hrc := htr.card_le + have hl' := hl (T.x s) (by have := T.hfib s hs; omega) (T.R s).card (by omega) + have hn : lam * k s ≤ gv root (T.R s).card + T.x s * capI + g := by + have : k s ≤ min 48 (T.x s + (T.R s).card) := le_min hk48 hc + exact le_trans (Nat.mul_le_mul_left _ this) hl' + have hr : (lam : ℝ) * k s ≤ ((gv root (T.R s).card : ℕ) : ℝ) + T.x s * capI + g := by exact_mod_cast hn + have hcx : (T.x s : ℝ) * capI ≤ SCr * (cap * T.x s) := by + have : (0 : ℝ) ≤ T.x s := by positivity + nlinarith + linarith + by_cases hb : s ∈ T.Bset + · have := key rootB rsB gB hcB hrB (fun x hx r hr => (hline x hx r hr).2) (T.htreeB s hb) + simpa [hγ, hb] using this + · have := key rootA rsA gA hcA hrA (fun x hx r hr => (hline x hx r hr).1) (T.htreeA s hs hb) + simpa [hγ, hb] using this + have hsum := Finset.sum_le_sum per + have hJ : (T.J.card : ℝ) = ∑ s ∈ T.S, (k s : ℝ) := by + have := Finset.card_eq_sum_card_fiberwise (f := Prod.fst) (s := T.J) (t := T.S) T.hJS + exact_mod_cast this + have hJge : (4962 : ℝ) ≤ ∑ s ∈ T.S, (k s : ℝ) := by rw [← hJ]; exact_mod_cast T.hJcard + have hγs : ∑ s ∈ T.S, (γ s : ℝ) ≤ gA * 104 - (gA - gB) * nB := by + have e : ∀ s, (γ s : ℝ) = gA - (if s ∈ T.Bset then ((gA : ℝ) - gB) else 0) := by + intro s; simp only [hγ]; split_ifs <;> push_cast <;> ring + rw [Finset.sum_congr rfl (fun s _ => e s), Finset.sum_sub_distrib, Finset.sum_const, Finset.sum_ite_mem, + Finset.inter_eq_right.2 T.hB, Finset.sum_const, nsmul_eq_mul, nsmul_eq_mul] + have h1 : (T.S.card : ℝ) ≤ 104 := by exact_mod_cast T.hScard + have h2 : (nB : ℝ) ≤ T.Bset.card := by exact_mod_cast T.hBcard + have h3 : (gB : ℝ) ≤ gA := by exact_mod_cast hBA + have h4 : (0 : ℝ) ≤ gA := by positivity + nlinarith [mul_nonneg h4 (sub_nonneg.2 h1), mul_nonneg (sub_nonneg.2 h3) (sub_nonneg.2 h2)] + have hlam : (0 : ℝ) ≤ lam := by positivity + have hgl : (lam : ℝ) * 4962 ≤ lam * ∑ s ∈ T.S, (k s : ℝ) := mul_le_mul_of_nonneg_left hJge hlam + have e1 : ∑ s ∈ T.S, ((lam : ℝ) * k s - γ s) = lam * ∑ s ∈ T.S, (k s : ℝ) - ∑ s ∈ T.S, (γ s : ℝ) := by + rw [Finset.sum_sub_distrib, ← Finset.mul_sum] + have e2 : ∑ s ∈ T.S, SCr * (((T.ms s).map fun e => w e / T.nm e).sum + cap * T.x s) = + SCr * (∑ s ∈ T.S, ((T.ms s).map fun e => w e / T.nm e).sum + cap * ∑ s ∈ T.S, (T.x s : ℝ)) := by + rw [← Finset.mul_sum, Finset.sum_add_distrib, ← Finset.mul_sum] + rw [e1, e2] at hsum + have h5 : SCr * (∑ s ∈ T.S, ((T.ms s).map fun e => w e / T.nm e).sum + cap * ∑ s ∈ T.S, (T.x s : ℝ)) ≤ + SCr * (∑ e ∈ T.Mv, w e + cap * ∑ s ∈ T.S, (T.x s : ℝ)) := + mul_le_mul_of_nonneg_left (add_le_add_left hred _ |> fun h => by linarith) hSC.le + linarith + +end CTree diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionTreePiece.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionTreePiece.lean new file mode 100644 index 0000000000..d758769556 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionTreePiece.lean @@ -0,0 +1,137 @@ +import Nov15.CongestionNativeJ +import Nov15.CongestionTreeW + +/-! +CONGESTION-TREE-PIECE: generic piece lemma of the whole-meeting tree ceiling. +`tree_regs_lower` : tree reduction + the two I2-charge premises => `LT/SC - corr <= sum of register c2 + Omega`. +`tree_piece` : one t-piece [a, b] inside [a0, tJ0]: the tree bound replaces `hcong`/`hdist`/`hJ` of `ceiling_native_J`. +-/ +namespace CTree +open NumCertK JointCeiling CallerCost CongestionI3 CongestionI3Dual CongestionNative Finset + +theorem tree_regs_lower {σ ρ μ : Type} [DecidableEq σ] [DecidableEq ρ] [DecidableEq μ] + (W : List (List ℕ)) (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) (T : TreeData σ ρ μ rsA rsB rootA rootB nB) + (hcA : ∀ r ∈ rsA, Row.check W rsA r = true) (hcB : ∀ r ∈ rsB, Row.check W rsB r = true) + (hrA : rootA.m ≤ 48) (hrB : rootB.m ≤ 48) (capI lam gA gB : ℕ) (hline : lineOK rootA rootB capI lam gA gB = true) + (lo hi : ℚ) (hwin : wtOK W lo hi = true) (hlo : 0 ≤ lo) (hhi : hi ≤ 1) (s : ℝ) (h1 : (lo : ℝ) ≤ s) (h2 : s ≤ (hi : ℝ)) + (capR corr Om regs : ℝ) (hcap : (capI : ℝ) ≤ SCr * capR) + (hP1 : ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capR * ∑ x ∈ T.S, (T.x x : ℝ) ≤ regs + Om) + (hP2 : ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corr) : + ((lam : ℝ) * 4962 - ((gA : ℝ) * 104 - ((gA : ℝ) - gB) * nB)) / SCr - corr ≤ regs + Om := by + have hSC : (0 : ℝ) < SCr := by unfold SCr; positivity + set w : μ → ℝ := fun e => c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) with hw + have hWl : ∀ e, 1 ≤ T.dA e → T.dA e < T.dB e → T.dB e ≤ 8 → + (((W.getD (T.dA e) []).getD (T.dB e) 0 : ℕ) : ℝ) ≤ SCr * w e := by + intro e ha hab hb + have := W_lower W lo hi hwin hlo hhi s h1 h2 (T.dA e) (T.dB e) ha hab hb + have h' := (div_le_iff₀ hSC).1 this + simp only [hw] + rw [mul_comm]; exact h' + have hw0 : ∀ e ∈ T.Mreg ∪ T.Mun, 0 ≤ w e := by + intro e he + obtain ⟨ha, hab, hb⟩ := T.hdim e he + have := W_lower W lo hi hwin hlo hhi s h1 h2 (T.dA e) (T.dB e) ha hab hb + exact le_trans (div_nonneg (Nat.cast_nonneg _) hSC.le) this + have tl := tree_lower W rsA rsB rootA rootB nB T hcA hcB hrA hrB capI lam gA gB hline w hWl + (fun e he => hw0 e (T.hMsub he)) capR hcap + have u1 : ∑ e ∈ T.Mv, w e ≤ ∑ e ∈ T.Mreg ∪ T.Mun, w e := + Finset.sum_le_sum_of_subset_of_nonneg T.hMsub (fun e he _ => hw0 e he) + have u2 : ∑ e ∈ T.Mreg ∪ T.Mun, w e ≤ ∑ e ∈ T.Mreg, w e + ∑ e ∈ T.Mun, w e := by + have h := Finset.sum_union_inter (s₁ := T.Mreg) (s₂ := T.Mun) (f := w) + have h0 : 0 ≤ ∑ e ∈ T.Mreg ∩ T.Mun, w e := + Finset.sum_nonneg (fun e he => hw0 e (Finset.mem_union_left _ (Finset.mem_of_mem_inter_left he))) + linarith + have h3 : ∑ e ∈ T.Mv, w e + capR * ∑ x ∈ T.S, (T.x x : ℝ) ≤ regs + Om + corr := by + have : ∑ e ∈ T.Mreg, w e = ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) := rfl + have : ∑ e ∈ T.Mun, w e = ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) := rfl + linarith + have h4 := mul_le_mul_of_nonneg_left h3 hSC.le + rw [sub_le_iff_le_add, div_le_iff₀ hSC] + nlinarith + +/-- one t-piece [a, b] of the tree ceiling, inside [a0, tJ0]. Same shape as `piece` of `ceiling_native_J`; the junk-count/`hcong`/`hdist` +hypotheses are replaced by the tree data `T`, the weight certificate `hwin`, the line certificate `hline`, and the two I2-charge premises +`hP1`, `hP2` (on the window s in [1 - tJ0, 1 - a0]). -/ +theorem tree_piece {ι : Type*} [DecidableEq ι] {σ' ρ' μ' : Type} [DecidableEq σ'] [DecidableEq ρ'] [DecidableEq μ'] + (R : Finset ι) (nR : ι → ℕ) (dR : ι → ℕ → ℕ) + (hmono : ∀ r ∈ R, ∀ i < nR r, dR r i ≤ dR r (i + 1)) (hd9 : ∀ r ∈ R, dR r (nR r) ≤ 9) + (hmix : (R.filter fun r => Mixed dR nR r).card ≤ 5) + (n : Inv) (ks : List ℕ) (mr : ℕ) (E : ℝ → ℝ) (cstF : ℝ → ℝ) + (hF : ∀ s, 0 ≤ s → s ≤ 1 → Finv s n ≤ -400 * (8 : ℝ) ^ s - dprice ks s - mr - E s) + (hEex : ∀ s, 0 ≤ s → s ≤ 1 → ∑ r ∈ R, ex (gs s) (lev dR r) (nR r) ≤ E s) + (W : List (List ℕ)) (rsA rsB : List Row) (rootA rootB : Row) (nB : ℕ) (T : TreeData σ' ρ' μ' rsA rsB rootA rootB nB) + (hcA : ∀ r ∈ rsA, Row.check W rsA r = true) (hcB : ∀ r ∈ rsB, Row.check W rsB r = true) + (hrA : rootA.m ≤ 48) (hrB : rootB.m ≤ 48) + (a0 a b lcp σc cH unLo : ℚ) (capI lam gA gB : ℕ) + (hwin : wtOK W (1 - tJ0) (1 - a0) = true) (ha0 : a0 ≤ a) (hab : a ≤ b) (hb : b ≤ tJ0) (ha00 : 0 ≤ a0) + (hσc : sigOK (1 - b) (1 - a) σc = true) (hσ0 : 0 ≤ σc) + (hline : lineOK rootA rootB capI lam gA gB = true) + (hnum : lcp + 8 * cH ≤ (((lam : ℚ) * 4962 - ((gA : ℚ) * 104 - ((gA : ℚ) - gB) * nB)) / 10 ^ 14)) + (hcapI : (capI : ℚ) ≤ unLo * 10 ^ 14 / 48) (hun : (unLo : ℝ) ≤ (9 : ℝ) ^ (1 - (b : ℝ)) - (8 : ℝ) ^ (1 - (b : ℝ))) + (hcst : cstF (b : ℝ) ≤ (cH : ℝ)) (hcstMono : MonotoneOn cstF (Set.Icc ((a0 : ℚ) : ℝ) (1 / 10))) + (hP1 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0 : ℚ) : ℝ) → + ∑ e ∈ T.Mreg, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) + capC s * ∑ x ∈ T.S, (T.x x : ℝ) ≤ + ∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs s) (lev dR r i) (lev dR r (i + 1)) + Omega ks mr s) + (hP2 : ∀ s : ℝ, ((1 - tJ0 : ℚ) : ℝ) ≤ s → s ≤ ((1 - a0 : ℚ) : ℝ) → + ∑ e ∈ T.Mun, c2 (gs s) (T.dA e : ℝ) (T.dB e : ℝ) ≤ corrC cstF s) + (hFb : ∀ s : ℝ, ((1 - b : ℚ) : ℝ) ≤ s → s ≤ ((1 - a : ℚ) : ℝ) → Fc cfC s < 17 * (((lcp - 5 * σc : ℚ)) : ℝ)) : + ∀ t : ℝ, (a : ℝ) ≤ t → t ≤ (b : ℝ) → Finv (1 - t) (invoice (caller 6 7) n 17) < 0 := by + intro t h1 h2 + have hbJ : b ≤ tJ0 := hb + have htJ : tJ0 ≤ 1 / 10 := by unfold tJ0; norm_num + have hbq : (b : ℝ) ≤ ((tJ0 : ℚ) : ℝ) := by exact_mod_cast hb + have hbq' : (b : ℝ) ≤ 1 / 10 := by + have := (Rat.cast_le (K := ℝ)).mpr (le_trans hb htJ); push_cast at this; exact this + have haq : ((a0 : ℚ) : ℝ) ≤ a := by exact_mod_cast ha0 + have hab' : (a : ℝ) ≤ b := by exact_mod_cast hab + have hA0 : (0 : ℝ) ≤ a0 := by exact_mod_cast ha00 + have hs0 : 0 ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + have hσ : ∀ a' b' : ℕ, 1 ≤ a' → a' ≤ b' → b' ≤ 8 → c2 (gs (1 - t)) (a' : ℝ) (b' : ℝ) ≤ (σc : ℝ) := by + intro a' b' h1' h2' h3' + have hb0 : 0 ≤ 1 - b := by + have : b ≤ 1 := le_trans hb (by unfold tJ0; norm_num) + linarith + exact sig_of_ok (1 - b) (1 - a) σc hσc hb0 (by linarith) hσ0 (1 - t) + (by push_cast; linarith) (by push_cast; linarith) a' b' h1' h2' h3' + -- window + have hlo : (0 : ℚ) ≤ 1 - tJ0 := by unfold tJ0; norm_num + have hhi : (1 - a0 : ℚ) ≤ 1 := by linarith + have hw1 : ((1 - tJ0 : ℚ) : ℝ) ≤ 1 - t := by push_cast; linarith + have hw2 : 1 - t ≤ ((1 - a0 : ℚ) : ℝ) := by push_cast; linarith + -- cap and corr + have hcap : (capI : ℝ) ≤ SCr * capC (1 - t) := by + have hu : (unLo : ℝ) ≤ (9 : ℝ) ^ (1 - t) - (8 : ℝ) ^ (1 - t) := by + have := unit_mono (1 - (b : ℝ)) (1 - t) (by linarith) (by linarith) + linarith + have hc : (capI : ℝ) ≤ (unLo : ℝ) * 10 ^ 14 / 48 := by exact_mod_cast hcapI + unfold SCr capC + have : (unLo : ℝ) * 10 ^ 14 / 48 ≤ 10 ^ 14 * (((9 : ℝ) ^ (1 - t) - (8 : ℝ) ^ (1 - t)) / 48) := by nlinarith + linarith + have hcorr : corrC cstF (1 - t) ≤ 8 * (cH : ℝ) := by + unfold corrC + have e : 1 - (1 - t) = t := by ring + rw [e] + have : cstF t ≤ cstF (b : ℝ) := + hcstMono ⟨le_trans haq h1, by linarith⟩ ⟨le_trans haq hab', hbq'⟩ h2 + linarith + have hT := tree_regs_lower W rsA rsB rootA rootB nB T hcA hcB hrA hrB capI lam gA gB hline (1 - tJ0) (1 - a0) hwin hlo hhi + (1 - t) hw1 hw2 (capC (1 - t)) (corrC cstF (1 - t)) (Omega ks mr (1 - t)) + (∑ r ∈ R, ∑ i ∈ range (nR r), c2 (gs (1 - t)) (lev dR r i) (lev dR r (i + 1))) hcap + (hP1 (1 - t) hw1 hw2) (hP2 (1 - t) hw1 hw2) + have hnum' : (lcp : ℝ) + 8 * cH ≤ ((lam : ℝ) * 4962 - ((gA : ℝ) * 104 - ((gA : ℝ) - gB) * nB)) / SCr := by + have := (Rat.cast_le (K := ℝ)).mpr hnum + push_cast at this + unfold SCr; linarith + have hreg := sum_all_c2_le (gs (1 - t)) (gs_zero (1 - t)) R nR dR hmono hd9 5 hmix (σc : ℝ) (by exact_mod_cast hσ0) hσ + push_cast at hreg + have hE' : (((lcp - 5 * σc : ℚ)) : ℝ) ≤ E (1 - t) + Omega ks mr (1 - t) := by + have := hEex (1 - t) hs0 hs1 + push_cast + linarith + exact branchC_om n ks mr (E (1 - t)) _ (1 - t) (hF _ hs0 hs1) hE' (hFb (1 - t) (by push_cast; linarith) (by push_cast; linarith)) + +end CTree + +#print axioms CTree.tree_regs_lower +#print axioms CTree.tree_piece diff --git a/research/p104-reader-ceiling/lean/Nov15/CongestionTreeW.lean b/research/p104-reader-ceiling/lean/Nov15/CongestionTreeW.lean new file mode 100644 index 0000000000..f22bfe0d0c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/CongestionTreeW.lean @@ -0,0 +1,71 @@ +import Nov15.CongestionI3DualSig +import Nov15.CongestionTreeCore + +/-! +CONGESTION-TREE-W: kernel certificate that the integer weight table `W a b` (units 1/10^14, rounded DOWN) is a lower bound of +`c2 (gs s) a b = min (h9, k0)` for every `s` in a window `[lo, hi]`. Method: `h9`, `k0` are exponential polynomials (`h9CF`, `k0CF`); +`dLo (negCF cf) lo hi > 0` proves them nonincreasing in `s` on the window (so nondecreasing in `t = 1 - s`), and a point enclosure +`Fup (negCF cf) hi hi <= -W/10^14` bounds them below at `s = hi`. No monotonicity hypothesis remains. +-/ +namespace CTree +open NumCertK CongestionI3Dual + +def negCF (cf : CF) : CF := cf.map fun p => (p.1, -p.2) + +theorem Fc_negCF (cf : CF) (s : ℝ) : Fc (negCF cf) s = - Fc cf s := by + induction cf with + | nil => simp [Fc, negCF] + | cons p l ih => + simp only [Fc, negCF, List.map_cons, List.sum_cons] at ih ⊢ + push_cast + linarith + +theorem okR_negCF (cf : CF) (h : okR cf) : okR (negCF cf) := by + intro p hp + simp only [negCF, List.mem_map] at hp + obtain ⟨q, hq, rfl⟩ := hp + exact h q hq + +def Wt (W : List (List ℕ)) (a b : ℕ) : ℕ := (W.getD a []).getD b 0 + +def wtPair (W : List (List ℕ)) (lo hi : ℚ) (p : ℕ × ℕ) : Bool := + decide (0 < dLo (negCF (h9CF p.1 p.2)) lo hi) && decide (0 < dLo (negCF (k0CF p.1 p.2)) lo hi) && + decide (Fup (negCF (h9CF p.1 p.2)) hi hi ≤ -((Wt W p.1 p.2 : ℚ) / 10 ^ 14)) && + decide (Fup (negCF (k0CF p.1 p.2)) hi hi ≤ -((Wt W p.1 p.2 : ℚ) / 10 ^ 14)) + +def wtOK (W : List (List ℕ)) (lo hi : ℚ) : Bool := pairs.all (wtPair W lo hi) + +theorem cf_lower (cf : CF) (hok : okR cf) (lo hi : ℚ) (hlo : 0 ≤ lo) (hhi : hi ≤ 1) (hd : 0 < dLo (negCF cf) lo hi) (q : ℚ) + (hq : Fup (negCF cf) hi hi ≤ -q) (s : ℝ) (h1 : (lo : ℝ) ≤ s) (h2 : s ≤ (hi : ℝ)) : (q : ℝ) ≤ Fc cf s := by + have hok' := okR_negCF cf hok + have m1 := Fc_mono (negCF cf) hok' lo hi hlo hhi hd s h1 h2 + have hhi0 : 0 ≤ hi := by + have : (0 : ℝ) ≤ hi := le_trans (by exact_mod_cast hlo) (le_trans h1 h2) + exact_mod_cast this + have m2 := Fc_le (negCF cf) hok' hi hi hhi0 hhi (hi : ℝ) (le_refl _) (le_refl _) + have m3 : ((Fup (negCF cf) hi hi : ℚ) : ℝ) ≤ ((-q : ℚ) : ℝ) := by exact_mod_cast hq + simp only [Fc_negCF] at m1 m2 + push_cast at m3 + linarith + +theorem W_lower (W : List (List ℕ)) (lo hi : ℚ) (hok : wtOK W lo hi = true) (hlo : 0 ≤ lo) (hhi : hi ≤ 1) (s : ℝ) + (h1 : (lo : ℝ) ≤ s) (h2 : s ≤ (hi : ℝ)) (a b : ℕ) (ha : 1 ≤ a) (hab : a < b) (hb : b ≤ 8) : + ((Wt W a b : ℕ) : ℝ) / SCr ≤ c2 (gs s) (a : ℝ) (b : ℝ) := by + have hm : (a, b) ∈ pairs := mem_pairs a (by omega) b (by omega) ⟨ha, hab, hb⟩ + have := List.all_eq_true.mp hok (a, b) hm + simp only [wtPair, Bool.and_eq_true, decide_eq_true_eq] at this + obtain ⟨⟨⟨d1, d2⟩, f1⟩, f2⟩ := this + have e1 := cf_lower (h9CF a b) (okR_h9CF a b ha hab hb) lo hi hlo hhi d1 ((Wt W a b : ℚ) / 10 ^ 14) f1 s h1 h2 + have e2 := cf_lower (k0CF a b) (okR_k0CF a b ha hab hb) lo hi hlo hhi d2 ((Wt W a b : ℚ) / 10 ^ 14) f2 s h1 h2 + rw [← h9_Fc s a b ha hab hb] at e1 + rw [← k0_Fc s a b ha hab hb] at e2 + have hS : SCr = ((10 ^ 14 : ℚ) : ℝ) := by unfold SCr; push_cast; ring + have : (((Wt W a b : ℚ) / 10 ^ 14 : ℚ) : ℝ) = ((Wt W a b : ℕ) : ℝ) / SCr := by + rw [hS]; push_cast; ring + rw [this] at e1 e2 + unfold c2 + exact le_min e1 e2 + +end CTree + +#print axioms CTree.W_lower diff --git a/research/p104-reader-ceiling/lean/Nov15/FibreK.lean b/research/p104-reader-ceiling/lean/Nov15/FibreK.lean new file mode 100644 index 0000000000..33e2d3f083 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/FibreK.lean @@ -0,0 +1,537 @@ +/- +FibreK . See FibreK.md. Formalises the AUDITED parts of internal notes,2}.md, AUDIT2.md. + +Part 1 THEOREM K. Price premise P0 as an explicit hypothesis (a `Table`: the ranks charged for a helper climb d = e - b on T, + and for a helper MOVE of |dim step| = d on P). The invoice F(t) = sum_r (T_r - P_r) r^(1-t) of the word is + `FK E tb S Pi t`: a function of the ends E, the step multiset S and the climb multiset Pi only (`K_word`, `K_invoice`). +Part 2 G2 for PURE relabels. Helpers end identity; hub gauge L in Blk(V'), M in Blk(G0) (SwapNull.Blk / Undo). + * tail: row relabel (SwapNull.rowSw), V' = sigma^-1 V (the corrected hypothesis), `tail_pairs`; + * head: column relabel (SwapNull.colSw), prefix block G1 = the NEW births-at-0 set, proved DIRECTLY `head_pairs`; + the (birth,end) multiset, hence Pi, hence F(t) by K, is unchanged. +Kernel only: no sorry, no native_decide. +-/ +import Nov15.SwapNull +import Nov15.CallerCost + +set_option linter.unusedSectionVars false +set_option linter.unusedVariables false + +namespace FibreK +open CallerCost + +/-! ### Part 1: THEOREM K -/ + +/-- P0: rank tables. `tT d` = ranks charged to T for a helper with climb d = e - b; +`tP d` = ranks charged to P for a helper MOVE with |Δdim| = d. (Hist = (rank, count) lists.) -/ +structure Table where + tT : ℕ → Hist + tP : ℕ → Hist + +/-- A helper: birth dim, end dim, and its MOVE steps as (source dim, target dim). -/ +structure Helper where + b : ℕ + e : ℕ + steps : List (ℕ × ℕ) + +def gap (s : ℕ × ℕ) : ℕ := Int.natAbs ((s.2 : ℤ) - s.1) + +/-- F-contribution of a histogram: sum count * rank^(1-t). -/ +noncomputable def Fh (l : Hist) (t : ℝ) : ℝ := (l.map fun p => (p.2 : ℝ) * (p.1 : ℝ) ^ (1 - t)).sum +noncomputable def Fi (i : Inv) (t : ℝ) : ℝ := Fh i.T t - Fh i.P t + +theorem Fh_append (l m : Hist) (t : ℝ) : Fh (l ++ m) t = Fh l t + Fh m t := by simp [Fh] + +theorem Fh_scale (L : ℕ) (l : Hist) (t : ℝ) : Fh (scale L l) t = L * Fh l t := by + induction l with + | nil => simp [Fh, scale] + | cons p l ih => + simp only [Fh, scale, List.map_cons, List.sum_cons] at ih ⊢ + rw [ih]; push_cast; ring + +theorem Fh_flatMap {α : Type*} (l : List α) (g : α → Hist) (t : ℝ) : + Fh (l.flatMap g) t = (l.map fun x => Fh (g x) t).sum := by + induction l with + | nil => simp [Fh] + | cons x l ih => simp [List.flatMap_cons, Fh_append, ih] + +/-- invoice = caller + L * native, at the level of F. -/ +theorem Fi_invoice (c n : Inv) (L : ℕ) (t : ℝ) : + Fi (invoice c n L) t = Fi c t + L * Fi n t := by + simp only [Fi, invoice, Fh_append, Fh_scale]; ring + +/-- the native's invoice histograms from the helper list (P0). -/ +def nativeInv (E : Inv) (tb : Table) (H : List Helper) : Inv := + ⟨E.T ++ H.flatMap fun h => tb.tT (h.e - h.b), + E.P ++ H.flatMap fun h => h.steps.flatMap fun s => tb.tP (gap s)⟩ + +/-- the timed-step data: S = multiset of all helper MOVEs, Pi = multiset of climbs e - b. -/ +def Ssum (H : List Helper) : Multiset (ℕ × ℕ) := ↑(H.flatMap Helper.steps) +def PiW (H : List Helper) : Multiset ℕ := ↑(H.map fun h => h.e - h.b) + +/-- F as a function of the DATA (E, S, Pi). -/ +noncomputable def FK (E : Inv) (tb : Table) (S : Multiset (ℕ × ℕ)) (Pi : Multiset ℕ) (t : ℝ) : ℝ := + Fi E t + (Pi.map fun d => Fh (tb.tT d) t).sum - (S.map fun s => Fh (tb.tP (gap s)) t).sum + +theorem sum_flatMap_map {α β : Type*} (H : List α) (g : α → List β) (φ : β → ℝ) : + ((H.flatMap g).map φ).sum = (H.map fun h => ((g h).map φ).sum).sum := by + induction H with + | nil => simp + | cons h H ih => simp [List.flatMap_cons, List.map_append, List.sum_append, ih] + +/-- **THEOREM K** (P0 as hypothesis `tb`): the word's F is `FK` of its (E, S, Pi). -/ +theorem K_word (E : Inv) (tb : Table) (H : List Helper) (t : ℝ) : + Fi (nativeInv E tb H) t = FK E tb (Ssum H) (PiW H) t := by + simp only [Fi, nativeInv, FK, Ssum, PiW, Fh_append, Fh_flatMap, Multiset.map_coe, Multiset.sum_coe] + rw [sum_flatMap_map] + have : ∀ h : Helper, (h.steps.map fun s => Fh (tb.tP (gap s)) t).sum + = Fh (h.steps.flatMap fun s => tb.tP (gap s)) t := fun h => (Fh_flatMap _ _ _).symm + simp only [List.map_map, Function.comp_def, this] + ring + +/-- κ depends only on (E, S, Pi): two words with the same data have the same F, so the same roots. -/ +theorem K_congr (E : Inv) (tb : Table) (H H' : List Helper) + (hS : Ssum H' = Ssum H) (hP : PiW H' = PiW H) (t : ℝ) : + Fi (nativeInv E tb H') t = Fi (nativeInv E tb H) t := by + rw [K_word, K_word, hS, hP] + +/-- the caller invoice of the native (calls = L) is a function of (E, S, Pi) (and the fixed caller). -/ +theorem K_invoice (c E : Inv) (tb : Table) (H : List Helper) (L : ℕ) (t : ℝ) : + Fi (invoice c (nativeInv E tb H) L) t = Fi c t + L * FK E tb (Ssum H) (PiW H) t := by + rw [Fi_invoice, K_word] + +/-- κ = a root of F: invariant when F is. -/ +def IsRoot (F : ℝ → ℝ) (κ : ℝ) : Prop := F κ = 0 + +theorem kappa_depends_only (c E : Inv) (tb : Table) (H H' : List Helper) (L : ℕ) + (hS : Ssum H' = Ssum H) (hP : PiW H' = PiW H) (κ : ℝ) : + IsRoot (Fi (invoice c (nativeInv E tb H') L)) κ ↔ IsRoot (Fi (invoice c (nativeInv E tb H) L)) κ := by + unfold IsRoot + rw [K_invoice, K_invoice, hS, hP] + +/-- the instance used by FloorD0 / V2Bridge: D0 table `tT d = tP d = [(d, 1)]`; then the helper part is +Σ_h [f(e-b) - Σ_steps f(gap)] (the per-helper D0 identity). -/ +def d0Table : Table := ⟨fun d => [(d, 1)], fun d => [(d, 1)]⟩ + +theorem Dh_flatMap {α : Type*} (l : List α) (g : α → Hist) : + Dh (l.flatMap g) = (l.map fun x => Dh (g x)).sum := by + induction l with + | nil => simp [Dh] + | cons x l ih => simp [List.flatMap_cons, Dh_append, ih] + +theorem d0_native (E : Inv) (H : List Helper) : + Dinv (nativeInv E d0Table H) = Dinv E + (H.map fun h => + (fL (h.e - h.b) - (h.steps.map fun s => fL (gap s)).sum)).sum := by + simp only [Dinv, nativeInv, Dh_append, Dh_flatMap, d0Table] + have h1 : ∀ h : Helper, Dh [(h.e - h.b, 1)] = fL (h.e - h.b) := by intro h; simp [Dh] + have h2 : ∀ h : Helper, (h.steps.map fun s => Dh [(gap s, 1)]).sum = (h.steps.map fun s => fL (gap s)).sum := by + intro h; simp [Dh] + have hs : ∀ (l : List Helper) (a b : Helper → ℝ), + (l.map fun h => a h - b h).sum = (l.map a).sum - (l.map b).sum := by + intro l a b + induction l with + | nil => simp + | cons x l ih => simp [ih]; ring + simp only [h1, h2] + rw [hs] + ring + +/-! ### Part 2: G2 for pure relabels -/ +section G2 +open SwapNull +variable {K Reg : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] + +/-- helpers end identity: the final row of a helper is its own unit vector. -/ +def HelpersId (H : Reg → Prop) (F : Matrix Reg Reg K) : Prop := + ∀ x, H x → ∀ k, F x k = (1 : Matrix Reg Reg K) x k + +/-- Row x ∉ V' of L * A * M is the row of A * M. -/ +theorem lrow {V' : Reg → Prop} {L : Matrix Reg Reg K} (hL : Blk V' L) (A : Matrix Reg Reg K) + {x : Reg} (hx : ¬ V' x) (j : Reg) : (L * A) x j = A x j := by + rw [Matrix.mul_apply, Finset.sum_eq_single x] + · rw [hL x x (fun h => hx h.1)]; simp + · intro i _ hi; rw [hL x i (fun h => hx h.1), Matrix.one_apply_ne (Ne.symm hi)]; simp + · simp + +/-- TAIL force: if L ∈ Blk(V'), M ∈ Blk(G0) undo a row relabel of an identity-final matrix, every moved +helper x ∉ V' has x and σ x in G0. -/ +theorem tail_force {H V' G0 : Reg → Prop} {F : Matrix Reg Reg K} (hF : HelpersId H F) + (σ : Equiv.Perm Reg) (hσH : ∀ x, H x → H (σ x)) + (hu : Undo V' G0 F (rowSw σ F)) {x : Reg} (hx : H x) (hV : ¬ V' x) (hm : σ x ≠ x) : + G0 x ∧ G0 (σ x) := by + obtain ⟨L, M, hL, hM, h⟩ := hu + have key : ∀ k, M (σ x) k = (1 : Matrix Reg Reg K) x k := by + intro k + have h1 : (L * rowSw σ F * M) x k = M (σ x) k := by + rw [Matrix.mul_apply, Finset.sum_eq_single (σ x)] + · rw [lrow hL _ hV]; simp [rowSw, hF (σ x) (hσH x hx)] + · intro j _ hj + rw [lrow hL _ hV]; simp [rowSw, hF (σ x) (hσH x hx), Matrix.one_apply_ne (Ne.symm hj)] + · simp + rw [← h1, h]; exact hF x hx k + constructor + · by_contra hg + have := hM (σ x) x (fun h => hg h.2) + rw [key x, Matrix.one_apply_ne hm] at this + simp at this + · by_contra hg + have := hM (σ x) (σ x) (fun h => hg h.1) + rw [key (σ x), Matrix.one_apply_ne (Ne.symm hm)] at this + simp at this + +/-- HEAD force (direct, not by time reversal): a column relabel undone by L ∈ Blk(V), M ∈ Blk(G1): +every moved helper x ∉ V has σ⁻¹ x and x in G1. -/ +theorem head_force {H V G1 : Reg → Prop} {F : Matrix Reg Reg K} (hF : HelpersId H F) + (σ : Equiv.Perm Reg) + (hu : Undo V G1 F (colSw σ F)) {x : Reg} (hx : H x) (hV : ¬ V x) (hm : σ x ≠ x) : + G1 (σ.symm x) ∧ G1 x := by + obtain ⟨L, M, hL, hM, h⟩ := hu + have key : ∀ k, M (σ.symm x) k = (1 : Matrix Reg Reg K) x k := by + intro k + have h1 : (L * colSw σ F * M) x k = M (σ.symm x) k := by + rw [Matrix.mul_apply, Finset.sum_eq_single (σ.symm x)] + · rw [lrow hL _ hV]; simp [colSw, hF x hx] + · intro j _ hj + rw [lrow hL _ hV] + have : x ≠ σ j := fun e => hj (by rw [e]; simp) + simp [colSw, hF x hx, Matrix.one_apply_ne this] + · simp + rw [← h1, h]; exact hF x hx k + have hy : σ.symm x ≠ x := fun e => hm (by + have := congrArg σ e; simpa using this.symm) + constructor + · by_contra hg + have := hM (σ.symm x) (σ.symm x) (fun h => hg h.1) + rw [key (σ.symm x), Matrix.one_apply_ne (Ne.symm hy)] at this + simp at this + · by_contra hg + have := hM (σ.symm x) x (fun h => hg h.2) + rw [key x, Matrix.one_apply_ne hy] at this + simp at this + +/-! counting lemma: equal cardinality, differing only on birth-0 elements, so equal birth multisets -/ +theorem map_birth_eq (β : Reg → ℕ) (A B : Finset Reg) (hc : A.card = B.card) + (hA : ∀ x ∈ A, x ∉ B → β x = 0) (hB : ∀ x ∈ B, x ∉ A → β x = 0) : + A.val.map β = B.val.map β := by + classical + have hne : ∀ b : ℕ, b ≠ 0 → A.filter (fun x => b = β x) = B.filter (fun x => b = β x) := by + intro b hb + ext x + simp only [Finset.mem_filter] + constructor + · rintro ⟨ha, e⟩ + refine ⟨?_, e⟩ + by_contra hn + exact hb (e.trans (hA x ha hn)) + · rintro ⟨ha, e⟩ + refine ⟨?_, e⟩ + by_contra hn + exact hb (e.trans (hB x ha hn)) + apply Multiset.ext.2 + intro b + rw [Multiset.count_map, Multiset.count_map] + simp only [← Finset.filter_val, Finset.card_val] + by_cases hb : b = 0 + · subst hb + have h1 := Finset.card_filter_add_card_filter_not (s := A) (fun x => 0 = β x) + have h2 := Finset.card_filter_add_card_filter_not (s := B) (fun x => 0 = β x) + have h3 : A.filter (fun x => ¬ (0 = β x)) = B.filter (fun x => ¬ (0 = β x)) := by + ext x + simp only [Finset.mem_filter] + constructor + · rintro ⟨ha, e⟩ + refine ⟨?_, e⟩ + by_contra hn + exact e (hA x ha hn).symm + · rintro ⟨ha, e⟩ + refine ⟨?_, e⟩ + by_contra hn + exact e (hB x ha hn).symm + rw [h3] at h1 + omega + · rw [hne b hb] + +variable (β ε : Reg → ℕ) (d : ℕ) + +/-- birth/end pairs of the helpers `Hs`. -/ +def pairs (Hs : Finset Reg) : Multiset (ℕ × ℕ) := Hs.val.map fun x => (β x, ε x) +/-- after a tail relabel x keeps its birth but takes σ x's end. -/ +def pairsTail (σ : Equiv.Perm Reg) (Hs : Finset Reg) : Multiset (ℕ × ℕ) := + Hs.val.map fun x => (β x, ε (σ x)) +/-- after a head relabel x takes σ x's birth but keeps its end. -/ +def pairsHead (σ : Equiv.Perm Reg) (Hs : Finset Reg) : Multiset (ℕ × ℕ) := + Hs.val.map fun x => (β (σ x), ε x) + +theorem sigma_H {H : Reg → Prop} (σ : Equiv.Perm Reg) (hσ : ∀ x, ¬ H x → σ x = x) : + ∀ x, H x → H (σ x) := by + intro x hx + by_contra h + have h1 := hσ _ h + have : σ x = x := σ.injective h1 + exact h (by rw [this]; exact hx) + +theorem split_map {α γ : Type*} (s : Multiset α) (p : α → Prop) [DecidablePred p] (f : α → γ) : + s.map f = (s.filter p).map f + (s.filter (fun x => ¬ p x)).map f := by + rw [← Multiset.map_add, Multiset.filter_add_not] + +/-- the (birth, end) pair multiset determines the climb multiset Pi -/ +def PiOf (ps : Multiset (ℕ × ℕ)) : Multiset ℕ := ps.map fun p => p.2 - p.1 + +theorem PiW_eq (H : List Helper) : PiW H = PiOf (↑(H.map fun h => (h.b, h.e)) : Multiset (ℕ × ℕ)) := by + simp [PiW, PiOf, Multiset.map_coe, List.map_map, Function.comp_def] + +section Pairs + +theorem symm_fix (σ : Equiv.Perm Reg) (x : Reg) (h : σ.symm x = x) : σ x = x := by + have h2 := congrArg σ h + rw [Equiv.apply_symm_apply] at h2 + exact h2.symm + +/-- **G2, TAIL case.** Hypotheses (AUDIT2): helpers end identity; G0-members are born at 0; the V-enders +(= the helpers ending at the single chart `d`) are exactly V ⊆ H; σ permutes helpers only; hub gauge +L ∈ Blk(V'), M ∈ Blk(G0) with V' = σ⁻¹ V. Then the (birth,end) multiset is unchanged. -/ +theorem tail_pairs {H V G0 : Reg → Prop} [DecidablePred H] [DecidablePred V] + {F : Matrix Reg Reg K} (hF : HelpersId H F) (σ : Equiv.Perm Reg) (hσ : ∀ x, ¬ H x → σ x = x) + (hVH : ∀ x, V x → H x) (hE : ∀ x, H x → (ε x = d ↔ V x)) (hG : ∀ x, G0 x → β x = 0) + (hu : Undo (fun x => V (σ x)) G0 F (rowSw σ F)) : + pairsTail β ε σ (Finset.univ.filter H) = pairs β ε (Finset.univ.filter H) := by + classical + have hσH := sigma_H σ hσ + have hσs : ∀ x, ¬ H x → σ.symm x = x := fun x hx => (Equiv.symm_apply_eq σ).2 (hσ x hx).symm + have hσsH := sigma_H σ.symm hσs + set Hs : Finset Reg := Finset.univ.filter H with hHs + have memH : ∀ x, x ∈ Hs ↔ H x := by intro x; simp [hHs] + have F1 : ∀ x, H x → ¬ V (σ x) → σ x ≠ x → β x = 0 ∧ β (σ x) = 0 := by + intro x hx hv hm + obtain ⟨a, b⟩ := tail_force hF σ hσH hu hx hv hm + exact ⟨hG _ a, hG _ b⟩ + have F2 : ∀ x, H x → ¬ V (σ x) → β (σ x) = β x := by + intro x hx hv + by_cases hm : σ x = x + · rw [hm] + · obtain ⟨a, b⟩ := F1 x hx hv hm; rw [a, b] + set V' : Finset Reg := Hs.filter (fun x => V (σ x)) with hV' + set Vf : Finset Reg := Hs.filter V with hVf + have hcard : V'.card = Vf.card := by + apply Finset.card_bij (fun x _ => σ x) + · intro x hx + simp only [hV', hVf, Finset.mem_filter, memH] at hx ⊢ + exact ⟨hσH x hx.1, hx.2⟩ + · intro x _ y _ e; exact σ.injective e + · intro y hy + simp only [hV', hVf, Finset.mem_filter, memH] at hy ⊢ + refine ⟨σ.symm y, ⟨hσsH y hy.1, by simpa using hy.2⟩, by simp⟩ + have F4 : ∀ x ∈ V', x ∉ Vf → β x = 0 := by + intro x hx hxn + simp only [hV', hVf, Finset.mem_filter, memH] at hx hxn + have hnV : ¬ V x := fun h => hxn ⟨hx.1, h⟩ + have hmu : σ (σ.symm x) ≠ σ.symm x := by + intro e + rw [Equiv.apply_symm_apply] at e + exact hnV (by have := symm_fix σ x e.symm; rw [← this]; exact hx.2) + have := (F1 _ (hσsH x hx.1) (by rw [Equiv.apply_symm_apply]; exact hnV) hmu).2 + rwa [Equiv.apply_symm_apply] at this + have F5 : ∀ y ∈ Vf, y ∉ V' → β y = 0 := by + intro y hy hyn + simp only [hV', hVf, Finset.mem_filter, memH] at hy hyn + have hnV : ¬ V (σ y) := fun h => hyn ⟨hy.1, h⟩ + have hm : σ y ≠ y := fun e => hnV (by rw [e]; exact hy.2) + exact (F1 y hy.1 hnV hm).1 + have hV'map : V'.val.map β = Vf.val.map β := + map_birth_eq β V' Vf hcard F4 F5 + -- the non-V' part is carried to the non-V part by σ + set N1 : Finset Reg := Hs.filter (fun x => ¬ V (σ x)) with hN1 + set N2 : Finset Reg := Hs.filter (fun x => ¬ V x) with hN2 + have hN : N2 = N1.map σ.toEmbedding := by + ext y + simp only [hN1, hN2, Finset.mem_filter, Finset.mem_map, memH, Equiv.coe_toEmbedding] + constructor + · rintro ⟨hy, hv⟩ + exact ⟨σ.symm y, ⟨hσsH y hy, by simpa using hv⟩, by simp⟩ + · rintro ⟨x, ⟨hx, hv⟩, rfl⟩ + exact ⟨hσH x hx, hv⟩ + unfold pairsTail pairs + rw [split_map Hs.val (fun x => V (σ x)), split_map Hs.val V] + congr 1 + · have e1 : (Hs.val.filter (fun x => V (σ x))).map (fun x => (β x, ε (σ x))) = + V'.val.map (fun x => (β x, d)) := by + apply Multiset.map_congr rfl + intro x hx + have hx' : x ∈ V' := hx + simp only [hV', Finset.mem_filter, memH] at hx' + rw [(hE (σ x) (hσH x hx'.1)).2 hx'.2] + have e2 : (Hs.val.filter V).map (fun x => (β x, ε x)) = Vf.val.map (fun x => (β x, d)) := by + apply Multiset.map_congr rfl + intro x hx + have hx' : x ∈ Vf := hx + simp only [hVf, Finset.mem_filter, memH] at hx' + rw [(hE x hx'.1).2 hx'.2] + rw [e1, e2] + have h3 : ∀ A : Finset Reg, A.val.map (fun x => (β x, d)) = (A.val.map β).map (fun b => (b, d)) := by + intro A; rw [Multiset.map_map]; rfl + rw [h3, h3, hV'map] + · have e : (Hs.val.filter (fun x => ¬ V (σ x))) = N1.val := rfl + have e' : (Hs.val.filter (fun x => ¬ V x)) = N2.val := rfl + rw [e, e', hN, Finset.map_val, Multiset.map_map] + apply Multiset.map_congr rfl + intro x hx + have hx' : x ∈ N1 := hx + simp only [hN1, Finset.mem_filter, memH] at hx' + simp [F2 x hx'.1 hx'.2] + +/-- **G2, HEAD case, proved directly** (no time reversal). A head relabel x ↦ birth of σ x, same end; +the hub undoing it is L ∈ Blk(V) (the V-enders are unchanged) and the prefix M ∈ Blk(G1), where G1 is the set +of helpers born at 0 in the NEW word (`G1 x → β (σ x) = 0`; the head-side analogue of V' = σ⁻¹ V). -/ +theorem head_pairs {H V G1 : Reg → Prop} [DecidablePred H] [DecidablePred V] + {F : Matrix Reg Reg K} (hF : HelpersId H F) (σ : Equiv.Perm Reg) (hσ : ∀ x, ¬ H x → σ x = x) + (hVH : ∀ x, V x → H x) (hE : ∀ x, H x → (ε x = d ↔ V x)) (hG : ∀ x, G1 x → β (σ x) = 0) + (hu : Undo V G1 F (colSw σ F)) : + pairsHead β ε σ (Finset.univ.filter H) = pairs β ε (Finset.univ.filter H) := by + classical + have hσH := sigma_H σ hσ + have hσs : ∀ x, ¬ H x → σ.symm x = x := fun x hx => (Equiv.symm_apply_eq σ).2 (hσ x hx).symm + have hσsH := sigma_H σ.symm hσs + set Hs : Finset Reg := Finset.univ.filter H with hHs + have memH : ∀ x, x ∈ Hs ↔ H x := by intro x; simp [hHs] + have F1 : ∀ x, H x → ¬ V x → σ x ≠ x → β x = 0 ∧ β (σ x) = 0 := by + intro x hx hv hm + obtain ⟨a, b⟩ := head_force hF σ hu hx hv hm + refine ⟨?_, hG _ b⟩ + have := hG _ a + rwa [Equiv.apply_symm_apply] at this + have F2 : ∀ x, H x → ¬ V x → β (σ x) = β x := by + intro x hx hv + by_cases hm : σ x = x + · rw [hm] + · obtain ⟨a, b⟩ := F1 x hx hv hm; rw [a, b] + set Vf : Finset Reg := Hs.filter V with hVf + set Vs : Finset Reg := Vf.map σ.toEmbedding with hVs + have hcard : Vs.card = Vf.card := Finset.card_map _ + have F4 : ∀ x ∈ Vs, x ∉ Vf → β x = 0 := by + intro x hx hxn + simp only [hVs, hVf, Finset.mem_map, Finset.mem_filter, memH, Equiv.coe_toEmbedding] at hx hxn + obtain ⟨w, ⟨hw, hv⟩, rfl⟩ := hx + have hnV : ¬ V (σ w) := fun h => hxn ⟨hσH w hw, h⟩ + have hm : σ (σ w) ≠ σ w := fun e => hnV (by have := σ.injective e; rw [this]; exact hv) + exact (F1 (σ w) (hσH w hw) hnV hm).1 + have F5 : ∀ x ∈ Vf, x ∉ Vs → β x = 0 := by + intro x hx hxn + simp only [hVs, hVf, Finset.mem_map, Finset.mem_filter, memH, Equiv.coe_toEmbedding] at hx hxn + have hnV : ¬ V (σ.symm x) := fun h => hxn ⟨σ.symm x, ⟨hσsH x hx.1, h⟩, by simp⟩ + have hm : σ (σ.symm x) ≠ σ.symm x := by + intro e + rw [Equiv.apply_symm_apply] at e + exact hnV (by rw [← e]; exact hx.2) + have := (F1 (σ.symm x) (hσsH x hx.1) hnV hm).2 + rwa [Equiv.apply_symm_apply] at this + have hmap : Vs.val.map β = Vf.val.map β := map_birth_eq β Vs Vf hcard F4 F5 + unfold pairsHead pairs + rw [split_map Hs.val V] + conv_rhs => rw [split_map Hs.val V] + congr 1 + · have e1 : (Hs.val.filter V).map (fun x => (β (σ x), ε x)) = Vf.val.map (fun x => (β (σ x), d)) := by + apply Multiset.map_congr rfl + intro x hx + have hx' : x ∈ Vf := hx + simp only [hVf, Finset.mem_filter, memH] at hx' + rw [(hE x hx'.1).2 hx'.2] + have e2 : (Hs.val.filter V).map (fun x => (β x, ε x)) = Vf.val.map (fun x => (β x, d)) := by + apply Multiset.map_congr rfl + intro x hx + have hx' : x ∈ Vf := hx + simp only [hVf, Finset.mem_filter, memH] at hx' + rw [(hE x hx'.1).2 hx'.2] + rw [e1, e2] + have h3 : Vf.val.map (fun x => (β (σ x), d)) = (Vs.val.map β).map (fun b => (b, d)) := by + rw [hVs, Finset.map_val, Multiset.map_map, Multiset.map_map]; rfl + have h4 : Vf.val.map (fun x => (β x, d)) = (Vf.val.map β).map (fun b => (b, d)) := by + rw [Multiset.map_map]; rfl + rw [h3, h4, hmap] + · have e' : (Hs.val.filter (fun x => ¬ V x)) = (Hs.filter (fun x => ¬ V x)).val := rfl + rw [e'] + apply Multiset.map_congr rfl + intro x hx + have hx' : x ∈ Hs.filter (fun x => ¬ V x) := hx + simp only [Finset.mem_filter, memH] at hx' + simp [F2 x hx'.1 hx'.2] + +/-! ### G2 ⇒ Π ⇒ F: the combined statement -/ + +theorem tail_Pi {H V G0 : Reg → Prop} [DecidablePred H] [DecidablePred V] + {F : Matrix Reg Reg K} (hF : HelpersId H F) (σ : Equiv.Perm Reg) (hσ : ∀ x, ¬ H x → σ x = x) + (hVH : ∀ x, V x → H x) (hE : ∀ x, H x → (ε x = d ↔ V x)) (hG : ∀ x, G0 x → β x = 0) + (hu : Undo (fun x => V (σ x)) G0 F (rowSw σ F)) : + PiOf (pairsTail β ε σ (Finset.univ.filter H)) = PiOf (pairs β ε (Finset.univ.filter H)) := by + rw [tail_pairs β ε d hF σ hσ hVH hE hG hu] + +theorem head_Pi {H V G1 : Reg → Prop} [DecidablePred H] [DecidablePred V] + {F : Matrix Reg Reg K} (hF : HelpersId H F) (σ : Equiv.Perm Reg) (hσ : ∀ x, ¬ H x → σ x = x) + (hVH : ∀ x, V x → H x) (hE : ∀ x, H x → (ε x = d ↔ V x)) (hG : ∀ x, G1 x → β (σ x) = 0) + (hu : Undo V G1 F (colSw σ F)) : + PiOf (pairsHead β ε σ (Finset.univ.filter H)) = PiOf (pairs β ε (Finset.univ.filter H)) := by + rw [head_pairs β ε d hF σ hσ hVH hE hG hu] + +/-- G2 + K: a hub-undoable pure tail relabel that keeps the step multiset S (SwapNull.stays_multiset) leaves +F(t), hence κ, unchanged. -/ +theorem tail_F_null {H V G0 : Reg → Prop} [DecidablePred H] [DecidablePred V] + {F : Matrix Reg Reg K} (hF : HelpersId H F) (σ : Equiv.Perm Reg) (hσ : ∀ x, ¬ H x → σ x = x) + (hVH : ∀ x, V x → H x) (hE : ∀ x, H x → (ε x = d ↔ V x)) (hG : ∀ x, G0 x → β x = 0) + (hu : Undo (fun x => V (σ x)) G0 F (rowSw σ F)) + (E : Inv) (tb : Table) (S : Multiset (ℕ × ℕ)) (t : ℝ) : + FK E tb S (PiOf (pairsTail β ε σ (Finset.univ.filter H))) t = + FK E tb S (PiOf (pairs β ε (Finset.univ.filter H))) t := by + rw [tail_Pi β ε d hF σ hσ hVH hE hG hu] + +theorem head_F_null {H V G1 : Reg → Prop} [DecidablePred H] [DecidablePred V] + {F : Matrix Reg Reg K} (hF : HelpersId H F) (σ : Equiv.Perm Reg) (hσ : ∀ x, ¬ H x → σ x = x) + (hVH : ∀ x, V x → H x) (hE : ∀ x, H x → (ε x = d ↔ V x)) (hG : ∀ x, G1 x → β (σ x) = 0) + (hu : Undo V G1 F (colSw σ F)) + (E : Inv) (tb : Table) (S : Multiset (ℕ × ℕ)) (t : ℝ) : + FK E tb S (PiOf (pairsHead β ε σ (Finset.univ.filter H))) t = + FK E tb S (PiOf (pairs β ε (Finset.univ.filter H))) t := by + rw [head_Pi β ε d hF σ hσ hVH hE hG hu] + +end Pairs + +/-! ### C3 (R1's 3-cycle) is NOT undoable once V' = σ⁻¹ V is used (Lean check of AUDIT2's observation) -/ +section C3 +open SwapNull + +/-- a = (5→9), b = (0→7), c = (0→9) on Fin 3; σ: a ↦ b, b ↦ c, c ↦ a. -/ +def c3β : Fin 3 → ℕ := ![5, 0, 0] +def c3ε : Fin 3 → ℕ := ![9, 7, 9] +def c3σ : Equiv.Perm (Fin 3) := Equiv.swap 0 1 * Equiv.swap 1 2 + +theorem c3σ_apply : c3σ 0 = 1 ∧ c3σ 1 = 2 ∧ c3σ 2 = 0 := by decide + +/-- the pair multiset changes (Π {4,7,9} → {2,9,9} in R1's words) -/ +theorem c3_pairs_change : + pairsTail c3β c3ε c3σ Finset.univ ≠ pairs c3β c3ε Finset.univ := by decide + +theorem c3_not_undoable (G0 : Fin 3 → Prop) (hG : ∀ x, G0 x → c3β x = 0) : + ¬ Undo (fun x => (c3ε (c3σ x) = 9 : Prop)) G0 (1 : Matrix (Fin 3) (Fin 3) ℚ) + (rowSw c3σ 1) := by + intro hu + have := tail_pairs (K := ℚ) (H := fun _ => True) (V := fun x => c3ε x = 9) c3β c3ε 9 + (F := 1) (fun _ _ _ => rfl) c3σ (fun x hx => absurd trivial hx) (fun _ _ => trivial) + (fun x _ => Iff.rfl) hG hu + have h2 : (Finset.univ.filter (fun _ : Fin 3 => True)) = (Finset.univ : Finset (Fin 3)) := by simp + rw [h2] at this + exact c3_pairs_change this +end C3 + +#print axioms K_word +#print axioms K_congr +#print axioms K_invoice +#print axioms kappa_depends_only +#print axioms d0_native +#print axioms tail_force +#print axioms head_force +#print axioms tail_pairs +#print axioms head_pairs +#print axioms tail_F_null +#print axioms head_F_null +#print axioms c3_not_undoable + +end G2 + +end FibreK diff --git a/research/p104-reader-ceiling/lean/Nov15/FibreK.md b/research/p104-reader-ceiling/lean/Nov15/FibreK.md new file mode 100644 index 0000000000..eaeb3e7e8e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/FibreK.md @@ -0,0 +1,51 @@ +# FibreK (Nov 17): Theorem K and G2 for pure relabels, in Lean + +`Nov15/FibreK.lean`, Lean 4.33.0-rc1 + Mathlib, kernel only: no `sorry`, no `native_decide`; every theorem prints +`[propext, Classical.choice, Quot.sound]`. Builds in 10 s / 2.9 GB (runlean.sh guard). Reuses `SwapNull` (Blk, Undo, rowSw, +colSw; olean built into .lake/build/lib/lean/Nov15) and `CallerCost` (Hist, Inv, invoice, Dh/Dinv). + +## 1. THEOREM K (AUDIT2: sound with fixes) +P0 is an explicit hypothesis: `Table {tT tP : ℕ → Hist}` = the ranks a helper pays on T for climb d = e - b and on P for a +helper MOVE of |Δdim| = d (the price checker's per-call ranks; AUDIT2 could not find the README in the tree, so the table is a parameter, +not a quoted constant). A word is `E : Inv` (fixed by the ends) plus helpers `{b, e, steps}`. +* `K_word`: `Fi (nativeInv E tb H) t = FK E tb (Ssum H) (PiW H) t`, i.e. F(t) = Σ_r (T_r − P_r) r^(1−t) is a function of + (E, S = multiset of helper MOVEs (src dim, tgt dim), Π = multiset {e_h − b_h}). Births/ends enter only through Π; ADD/SCALE/SWAP + appear nowhere (they are not in the table). +* `K_congr`, `kappa_depends_only`: same (E, S, Π) ⇒ same F, same roots, also for the caller invoice + `K_invoice : Fi (invoice c n L) t = Fi c t + L · FK E tb S Π t` (CallerCost.invoice). +* `d0_native`: for `d0Table` (ranks = gaps) the helper part is Σ_h [f(e−b) − Σ_steps f(gap)] (the per-helper D0 identity of + FloorD0/V2Bridge, f = r ln r, Dh convention). +Remark: the dependence on S is only through the multiset of GAPS |Δdim|; the source dim itself is not priced. + +## 2. G2 for PURE relabels (AUDIT2: sound with fixes) +Model: registers `Reg` (Fintype), final matrix `F : Matrix Reg Reg K`; `HelpersId H F` = every helper's final row is its own unit +vector; hub gauge = `Undo V G F F'` := ∃ L M, Blk V L ∧ Blk G M ∧ L·F'·M = F (SwapNull; invertibility NOT demanded, which only +strengthens the conclusions). σ permutes helpers only (`σ x = x` off H). β, ε : birth/end dims; V ⊆ H = the helpers with ε = d +(one chart, `hE : ε x = d ↔ V x`). +* `tail_force`: F' = rowSw σ F (SwapNull.tail_run), L ∈ Blk(V′), M ∈ Blk(G0) ⇒ every moved helper x ∉ V′ has x, σ x ∈ G0. +* `tail_pairs`: with G0 ⊆ {β = 0} and **V′ = σ⁻¹ V** (`fun x => V (σ x)`), the (birth,end) multiset {(β x, ε (σ x))} equals + {(β x, ε x)}. Proof: σ carries H∖V′ onto H∖V keeping β (moved ⇒ both birth 0); V′∖V and V∖V′ are birth-0 and |V′| = |V| + (`map_birth_eq`). +* `head_force`, `head_pairs`, DIRECT (not by time reversal): F' = colSw σ F (SwapNull.head_run), L ∈ Blk(V) (V unchanged), M ∈ Blk(G1) + where **G1 is the NEW births-at-0 set** (`G1 x → β (σ x) = 0`); moved x ∉ V ⇒ σ⁻¹x, x ∈ G1 ⇒ β x = β (σ x) = 0. Pair multiset + {(β (σ x), ε x)} = {(β x, ε x)}. This is the head analogue of V′ = σ⁻¹V (the time-reversal image of "prefix ↔ V"); using the + native G0 here is the head-side form of R1's slip. +* `tail_Pi`, `head_Pi`: Π unchanged. `tail_F_null`, `head_F_null`: FK (hence F(t), hence κ by K) unchanged, for any S, E, tb. S + being unchanged by a swap is SwapNull.stays_multiset (not re-proved; the theorem takes S as the common argument). +* `c3_not_undoable`: Lean check of AUDIT2's observation. R1's 3-cycle C3 (a=(5→9), b=(0→7), c=(0→9), σ: a→b→c→a, identity F) + is NOT undoable under V′ = σ⁻¹V for any G0 ⊆ {β=0}: its pair multiset changes (`c3_pairs_change`), which `tail_pairs` forbids + for undoable relabels. (Undoable only under the native V = the retracted slip.) + +No paper statement was found false as written. Corrections to the wording: (i) heads need the NEW G0 (G1 above), "same proof under +time reversal" is right only with that substitution; (ii) K needs P0 as a stated table; (iii) G2 conclusions about κ also need +S unchanged (SwapNull.stays_multiset), which is a separate hypothesis here. + +## 3. NOT covered +* relabel + interior gauge D(t) jointly (D(end) ≠ I on helper rows; AUDIT2 item 2/4): the model has D = I, F' = P_σ F exactly. +* the LOOP claim (THEORY2 §2 "interiors differ by a time-slice gauge, κ-null"): UNSOUND as stated (D(t) = U′U⁻¹ exists for any two + circuits; legality of D(t+1) T D(t)⁻¹ and D(end) = I are the content). Not formalised; only the true restatement + "same skeleton ⇒ κ-null" follows from K_word (S and Π fixed). +* "native = max over fibre": NOT established (needs the joint case above, theorem R with the real the price checker concavity, and S that + includes END charts for D helpers). R (re-pairing monotonicity), G1-tree, T (cover lemma), U in full generality are not formalised. +* mixed head+tail sequences (only each pure case); multi-chart V ends; helpers not ending identity. +* The real the price checker table values are not instantiated (`Table` is abstract; `d0Table` is the D0 convention). diff --git a/research/p104-reader-ceiling/lean/Nov15/FrameSep.lean b/research/p104-reader-ceiling/lean/Nov15/FrameSep.lean new file mode 100644 index 0000000000..abf460717d --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/FrameSep.lean @@ -0,0 +1,165 @@ +/- +SPEC7/SPEC8 frame-separation law, See FrameSep.md. +Source: internal notes (sec 2, 4), SPEC8.md (sec 2, 4). +Abstract model: frames = submodules of V; a route is a time-indexed frame sequence whose +non-owned (public) steps ascend by inclusion; owned steps are arbitrary. +-/ +import Mathlib.LinearAlgebra.Span.Basic +import Mathlib.Algebra.Field.Rat +import Mathlib.Data.Rat.Defs + +namespace FrameSep + +variable {K V : Type*} [Field K] [AddCommGroup V] [Module K V] + +/-- A register's frame history; `owned t` marks step t -> t+1 as an owned MOVE. -/ +structure Route (K V : Type*) [Field K] [AddCommGroup V] [Module K V] where + f : ℕ → Submodule K V + owned : ℕ → Prop + pub : ∀ t, ¬ owned t → f t ≤ f (t + 1) + +namespace Route +variable (R : Route K V) + +/-- public stretch: no owned step in [a,b) -/ +def Pub (a b : ℕ) : Prop := ∀ s, a ≤ s → s < b → ¬ R.owned s + +theorem pub_mono {a b : ℕ} (hab : a ≤ b) (h : R.Pub a b) : R.f a ≤ R.f b := by + induction b, hab using Nat.le_induction with + | base => exact le_rfl + | succ b hb ih => + exact (ih fun s h1 h2 => h s h1 (by omega)).trans (R.pub b (h b hb (by omega))) + +theorem persist {u : V} {a b : ℕ} (hab : a ≤ b) (h : R.Pub a b) (hu : u ∈ R.f a) : + u ∈ R.f b := R.pub_mono hab h hu + +/-- First-exit law: leaving a u-containing frame needs an OWNED step that genuinely drops u. -/ +theorem exit_owned {u : V} {a b : ℕ} (hab : a ≤ b) (hu : u ∈ R.f a) (hb : u ∉ R.f b) : + ∃ s, a ≤ s ∧ s < b ∧ R.owned s ∧ u ∈ R.f s ∧ u ∉ R.f (s + 1) := by + induction b, hab using Nat.le_induction with + | base => exact absurd hu hb + | succ b hb' ih => + by_cases hb0 : u ∈ R.f b + · refine ⟨b, hb', by omega, ?_, hb0, hb⟩ + by_contra hno + exact hb (R.pub b hno hb0) + · obtain ⟨s, h1, h2, h3, h4, h5⟩ := ih hb0 + exact ⟨s, h1, by omega, h3, h4, h5⟩ + +/-- A route is public if it has no owned steps. -/ +def IsPublic : Prop := ∀ t, ¬ R.owned t + +theorem IsPublic.mono {R : Route K V} (h : R.IsPublic) {a b : ℕ} (hab : a ≤ b) : + R.f a ≤ R.f b := R.pub_mono hab fun s _ _ => h s + +theorem IsPublic.persist {R : Route K V} (h : R.IsPublic) {u : V} {a b : ℕ} (hab : a ≤ b) + (hu : u ∈ R.f a) : u ∈ R.f b := h.mono hab hu + +end Route + +/-- SPEC7 core: X contains u at the start of a public route, Y's frames lie in W with u ∉ W. + Then X's frames never equal Y's frames. -/ +theorem X_Y_never_share (X Y : Route K V) (u : V) (W : Submodule K V) (hu : u ∉ W) + (hX : X.IsPublic) (hX0 : u ∈ X.f 0) (hY : ∀ t, Y.f t ≤ W) (s t : ℕ) : + X.f s ≠ Y.f t := by + intro h + exact hu (hY t (h ▸ hX.persist (Nat.zero_le s) hX0)) + +/-- Any public register that has read X_a (co-present at X's frame, X's frame containing u) + at time t0 never again shares a frame with Y at any time t ≥ t0. -/ +theorem reader_never_meets_Y_after (X Y P : Route K V) (u : V) (W : Submodule K V) + (hu : u ∉ W) (hX : X.IsPublic) (hX0 : u ∈ X.f 0) (hP : P.IsPublic) + (hY : ∀ t, Y.f t ≤ W) {s t0 : ℕ} (hread : P.f t0 = X.f s) {t t' : ℕ} (htt : t0 ≤ t) : + P.f t ≠ Y.f t' := by + intro h + have h1 : u ∈ P.f t0 := hread ▸ hX.persist (Nat.zero_le s) hX0 + exact hu (hY t' (h ▸ hP.persist htt h1)) + +/-- Scope: "ever reads X_a ⇒ never meets Y_a" needs "afterwards"; a public helper may meet Y + before it reads X. Concrete counterexample over ℚ×ℚ. -/ +theorem meet_before_read_possible : + ∃ (X Y P : Route ℚ (ℚ × ℚ)) (u : ℚ × ℚ) (W : Submodule ℚ (ℚ × ℚ)), + u ∉ W ∧ X.IsPublic ∧ u ∈ X.f 0 ∧ P.IsPublic ∧ (∀ t, Y.f t ≤ W) ∧ + P.f 1 = X.f 1 ∧ P.f 0 = Y.f 0 := by + let W : Submodule ℚ (ℚ × ℚ) := Submodule.span ℚ {((0 : ℚ), (1 : ℚ))} + refine ⟨⟨fun _ => ⊤, fun _ => False, fun _ _ => le_rfl⟩, + ⟨fun _ => W, fun _ => False, fun _ _ => le_rfl⟩, + ⟨fun t => if t = 0 then W else ⊤, fun _ => False, ?_⟩, (1, 0), W, ?_, ?_, ?_, ?_, ?_, ?_, ?_⟩ + · intro t _ + by_cases h : t = 0 + · subst h; simp + · simp [h] + · intro h + obtain ⟨a, ha⟩ := Submodule.mem_span_singleton.mp h + have := congrArg Prod.fst ha + simp at this + · intro t h; exact h + · trivial + · intro t h; exact h + · intro t; exact le_rfl + · simp + · simp + +/-- Entry law: content (u) in a register's history, then a u-free frame at time t: + an owned step dropped it. With all owned destinations in D and F = frame(t) ∉ D, + the register took an owned MOVE to a landing frame d ∈ D and then ASCENDED + publicly (d < F strictly) before reaching F. -/ +theorem owned_landing_then_ascent (R : Route K V) (D : Set (Submodule K V)) (u : V) + (hD : ∀ s, R.owned s → R.f (s + 1) ∈ D) {a t : ℕ} (hat : a ≤ t) (hu : u ∈ R.f a) + (hF : u ∉ R.f t) (hFD : R.f t ∉ D) : + ∃ s, a ≤ s ∧ s < t ∧ R.owned s ∧ R.f (s + 1) ∈ D ∧ R.f (s + 1) < R.f t := by + -- last owned step before t + have key : ∀ t, a ≤ t → R.Pub a t ∨ + ∃ s, a ≤ s ∧ s < t ∧ R.owned s ∧ R.f (s + 1) ≤ R.f t := by + intro t hat + induction t, hat using Nat.le_induction with + | base => exact Or.inl fun s h1 h2 => by omega + | succ t ht ih => + by_cases ho : R.owned t + · exact Or.inr ⟨t, ht, by omega, ho, le_rfl⟩ + · rcases ih with h | ⟨s, h1, h2, h3, h4⟩ + · left + intro s h1 h2 + by_cases hs : s = t + · subst hs; exact ho + · exact h s h1 (by omega) + · exact Or.inr ⟨s, h1, by omega, h3, h4.trans (R.pub t ho)⟩ + rcases key t hat with h | ⟨s, h1, h2, h3, h4⟩ + · exact absurd (R.persist hat h hu) hF + · refine ⟨s, h1, h2, h3, hD s h3, lt_of_le_of_ne h4 ?_⟩ + intro heq + exact hFD (heq ▸ hD s h3) + +/-- SPEC8 corollary: a u-holding register sitting in Y's final frame F (u-free since F ≤ W, + u ∉ W) with F ∉ D has landed by an owned MOVE in D and climbed publicly strictly above + the landing frame: it is a ferrying register, not an owned register at a landing frame. -/ +theorem delivery_needs_ferry (R : Route K V) (D : Set (Submodule K V)) (u : V) + (W F : Submodule K V) (hu : u ∉ W) (hFW : F ≤ W) (hFD : F ∉ D) + (hD : ∀ s, R.owned s → R.f (s + 1) ∈ D) {a t : ℕ} (hat : a ≤ t) (hua : u ∈ R.f a) + (hFt : R.f t = F) : + ∃ s, a ≤ s ∧ s < t ∧ R.owned s ∧ R.f (s + 1) ∈ D ∧ R.f (s + 1) < F := by + have hF : u ∉ R.f t := fun h => hu (hFW (hFt ▸ h)) + obtain ⟨s, h1, h2, h3, h4, h5⟩ := + owned_landing_then_ascent R D u hD hat hua hF (hFt ▸ hFD) + exact ⟨s, h1, h2, h3, h4, hFt ▸ h5⟩ + +/-- Consequently no owned destination (a fixed set D) equals a delivered frame: + strict ascent means the delivering register took at least one public step after its + owned landing (landing frame ≠ F). -/ +theorem landing_ne_final (R : Route K V) (D : Set (Submodule K V)) (u : V) + (W F : Submodule K V) (hu : u ∉ W) (hFW : F ≤ W) (hFD : F ∉ D) + (hD : ∀ s, R.owned s → R.f (s + 1) ∈ D) {a t : ℕ} (hat : a ≤ t) (hua : u ∈ R.f a) + (hFt : R.f t = F) : + ∃ s, s < t ∧ R.owned s ∧ R.f (s + 1) ≠ F := by + obtain ⟨s, -, h2, h3, -, h5⟩ := delivery_needs_ferry R D u W F hu hFW hFD hD hat hua hFt + exact ⟨s, h2, h3, h5.ne⟩ + +end FrameSep + +#print axioms FrameSep.X_Y_never_share +#print axioms FrameSep.reader_never_meets_Y_after +#print axioms FrameSep.meet_before_read_possible +#print axioms FrameSep.Route.exit_owned +#print axioms FrameSep.owned_landing_then_ascent +#print axioms FrameSep.delivery_needs_ferry +#print axioms FrameSep.landing_ne_final diff --git a/research/p104-reader-ceiling/lean/Nov15/FrameSep.md b/research/p104-reader-ceiling/lean/Nov15/FrameSep.md new file mode 100644 index 0000000000..16dbbd840e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/FrameSep.md @@ -0,0 +1,13 @@ +# FrameSep.lean: SPEC7 frame-separation law + SPEC8 corollary +Kernel-only, no sorry/native_decide, ~3 s / 1.5 GB, imports Mathlib only (does not need TokenCancel/TCLemma/W0Cancel: the law is purely about frames). Axioms [propext, Classical.choice, Quot.sound] (two theorems: [propext, Quot.sound]). + +**Model.** Frames = submodules of V. `Route`: frame sequence f, flag `owned t` for step t->t+1; non-owned (public) steps satisfy f t <= f (t+1); owned steps arbitrary. "Holds x_a content" = frame contains u_a. + +**Theorems.** +- `Route.exit_owned`: u in f a, u not in f b (a<=b) => an OWNED step s with u in f s, u not in f (s+1). (public routes never drop u.) +- `X_Y_never_share`: X public with u in f 0, Y frames <= W, u not in W => X.f s != Y.f t for all s,t (SPEC7 core; "below V" is automatic since W != V). +- `reader_never_meets_Y_after`: public P co-present with X at t0 => P.f t != Y.f t' for all t >= t0. +- `owned_landing_then_ascent`, `delivery_needs_ferry`, `landing_ne_final` (SPEC8): all owned MOVE destinations in D, F = Y's final frame (F <= W), F not in D, a register that ever held u sits in F at t => it took an owned MOVE to some d in D and climbed publicly with d < F strictly, i.e. it is a ferrying register, never an owned register at its landing frame. + +**Scope / correction (stated at once).** SPEC7's "any public that ever reads X_a can never meet Y_a" is true only AFTER the read (its parenthetical "later frames contain u_a"). `meet_before_read_possible` (over Q x Q): a public helper has frame W = Y's frame at time 0, then reads X at time 1. The paper statement is not false (it says later), but the unqualified reading is; use the `_after` form. +Modelling limits: content is tracked by "frame contained u" along one register's history (direct holders; multi-hop taint through u-free registers not modelled); owned steps are assumed to land in D (every owned step is a MOVE with destination in D); CLEAR of content is not modelled. diff --git a/research/p104-reader-ceiling/lean/Nov15/JointCeiling.lean b/research/p104-reader-ceiling/lean/Nov15/JointCeiling.lean new file mode 100644 index 0000000000..4989827790 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/JointCeiling.lean @@ -0,0 +1,809 @@ +/- +JOINT-CEILING (; CORRECTED by , Nov 17 per CALLERFLOOR R2 + AUDIT2: arms of 1 repriced). Formalises the AUDITED structure of CALLERFLOOR R1 (internal notes + AUDIT1.md) +on top of Nov15/CallerCost.lean. Kernel only (no sorry, no native_decide; `decide +kernel` is kernel evaluation, no extra axiom). +F(s) = sum (T-P) r^s, s = 1-t (so F = the R1 "F(t)" = sum (T-P) r^(1-t)). + 1. invoice F = caller F + k * native F for ALL s (invoice_F, same proof as D0). + 2. native floor Nfl(s) = 400*8^s + 16 + 88*(2-2^s): the exact F of the floor histogram (natFloor_F); the bound F_nat <= -Nfl is a HYPOTHESIS (hN). + 3. class lemmas as HYPOTHESES (structure InClass): B-form per-split optimality pointwise in F, sign floor th >= 4 (or 3), two arms (rho = 2). + 4. closed form FB a b th (all a,b >= 1) with bridge to CallerCost.caller for a,b >= 2 (FB_eq). + 5. ceiling theorem, REDUCED to the named numeric hypothesis NumCert th tbar (finite list of rational inequalities, tail.py). + 6. kernel-checked numerics: split 2|2 at t >= 141/4096, the CORRECTED argmax split 1|1 at t >= 176/4096 (36 rational cells), and the control C(8|9): root of the invoice F in (.0204,.0205). + CORRECTION (R2/AUDIT2): R1's FB overcharged every arm of length 1 by 208 one-stage lines (P[8]) -- FBc below adds 208*8^s per arm of 1; + the old .0336 ceiling (and the NumCert built from cf.py) is WITHDRAWN; the certified ceiling is kappa <= .0419448764 (A = 4 QUERY, B-form masks, peak 1|1). +-/ +import Nov15.CallerCost +import Mathlib.Analysis.SpecialFunctions.Pow.Real + +namespace JointCeiling +open CallerCost Real + +/-! ### 1. F-form of the invoice -/ +noncomputable def Fh (s : ℝ) (l : Hist) : ℝ := (l.map fun p => (p.2 : ℝ) * (p.1 : ℝ) ^ s).sum +noncomputable def Finv (s : ℝ) (i : Inv) : ℝ := Fh s i.T - Fh s i.P + +theorem Fh_append (s : ℝ) (l m : Hist) : Fh s (l ++ m) = Fh s l + Fh s m := by simp [Fh] +theorem Fh_scale (s : ℝ) (L : ℕ) (l : Hist) : Fh s (scale L l) = L * Fh s l := by + induction l with + | nil => simp [Fh, scale] + | cons p l ih => + simp only [Fh, scale, List.map_cons, List.sum_cons] at ih ⊢ + rw [ih]; push_cast; ring + +/-- the invoice in kappa form: F = caller part + k * native part, for every s (hence every t = 1 - s) -/ +theorem invoice_F (s : ℝ) (c n : Inv) (L : ℕ) : Finv s (invoice c n L) = Finv s c + L * Finv s n := by + simp only [Finv, invoice, Fh_append, Fh_scale]; ring + +theorem Fh_mono (l : Hist) (hl : ∀ p ∈ l, 1 ≤ p.1) {s s' : ℝ} (h : s ≤ s') : Fh s l ≤ Fh s' l := by + induction l with + | nil => simp [Fh] + | cons p l ih => + have ih' := ih (fun q hq => hl q (by simp [hq])) + have hp : (1 : ℝ) ≤ p.1 := by exact_mod_cast hl p (by simp) + simp only [Fh, List.map_cons, List.sum_cons] at ih' ⊢ + have := Real.rpow_le_rpow_of_exponent_le hp h + have h2 : (p.2 : ℝ) * (p.1 : ℝ) ^ s ≤ (p.2 : ℝ) * (p.1 : ℝ) ^ s' := + mul_le_mul_of_nonneg_left this (Nat.cast_nonneg _) + linarith + +/-! ### 2. native floor -/ +noncomputable def Nfl (s : ℝ) : ℝ := 400 * (8 : ℝ) ^ s + 16 + 88 * (2 - (2 : ℝ) ^ s) +/-- the per-call native floor histogram: 88 stops priced T[2]-2P[1], 400 rank-8 mains, 16 owned (rank 1) + 176 stop credits -/ +def natFloor : Inv := ⟨[(2, 88)], [(8, 400), (1, 192)]⟩ +theorem natFloor_F (s : ℝ) : Finv s natFloor = -Nfl s := by + simp [Finv, natFloor, Fh, Nfl]; ring + +/-! ### 3. closed form of the caller family, all a,b >= 1 -/ +noncomputable def FB (a b th : ℕ) (s : ℝ) : ℝ := + 208 * (∑ i ∈ Finset.range a, ((8 * i + 9 : ℕ) : ℝ) ^ s + ∑ i ∈ Finset.range b, ((8 * i + 9 : ℕ) : ℝ) ^ s + + ((8 * (a + b) + 1 : ℕ) : ℝ) ^ s) + - 208 * (∑ i ∈ Finset.range (a - 2), ((8 * i + 16 : ℕ) : ℝ) ^ s + ∑ i ∈ Finset.range (b - 2), ((8 * i + 16 : ℕ) : ℝ) ^ s) + - (384 + 16 * ((a + b : ℕ) : ℝ)) * (8 : ℝ) ^ s - 96 * th - 32 * (9 : ℝ) ^ s + +theorem Fh_armT (s : ℝ) (n c : ℕ) : + Fh s (armT n c) = c * ∑ i ∈ Finset.range n, ((8 * i + 9 : ℕ) : ℝ) ^ s := by + induction n with + | zero => simp [armT, Fh] + | succ n ih => + have : armT (n + 1) c = armT n c ++ [(8 * n + 9, c)] := by simp [armT, List.range_succ] + rw [this, Fh_append, ih, Finset.sum_range_succ]; simp [Fh]; ring +theorem Fh_armP (s : ℝ) (m c : ℕ) : + Fh s (armP m c) = c * ∑ i ∈ Finset.range m, ((8 * i + 16 : ℕ) : ℝ) ^ s := by + induction m with + | zero => simp [armP, Fh] + | succ n ih => + have : armP (n + 1) c = armP n c ++ [(8 * n + 16, c)] := by simp [armP, List.range_succ] + rw [this, Fh_append, ih, Finset.sum_range_succ]; simp [Fh]; ring + +/-- bridge: CallerCost's histogram caller (a' + 2 | b' + 2), thin 4, has F = FB (a'+2) (b'+2) 4 -/ +theorem FB_eq (s : ℝ) (a' b' : ℕ) : Finv s (caller a' b') = FB (a' + 2) (b' + 2) 4 s := by + have hk : a' + 2 + (b' + 2) = a' + b' + 4 := by ring + simp only [Finv, caller, callerT, callerP, Fh_append, Fh_armT, Fh_armP, FB, hk] + simp [Fh] + ring + +theorem FB_th_mono (a b : ℕ) {th th0 : ℕ} (h : th0 ≤ th) (s : ℝ) : FB a b th s ≤ FB a b th0 s := by + unfold FB + have : (th0 : ℝ) ≤ th := by exact_mod_cast h + linarith + +/-! ### 3b. CORRECTION (R2/AUDIT2): arms of length 1. + cf.py / CALLERCO s1h priced every arm of 1 with 208 spurious one-stage lines (P[8]); the ledger-correct caller (r2.py port model) + has the same histograms except P[8] is lowered by 208 per arm of 1. FBc = FB + 208 * 8^s per arm of 1; for a,b >= 2 FBc = FB. -/ +def ind (x : ℕ) : ℕ := if x = 1 then 1 else 0 +noncomputable def FBc (a b th : ℕ) (s : ℝ) : ℝ := FB a b th s + 208 * ((ind a + ind b : ℕ) : ℝ) * (8 : ℝ) ^ s + +theorem FBc_two (a b th : ℕ) (s : ℝ) (ha : 2 ≤ a) (hb : 2 ≤ b) : FBc a b th s = FB a b th s := by + have h1 : ind a = 0 := by unfold ind; split_ifs <;> omega + have h2 : ind b = 0 := by unfold ind; split_ifs <;> omega + simp [FBc, h1, h2] + +theorem FBc_th_mono (a b : ℕ) {th th0 : ℕ} (h : th0 ≤ th) (s : ℝ) : FBc a b th s ≤ FBc a b th0 s := by + unfold FBc + have := FB_th_mono a b h s + linarith + +/-- the corrected caller histograms (a, b >= 1; thin queries th): arms as in CallerCost, P[8] = 384 + 16 (a+b) - 208 (#arms of 1) -/ +def callerG (a b th : ℕ) : Inv := + ⟨armT a 208 ++ armT b 208 ++ [(8 * (a + b) + 1, 208)], + armP (a - 2) 208 ++ armP (b - 2) 208 ++ [(8, 384 + 16 * (a + b) - 208 * (ind a + ind b)), (1, 96 * th), (9, 32)]⟩ + +theorem ind_le (a b : ℕ) (ha : 1 ≤ a) (hb : 1 ≤ b) : 208 * (ind a + ind b) ≤ 384 + 16 * (a + b) := by + unfold ind; split_ifs <;> omega + +theorem callerG_F (a b th : ℕ) (ha : 1 ≤ a) (hb : 1 ≤ b) (s : ℝ) : Finv s (callerG a b th) = FBc a b th s := by + have hle := ind_le a b ha hb + have hc : (((384 + 16 * (a + b) - 208 * (ind a + ind b) : ℕ)) : ℝ) = 384 + 16 * ((a + b : ℕ) : ℝ) - 208 * ((ind a + ind b : ℕ) : ℝ) := by + rw [Nat.cast_sub hle]; push_cast; ring + simp only [Finv, callerG, Fh_append, Fh_armT, Fh_armP, FBc, FB] + simp [Fh, hc] + push_cast + ring + +/-- for a, b >= 2 the corrected caller has the same F as CallerCost.caller (so reproduction of #7113 is unaffected) -/ +theorem callerG_eq_caller_F (a' b' : ℕ) (s : ℝ) : Finv s (callerG (a' + 2) (b' + 2) 4) = Finv s (caller a' b') := by + rw [callerG_F _ _ _ (by omega) (by omega), FBc_two _ _ _ _ (by omega) (by omega), FB_eq] + +/-- LEDGER LAW for ALL arms >= 1: S(callerG) = 3408 (a+b) - 208 (+ 96 (4 - th)); at a,b >= 2 this is CallerCost.S_caller. + (cf.py's version gave 3408 (a+b) - 208 - 1664 per arm of 1: the broken ledger.) -/ +theorem Sh_armP' (x : ℕ) (hx : 1 ≤ x) : + Sh (armP (x - 2) 208) = 208 * (4 * ((x : ℤ) - 2) * ((x : ℤ) - 2) + 12 * ((x : ℤ) - 2)) + 1664 * (ind x : ℤ) := by + rw [Sh_armP] + rcases Nat.lt_or_ge x 2 with h | h + · have : x = 1 := by omega + subst this; simp [ind] + · have h1 : ((x - 2 : ℕ) : ℤ) = (x : ℤ) - 2 := by omega + have h2 : ind x = 0 := by unfold ind; split_ifs <;> omega + rw [h1, h2]; simp + +theorem callerG_S (a b : ℕ) (ha : 1 ≤ a) (hb : 1 ≤ b) : + Sinv (callerG a b 4) = 3408 * ((a : ℤ) + b) - 208 := by + have hle := ind_le a b ha hb + have hc : (((384 + 16 * (a + b) - 208 * (ind a + ind b) : ℕ)) : ℤ) = 384 + 16 * ((a + b : ℕ) : ℤ) - 208 * ((ind a + ind b : ℕ) : ℤ) := by + rw [Nat.cast_sub hle]; push_cast; ring + simp only [Sinv, callerG, Sh_append, Sh_armT, Sh_armP' a ha, Sh_armP' b hb] + simp only [Sh, List.map_cons, List.sum_cons, List.map_nil, List.sum_nil] + rw [hc] + push_cast + ring + +/-! ### 4. class lemmas as explicit hypotheses -/ +/-- A caller in the audited class (CALLERFLOOR R1 sec 1): two-arm nested rho = 2 root with arms a|b >= 1 (k = a+b calls), + thin queries th. The CLASS LEMMAS are fields (hypotheses; a parallel lane proves them): + hB : B-form per-split optimality, pointwise in F(t) (CALLEROPEN Crossing + Floor lemmas; AUDIT1 item 1: only the D0/ratio form is proved); + hth : sign floor thin >= th0 (SIGNCAP/BEAUTY84; th0 = 4 built, 3 unbuilt); + hrho: rho >= 2 (rho = 1 needs t = -1, closed). rho = 2 enters only through the shape of FB (the two-arm closed form). -/ +structure InClass (th0 : ℕ) where + a : ℕ + b : ℕ + th : ℕ + rho : ℕ + ci : Inv + ha : 1 ≤ a + hb : 1 ≤ b + hth : th0 ≤ th + hrho : 2 ≤ rho + hB : ∀ s : ℝ, 0 ≤ s → s ≤ 1 → Finv s ci ≤ FBc a b th s + + +/-- the NUMERIC CERTIFICATE as a named hypothesis (REGENERATED, , from the AUDITED r2c.py; R1's cf.py-based list is withdrawn). + Statement: for every split a|b (a,b>=1) and 0 <= s <= 1-tbar, FBc a b th0 s - (a+b) Nfl s < 0. + Source: internal notes (lines 8-12: 1|1 root via cf.cert on the ledger-correct port model, th = th0; lines 13-17: 1|b, b = 2..59, + interval cover on [t0, 1] with pk._coef of joint(A(1,b), B(1,b), 1+b); lines 18-26: tail k >= 61 with R1's U plus the arm-of-1 correction + +208*8^s, U < 0 and U' < 0 by cover) together with a,b >= 2 splits from R1 tail.py lines 6-26 / cf.py `cert` lines 33-40 (unchanged: FBc = FB there, + FBc_two + callerG_eq_caller_F; r2.py asserts identity with the port model). Output r2c.out (th4: kbar .041944876391, cert True, 1|b True, tail True; + th3: .068120327915). Not discharged in Lean: ~1,800 (a,b) pairs of 40-digit interval covers, plus the R1 tail Jensen/MVT step (AUDIT2: unaudited). + tbar = .0419448764 (th0 = 4, rounded UP from .041944876391; A = 4 QUERY, B-form masks) and .0681203280 (th0 = 3: th3 B-form-A class only; + AUDIT2: scanned, not covered, for the true sign-floor class). -/ +def NumCert (th0 : ℕ) (tbar : ℝ) : Prop := + ∀ a b : ℕ, 1 ≤ a → 1 ≤ b → ∀ s : ℝ, 0 ≤ s → s ≤ 1 - tbar → FBc a b th0 s - ((a + b : ℕ) : ℝ) * Nfl s < 0 + +noncomputable def tbar4 : ℝ := 419448764 / 10 ^ 10 +noncomputable def tbar3 : ℝ := 681203280 / 10 ^ 10 + +/-- CEILING THEOREM (conditional on the class lemmas hB/hth/hrho, the native floor hN, and NumCert): + for every caller in the class and every native meeting the floor, the invoice F(t) = Finv (1-t) is < 0 for t >= tbar. -/ +theorem ceiling {th0 : ℕ} {tbar : ℝ} (hnum : NumCert th0 tbar) (c : InClass th0) (n : Inv) + (hN : ∀ s : ℝ, 0 ≤ s → s ≤ 1 → Finv s n ≤ -Nfl s) (htb : 0 ≤ tbar) + (s : ℝ) (hs0 : 0 ≤ s) (hs : s ≤ 1 - tbar) : + Finv s (invoice c.ci n (c.a + c.b)) < 0 := by + have hs1 : s ≤ 1 := by linarith + rw [invoice_F] + have h1 := c.hB s hs0 hs1 + have h2 := hN s hs0 hs1 + have h3 : ((c.a + c.b : ℕ) : ℝ) * Finv s n ≤ ((c.a + c.b : ℕ) : ℝ) * (-Nfl s) := + mul_le_mul_of_nonneg_left h2 (Nat.cast_nonneg _) + have h4 := FBc_th_mono c.a c.b c.hth s + have h5 := hnum c.a c.b c.ha c.hb s hs0 hs + linarith + +theorem ceiling4 (hnum : NumCert 4 tbar4) (c : InClass 4) (n : Inv) + (hN : ∀ s : ℝ, 0 ≤ s → s ≤ 1 → Finv s n ≤ -Nfl s) (t : ℝ) (ht : tbar4 ≤ t) (ht1 : t ≤ 1) : + Finv (1 - t) (invoice c.ci n (c.a + c.b)) < 0 := + ceiling hnum c n hN (by unfold tbar4; norm_num) (1 - t) (by linarith) (by linarith) + +theorem ceiling3 (hnum : NumCert 3 tbar3) (c : InClass 3) (n : Inv) + (hN : ∀ s : ℝ, 0 ≤ s → s ≤ 1 → Finv s n ≤ -Nfl s) (t : ℝ) (ht : tbar3 ≤ t) (ht1 : t ≤ 1) : + Finv (1 - t) (invoice c.ci n (c.a + c.b)) < 0 := + ceiling hnum c n hN (by unfold tbar3; norm_num) (1 - t) (by linarith) (by linarith) + + +/-! ### 5. kernel-checked numerics: rational rpow bounds through natural-number powers -/ +theorem rp_pow {x : ℕ} {p q : ℕ} (hq : 0 < q) : (((x : ℝ) ^ ((p : ℝ) / q)) ^ q) = (x : ℝ) ^ p := by + rw [← Real.rpow_natCast, ← Real.rpow_mul (Nat.cast_nonneg x), div_mul_cancel₀ _ (by exact_mod_cast hq.ne'), + Real.rpow_natCast] + +theorem rp_le_nat {x p q n d : ℕ} (hq : 0 < q) (hd : 0 < d) (h : x ^ p * d ^ q ≤ n ^ q) : + (x : ℝ) ^ ((p : ℝ) / q) ≤ (n : ℝ) / d := by + by_contra hc + have hc := not_le.mp hc + have hdr : (0 : ℝ) < d := by exact_mod_cast hd + have h1 : (((n : ℝ) / d)) ^ q < (((x : ℝ) ^ ((p : ℝ) / q)) ^ q) := + pow_lt_pow_left₀ hc (by positivity) hq.ne' + rw [rp_pow hq, div_pow, div_lt_iff₀ (by positivity)] at h1 + have h2 : ((x ^ p * d ^ q : ℕ) : ℝ) ≤ ((n ^ q : ℕ) : ℝ) := by exact_mod_cast h + push_cast at h2 + linarith + +theorem rp_ge_nat {x p q n d : ℕ} (hq : 0 < q) (hd : 0 < d) (h : n ^ q ≤ x ^ p * d ^ q) : + (n : ℝ) / d ≤ (x : ℝ) ^ ((p : ℝ) / q) := by + by_contra hc + have hc := not_le.mp hc + have hdr : (0 : ℝ) < d := by exact_mod_cast hd + have h1 : (((x : ℝ) ^ ((p : ℝ) / q))) ^ q < (((n : ℝ) / d)) ^ q := + pow_lt_pow_left₀ hc (by positivity) hq.ne' + rw [rp_pow hq, div_pow, lt_div_iff₀ (by positivity)] at h1 + have h2 : ((n ^ q : ℕ) : ℝ) ≤ ((x ^ p * d ^ q : ℕ) : ℝ) := by exact_mod_cast h + push_cast at h2 + linarith + +/-- upper bound of F-sum of a histogram at s = p/q by natural numerators U r / d -/ +theorem Fh_le (l : Hist) (p q d : ℕ) (U : ℕ → ℕ) (hq : 0 < q) (hd : 0 < d) + (h : ∀ pr ∈ l, pr.1 ^ p * d ^ q ≤ (U pr.1) ^ q) : + Fh ((p : ℝ) / q) l ≤ ((l.map fun pr => pr.2 * U pr.1).sum : ℕ) / (d : ℝ) := by + induction l with + | nil => simp [Fh] + | cons pr l ih => + have ih' := ih (fun r hr => h r (by simp [hr])) + have h1 := rp_le_nat hq hd (h pr (by simp)) + simp only [Fh, List.map_cons, List.sum_cons] at ih' ⊢ + rw [Nat.cast_add, Nat.cast_mul] + have h2 : (pr.2 : ℝ) * (pr.1 : ℝ) ^ ((p : ℝ) / q) ≤ (pr.2 : ℝ) * ((U pr.1 : ℝ) / d) := + mul_le_mul_of_nonneg_left h1 (Nat.cast_nonneg _) + have h3 : (pr.2 : ℝ) * ((U pr.1 : ℝ) / d) = ((pr.2 : ℝ) * U pr.1) / d := by ring + rw [add_div] + linarith + +theorem Fh_ge (l : Hist) (p q d : ℕ) (L : ℕ → ℕ) (hq : 0 < q) (hd : 0 < d) + (h : ∀ pr ∈ l, (L pr.1) ^ q ≤ pr.1 ^ p * d ^ q) : + ((l.map fun pr => pr.2 * L pr.1).sum : ℕ) / (d : ℝ) ≤ Fh ((p : ℝ) / q) l := by + induction l with + | nil => simp [Fh] + | cons pr l ih => + have ih' := ih (fun r hr => h r (by simp [hr])) + have h1 := rp_ge_nat hq hd (h pr (by simp)) + simp only [Fh, List.map_cons, List.sum_cons] at ih' ⊢ + rw [Nat.cast_add, Nat.cast_mul] + have h2 : (pr.2 : ℝ) * ((L pr.1 : ℝ) / d) ≤ (pr.2 : ℝ) * (pr.1 : ℝ) ^ ((p : ℝ) / q) := + mul_le_mul_of_nonneg_left h1 (Nat.cast_nonneg _) + have h3 : (pr.2 : ℝ) * ((L pr.1 : ℝ) / d) = ((pr.2 : ℝ) * L pr.1) / d := by ring + rw [add_div] + linarith + +/-- certificate cell: for s in [px/q, py/q], F(s) <= (T-part at py) - (P-part at px) < 0 by natural-number checks -/ +theorem cell_neg (i : Inv) (px py q d : ℕ) (U L : ℕ → ℕ) (hq : 0 < q) (hd : 0 < d) + (hrT : ∀ pr ∈ i.T, 1 ≤ pr.1) (hrP : ∀ pr ∈ i.P, 1 ≤ pr.1) + (hT : ∀ pr ∈ i.T, pr.1 ^ py * d ^ q ≤ (U pr.1) ^ q) + (hP : ∀ pr ∈ i.P, (L pr.1) ^ q ≤ pr.1 ^ px * d ^ q) + (hsum : (i.T.map fun pr => pr.2 * U pr.1).sum < (i.P.map fun pr => pr.2 * L pr.1).sum) + (s : ℝ) (hx : (px : ℝ) / q ≤ s) (hy : s ≤ (py : ℝ) / q) : Finv s i < 0 := by + have a1 := Fh_mono i.T hrT hy + have a2 := Fh_mono i.P hrP hx + have a3 := Fh_le i.T py q d U hq hd hT + have a4 := Fh_ge i.P px q d L hq hd hP + have hdr : (0 : ℝ) < d := by exact_mod_cast hd + have a5 : (((i.T.map fun pr => pr.2 * U pr.1).sum : ℕ) : ℝ) < (((i.P.map fun pr => pr.2 * L pr.1).sum : ℕ) : ℝ) := by + exact_mod_cast hsum + have a6 : (((i.T.map fun pr => pr.2 * U pr.1).sum : ℕ) : ℝ) / d < (((i.P.map fun pr => pr.2 * L pr.1).sum : ℕ) : ℝ) / d := + div_lt_div_of_pos_right a5 hdr + unfold Finv + linarith + +/-- the converse cell for a positive sign (used for the control bracket): F(s) > 0 at the single point s = p/q -/ +theorem pt_pos (i : Inv) (p q d : ℕ) (U L : ℕ → ℕ) (hq : 0 < q) (hd : 0 < d) + (hT : ∀ pr ∈ i.T, (L pr.1) ^ q ≤ pr.1 ^ p * d ^ q) + (hP : ∀ pr ∈ i.P, pr.1 ^ p * d ^ q ≤ (U pr.1) ^ q) + (hsum : (i.P.map fun pr => pr.2 * U pr.1).sum < (i.T.map fun pr => pr.2 * L pr.1).sum) : + 0 < Finv ((p : ℝ) / q) i := by + have a3 := Fh_le i.P p q d U hq hd hP + have a4 := Fh_ge i.T p q d L hq hd hT + have hdr : (0 : ℝ) < d := by exact_mod_cast hd + have a5 : (((i.P.map fun pr => pr.2 * U pr.1).sum : ℕ) : ℝ) < (((i.T.map fun pr => pr.2 * L pr.1).sum : ℕ) : ℝ) := by + exact_mod_cast hsum + have a6 : (((i.P.map fun pr => pr.2 * U pr.1).sum : ℕ) : ℝ) / d < (((i.T.map fun pr => pr.2 * L pr.1).sum : ℕ) : ℝ) / d := + div_lt_div_of_pos_right a5 hdr + unfold Finv + linarith + +/-! ### 6. the argmax split 2|2 (k = 4, thin 4): F < 0 for t >= 141/4096 (= .034424), 28-cell rational cover (python: internal notes cover, generators Nov15/jointceiling_gen/) + (the exact crossing .0336321541 needs rpow to 1e-10: held in NumCert, see sec 4) -/ +def I22 : Inv := invoice (caller 0 0) natFloor 4 +theorem I22_F (s : ℝ) : Finv s I22 = FBc 2 2 4 s - ((2 + 2 : ℕ) : ℝ) * Nfl s := by + rw [FBc_two 2 2 4 s (by norm_num) (by norm_num)] + have h := invoice_F s (caller 0 0) natFloor 4 + rw [natFloor_F, FB_eq] at h + show Finv s (invoice (caller 0 0) natFloor 4) = _ + rw [h]; push_cast; ring +theorem cell22_0 (s : ℝ) (hx : ((0 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((988 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 0 988 4096 100000000 (fun r => if r = 2 then 118198437 else if r = 9 then 169892315 else if r = 17 then 198060441 else if r = 33 then 232424644 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 99999999 else if r = 9 then 99999999 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_1 (s : ℝ) (hx : ((988 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((1977 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 988 1977 4096 100000000 (fun r => if r = 2 then 139732347 else if r = 9 then 288788857 else if r = 17 then 392550812 else if r = 33 then 540673488 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 165133497 else if r = 9 then 169892312 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_2 (s : ℝ) (hx : ((1977 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((2471 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 1977 2471 4096 100000000 (fun r => if r = 2 then 151915755 else if r = 9 then 376415325 else if r = 17 then 552452252 else if r = 33 then 824282651 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 272829196 else if r = 9 then 288788854 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_3 (s : ℝ) (hx : ((2471 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((2718 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 2471 2718 4096 100000000 (fun r => if r = 2 then 158400208 else if r = 9 then 429744898 else if r = 17 then 655381507 else if r = 33 then 1017763102 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 350597193 else if r = 9 then 376415322 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_4 (s : ℝ) (hx : ((2718 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((2966 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 2718 2966 4096 100000000 (fun r => if r = 2 then 165189399 else if r = 9 then 490893330 else if r = 17 then 778025837 else if r = 33 then 1257731609 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 397436025 else if r = 9 then 429744895 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_5 (s : ℝ) (hx : ((2966 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3213 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 2966 3213 4096 100000000 (fun r => if r = 2 then 172240432 else if r = 9 then 560441857 else if r = 17 then 922982473 else if r = 33 then 1552953737 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 450761181 else if r = 9 then 490893327 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_6 (s : ℝ) (hx : ((3213 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3336 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3213 3336 4096 100000000 (fun r => if r = 2 then 175863141 else if r = 9 then 598667655 else if r = 17 then 1004946564 else if r = 33 then 1724878163 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 510981649 else if r = 9 then 560441854 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_7 (s : ℝ) (hx : ((3336 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3460 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3336 3460 4096 100000000 (fun r => if r = 2 then 179592434 else if r = 9 then 639843844 else if r = 17 then 1094946471 else if r = 33 then 1917472133 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 543906765 else if r = 9 then 598667652 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_8 (s : ℝ) (hx : ((3460 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3583 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3460 3583 4096 100000000 (fun r => if r = 2 then 183369777 else if r = 9 then 683485377 else if r = 17 then 1192181571 else if r = 33 then 2129751667 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 579247408 else if r = 9 then 639843841 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_9 (s : ℝ) (hx : ((3583 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3645 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3583 3645 4096 100000000 (fun r => if r = 2 then 185303816 else if r = 9 then 706599503 else if r = 17 then 1244421092 else if r = 33 then 2245506338 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 616571231 else if r = 9 then 683485374 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_10 (s : ℝ) (hx : ((3645 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3707 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3645 3707 4096 100000000 (fun r => if r = 2 then 187258254 else if r = 9 then 730495304 else if r = 17 then 1298949666 else if r = 33 then 2367552420 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 636287037 else if r = 9 then 706599500 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_11 (s : ℝ) (hx : ((3707 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3769 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3707 3769 4096 100000000 (fun r => if r = 2 then 189233305 else if r = 9 then 755199213 else if r = 17 then 1355867597 else if r = 33 then 2496231861 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 656633287 else if r = 9 then 730495301 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_12 (s : ℝ) (hx : ((3769 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3800 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3769 3800 4096 100000000 (fun r => if r = 2 then 190228629 else if r = 9 then 767862713 else if r = 17 then 1385255112 else if r = 33 then 2563171002 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 677630139 else if r = 9 then 755199210 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_13 (s : ℝ) (hx : ((3800 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3831 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3800 3831 4096 100000000 (fun r => if r = 2 then 191229188 else if r = 9 then 780738560 else if r = 17 then 1415279582 else if r = 33 then 2631905189 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 688379017 else if r = 9 then 767862710 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_14 (s : ℝ) (hx : ((3831 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3862 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3831 3862 4096 100000000 (fun r => if r = 2 then 192235010 else if r = 9 then 793830314 else if r = 17 then 1445954812 else if r = 33 then 2702482558 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 699298398 else if r = 9 then 780738557 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_15 (s : ℝ) (hx : ((3862 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3877 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3862 3877 4096 100000000 (fun r => if r = 2 then 192723596 else if r = 9 then 800243619 else if r = 17 then 1461035469 else if r = 33 then 2737309242 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 710390987 else if r = 9 then 793830311 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_16 (s : ℝ) (hx : ((3877 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3893 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3877 3893 4096 100000000 (fun r => if r = 2 then 193246122 else if r = 9 then 807141597 else if r = 17 then 1477294906 else if r = 33 then 2774952534 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 715821366 else if r = 9 then 800243616 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_17 (s : ℝ) (hx : ((3893 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3908 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3893 3908 4096 100000000 (fun r => if r = 2 then 193737278 else if r = 9 then 813662443 else if r = 17 then 1492702427 else if r = 33 then 2810713133 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 721659532 else if r = 9 then 807141594 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_18 (s : ℝ) (hx : ((3908 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3924 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3908 3924 4096 100000000 (fun r => if r = 2 then 194262553 else if r = 9 then 820676089 else if r = 17 then 1509314276 else if r = 33 then 2849365870 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 727176050 else if r = 9 then 813662440 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_19 (s : ℝ) (hx : ((3924 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3931 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3924 3931 4096 100000000 (fun r => if r = 2 then 194492808 else if r = 9 then 823763539 else if r = 17 then 1516639972 else if r = 33 then 2866443162 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 733106824 else if r = 9 then 820676086 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_20 (s : ℝ) (hx : ((3931 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3939 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3931 3939 4096 100000000 (fun r => if r = 2 then 194756291 else if r = 9 then 827306279 else if r = 17 then 1525055745 else if r = 33 then 2886085429 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 735716725 else if r = 9 then 823763536 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_21 (s : ℝ) (hx : ((3939 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3943 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3939 3943 4096 100000000 (fun r => if r = 2 then 194888167 else if r = 9 then 829083358 else if r = 17 then 1529281127 else if r = 33 then 2895956979 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 738710847 else if r = 9 then 827306276 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_22 (s : ℝ) (hx : ((3943 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3947 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3943 3947 4096 100000000 (fun r => if r = 2 then 195020132 else if r = 9 then 830864255 else if r = 17 then 1533518216 else if r = 33 then 2905862294 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 740212475 else if r = 9 then 829083355 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_23 (s : ℝ) (hx : ((3947 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3949 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3947 3949 4096 100000000 (fun r => if r = 2 then 195086147 else if r = 9 then 831756137 else if r = 17 then 1535641161 else if r = 33 then 2910827650 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 741717155 else if r = 9 then 830864252 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_24 (s : ℝ) (hx : ((3949 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3951 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3949 3951 4096 100000000 (fun r => if r = 2 then 195152186 else if r = 9 then 832648977 else if r = 17 then 1537767044 else if r = 33 then 2915801489 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 742470642 else if r = 9 then 831756134 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_25 (s : ℝ) (hx : ((3951 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3953 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3951 3953 4096 100000000 (fun r => if r = 2 then 195218246 else if r = 9 then 833542775 else if r = 17 then 1539895871 else if r = 33 then 2920783828 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 743224894 else if r = 9 then 832648974 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_26 (s : ℝ) (hx : ((3953 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3954 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3953 3954 4096 100000000 (fun r => if r = 2 then 195251285 else if r = 9 then 833990034 else if r = 17 then 1540961389 else if r = 33 then 2923278189 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 743979912 else if r = 9 then 833542772 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell22_27 (s : ℝ) (hx : ((3954 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3955 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I22 < 0 := + cell_neg I22 3954 3955 4096 100000000 (fun r => if r = 2 then 195284329 else if r = 9 then 834437532 else if r = 17 then 1542027645 else if r = 33 then 2925774680 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 744357709 else if r = 9 then 833990031 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem I22_neg (s : ℝ) (h0 : 0 ≤ s) (h1 : s ≤ ((3955 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : Finv s I22 < 0 := by + rcases le_total s (((988 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h2 | h2 + · exact cell22_0 s (by rw [Nat.cast_zero, zero_div]; exact h0) h2 + · rcases le_total s (((1977 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h3 | h3 + · exact cell22_1 s h2 h3 + · rcases le_total s (((2471 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h4 | h4 + · exact cell22_2 s h3 h4 + · rcases le_total s (((2718 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h5 | h5 + · exact cell22_3 s h4 h5 + · rcases le_total s (((2966 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h6 | h6 + · exact cell22_4 s h5 h6 + · rcases le_total s (((3213 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h7 | h7 + · exact cell22_5 s h6 h7 + · rcases le_total s (((3336 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h8 | h8 + · exact cell22_6 s h7 h8 + · rcases le_total s (((3460 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h9 | h9 + · exact cell22_7 s h8 h9 + · rcases le_total s (((3583 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h10 | h10 + · exact cell22_8 s h9 h10 + · rcases le_total s (((3645 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h11 | h11 + · exact cell22_9 s h10 h11 + · rcases le_total s (((3707 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h12 | h12 + · exact cell22_10 s h11 h12 + · rcases le_total s (((3769 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h13 | h13 + · exact cell22_11 s h12 h13 + · rcases le_total s (((3800 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h14 | h14 + · exact cell22_12 s h13 h14 + · rcases le_total s (((3831 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h15 | h15 + · exact cell22_13 s h14 h15 + · rcases le_total s (((3862 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h16 | h16 + · exact cell22_14 s h15 h16 + · rcases le_total s (((3877 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h17 | h17 + · exact cell22_15 s h16 h17 + · rcases le_total s (((3893 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h18 | h18 + · exact cell22_16 s h17 h18 + · rcases le_total s (((3908 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h19 | h19 + · exact cell22_17 s h18 h19 + · rcases le_total s (((3924 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h20 | h20 + · exact cell22_18 s h19 h20 + · rcases le_total s (((3931 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h21 | h21 + · exact cell22_19 s h20 h21 + · rcases le_total s (((3939 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h22 | h22 + · exact cell22_20 s h21 h22 + · rcases le_total s (((3943 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h23 | h23 + · exact cell22_21 s h22 h23 + · rcases le_total s (((3947 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h24 | h24 + · exact cell22_22 s h23 h24 + · rcases le_total s (((3949 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h25 | h25 + · exact cell22_23 s h24 h25 + · rcases le_total s (((3951 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h26 | h26 + · exact cell22_24 s h25 h26 + · rcases le_total s (((3953 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h27 | h27 + · exact cell22_25 s h26 h27 + · rcases le_total s (((3954 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h28 | h28 + · exact cell22_26 s h27 h28 + · exact cell22_27 s h28 h1 + +/-- t >= 141/4096 (s <= 3955/4096): the invoice F of EVERY native at the floor with the argmax caller 2|2 is negative -/ +theorem split22_ceiling (t : ℝ) (ht : (141 : ℝ) / 4096 ≤ t) (ht1 : t ≤ 1) : Finv (1 - t) I22 < 0 := by + apply I22_neg (1 - t) (by linarith) + have : ((3955 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) = 1 - 141 / 4096 := by norm_num + rw [this]; linarith + +/-! ### 7. the control C(8|9) (= #7113 caller, CallerCost.reproduction) at the native floor, k = 17: the root of F(t) lies in (.0204, .0205) + (R3 control .0204110964; exact root needs rpow to 1e-10, not done in kernel) -/ +def I89 : Inv := invoice (caller 6 7) natFloor 17 +theorem I89_F (s : ℝ) : Finv s I89 = FB 8 9 4 s - ((8 + 9 : ℕ) : ℝ) * Nfl s := by + have h := invoice_F s (caller 6 7) natFloor 17 + rw [natFloor_F, FB_eq] at h + show Finv s (invoice (caller 6 7) natFloor 17) = _ + rw [h]; push_cast; ring +/-- F(t = .0204) > 0 (s = 2449/2500) -/ +theorem control_pos : 0 < Finv (((2449 : ℕ) : ℝ) / ((2500 : ℕ) : ℝ)) I89 := + pt_pos I89 2449 2500 100000000 (fun r => if r = 1 then 100000001 else if r = 8 then 766773248 else if r = 9 then 860549711 else if r = 16 then 1512014428 else if r = 24 then 2249339100 else if r = 32 then 2981569375 else if r = 40 then 3710034667 else if r = 48 then 4435513611 else if r = 56 then 5158518488 else if r = 64 then 5879412111 else 0) (fun r => if r = 2 then 197191859 else if r = 9 then 860549708 else if r = 17 then 1604529710 else if r = 25 then 2341111144 else if r = 33 then 3072813876 else if r = 41 then 3800870438 else if r = 49 then 4526015947 else if r = 57 then 5248739375 else if r = 65 then 5969389592 else if r = 73 then 6688228062 else if r = 137 then 12391716458 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) +/-- F(t = .0205) < 0 (s = 1959/2000) -/ +theorem control_neg : Finv (((1959 : ℕ) : ℝ) / ((2000 : ℕ) : ℝ)) I89 < 0 := + cell_neg I89 1959 1959 2000 100000000 (fun r => if r = 2 then 197178194 else if r = 9 then 860360650 else if r = 17 then 1604075180 else if r = 25 then 2340357693 else if r = 33 then 3071739655 else if r = 41 then 3799459223 else if r = 49 then 4524254849 else if r = 57 then 5246617715 else if r = 65 then 5966898261 else if r = 73 then 6685359123 else if r = 137 then 12385621260 else 0) (fun r => if r = 1 then 99999999 else if r = 8 then 766613815 else if r = 9 then 860360647 else if r = 16 then 1511595264 else if r = 24 then 2248624359 else if r = 32 then 2980536218 else if r = 40 then 3708666329 else if r = 48 then 4433796864 else if r = 56 then 5156442418 else if r = 64 then 5876967437 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) _ le_rfl le_rfl +/-- the control brackets the R3 value .0204110964: F(.0204) > 0 > F(.0205) for the exact #7113 caller invoice at the floor native -/ +theorem control_bracket : + 0 < Finv (1 - (204 : ℝ) / 10000) I89 ∧ Finv (1 - (205 : ℝ) / 10000) I89 < 0 := by + constructor + · have h := control_pos + have e : ((2449 : ℕ) : ℝ) / ((2500 : ℕ) : ℝ) = 1 - 204 / 10000 := by norm_num + rwa [e] at h + · have h := control_neg + have e : ((1959 : ℕ) : ℝ) / ((2000 : ℕ) : ℝ) = 1 - 205 / 10000 := by norm_num + rwa [e] at h + + +/-! ### 8. the CORRECTED argmax split 1|1 (k = 2, thin 4, arms of 1 priced by the ledger): F < 0 for t >= 176/4096 = 0.042969 (root .0419448764), 36 rational cells. + (internal notes; the exact root needs rpow to 1e-10, held in NumCert) -/ +def I11 : Inv := invoice (callerG 1 1 4) natFloor 2 +theorem I11_F (s : ℝ) : Finv s I11 = FBc 1 1 4 s - ((1 + 1 : ℕ) : ℝ) * Nfl s := by + have h := invoice_F s (callerG 1 1 4) natFloor 2 + rw [natFloor_F, callerG_F 1 1 4 le_rfl le_rfl] at h + show Finv s (invoice (callerG 1 1 4) natFloor 2) = _ + rw [h]; push_cast; ring +theorem cell11_0 (s : ℝ) (hx : ((0 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((980 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 0 980 4096 100000000000 (fun r => if r = 2 then 118038526172 else if r = 9 then 169164790567 else if r = 17 then 196967474893 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 99999999999 else if r = 9 then 99999999999 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_1 (s : ℝ) (hx : ((980 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((1470 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 980 1470 4096 100000000000 (fun r => if r = 2 then 128243590121 else if r = 9 then 220021419926 else if r = 17 then 276434202378 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 164464184067 else if r = 9 then 169164790564 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_2 (s : ℝ) (hx : ((1470 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((1960 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 1470 1960 4096 100000000000 (fun r => if r = 2 then 139330936607 else if r = 9 then 286167263672 else if r = 17 then 387961861652 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 210914774109 else if r = 9 then 220021419923 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_3 (s : ℝ) (hx : ((1960 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((2450 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 1960 2450 4096 100000000000 (fun r => if r = 2 then 151376843687 else if r = 9 then 372198774216 else if r = 17 then 544485468158 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 270484678412 else if r = 9 then 286167263669 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_4 (s : ℝ) (hx : ((2450 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((2695 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 2450 2695 4096 100000000000 (fun r => if r = 2 then 157784882305 else if r = 9 then 424475308227 else if r = 17 then 645037439188 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 346879262320 else if r = 9 then 372198774213 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_5 (s : ℝ) (hx : ((2695 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((2940 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 2695 2940 4096 100000000000 (fun r => if r = 2 then 164464184070 else if r = 9 then 484094252257 else if r = 17 then 764158682436 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 392822333018 else if r = 9 then 424475308224 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_6 (s : ℝ) (hx : ((2940 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3185 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 2940 3185 4096 100000000000 (fun r => if r = 2 then 171426232010 else if r = 9 then 552086871782 else if r = 17 then 905278448145 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 444850419381 else if r = 9 then 484094252254 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_7 (s : ℝ) (hx : ((3185 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3307 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3185 3307 4096 100000000000 (fun r => if r = 2 then 175002198569 else if r = 9 then 589426533829 else if r = 17 then 984988805396 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 503769462655 else if r = 9 then 552086871779 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_8 (s : ℝ) (hx : ((3307 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3430 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3307 3430 4096 100000000000 (fun r => if r = 2 then 178682995252 else if r = 9 then 629629276888 else if r = 17 then 1072459277781 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 535957699595 else if r = 9 then 589426533826 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_9 (s : ℝ) (hx : ((3430 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3491 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3430 3491 4096 100000000000 (fun r => if r = 2 then 180537047876 else if r = 9 then 650573014604 else if r = 17 then 1118678695528 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 570492148478 else if r = 9 then 629629276885 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_10 (s : ℝ) (hx : ((3491 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3552 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3491 3552 4096 100000000000 (fun r => if r = 2 then 182410338542 else if r = 9 then 672213416478 else if r = 17 then 1166890016018 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 588435695526 else if r = 9 then 650573014601 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_11 (s : ℝ) (hx : ((3552 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3613 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3552 3613 4096 100000000000 (fun r => if r = 2 then 184303066870 else if r = 9 then 694573656069 else if r = 17 then 1217179083616 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 606943616478 else if r = 9 then 672213416475 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_12 (s : ℝ) (hx : ((3613 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3675 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3613 3675 4096 100000000000 (fun r => if r = 2 then 186246949593 else if r = 9 then 718062766164 else if r = 17 then 1270513956070 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 626033662444 else if r = 9 then 694573656066 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_13 (s : ℝ) (hx : ((3675 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3705 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3675 3705 4096 100000000000 (fun r => if r = 2 then 187194885136 else if r = 9 then 729712000715 else if r = 17 then 1297153933706 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 646052044837 else if r = 9 then 718062766161 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_14 (s : ℝ) (hx : ((3705 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3736 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3705 3736 4096 100000000000 (fun r => if r = 2 then 188179487410 else if r = 9 then 741948120277 else if r = 17 then 1325268869852 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 655966912907 else if r = 9 then 729712000712 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_15 (s : ℝ) (hx : ((3736 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3766 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3736 3766 4096 100000000000 (fun r => if r = 2 then 189137258933 else if r = 9 then 753984850330 else if r = 17 then 1353056941668 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 666372158432 else if r = 9 then 741948120274 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_16 (s : ℝ) (hx : ((3766 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3797 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3766 3797 4096 100000000000 (fun r => if r = 2 then 190132077649 else if r = 9 then 766627987305 else if r = 17 then 1382383537787 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 676598876371 else if r = 9 then 753984850327 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_17 (s : ℝ) (hx : ((3797 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3812 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3797 3812 4096 100000000000 (fun r => if r = 2 then 190615318327 else if r = 9 then 772821526227 else if r = 17 then 1396801175565 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 687331395485 else if r = 9 then 766627987302 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_18 (s : ℝ) (hx : ((3812 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3827 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3812 3827 4096 100000000000 (fun r => if r = 2 then 191099787212 else if r = 9 then 779065102357 else if r = 17 then 1411369182812 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 692585501907 else if r = 9 then 772821526224 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_19 (s : ℝ) (hx : ((3827 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3842 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3827 3842 4096 100000000000 (fun r => if r = 2 then 191585487426 else if r = 9 then 785359119943 else if r = 17 then 1426089127815 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 697879771828 else if r = 9 then 779065102354 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_20 (s : ℝ) (hx : ((3842 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3858 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3842 3858 4096 100000000000 (fun r => if r = 2 then 192104928378 else if r = 9 then 792128795609 else if r = 17 then 1441959657406 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 703214512268 else if r = 9 then 785359119940 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_21 (s : ℝ) (hx : ((3858 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3873 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3858 3873 4096 100000000000 (fun r => if r = 2 then 192593183263 else if r = 9 then 798528353945 else if r = 17 then 1456998647283 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 708949858185 else if r = 9 then 792128795606 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_22 (s : ℝ) (hx : ((3873 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3881 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3873 3881 4096 100000000000 (fun r => if r = 2 then 192854093080 else if r = 9 then 801962565455 else if r = 17 then 1465083472409 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 714369220704 else if r = 9 then 798528353942 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_23 (s : ℝ) (hx : ((3881 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3889 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3881 3889 4096 100000000000 (fun r => if r = 2 then 193115356356 else if r = 9 then 805411546396 else if r = 17 then 1473213159894 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 717276466233 else if r = 9 then 801962565452 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_24 (s : ℝ) (hx : ((3889 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3896 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3889 3896 4096 100000000000 (fun r => if r = 2 then 193344252046 else if r = 9 then 808441570194 else if r = 17 then 1480363633263 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 720195543287 else if r = 9 then 805411546393 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_25 (s : ℝ) (hx : ((3896 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3900 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3896 3900 4096 100000000000 (fun r => if r = 2 then 193475171374 else if r = 9 then 810178127625 else if r = 17 then 1484465189525 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 722759479103 else if r = 9 then 808441570191 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_26 (s : ℝ) (hx : ((3900 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3904 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3900 3904 4096 100000000000 (fun r => if r = 2 then 193606179351 else if r = 9 then 811918415234 else if r = 17 then 1488578109728 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 724228681377 else if r = 9 then 810178127622 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_27 (s : ℝ) (hx : ((3904 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3908 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3904 3908 4096 100000000000 (fun r => if r = 2 then 193737276037 else if r = 9 then 813662441034 else if r = 17 then 1492702425356 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 725700870199 else if r = 9 then 811918415231 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_28 (s : ℝ) (hx : ((3908 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3910 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3908 3910 4096 100000000000 (fun r => if r = 2 then 193802857665 else if r = 9 then 814535858265 else if r = 17 then 1494768866317 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 727176051638 else if r = 9 then 813662441031 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_29 (s : ℝ) (hx : ((3910 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3912 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3910 3912 4096 100000000000 (fun r => if r = 2 then 193868461493 else if r = 9 then 815410213056 else if r = 17 then 1496838167982 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 727914766490 else if r = 9 then 814535858262 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_30 (s : ℝ) (hx : ((3912 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3914 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3912 3914 4096 100000000000 (fun r => if r = 2 then 193934087529 else if r = 9 then 816285506414 else if r = 17 then 1498910334309 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 728654231779 else if r = 9 then 815410213053 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_31 (s : ℝ) (hx : ((3914 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3916 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3914 3916 4096 100000000000 (fun r => if r = 2 then 193999735779 else if r = 9 then 817161739346 else if r = 17 then 1500985369266 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 729394448267 else if r = 9 then 816285506411 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_32 (s : ℝ) (hx : ((3916 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3917 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3916 3917 4096 100000000000 (fun r => if r = 2 then 194032568237 else if r = 9 then 817600208467 else if r = 17 then 1502023963721 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 730135416717 else if r = 9 then 817161739343 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_33 (s : ℝ) (hx : ((3917 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3918 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3917 3918 4096 100000000000 (fun r => if r = 2 then 194065406252 else if r = 9 then 818038912861 else if r = 17 then 1503063276823 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 730506183167 else if r = 9 then 817600208464 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_34 (s : ℝ) (hx : ((3918 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3919 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3918 3919 4096 100000000000 (fun r => if r = 2 then 194098249824 else if r = 9 then 818477852652 else if r = 17 then 1504103309069 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 730877137893 else if r = 9 then 818038912858 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem cell11_35 (s : ℝ) (hx : ((3919 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) ≤ s) (hy : s ≤ ((3920 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : + Finv s I11 < 0 := + cell_neg I11 3919 3920 4096 100000000000 (fun r => if r = 2 then 194131098954 else if r = 9 then 818917027968 else if r = 17 then 1505144060957 else 0) (fun r => if r = 1 then 99999999999 else if r = 8 then 731248280993 else if r = 9 then 818477852649 else 0) (by norm_num) (by norm_num) + (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) (by decide +kernel) s hx hy +theorem I11_neg (s : ℝ) (h0 : 0 ≤ s) (h1 : s ≤ ((3920 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) : Finv s I11 < 0 := by + rcases le_total s (((980 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h2 | h2 + · exact cell11_0 s (by rw [Nat.cast_zero, zero_div]; exact h0) h2 + · rcases le_total s (((1470 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h3 | h3 + · exact cell11_1 s h2 h3 + · rcases le_total s (((1960 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h4 | h4 + · exact cell11_2 s h3 h4 + · rcases le_total s (((2450 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h5 | h5 + · exact cell11_3 s h4 h5 + · rcases le_total s (((2695 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h6 | h6 + · exact cell11_4 s h5 h6 + · rcases le_total s (((2940 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h7 | h7 + · exact cell11_5 s h6 h7 + · rcases le_total s (((3185 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h8 | h8 + · exact cell11_6 s h7 h8 + · rcases le_total s (((3307 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h9 | h9 + · exact cell11_7 s h8 h9 + · rcases le_total s (((3430 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h10 | h10 + · exact cell11_8 s h9 h10 + · rcases le_total s (((3491 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h11 | h11 + · exact cell11_9 s h10 h11 + · rcases le_total s (((3552 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h12 | h12 + · exact cell11_10 s h11 h12 + · rcases le_total s (((3613 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h13 | h13 + · exact cell11_11 s h12 h13 + · rcases le_total s (((3675 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h14 | h14 + · exact cell11_12 s h13 h14 + · rcases le_total s (((3705 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h15 | h15 + · exact cell11_13 s h14 h15 + · rcases le_total s (((3736 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h16 | h16 + · exact cell11_14 s h15 h16 + · rcases le_total s (((3766 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h17 | h17 + · exact cell11_15 s h16 h17 + · rcases le_total s (((3797 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h18 | h18 + · exact cell11_16 s h17 h18 + · rcases le_total s (((3812 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h19 | h19 + · exact cell11_17 s h18 h19 + · rcases le_total s (((3827 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h20 | h20 + · exact cell11_18 s h19 h20 + · rcases le_total s (((3842 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h21 | h21 + · exact cell11_19 s h20 h21 + · rcases le_total s (((3858 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h22 | h22 + · exact cell11_20 s h21 h22 + · rcases le_total s (((3873 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h23 | h23 + · exact cell11_21 s h22 h23 + · rcases le_total s (((3881 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h24 | h24 + · exact cell11_22 s h23 h24 + · rcases le_total s (((3889 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h25 | h25 + · exact cell11_23 s h24 h25 + · rcases le_total s (((3896 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h26 | h26 + · exact cell11_24 s h25 h26 + · rcases le_total s (((3900 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h27 | h27 + · exact cell11_25 s h26 h27 + · rcases le_total s (((3904 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h28 | h28 + · exact cell11_26 s h27 h28 + · rcases le_total s (((3908 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h29 | h29 + · exact cell11_27 s h28 h29 + · rcases le_total s (((3910 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h30 | h30 + · exact cell11_28 s h29 h30 + · rcases le_total s (((3912 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h31 | h31 + · exact cell11_29 s h30 h31 + · rcases le_total s (((3914 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h32 | h32 + · exact cell11_30 s h31 h32 + · rcases le_total s (((3916 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h33 | h33 + · exact cell11_31 s h32 h33 + · rcases le_total s (((3917 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h34 | h34 + · exact cell11_32 s h33 h34 + · rcases le_total s (((3918 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h35 | h35 + · exact cell11_33 s h34 h35 + · rcases le_total s (((3919 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ)) with h36 | h36 + · exact cell11_34 s h35 h36 + · exact cell11_35 s h36 h1 + +/-- t >= 176/4096: the invoice F of EVERY native at the floor with the 1|1 caller (thin 4) is negative -/ +theorem split11_ceiling (t : ℝ) (ht : (176 : ℝ) / 4096 ≤ t) (ht1 : t ≤ 1) : Finv (1 - t) I11 < 0 := by + apply I11_neg (1 - t) (by linarith) + have : ((3920 : ℕ) : ℝ) / ((4096 : ℕ) : ℝ) = 1 - 176 / 4096 := by norm_num + rw [this]; linarith + +/-- UNCONDITIONAL-NUMERICS instance of the ceiling theorem: argmax split 2|2, thin >= 4, any native meeting the floor: + F(t) < 0 for t >= 141/4096 (class lemmas hB/hth and the native floor hN stay hypotheses; no NumCert needed). -/ +theorem ceiling_split22 (c : InClass 4) (ha : c.a = 2) (hb : c.b = 2) (n : Inv) + (hN : ∀ s : ℝ, 0 ≤ s → s ≤ 1 → Finv s n ≤ -Nfl s) (t : ℝ) (ht : (141 : ℝ) / 4096 ≤ t) (ht1 : t ≤ 1) : + Finv (1 - t) (invoice c.ci n (c.a + c.b)) < 0 := by + have hs0 : (0 : ℝ) ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + rw [invoice_F] + have h1 := c.hB (1 - t) hs0 hs1 + have h2 := hN (1 - t) hs0 hs1 + have h3 : ((c.a + c.b : ℕ) : ℝ) * Finv (1 - t) n ≤ ((c.a + c.b : ℕ) : ℝ) * (-Nfl (1 - t)) := + mul_le_mul_of_nonneg_left h2 (Nat.cast_nonneg _) + have h4 := FBc_th_mono c.a c.b c.hth (1 - t) + have h5 := split22_ceiling t ht ht1 + rw [I22_F] at h5 + rw [ha, hb] at h1 h3 h4 ⊢ + push_cast at h3 ⊢ + norm_num at h3 h5 ⊢ + linarith + +/-- CORRECTED argmax split 1|1 (k = 2, thin >= 4, any native meeting the floor): F(t) < 0 for t >= 176/4096 = .04297 (kernel-checked, 36 cells; + the sharp value .0419448764 is the certified root, NumCert). Class lemmas hB/hth and the native floor hN stay hypotheses. -/ +theorem ceiling_split11 (c : InClass 4) (ha : c.a = 1) (hb : c.b = 1) (n : Inv) + (hN : ∀ s : ℝ, 0 ≤ s → s ≤ 1 → Finv s n ≤ -Nfl s) (t : ℝ) (ht : (176 : ℝ) / 4096 ≤ t) (ht1 : t ≤ 1) : + Finv (1 - t) (invoice c.ci n (c.a + c.b)) < 0 := by + have hs0 : (0 : ℝ) ≤ 1 - t := by linarith + have hs1 : 1 - t ≤ 1 := by linarith + rw [invoice_F] + have h1 := c.hB (1 - t) hs0 hs1 + have h2 := hN (1 - t) hs0 hs1 + have h3 : ((c.a + c.b : ℕ) : ℝ) * Finv (1 - t) n ≤ ((c.a + c.b : ℕ) : ℝ) * (-Nfl (1 - t)) := + mul_le_mul_of_nonneg_left h2 (Nat.cast_nonneg _) + have h4 := FBc_th_mono c.a c.b c.hth (1 - t) + have h5 := split11_ceiling t ht ht1 + rw [I11_F] at h5 + rw [ha, hb] at h1 h3 h4 ⊢ + push_cast at h3 ⊢ + norm_num at h3 h5 ⊢ + linarith + +#print axioms invoice_F +#print axioms natFloor_F +#print axioms FB_eq +#print axioms ceiling +#print axioms ceiling4 +#print axioms ceiling3 +#print axioms rp_le_nat +#print axioms rp_ge_nat +#print axioms I22_F +#print axioms split22_ceiling +#print axioms ceiling_split22 +#print axioms callerG_F +#print axioms callerG_S +#print axioms callerG_eq_caller_F +#print axioms split11_ceiling +#print axioms ceiling_split11 +#print axioms I89_F +#print axioms control_bracket + +end JointCeiling diff --git a/research/p104-reader-ceiling/lean/Nov15/JointCeiling.md b/research/p104-reader-ceiling/lean/Nov15/JointCeiling.md new file mode 100644 index 0000000000..9672a4cb33 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/JointCeiling.md @@ -0,0 +1,21 @@ +# JointCeiling.lean: Joint (caller, native) ceiling, CORRECTED +Imports Nov15.CallerCost + Mathlib. About 12 s, 2.9 GB. 18 `#print axioms` all within [propext, Classical.choice, Quot.sound]; no sorry, no native_decide (`decide +kernel` = kernel evaluation only). The rational-cell data are produced by scripts that are not shipped; Lean re-checks every cell. +Convention: F(s) = sum (T-P) r^s, s = 1-t. + +## WITHDRAWN +- **The old statement "kappa <= .0336321541 (thin 4) / .0400007313 (thin 3), argmax 2|2" is WITHDRAWN.** Reason (internal audit): the generating script overcharged every arm of length 1 by 208 one-stage lines (P[8]) -- two lines per port, 104 ports x 2 -- breaking the ledger S = 3408(a+b) - 208. The argmax is 1|1 (k = 2), not 2|2, and the R1 NumCert list built from that script is invalid for arms of 1. +- tbar4 = .0336321541, tbar3 = .0400007313 are removed from the file. + +## Proved (kernel) +- `invoice_F`, `Fh_mono`, `natFloor`, `natFloor_F` (Nfl = 400*8^s + 16 + 88(2-2^s)): unchanged. +- **Correction (a).** `FBc a b th s = FB a b th s + 208*8^s*(#arms of 1)`; `callerG a b th` = ledger-correct caller histogram (a,b >= 1; P[8] = 384 + 16(a+b) - 208 #arms-of-1). `callerG_F`: F(callerG) = FBc for all a,b >= 1. `callerG_S`: **S(callerG a b 4) = 3408(a+b) - 208 for ALL a,b >= 1** (the ledger law; with the floor native S = -3216/call this is 192k - 208 = 176, 368, 560 at 1|1, 1|2, 2|2). `FBc_two`, `callerG_eq_caller_F`: for a,b >= 2 FBc = FB and callerG has the same F as CallerCost.caller (and FB_eq / reproduction of #7113 / S_caller are untouched), so the a,b >= 2 agreement stands. (`FB_eq`, `FB_th_mono` kept.) +- **Ceiling theorems** (`ceiling`, `ceiling4`, `ceiling3`) now run on FBc; tbar4 = .0419448764 (rounded up from the certified root .041944876391), tbar3 = .0681203280 (th3 B-form-A class only). +- **(c) Kernel-checked numerics:** `split22_ceiling` / `ceiling_split22` (2|2, t >= 141/4096, 28 cells; unaffected by the correction) and NEW `split11_ceiling` / `ceiling_split11`: the corrected argmax 1|1, thin >= 4, any floor native: F(t) < 0 for t >= 176/4096 = .04297 (36 rational cells, DEC = 1e11, q = 4096; the sharp root .0419448764 is not reachable by 4096-grid cells, it is in NumCert). `control_bracket` (C(8|9) = #7113 caller, F(.0204) > 0 > F(.0205)) unchanged. + +## Hypotheses (explicit, named) +1. `InClass.hB`: B-form per-split optimality pointwise in F on [0,1] (justified by a tail-swap/join majorization + Karamata argument, phi concave; finite checks 58,873 schedules and 360,844 B layouts; the audit found it sound for B ports). It holds on B ports. **It FAILS on A ports for the true sign-floor masks (centre-drop case, 6,009 / 5,879 failing layouts)**, which is why the ceiling is stated for the built-type class (A = 4 QUERY, B-form masks). `hth`: th >= th0 (4 = A ports use 4 QUERY sign units; 3 unbuilt). `hrho`: rho >= 2 (Theorem H, + t = -1 closure, #7606 findings bundle), recorded only. +2. `hN`: F_nat <= -Nfl on [0,1] (whole-floor note). Not re-proved. +3. `NumCert th0 tbar` (regenerated): for every split a|b (a,b >= 1), 0 <= s <= 1-tbar: FBc a b th0 s - (a+b) Nfl s < 0. Source: an external interval-arithmetic script (1|1 root, 1|b for b = 2..59 by interval cover, tail k >= 61 by U plus 208*8^s with U < 0 and U' < 0, a,b >= 2 splits unchanged since FBc = FB there). Its output: th4 1|1 kbar .041944876391 cert True, 1|b True, tail True; th3 .068120327915. Not in the kernel: ~1,800 pairs of 40-digit interval covers; the tail U >= F Jensen/MVT step (R1) is unaudited (audit conditions). + +## Theorem as restated (paper) +For every rho = 2 nested two-arm caller (arms a,b >= 1, meeting only in hubs, host calls t != -1) with A ports at 4 QUERY sign units and B-form masks, composed with any native at the whole-floor per-call floor: kappa <= .0419448764, peak at 1|1 (k = 2). Conditions: [H-centre] (no line crosses the centre at h <= 4), [H-odd] (a B sign unit costs >= psi(1)), Theorem H + t = -1 closure (quoted), the R1 tail step (hypothesis, in NumCert), hN, and realisability of arms of 1 / k = 2 (no root built; Floor Lemma does not cover an innermost-only arm). Outside the class: trees, multi-centre, shared own roles. The .0681203279 figure (thin-3 masks) is only "scanned, conditional" for the true sign-floor class (audit); the Lean `ceiling3` certifies only the th3 B-form-A class under hB. diff --git a/research/p104-reader-ceiling/lean/Nov15/JunkLB2.lean b/research/p104-reader-ceiling/lean/Nov15/JunkLB2.lean new file mode 100644 index 0000000000..d9d034ea16 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/JunkLB2.lean @@ -0,0 +1,1188 @@ +/- +BIG-JUNKLB2 (internal notes), T1 g9 pricing (class M): charging every move at g9 = h_9, except a Y main's first move + (out of chart 0, never on a pair chain), never exceeds the real I1 cost; the gap for Y_p is + l(d_1) = f(8) - f(d_1) - f(9-d_1) ≥ 0. Hence Σ_{junk pairs} dist_{g9}(A_q → G_p) ≤ public cost. +T3 slot lemma (level 7): |D| ≤ rank{x_p : p ∈ D} + |Z|, with the T2 facts as explicit hypotheses. +T4 departer law, CORRECTED SCOPE (GAPMAP): arrivals = ALL arrivals at c, owned included; + dim π(Arr_c) ≤ #public departers + #owned arrivals + #Y enders. Each departer stop costs ≥ f(2). + The public-only version is false in the same model (`T4_public_only_false`). +(Nov 16): T1 linked to registers (`Net.T1_cost`, `Net.T1_full`: Σ move charges ≤ public +cost under JunkM op semantics); T2 proved from level-k op semantics (`T2_run`: complementarity, +independence, expansion existence) and discharged in T3 (`slot_lemma_T2`, `slot_lemma_run`). +Self-contained: h / gaps / hsum / two_point / Net are copied from Nov15/JunkM.lean. +-/ +import Mathlib.Analysis.SpecialFunctions.Log.NegMulLog +import Mathlib.Analysis.Convex.Slope +import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas +import Mathlib.LinearAlgebra.StdBasis +import Mathlib.LinearAlgebra.Dimension.OrzechProperty + +open Finset + +set_option linter.unusedSectionVars false +set_option linter.unusedSimpArgs false + +namespace JunkLB2 + +/-! ## Costs (copied from JunkM, I1) -/ + +section Cost + +variable (f : ℝ → ℝ) + +/-- `h_e(a,b) = f(e-a) - f(b-a) - f(e-b)`. -/ +def h (e a b : ℝ) : ℝ := f (e - a) - f (b - a) - f (e - b) + +def gaps : List ℝ → ℝ + | a :: b :: t => f (b - a) + gaps (b :: t) + | _ => 0 + +/-- `Σ h_e(d_i, d_{i+1})` along a dim chain. -/ +def hsum (e : ℝ) : List ℝ → ℝ + | a :: b :: t => h f e a b + hsum e (b :: t) + | _ => 0 + +/-- telescoping with an arbitrary pricing level `e` (the chain need not end at `e`): +`Σ h_e(d_i,d_{i+1}) = f(e - d_0) - f(e - last) - Σ f(gaps)`. -/ +theorem hsum_tele (e : ℝ) : ∀ (d0 : ℝ) (ds : List ℝ), + hsum f e (d0 :: ds) = + f (e - d0) - f (e - (d0 :: ds).getLast (List.cons_ne_nil _ _)) - gaps f (d0 :: ds) + | d0, [] => by simp [hsum, gaps] + | d0, b :: t => by + have ih := hsum_tele e b t + rw [List.getLast_cons (List.cons_ne_nil _ _)] + simp only [hsum, gaps, h] at ih ⊢ + rw [ih]; ring + +end Cost + +/-- `f(r) = r log r`. -/ +noncomputable def fL (r : ℝ) : ℝ := r * Real.log r + +lemma fL_convex : ConvexOn ℝ (Set.Ici (0 : ℝ)) fL := Real.convexOn_mul_log + +/-- two-point majorisation for a convex function on `[0,∞)` (copied from JunkM). -/ +lemma two_point {f : ℝ → ℝ} (cvx : ConvexOn ℝ (Set.Ici (0 : ℝ)) f) {lo hi y z : ℝ} (h0 : 0 ≤ lo) + (hlt : lo < hi) (hy1 : lo ≤ y) (hy2 : y ≤ hi) (hz1 : lo ≤ z) (hz2 : z ≤ hi) + (hs : y + z = lo + hi) : f y + f z ≤ f lo + f hi := by + have hD : 0 < hi - lo := by linarith + have hlo : lo ∈ Set.Ici (0:ℝ) := h0 + have hhi : hi ∈ Set.Ici (0:ℝ) := by simp; linarith + have hy := cvx.2 hlo hhi + (div_nonneg (by linarith) hD.le : (0:ℝ) ≤ (hi - y) / (hi - lo)) + (div_nonneg (by linarith) hD.le : (0:ℝ) ≤ (y - lo) / (hi - lo)) (by field_simp; ring) + have hz := cvx.2 hlo hhi + (div_nonneg (by linarith) hD.le : (0:ℝ) ≤ (hi - z) / (hi - lo)) + (div_nonneg (by linarith) hD.le : (0:ℝ) ≤ (z - lo) / (hi - lo)) (by field_simp; ring) + simp only [smul_eq_mul] at hy hz + have ey : (hi - y) / (hi - lo) * lo + (y - lo) / (hi - lo) * hi = y := by field_simp; ring + have ez : (hi - z) / (hi - lo) * lo + (z - lo) / (hi - lo) * hi = z := by field_simp; ring + rw [ey] at hy; rw [ez] at hz + have e1 : (hi - y) / (hi - lo) + (hi - z) / (hi - lo) = 1 := by field_simp; linarith + have e2 : (y - lo) / (hi - lo) + (z - lo) / (hi - lo) = 1 := by field_simp; linarith + have : f y + f z ≤ ((hi - y) / (hi - lo) + (hi - z) / (hi - lo)) * f lo + + ((y - lo) / (hi - lo) + (z - lo) / (hi - lo)) * f hi := by linarith + rw [e1, e2] at this; linarith + +lemma fL0 : fL 0 = 0 := by simp [fL] +lemma fL1 : fL 1 = 0 := by simp [fL] + +/-- every ascending move strictly below the final dim costs at least `κ = f(2) = 2 log 2`: +`h_e(a,b) ≥ f(2)` when `b - a ≥ 1` and `e - b ≥ 1` (T4's "each departer stop costs ≥ f(2)"). -/ +theorem kappa_le (e a b : ℝ) (hab : 1 ≤ b - a) (hbe : 1 ≤ e - b) : fL 2 ≤ h fL e a b := by + have cvx := fL_convex + set x := b - a; set y := e - b + have hxy : e - a = x + y := by simp only [x, y]; ring + -- f(x) + f(1+y) ≤ f(1) + f(x+y) + have s1 := two_point cvx (lo := 1) (hi := x + y) (y := x) (z := 1 + y) + (by norm_num) (by linarith) hab (by linarith) (by linarith) (by linarith) (by ring) + -- f(y) + f(2) ≤ f(1) + f(1+y) + have s2 := two_point cvx (lo := 1) (hi := 1 + y) (y := y) (z := 2) + (by norm_num) (by linarith) hbe (by linarith) (by norm_num) (by linarith) (by ring) + simp only [h, hxy]; rw [fL1] at s1 s2; linarith + +/-- `g9(a,b) ≥ 0` for `a ≤ b ≤ 9`. -/ +lemma g9_nonneg (a b : ℝ) (hab : a ≤ b) (hb : b ≤ 9) : 0 ≤ h fL 9 a b := by + have := two_point fL_convex (lo := 0) (hi := 9 - a) (y := b - a) (z := 9 - b) + rcases (show a = 9 ∨ a < 9 by + rcases lt_or_eq_of_le (hab.trans hb) with h' | h' <;> [exact Or.inr h'; exact Or.inl h']) with + rfl | ha + · have : b = 9 := le_antisymm hb hab + subst this; simp [h, fL0] + · have := this le_rfl (by linarith) (by linarith) (by linarith) (by linarith) (by linarith) + (by ring) + simp only [h]; rw [fL0] at this; linarith + +/-! ## T1. g9 pricing (class M) -/ + +section T1 + +/-- **T1, Y main.** For `Y_p` with dim chain `0 < d_1 < … < d_k = 8`, the real I1 cost +`Σ h_8` equals the g9 charge on every move but the first, plus `l(d_1) = f(8) - f(d_1) - f(9 - d_1)`. -/ +theorem T1_Y (f : ℝ → ℝ) (hf0 : f 0 = 0) (hf1 : f 1 = 0) (d1 : ℝ) (rest : List ℝ) + (hlast : (d1 :: rest).getLast (List.cons_ne_nil _ _) = 8) : + hsum f 8 (0 :: d1 :: rest) = hsum f 9 (d1 :: rest) + (f 8 - f d1 - f (9 - d1)) := by + have e1 : hsum f 8 (0 :: d1 :: rest) = h f 8 0 d1 + hsum f 8 (d1 :: rest) := rfl + rw [e1, hsum_tele f 8 d1 rest, hsum_tele f 9 d1 rest, hlast] + have a1 : (8:ℝ) - 8 = 0 := by norm_num + have a2 : (9:ℝ) - 8 = 1 := by norm_num + simp only [h, a1, a2, hf0, hf1, sub_zero]; ring + +/-- the T1 slack `l(d) = f(8) - f(d) - f(9-d) ≥ 0` for `1 ≤ d ≤ 8` (and `l(1) = l(8) = 0`). -/ +theorem l_nonneg (d : ℝ) (h1 : 1 ≤ d) (h8 : d ≤ 8) : 0 ≤ fL 8 - fL d - fL (9 - d) := by + have := two_point fL_convex (lo := 1) (hi := 8) (y := d) (z := 9 - d) + (by norm_num) (by norm_num) h1 h8 (by linarith) (by linarith) (by ring) + rw [fL1] at this; linarith + +lemma l_one : fL 8 - fL 1 - fL (9 - 1) = 0 := by norm_num [fL1] + +/-- **T1, per register.** Charged ≤ real for a Y main (`0 :: d_1 :: … :: 8`, first move uncharged); +for a register ending at V (dim 9) the charge is its real cost by definition (`hsum fL 9`). -/ +theorem T1_Y_le (d1 : ℝ) (rest : List ℝ) (h1 : 1 ≤ d1) (h8 : d1 ≤ 8) + (hlast : (d1 :: rest).getLast (List.cons_ne_nil _ _) = 8) : + hsum fL 9 (d1 :: rest) ≤ hsum fL 8 (0 :: d1 :: rest) := by + rw [T1_Y fL fL0 fL1 d1 rest hlast]; linarith [l_nonneg d1 h1 h8] + +/-! ### The path bound with g9 everywhere (copy of JunkM's `Net`, no free moves) -/ + +attribute [local instance] Classical.propDecidable + +variable {C XP YP Mv : Type*} [PartialOrder C] [Fintype XP] [Fintype YP] [Fintype Mv] + +structure Net (C XP YP Mv : Type*) [PartialOrder C] where + inS : XP → C → Prop + inP : YP → C → Prop + monoS : ∀ q s s', s ≤ s' → inS q s → inS q s' + antiP : ∀ p t t', t ≤ t' → inP p t' → inP p t + A : XP → C + G : YP → C + hA : ∀ q, inS q (A q) + hG : ∀ p, inP p (G p) + src : Mv → C + tgt : Mv → C + hlt : ∀ m, src m < tgt m + +namespace Net + +variable (N : Net C XP YP Mv) + +noncomputable def nS (s : C) : ℕ := (univ.filter fun q => N.inS q s).card +noncomputable def mP (t : C) : ℕ := (univ.filter fun p => N.inP p t).card + +def Chain : C → List Mv → C → Prop + | a, [], b => a = b + | a, m :: ms, b => N.src m = a ∧ Chain (N.tgt m) ms b + +lemma chain_bounds : ∀ (a : C) (ℓ : List Mv) (b : C), N.Chain a ℓ b → + ∀ m ∈ ℓ, a ≤ N.src m ∧ N.tgt m ≤ b + | a, [], b, _, m, hm => absurd hm (List.not_mem_nil) + | a, m' :: ms, b, ⟨hs, hc⟩, m, hm => by + have hab : ∀ x ∈ ms, N.tgt m' ≤ N.src x ∧ N.tgt x ≤ b := chain_bounds _ ms b hc + have hend : N.tgt m' ≤ b := by + cases ms with + | nil => exact le_of_eq hc + | cons x xs => exact (le_of_lt (N.hlt x)).trans' ((hab x (by simp)).1) |>.trans (hab x (by simp)).2 + rcases List.mem_cons.mp hm with rfl | hm + · exact ⟨le_of_eq hs.symm, hend⟩ + · have := hab m hm + exact ⟨(le_of_eq hs.symm).trans ((le_of_lt (N.hlt m')).trans this.1), this.2⟩ + +lemma chain_nodup : ∀ (a : C) (ℓ : List Mv) (b : C), N.Chain a ℓ b → ℓ.Nodup + | a, [], b, _ => List.nodup_nil + | a, m :: ms, b, ⟨_, hc⟩ => by + refine List.nodup_cons.mpr ⟨fun hm => ?_, chain_nodup _ ms b hc⟩ + have := (N.chain_bounds _ ms b hc m hm).1 + exact absurd (lt_of_lt_of_le (N.hlt m) this) (lt_irrefl _) + +noncomputable def wt (c : C → C → ℝ) (m : Mv) : ℝ := + c (N.src m) (N.tgt m) / ((N.nS (N.src m) : ℝ) * N.mP (N.tgt m)) + +lemma users_card (P : Finset (YP × XP)) (path : YP × XP → List Mv) + (hpath : ∀ π ∈ P, N.Chain (N.A π.2) (path π) (N.G π.1)) (m : Mv) : + (P.filter fun π => m ∈ path π).card ≤ N.mP (N.tgt m) * N.nS (N.src m) := by + rw [mP, nS, ← card_product] + apply card_le_card + intro π hπ + rw [mem_filter] at hπ + have hb := N.chain_bounds _ _ _ (hpath π hπ.1) m hπ.2 + simp only [mem_product, mem_filter, mem_univ, true_and] + exact ⟨N.antiP π.1 _ _ hb.2 (N.hG π.1), N.monoS π.2 _ _ hb.1 (N.hA π.2)⟩ + +def ChartChain : C → List C → C → Prop + | a, [], b => a = b + | a, t :: ts, b => a < t ∧ ChartChain t ts b + +noncomputable def cw (c : C → C → ℝ) : C → List C → ℝ + | _, [] => 0 + | a, t :: ts => c a t / ((N.nS a : ℝ) * N.mP t) + cw c t ts + +/-- the shortest-path value `dist(a → b)` in the chart graph. -/ +noncomputable def dist (c : C → C → ℝ) (a b : C) : ℝ := + sInf {x | ∃ l, ChartChain a l b ∧ N.cw c a l = x} + +lemma cw_nonneg (c : C → C → ℝ) (hc0 : ∀ s t, 0 ≤ c s t) : ∀ a l, 0 ≤ N.cw c a l + | _, [] => le_rfl + | a, t :: ts => add_nonneg (div_nonneg (hc0 _ _) (by positivity)) (cw_nonneg c hc0 t ts) + +lemma chain_to_chart (c : C → C → ℝ) : ∀ (a : C) (ℓ : List Mv) (b : C), N.Chain a ℓ b → + ChartChain a (ℓ.map N.tgt) b ∧ N.cw c a (ℓ.map N.tgt) = (ℓ.map (N.wt c)).sum + | a, [], b, h => ⟨h, rfl⟩ + | a, m :: ms, b, ⟨hs, hc⟩ => by + obtain ⟨h1, h2⟩ := chain_to_chart c _ ms b hc + refine ⟨⟨hs ▸ N.hlt m, h1⟩, ?_⟩ + simp only [List.map_cons, cw, List.sum_cons, h2, wt, hs] + +lemma dist_le (c : C → C → ℝ) (hc0 : ∀ s t, 0 ≤ c s t) {a b : C} {ℓ : List Mv} + (h : N.Chain a ℓ b) : N.dist c a b ≤ (ℓ.map (N.wt c)).sum := by + obtain ⟨h1, h2⟩ := N.chain_to_chart c a ℓ b h + exact csInf_le ⟨0, fun x ⟨l, _, hx⟩ => hx ▸ N.cw_nonneg c hc0 a l⟩ ⟨_, h1, h2⟩ + +/-- the path bound without free moves: if every USED move is charged `w m ≥ c(src,tgt)`, then +`Σ_pairs dist ≤ Σ_m w m`. -/ +theorem bound0 (c : C → C → ℝ) (w : Mv → ℝ) (P : Finset (YP × XP)) (path : YP × XP → List Mv) + (hpath : ∀ π ∈ P, N.Chain (N.A π.2) (path π) (N.G π.1)) + (hc0 : ∀ s t, 0 ≤ c s t) (hw0 : ∀ m, 0 ≤ w m) + (hpay : ∀ m, (∃ π ∈ P, m ∈ path π) → c (N.src m) (N.tgt m) ≤ w m) : + ∑ π ∈ P, N.dist c (N.A π.2) (N.G π.1) ≤ ∑ m, w m := by + have s1 : ∑ π ∈ P, N.dist c (N.A π.2) (N.G π.1) ≤ ∑ π ∈ P, ((path π).map (N.wt c)).sum := + sum_le_sum fun π hπ => N.dist_le c hc0 (hpath π hπ) + have s2 : ∑ π ∈ P, ((path π).map (N.wt c)).sum + = ∑ m, ((P.filter fun π => m ∈ path π).card : ℝ) * N.wt c m := by + have e1 : ∀ π ∈ P, ((path π).map (N.wt c)).sum + = ∑ m, if m ∈ path π then N.wt c m else 0 := by + intro π hπ + rw [← List.sum_toFinset _ (N.chain_nodup _ _ _ (hpath π hπ)), ← sum_filter] + congr 1; ext m; simp + rw [sum_congr rfl e1, sum_comm] + refine sum_congr rfl fun m _ => ?_ + rw [← sum_filter, sum_const, nsmul_eq_mul] + have s3 : ∀ m, ((P.filter fun π => m ∈ path π).card : ℝ) * N.wt c m ≤ w m := by + intro m + by_cases hu : ∃ π ∈ P, m ∈ path π + · have hcard := N.users_card P path hpath m + obtain ⟨π, hπ, hm⟩ := hu + have hpos : 0 < (P.filter fun π => m ∈ path π).card := + card_pos.mpr ⟨π, mem_filter.mpr ⟨hπ, hm⟩⟩ + have hD : (0 : ℝ) < (N.nS (N.src m) : ℝ) * N.mP (N.tgt m) := by + have : 0 < N.mP (N.tgt m) * N.nS (N.src m) := lt_of_lt_of_le hpos hcard + rw [mul_comm]; exact_mod_cast this + have hle : ((P.filter fun π => m ∈ path π).card : ℝ) ≤ (N.nS (N.src m) : ℝ) * N.mP (N.tgt m) := by + rw [mul_comm]; exact_mod_cast hcard + have : ((P.filter fun π => m ∈ path π).card : ℝ) * N.wt c m ≤ c (N.src m) (N.tgt m) := by + rw [wt, mul_div_assoc', div_le_iff₀ hD] + exact mul_le_mul_of_nonneg_left hle (hc0 _ _) |>.trans_eq' (by ring) + exact this.trans (hpay m ⟨π, hπ, hm⟩) + · have : (P.filter fun π => m ∈ path π) = ∅ := by + ext π; simp only [mem_filter, Finset.notMem_empty, iff_false, not_and] + exact fun hπ hm => hu ⟨π, hπ, hm⟩ + simp [this, hw0 m] + calc _ ≤ _ := s1 + _ = _ := s2 + _ ≤ _ := sum_le_sum fun m _ => s3 m + +/-- **T1 (class M), path form.** Chart `z` (= chart 0) holds no X port (`n(0) = 0`). Every move +not leaving `z` is charged at least `c` (with `c = g9` on dims: `g9_nonneg`, `T1_Y_le`); moves out of +`z` (Y mains' first moves, the uncharged ones) may be charged anything `≥ 0`. Then +`Σ_{junk pairs} dist_c(A_q → G_p) ≤ Σ_m w m`; combined with `Σ_m w m ≤ public cost` (per register: +`T1_Y_le` for Y mains, equality for registers ending at V) this is T1's bound. -/ +theorem T1_bound (c : C → C → ℝ) (w : Mv → ℝ) (P : Finset (YP × XP)) (path : YP × XP → List Mv) + (hpath : ∀ π ∈ P, N.Chain (N.A π.2) (path π) (N.G π.1)) + (hc0 : ∀ s t, 0 ≤ c s t) (hw0 : ∀ m, 0 ≤ w m) (z : C) (hz : ∀ q, ¬ N.inS q z) + (hcharge : ∀ m, N.src m ≠ z → c (N.src m) (N.tgt m) ≤ w m) + (cost : ℝ) (hcost : ∑ m, w m ≤ cost) : + ∑ π ∈ P, N.dist c (N.A π.2) (N.G π.1) ≤ cost := by + refine (N.bound0 c w P path hpath hc0 hw0 fun m ⟨π, hπ, hm⟩ => hcharge m ?_).trans hcost + intro hzm + have := (N.chain_bounds _ _ _ (hpath π hπ) m hm).1 + rw [hzm] at this + exact hz π.2 (N.monoS π.2 _ _ this (N.hA π.2)) + +end Net + +end T1 + +/-! ## T1, linked to registers: total move charges ≤ public cost (JunkM op semantics) -/ + +section T1link + +attribute [local instance] Classical.propDecidable + +variable {C XP YP Mv R : Type*} [PartialOrder C] [Fintype XP] [Fintype YP] [Fintype Mv] [Fintype R] + +namespace Net + +variable (N : Net C XP YP Mv) + +lemma chain_append : ∀ (a : C) (ℓ : List Mv) (b : C) (m : Mv), N.Chain a ℓ b → N.src m = b → + N.Chain a (ℓ ++ [m]) (N.tgt m) + | a, [], b, m, h, hm => by simp only [Chain] at h; subst h; exact ⟨hm, rfl⟩ + | a, m' :: ms, b, m, ⟨hs, hc⟩, hm => ⟨hs, chain_append _ ms b m hc hm⟩ + +/-- register `i`'s moves up to time `n`, in time order: `mv t i` at each `t < n` where its chart +rises (JunkM's `mv t i`). -/ +noncomputable def movesOf (chart : ℕ → R → C) (mv : ℕ → R → Mv) (i : R) (n : ℕ) : List Mv := + ((List.range n).filter (fun t => decide (chart t i < chart (t + 1) i))).map (fun t => mv t i) + +/-- JunkM op semantics (b) charts never decrease, (c) `mv t i` goes `chart t i → chart (t+1) i` when +`i`'s chart rises: then `i`'s moves form a chain from its birth chart to its chart at time `n`. -/ +lemma movesOf_chain (chart : ℕ → R → C) (mv : ℕ → R → Mv) + (hmv : ∀ t i, chart t i < chart (t + 1) i → + N.src (mv t i) = chart t i ∧ N.tgt (mv t i) = chart (t + 1) i) + (hmono : ∀ t i, chart t i ≤ chart (t + 1) i) (i : R) : + ∀ n, N.Chain (chart 0 i) (movesOf chart mv i n) (chart n i) := by + intro n + induction n with + | zero => simp [movesOf, Chain] + | succ n ih => + by_cases hlt : chart n i < chart (n + 1) i + · have e : movesOf chart mv i (n + 1) = movesOf chart mv i n ++ [mv n i] := by + simp [movesOf, List.range_succ, List.filter_append, hlt] + obtain ⟨hs, ht⟩ := hmv n i hlt + rw [e, ← ht]; exact N.chain_append _ _ _ _ ih hs + · have e : movesOf chart mv i (n + 1) = movesOf chart mv i n := by + simp [movesOf, List.range_succ, List.filter_append, hlt] + have heq : chart (n + 1) i = chart n i := + ((hmono n i).lt_or_eq.resolve_left hlt).symm + rw [e, heq]; exact ih + +/-- the move costs along a chain telescope into `hsum` over the chain's dims. -/ +lemma chain_hsum (f : ℝ → ℝ) (e : ℝ) (dim : C → ℝ) : ∀ (a : C) (ℓ : List Mv) (b : C), N.Chain a ℓ b → + (ℓ.map fun m => h f e (dim (N.src m)) (dim (N.tgt m))).sum = + hsum f e (dim a :: ℓ.map fun m => dim (N.tgt m)) + | a, [], b, _ => by simp [hsum] + | a, m :: ms, b, ⟨hs, hc⟩ => by + simp only [List.map_cons, List.sum_cons, hsum] + rw [chain_hsum f e dim _ ms b hc, hs] + +lemma chain_last (dim : C → ℝ) : ∀ (a : C) (ℓ : List Mv) (b : C), N.Chain a ℓ b → + (dim a :: ℓ.map fun m => dim (N.tgt m)).getLast (List.cons_ne_nil _ _) = dim b + | a, [], b, hc => by simp only [Chain] at hc; subst hc; rfl + | a, m :: ms, b, ⟨_, hc⟩ => by + rw [List.map_cons, List.getLast_cons (List.cons_ne_nil _ _)] + exact chain_last dim _ ms b hc + +/-- the T1 edge price `c(s,t) = g9(dim s, dim t)` (clipped at 0, which changes nothing on real moves). -/ +noncomputable def cg (dim : C → ℕ) (s t : C) : ℝ := max (h fL 9 (dim s) (dim t)) 0 + +/-- the T1 move charge: moves out of chart `z` (= chart 0; Y mains' first moves) are uncharged, every +other move is charged `c(src, tgt)`. -/ +noncomputable def wz (dim : C → ℕ) (z : C) (m : Mv) : ℝ := + if N.src m = z then 0 else cg dim (N.src m) (N.tgt m) + +lemma cg_eq (dim : C → ℕ) (hdim : StrictMono dim) (s t : C) (hst : s < t) (ht : dim t ≤ 9) : + cg dim s t = h fL 9 (dim s) (dim t) := by + have h1 : (dim s : ℝ) ≤ dim t := by exact_mod_cast (hdim hst).le + have h2 : (dim t : ℝ) ≤ 9 := by exact_mod_cast ht + exact max_eq_left (g9_nonneg _ _ h1 h2) + +/-- a register ending at V (dim 9): its charges are at most its real cost `Σ h_9`. -/ +lemma reg_le_V (dim : C → ℕ) (hdim : StrictMono dim) (z : C) (a : C) (ℓ : List Mv) (b : C) + (hc : N.Chain a ℓ b) (hb : dim b ≤ 9) : + (ℓ.map (N.wz dim z)).sum ≤ hsum fL 9 ((dim a : ℝ) :: ℓ.map fun m => (dim (N.tgt m) : ℝ)) := by + rw [← N.chain_hsum fL 9 (fun c => (dim c : ℝ)) a ℓ b hc] + apply List.sum_le_sum + intro m hm + have hbd := N.chain_bounds a ℓ b hc m hm + have ht9 : dim (N.tgt m) ≤ 9 := (hdim.monotone hbd.2).trans hb + have hceq := cg_eq dim hdim _ _ (N.hlt m) ht9 + have h1 : (dim (N.src m) : ℝ) ≤ dim (N.tgt m) := by exact_mod_cast (hdim (N.hlt m)).le + have h2 : (dim (N.tgt m) : ℝ) ≤ 9 := by exact_mod_cast ht9 + unfold wz; split_ifs + · exact g9_nonneg _ _ h1 h2 + · exact hceq.le + +/-- a Y main (born at chart `z`, dim 0; ends at `G_p`, dim 8): charges ≤ real cost `Σ h_8` +(the first move is uncharged; `T1_Y_le`). -/ +lemma reg_le_Y (dim : C → ℕ) (hdim : StrictMono dim) (z : C) (hz0 : dim z = 0) (ℓ : List Mv) (b : C) + (hc : N.Chain z ℓ b) (hb : dim b = 8) : + (ℓ.map (N.wz dim z)).sum ≤ hsum fL 8 ((dim z : ℝ) :: ℓ.map fun m => (dim (N.tgt m) : ℝ)) := by + cases ℓ with + | nil => simp only [Chain] at hc; subst hc; omega + | cons m1 rest => + obtain ⟨hs1, hc'⟩ := hc + have hw1 : N.wz dim z m1 = 0 := by simp [wz, hs1] + have hrest : (rest.map (N.wz dim z)) = rest.map fun m => h fL 9 (dim (N.src m)) (dim (N.tgt m)) := by + apply List.map_congr_left + intro m hm + have hbd := N.chain_bounds _ rest b hc' m hm + have hpos : 0 < dim (N.src m) := by + have := hdim (lt_of_lt_of_le (hs1 ▸ N.hlt m1) hbd.1); omega + have hne : N.src m ≠ z := fun e => by rw [e] at hpos; omega + have ht9 : dim (N.tgt m) ≤ 9 := by have := hdim.monotone hbd.2; omega + simp only [wz, hne, if_false] + exact cg_eq dim hdim _ _ (N.hlt m) ht9 + rw [List.map_cons, List.sum_cons, hw1, zero_add, hrest, + N.chain_hsum fL 9 (fun c => (dim c : ℝ)) _ rest b hc', List.map_cons, hz0, Nat.cast_zero] + have hd1 : 0 < dim (N.tgt m1) := by have := hdim (hs1 ▸ N.hlt m1); omega + have hd8 : dim (N.tgt m1) ≤ 8 := by + have := hdim.monotone (show N.tgt m1 ≤ b from by + cases rest with + | nil => exact le_of_eq hc' + | cons x xs => + have hx := N.chain_bounds _ (x :: xs) b hc' x (by simp) + exact (le_of_lt (N.hlt x)).trans' hx.1 |>.trans hx.2) + omega + apply T1_Y_le + · exact_mod_cast hd1 + · exact_mod_cast hd8 + · rw [N.chain_last (fun c => (dim c : ℝ)) _ rest b hc', hb]; norm_num + +lemma list_range_filter_sum (n : ℕ) (p : ℕ → Prop) (g : ℕ → ℝ) : + (((List.range n).filter (fun t => decide (p t))).map g).sum = + ∑ t ∈ Finset.range n, if p t then g t else 0 := by + induction n with + | zero => simp + | succ n ih => + rw [List.range_succ, List.filter_append, List.map_append, List.sum_append, ih, + Finset.sum_range_succ] + by_cases hp : p n <;> simp [hp] + +/-- **T1, Σ_m w_m ≤ public cost, as a theorem.** JunkM op semantics: charts never decrease, +`mv t i` is register `i`'s move `chart t i → chart (t+1) i` when its chart rises, and the moves are +exactly these (each move is `mv t i` for exactly one rising step `t < n`). Charts carry a strictly +monotone dim (`z` = chart 0, dim 0). Model M: a Y main (`Ym`) is born at `z` and ends at dim 8, every +other register ends at V (dim 9). The public cost is `Σ_i h-sum` over each register's dim chain +(I1), with `e = 8` for Y mains and `9` otherwise. -/ +theorem T1_cost (chart : ℕ → R → C) (mv : ℕ → R → Mv) (n : ℕ) + (hmv : ∀ t i, chart t i < chart (t + 1) i → + N.src (mv t i) = chart t i ∧ N.tgt (mv t i) = chart (t + 1) i) + (hmono : ∀ t i, chart t i ≤ chart (t + 1) i) + (hsurj : ∀ m, ∃ t < n, ∃ i, chart t i < chart (t + 1) i ∧ mv t i = m) + (hinj : ∀ t t' i i', chart t i < chart (t + 1) i → chart t' i' < chart (t' + 1) i' → + mv t i = mv t' i' → t = t' ∧ i = i') + (dim : C → ℕ) (hdim : StrictMono dim) (z : C) (hz0 : dim z = 0) (Ym : Finset R) + (hY : ∀ i ∈ Ym, chart 0 i = z ∧ dim (chart n i) = 8) (hV : ∀ i ∉ Ym, dim (chart n i) = 9) : + ∑ m, N.wz dim z m ≤ ∑ i, hsum fL (if i ∈ Ym then 8 else 9) + ((dim (chart 0 i) : ℝ) :: (movesOf chart mv i n).map fun m => (dim (N.tgt m) : ℝ)) := by + have hsplit : ∑ m, N.wz dim z m = ∑ i, ((movesOf chart mv i n).map (N.wz dim z)).sum := by + have e1 : ∀ i, ((movesOf chart mv i n).map (N.wz dim z)).sum = + ∑ t ∈ Finset.range n, if chart t i < chart (t + 1) i then N.wz dim z (mv t i) else 0 := by + intro i; rw [movesOf, List.map_map]; exact list_range_filter_sum n _ _ + simp_rw [e1] + rw [Finset.sum_comm, ← Finset.sum_product (s := Finset.range n) (t := Finset.univ) + (f := fun x : ℕ × R => if chart x.1 x.2 < chart (x.1 + 1) x.2 then N.wz dim z (mv x.1 x.2) else 0), + ← Finset.sum_filter] + symm + refine Finset.sum_bij (fun x _ => mv x.1 x.2) (fun _ _ => Finset.mem_univ _) ?_ ?_ (fun _ _ => rfl) + · rintro ⟨t, i⟩ h1 ⟨t', i'⟩ h2 he + simp only [Finset.mem_filter] at h1 h2 + obtain ⟨rfl, rfl⟩ := hinj t t' i i' h1.2 h2.2 he; rfl + · intro m _ + obtain ⟨t, ht, i, hr, rfl⟩ := hsurj m + exact ⟨(t, i), by simp [ht, hr], rfl⟩ + rw [hsplit] + refine Finset.sum_le_sum fun i _ => ?_ + have hc := N.movesOf_chain chart mv hmv hmono i n + by_cases hi : i ∈ Ym + · obtain ⟨h0, h8⟩ := hY i hi + rw [if_pos hi, h0]; rw [h0] at hc + exact N.reg_le_Y dim hdim z hz0 _ _ hc h8 + · rw [if_neg hi] + exact N.reg_le_V dim hdim z _ _ _ hc (by rw [hV i hi]) + +/-- **T1 (class M), full form.** Under the hypotheses of `T1_cost`, with chart `z` holding no X port +and a move chain `A_q → G_p` for every junk pair (JunkM `hpath_of_junk`): +`Σ_{junk pairs} dist_{g9}(A_q → G_p) ≤ public cost`. -/ +theorem T1_full (chart : ℕ → R → C) (mv : ℕ → R → Mv) (n : ℕ) + (hmv : ∀ t i, chart t i < chart (t + 1) i → + N.src (mv t i) = chart t i ∧ N.tgt (mv t i) = chart (t + 1) i) + (hmono : ∀ t i, chart t i ≤ chart (t + 1) i) + (hsurj : ∀ m, ∃ t < n, ∃ i, chart t i < chart (t + 1) i ∧ mv t i = m) + (hinj : ∀ t t' i i', chart t i < chart (t + 1) i → chart t' i' < chart (t' + 1) i' → + mv t i = mv t' i' → t = t' ∧ i = i') + (dim : C → ℕ) (hdim : StrictMono dim) (z : C) (hz0 : dim z = 0) (Ym : Finset R) + (hY : ∀ i ∈ Ym, chart 0 i = z ∧ dim (chart n i) = 8) (hV : ∀ i ∉ Ym, dim (chart n i) = 9) + (hz : ∀ q, ¬ N.inS q z) + (P : Finset (YP × XP)) (path : YP × XP → List Mv) + (hpath : ∀ π ∈ P, N.Chain (N.A π.2) (path π) (N.G π.1)) : + ∑ π ∈ P, N.dist (cg dim) (N.A π.2) (N.G π.1) ≤ ∑ i, hsum fL (if i ∈ Ym then 8 else 9) + ((dim (chart 0 i) : ℝ) :: (movesOf chart mv i n).map fun m => (dim (N.tgt m) : ℝ)) := + N.T1_bound (cg dim) (N.wz dim z) P path hpath (fun _ _ => le_max_right _ _) + (fun m => by unfold wz; split_ifs; exact le_rfl; exact le_max_right _ _) z hz + (fun m hm => by simp [wz, hm]) _ + (N.T1_cost chart mv n hmv hmono hsurj hinj dim hdim z hz0 Ym hY hV) + +end Net + +end T1link + + + +/-! ## T3. Slot lemma (level 7) -/ + +section T3 + +open Module Submodule + +variable {K V Reg D C : Type*} [Field K] [AddCommGroup V] [Module K V] [FiniteDimensional K V] + [DecidableEq Reg] [Fintype D] + +/-- **T3 slot lemma.** Data at level 7 (all T2 outputs are hypotheses): +* `Cr` = crossers of level 7 with crossing rows `ρ μ`, linearly independent (T2(a)); +* `B0` = registers born at chart 0 with tokens `tok b`; `S0 = span tok(B0)`; +* `W ⊆ Cr ∩ B0` = 0-born registers jumping from chart 0 straight to dim 8/9; their crossing rows lie + in `S0` (chart 0 holds only 0-born tokens); `Z = (B0 ∩ Cr) \ W` (0-born, cross after a paid stop); +* `P` fixes every crossing row and kills the tokens of 0-born registers that never cross + (a projection onto span ρ(Cr) along the stayer tokens; it exists because these are complementary, + T2 proof — see `proj_exists`); +* for `p ∈ D`: `y p = Σ_μ A p μ • ρ μ` (T2(b)), where a non-`W` crosser has `A p μ ≠ 0` only if it + lands at `G p` (a level-7 crosser landing `≤ G_p`, dim 8, lands AT `G_p`), and `G` is injective; +* `y p = x p + e p` with `e p ∈ S0` (Y_p's token) and `0 ≠ x p ∈ X`, `X ⊓ S0 = ⊥` (X content and + 0-born tokens are different coordinates). +Then `|D| ≤ rank{x_p} + |Z|`. No directness of the `Y_p`, `p ∈ D`, is needed. -/ +theorem slot_lemma (Cr B0 W : Finset Reg) (hW : W ⊆ B0 ∩ Cr) + (ρ tok : Reg → V) (P : V →ₗ[K] V) + (hind : ∀ g : Reg → K, ∑ μ ∈ Cr, g μ • ρ μ = 0 → ∀ μ ∈ Cr, g μ = 0) + (hPρ : ∀ μ ∈ Cr, P (ρ μ) = ρ μ) + (hPst : ∀ b ∈ B0, b ∉ Cr → P (tok b) = 0) + (hWS0 : ∀ μ ∈ W, ρ μ ∈ span K (tok '' (B0 : Set Reg))) + (land : Reg → C) (G : D → C) (hG : Function.Injective G) + (y x e : D → V) (A : D → Reg → K) + (hT2b : ∀ p, y p = ∑ μ ∈ Cr, A p μ • ρ μ) + (hsupp : ∀ p, ∀ μ ∈ Cr, μ ∉ W → A p μ ≠ 0 → land μ = G p) + (hy : ∀ p, y p = x p + e p) (he : ∀ p, e p ∈ span K (tok '' (B0 : Set Reg))) + (X : Submodule K V) (hx : ∀ p, x p ∈ X) (hXS : X ⊓ span K (tok '' (B0 : Set Reg)) = ⊥) + (hx0 : ∀ p, x p ≠ 0) : + Fintype.card D ≤ finrank K (span K (Set.range x)) + ((B0 ∩ Cr) \ W).card := by + classical + set S0 := span K (tok '' (B0 : Set Reg)) with hS0 + -- step 1: every y p has a non-W crosser in its expansion + have hyW : ∀ p, ∃ μ ∈ Cr, μ ∉ W ∧ A p μ ≠ 0 := by + intro p; by_contra hcon; push Not at hcon + have hyS : y p ∈ S0 := by + rw [hT2b p] + refine Submodule.sum_mem _ fun μ hμ => ?_ + by_cases hμW : μ ∈ W + · exact Submodule.smul_mem _ _ (hWS0 μ hμW) + · rw [hcon μ hμ hμW, zero_smul]; exact Submodule.zero_mem _ + have hxS : x p ∈ S0 := by + have : x p = y p - e p := by rw [hy p]; abel + rw [this]; exact Submodule.sub_mem _ hyS (he p) + have : x p ∈ X ⊓ S0 := ⟨hx p, hxS⟩ + rw [hXS] at this + exact hx0 p ((Submodule.mem_bot K).mp this) + -- step 2: the family (y_p)_{p ∈ D} ⊔ (ρ_h)_{h ∈ W} is linearly independent + let F : D ⊕ W → V := Sum.elim y (fun h => ρ h) + have hF : LinearIndependent K F := by + rw [Fintype.linearIndependent_iff] + intro g hg + let gW : Reg → K := fun μ => if hμ : μ ∈ W then g (Sum.inr ⟨μ, hμ⟩) else 0 + let coef : Reg → K := fun μ => (∑ p, g (Sum.inl p) * A p μ) + gW μ + have hW' : ∑ h : W, g (Sum.inr h) • ρ h = ∑ μ ∈ Cr, gW μ • ρ μ := by + rw [← Finset.sum_subset (fun μ hμ => (mem_inter.mp (hW hμ)).2) + (fun μ _ hμ => by simp [gW, hμ])] + rw [← Finset.sum_attach W] + refine Finset.sum_congr rfl fun h _ => ?_ + simp [gW, h.2] + have hsum : ∑ μ ∈ Cr, coef μ • ρ μ = 0 := by + rw [← hg, Fintype.sum_sum_type] + simp only [F, Sum.elim_inl, Sum.elim_inr, hT2b, Finset.smul_sum, smul_smul, coef, add_smul, + Finset.sum_add_distrib, Finset.sum_smul] + rw [hW', Finset.sum_comm] + have hc := hind coef hsum + -- non-W crossers: only one p contributes + have hone : ∀ μ ∈ Cr, μ ∉ W → ∀ p, g (Sum.inl p) * A p μ = 0 := by + intro μ hμ hμW p + have h0 : coef μ = 0 := hc μ hμ + simp only [coef, gW, hμW, dite_false, add_zero] at h0 + by_cases hA2 : A p μ = 0 + · simp [hA2] + rw [Finset.sum_eq_single p] at h0 + · exact h0 + · intro p' _ hp' + by_cases hA : A p' μ = 0 + · simp [hA] + exact absurd (hG ((hsupp p' μ hμ hμW hA).symm.trans (hsupp p μ hμ hμW hA2))) hp' + · simp + have hD0 : ∀ p, g (Sum.inl p) = 0 := by + intro p + obtain ⟨μ, hμ, hμW, hA⟩ := hyW p + exact (mul_eq_zero.mp (hone μ hμ hμW p)).resolve_right hA + rintro (p | ⟨μ, hμW⟩) + · exact hD0 p + · have h0 : coef μ = 0 := hc μ (mem_inter.mp (hW hμW)).2 + simp only [coef, gW, hμW, dite_true, hD0, zero_mul, Finset.sum_const_zero, zero_add] at h0 + exact h0 + -- step 3: the family lies in span(P x) ⊔ E + let E : Submodule K V := span K (((B0 ∩ Cr).image fun b => P (tok b) : Finset V) : Set V) + have hPS0 : ∀ v ∈ S0, P v ∈ E := by + have : S0.map P ≤ E := by + rw [hS0, Submodule.map_span, Submodule.span_le] + rintro _ ⟨_, ⟨b, hb, rfl⟩, rfl⟩ + by_cases hbC : b ∈ Cr + · exact Submodule.subset_span (by simp only [coe_image, coe_inter]; exact ⟨b, ⟨hb, hbC⟩, rfl⟩) + · simp only [SetLike.mem_coe]; rw [hPst b hb hbC]; exact Submodule.zero_mem _ + exact fun v hv => this (Submodule.mem_map_of_mem hv) + set Sx := span K (Set.range fun p => P (x p)) + have hrange : Set.range F ⊆ (Sx ⊔ E : Submodule K V) := by + rintro _ ⟨i, rfl⟩ + rcases i with p | ⟨μ, hμW⟩ + · have hPy : P (y p) = y p := by + rw [hT2b p, map_sum] + exact Finset.sum_congr rfl fun μ hμ => by rw [map_smul, hPρ μ hμ] + show y p ∈ Sx ⊔ E + rw [← hPy, hy p, map_add] + exact Submodule.add_mem _ (Submodule.mem_sup_left (Submodule.subset_span ⟨p, rfl⟩)) + (Submodule.mem_sup_right (hPS0 _ (he p))) + · show ρ μ ∈ Sx ⊔ E + rw [← hPρ μ (mem_inter.mp (hW hμW)).2] + exact Submodule.mem_sup_right (hPS0 _ (hWS0 μ hμW)) + -- step 4: count + have h1 : Fintype.card (D ⊕ W) ≤ finrank K (Sx ⊔ E : Submodule K V) := by + rw [← finrank_span_eq_card hF] + exact Submodule.finrank_mono (Submodule.span_le.mpr hrange) + have h2 := Submodule.finrank_add_le_finrank_add_finrank Sx E + have h3 : finrank K Sx ≤ finrank K (span K (Set.range x)) := by + have : Sx = (span K (Set.range x)).map P := by + rw [Submodule.map_span, ← Set.range_comp]; rfl + rw [this]; exact Submodule.finrank_map_le _ _ + have h4 : finrank K E ≤ (B0 ∩ Cr).card := + (finrank_span_finset_le_card _).trans Finset.card_image_le + have h5 : (B0 ∩ Cr).card = W.card + ((B0 ∩ Cr) \ W).card := by + rw [add_comm, Finset.card_sdiff_add_card_eq_card hW] + rw [Fintype.card_sum, Fintype.card_coe] at h1 + omega + +/-- the projection `P` of T3 exists whenever the crossing span and the stayer-token span are +complementary (T2's proof gives exactly this). -/ +theorem proj_exists (R Q : Submodule K V) (hRQ : IsCompl R Q) : + ∃ P : V →ₗ[K] V, (∀ v ∈ R, P v = v) ∧ (∀ v ∈ Q, P v = 0) := by + refine ⟨R.subtype ∘ₗ Submodule.projectionOnto R Q hRQ, fun v hv => ?_, fun v hv => ?_⟩ + · simp [Submodule.projectionOnto_apply_of_mem_left hRQ hv] + · simp [Submodule.projectionOnto_apply_of_mem_right hRQ hv] + +end T3 + +/-! ## T2. Crossing-basis lemma (complementarity), from the level-k op semantics -/ + +section T2 + +open Module Submodule + +/-- dimension count: if `a ⊔ b = ⊤`, `dim a ≤ m`, `dim b ≤ n` and `dim V = m + n`, then `a`, `b` +are complementary and both bounds are equalities. -/ +lemma compl_of_sup {K V : Type*} [Field K] [AddCommGroup V] [Module K V] [FiniteDimensional K V] + (a b : Submodule K V) (m n : ℕ) (hsup : a ⊔ b = ⊤) (ha : finrank K a ≤ m) (hb : finrank K b ≤ n) + (hV : finrank K V = m + n) : IsCompl a b ∧ finrank K a = m ∧ finrank K b = n := by + have h := Submodule.finrank_sup_add_finrank_inf_eq a b + rw [hsup, finrank_top, hV] at h + have h0 : finrank K (a ⊓ b : Submodule K V) = 0 := by omega + refine ⟨⟨disjoint_iff.mpr (Submodule.finrank_eq_zero.mp h0), codisjoint_iff.mpr hsup⟩, by omega, + by omega⟩ + +lemma finrank_span_image_le {K V ι : Type*} [Field K] [AddCommGroup V] [Module K V] + (s : Finset ι) (f : ι → V) : finrank K (span K (f '' (s : Set ι))) ≤ s.card := by + classical + rw [← Finset.coe_image]; exact (finrank_span_finset_le_card _).trans Finset.card_image_le + +variable {K Reg : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] + +/-- ops seen at level `k`: an ADD `row_i += c·row_j` (co-present, so on the same side of level `k`), +or register `i` crossing level `k` (its first move from dim `≤ k` to dim `> k`). Moves that do not +cross level `k` change neither rows nor sides, so they are omitted. -/ +inductive LOp (K Reg : Type*) + | add (i j : Reg) (c : K) + | cross (i : Reg) + +/-- rows (initial-row coordinates), registers above level `k`, crossers so far, crossing rows. -/ +structure LSt (K Reg : Type*) where + row : Reg → Reg → K + ab : Finset Reg + cr : Finset Reg + rho : Reg → Reg → K + +def lstep : LSt K Reg → LOp K Reg → LSt K Reg + | s, .add i j c => ⟨Function.update s.row i (s.row i + c • s.row j), s.ab, s.cr, s.rho⟩ + | s, .cross i => ⟨s.row, insert i s.ab, insert i s.cr, Function.update s.rho i (s.row i)⟩ + +def lrun : LSt K Reg → List (LOp K Reg) → LSt K Reg + | s, [] => s + | s, op :: ops => lrun (lstep s op) ops + +/-- legality: an ADD has `i ≠ j` (an invertible public op) and both registers on the same side of +level `k` (co-presence at one chart); a crossing register is still at dim `≤ k`. -/ +def LLegal : LSt K Reg → List (LOp K Reg) → Prop + | _, [] => True + | s, .add i j c :: ops => (i ≠ j ∧ (i ∈ s.ab ↔ j ∈ s.ab)) ∧ LLegal (lstep s (.add i j c)) ops + | s, .cross i :: ops => i ∉ s.ab ∧ LLegal (lstep s (.cross i)) ops + +/-- time 0: every register holds its own token; `B` = registers born at dim `≤ k`, the rest are +above level `k` already. -/ +def lstart (B : Finset Reg) : LSt K Reg := ⟨fun r => Pi.single r 1, univ \ B, ∅, fun _ => 0⟩ + +/-- the run invariant (for any linear `L` that kills the tokens of registers born above `k`). -/ +structure LInv {W : Type*} [AddCommGroup W] [Module K W] (B : Finset Reg) (L : (Reg → K) →ₗ[K] W) + (s : LSt K Reg) : Prop where + crB : s.cr ⊆ B + ab_iff : ∀ r, r ∈ s.ab ↔ (r ∉ B ∨ r ∈ s.cr) + up : ∀ r ∈ s.ab, L (s.row r) ∈ span K ((fun μ => L (s.rho μ)) '' (s.cr : Set Reg)) + top : span K (Set.range s.row) = ⊤ + +lemma linv_start {W : Type*} [AddCommGroup W] [Module K W] (B : Finset Reg) + (L : (Reg → K) →ₗ[K] W) (hL : ∀ r, r ∉ B → L (Pi.single r 1) = 0) : + LInv B L (lstart (K := K) B) where + crB := by simp [lstart] + ab_iff := by intro r; simp [lstart] + up := by + intro r hr + simp only [lstart, mem_sdiff, mem_univ, true_and] at hr + simp only [lstart]; rw [hL r hr]; exact Submodule.zero_mem _ + top := by + have : Set.range (fun r : Reg => (Pi.single r (1 : K) : Reg → K)) = + Set.range (Pi.basisFun K Reg) := by + congr 1; funext r; simp + simp only [lstart]; rw [this]; exact (Pi.basisFun K Reg).span_eq + +lemma linv_step {W : Type*} [AddCommGroup W] [Module K W] (B : Finset Reg) + (L : (Reg → K) →ₗ[K] W) (s : LSt K Reg) (op : LOp K Reg) (hI : LInv B L s) + (hop : match op with + | .add i j _ => i ≠ j ∧ (i ∈ s.ab ↔ j ∈ s.ab) + | .cross i => i ∉ s.ab) : + LInv B L (lstep s op) := by + cases op with + | add i j c => + obtain ⟨hij, hside⟩ := hop + refine ⟨hI.crB, hI.ab_iff, ?_, ?_⟩ + · intro r hr + simp only [lstep] at hr ⊢ + by_cases hri : r = i + · subst hri + rw [Function.update_self, map_add, map_smul] + exact Submodule.add_mem _ (hI.up r hr) (Submodule.smul_mem _ _ (hI.up j (hside.mp hr))) + · rw [Function.update_of_ne hri]; exact hI.up r hr + · rw [eq_top_iff, ← hI.top, Submodule.span_le] + rintro _ ⟨r, rfl⟩ + simp only [lstep] + set u := Function.update s.row i (s.row i + c • s.row j) with hu + by_cases hri : r = i + · subst hri + have e1 : s.row r = u r - c • u j := by + rw [hu, Function.update_self, Function.update_of_ne (Ne.symm hij)]; abel + rw [e1] + exact Submodule.sub_mem _ (Submodule.subset_span ⟨r, rfl⟩) + (Submodule.smul_mem _ _ (Submodule.subset_span ⟨j, rfl⟩)) + · have : s.row r = u r := by + rw [hu, Function.update_of_ne hri] + rw [this]; exact Submodule.subset_span ⟨r, rfl⟩ + | cross i => + have hiB : i ∈ B := by + by_contra h; exact hop ((hI.ab_iff i).mpr (Or.inl h)) + have hicr : i ∉ s.cr := fun h => hop ((hI.ab_iff i).mpr (Or.inr h)) + have hmono : span K ((fun μ => L (s.rho μ)) '' (s.cr : Set Reg)) ≤ + span K ((fun μ => L (Function.update s.rho i (s.row i) μ)) '' ((insert i s.cr : Finset Reg) : Set Reg)) := by + apply Submodule.span_mono + rintro _ ⟨μ, hμ, rfl⟩ + have hμi : μ ≠ i := fun e => hicr (e ▸ hμ) + refine ⟨μ, by simp [hμ], ?_⟩ + simp [Function.update_of_ne hμi] + refine ⟨?_, ?_, ?_, hI.top⟩ + · simp only [lstep]; exact Finset.insert_subset hiB hI.crB + · intro r; simp only [lstep, mem_insert] + rw [hI.ab_iff r]; tauto + · intro r hr + simp only [lstep, mem_insert] at hr ⊢ + rcases hr with rfl | hr + · apply Submodule.subset_span + exact ⟨r, by simp, by simp⟩ + · exact hmono (hI.up r hr) + +lemma linv_run {W : Type*} [AddCommGroup W] [Module K W] (B : Finset Reg) + (L : (Reg → K) →ₗ[K] W) : ∀ (s : LSt K Reg) (ops : List (LOp K Reg)), + LInv B L s → LLegal s ops → LInv B L (lrun s ops) + | s, [], hI, _ => hI + | s, .add i j c :: ops, hI, ⟨h, hL⟩ => linv_run B L _ ops (linv_step B L s _ hI h) hL + | s, .cross i :: ops, hI, ⟨h, hL⟩ => linv_run B L _ ops (linv_step B L s _ hI h) hL + +/-- restriction to the coordinates of registers born at dim `≤ k`. -/ +def resB (B : Finset Reg) : (Reg → K) →ₗ[K] (B → K) := LinearMap.funLeft K K (Subtype.val) + +lemma resB_single (B : Finset Reg) (r : Reg) (hr : r ∉ B) : resB B (Pi.single r (1 : K)) = 0 := by + funext b + have : (b : Reg) ≠ r := fun e => hr (e ▸ b.2) + simp [resB, LinearMap.funLeft_apply, Pi.single_apply, this] + +/-- **T2 (crossing-basis lemma), from the op semantics.** Run legal level-`k` ops from time 0 +(`B` = registers born at dim `≤ k`). Class-N hypothesis: every stayer (born `≤ k`, never crosses) +ends as its own token. Restrict rows to the coordinates of `B` (`resB`). Then +* `cr ⊆ B`; +* (complementarity) the crossing rows and the stayer tokens span complementary subspaces of `B → K`; +* (T2(a)) the crossing rows are linearly independent; +* (T2(b), existence) every register above level `k` at the end (born above, or crossed) has its + restricted final row in the span of the crossing rows. -/ +theorem T2_run (B : Finset Reg) (ops : List (LOp K Reg)) (hL : LLegal (lstart B) ops) + (hst : ∀ r ∈ B, r ∉ (lrun (lstart B) ops).cr → (lrun (lstart B) ops).row r = Pi.single r 1) : + (lrun (lstart (K := K) B) ops).cr ⊆ B ∧ + IsCompl (span K ((fun μ => resB B ((lrun (lstart B) ops).rho μ)) '' ((lrun (lstart B) ops).cr : Set Reg))) + (span K ((fun b => resB B (Pi.single b (1 : K))) '' ((B \ (lrun (lstart B) ops).cr : Finset Reg) : Set Reg))) ∧ + LinearIndependent K (fun μ : (lrun (lstart (K := K) B) ops).cr => resB B ((lrun (lstart B) ops).rho μ)) ∧ + (∀ r, r ∉ B ∨ r ∈ (lrun (lstart (K := K) B) ops).cr → + resB B ((lrun (lstart B) ops).row r) ∈ + span K ((fun μ => resB B ((lrun (lstart B) ops).rho μ)) '' ((lrun (lstart B) ops).cr : Set Reg))) := by + classical + set s := lrun (lstart (K := K) B) ops + have hI : LInv B (resB B) s := linv_run B (resB B) _ ops (linv_start B _ (resB_single B)) hL + set a := span K ((fun μ => resB B (s.rho μ)) '' (s.cr : Set Reg)) + set b := span K ((fun b => resB B (Pi.single b (1 : K))) '' ((B \ s.cr : Finset Reg) : Set Reg)) + have hsup : a ⊔ b = ⊤ := by + have hsurj : Function.Surjective (resB (K := K) B) := + LinearMap.funLeft_surjective_of_injective _ _ _ Subtype.val_injective + rw [eq_top_iff, ← LinearMap.range_eq_top.mpr hsurj, LinearMap.range_eq_map, ← hI.top, + Submodule.map_span, Submodule.span_le] + rintro _ ⟨_, ⟨r, rfl⟩, rfl⟩ + by_cases hr : r ∈ s.ab + · exact Submodule.mem_sup_left (hI.up r hr) + · have hrB : r ∈ B := by by_contra h; exact hr ((hI.ab_iff r).mpr (Or.inl h)) + have hrc : r ∉ s.cr := fun h => hr ((hI.ab_iff r).mpr (Or.inr h)) + apply Submodule.mem_sup_right + rw [hst r hrB hrc] + exact Submodule.subset_span ⟨r, by simp [hrB, hrc], rfl⟩ + have ha : finrank K a ≤ s.cr.card := finrank_span_image_le _ _ + have hb : finrank K b ≤ (B \ s.cr).card := finrank_span_image_le _ _ + have hV : finrank K (B → K) = s.cr.card + (B \ s.cr).card := by + rw [Module.finrank_fintype_fun_eq_card, Fintype.card_coe, add_comm, + Finset.card_sdiff_add_card_eq_card hI.crB] + obtain ⟨hc, hfa, -⟩ := compl_of_sup a b _ _ hsup ha hb hV + refine ⟨hI.crB, hc, ?_, fun r hr => hI.up r ((hI.ab_iff r).mpr hr)⟩ + rw [linearIndependent_iff_card_eq_finrank_span, Set.finrank] + have : Set.range (fun μ : s.cr => resB B (s.rho μ)) = (fun μ => resB B (s.rho μ)) '' (s.cr : Set Reg) := by + ext v; simp + rw [this, Fintype.card_coe]; exact hfa.symm + +end T2 + +/-! ### T3 with T2 discharged -/ + +section T3T2 + +open Module Submodule + +/-- **T3 with the complementarity discharged.** `slot_lemma` with its T2 hypotheses (independence of +the crossing rows, and the projection `P`) replaced by the T2 data: the crossing rows `ρ(Cr)` and the +stayer tokens `tok(St)` span `V`, `dim V = |Cr| + |St|`, and every 0-born non-crosser is a stayer. +(`T2_run` derives exactly this from the op semantics, with `V = B → K`.) -/ +theorem slot_lemma_T2 {K V Reg D C : Type*} [Field K] [AddCommGroup V] [Module K V] + [FiniteDimensional K V] [DecidableEq Reg] [Fintype D] + (Cr B0 W St : Finset Reg) (hW : W ⊆ B0 ∩ Cr) (ρ tok : Reg → V) + (hsup : span K (ρ '' (Cr : Set Reg)) ⊔ span K (tok '' (St : Set Reg)) = ⊤) + (hdim : finrank K V = Cr.card + St.card) + (hSt : ∀ b ∈ B0, b ∉ Cr → b ∈ St) + (hWS0 : ∀ μ ∈ W, ρ μ ∈ span K (tok '' (B0 : Set Reg))) + (land : Reg → C) (G : D → C) (hG : Function.Injective G) + (y x e : D → V) (A : D → Reg → K) + (hT2b : ∀ p, y p = ∑ μ ∈ Cr, A p μ • ρ μ) + (hsupp : ∀ p, ∀ μ ∈ Cr, μ ∉ W → A p μ ≠ 0 → land μ = G p) + (hy : ∀ p, y p = x p + e p) (he : ∀ p, e p ∈ span K (tok '' (B0 : Set Reg))) + (X : Submodule K V) (hx : ∀ p, x p ∈ X) (hXS : X ⊓ span K (tok '' (B0 : Set Reg)) = ⊥) + (hx0 : ∀ p, x p ≠ 0) : + Fintype.card D ≤ finrank K (span K (Set.range x)) + ((B0 ∩ Cr) \ W).card := by + obtain ⟨hc, hfa, -⟩ := compl_of_sup _ _ _ _ hsup (finrank_span_image_le _ _) + (finrank_span_image_le _ _) hdim + obtain ⟨P, hP1, hP2⟩ := proj_exists _ _ hc + have hli : LinearIndependent K (fun μ : Cr => ρ μ) := by + rw [linearIndependent_iff_card_eq_finrank_span, Set.finrank] + have : Set.range (fun μ : Cr => ρ μ) = ρ '' (Cr : Set Reg) := by ext v; simp + rw [this, Fintype.card_coe]; exact hfa.symm + refine slot_lemma Cr B0 W hW ρ tok P ?_ (fun μ hμ => hP1 _ (subset_span ⟨μ, hμ, rfl⟩)) + (fun b hb hbC => hP2 _ (subset_span ⟨b, hSt b hb hbC, rfl⟩)) hWS0 land G hG y x e A hT2b hsupp + hy he X hx hXS hx0 + intro g hg μ hμ + have := Fintype.linearIndependent_iff.mp hli (fun μ => g μ) + (by rw [Finset.sum_coe_sort Cr (fun μ => g μ • ρ μ)]; exact hg) + exact this ⟨μ, hμ⟩ + +/-- **T3 from the op semantics.** Level-7 run (`T2_run`): `B` = registers born at dim `≤ 7`, `B0 ⊆ B` +the 0-born ones, stayers end as their own tokens (class N). In `V = B → K` with crossing rows +`resB(ρ_μ)` and tokens `resB(e_b)`, the slot bound holds with only T2(b)'s coefficient/support data, +the W/S0 facts and the X/S0 split left as hypotheses. -/ +theorem slot_lemma_run {K Reg D C : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] [Fintype D] + (B B0 W : Finset Reg) (hB0 : B0 ⊆ B) (ops : List (LOp K Reg)) (hL : LLegal (lstart B) ops) + (hst : ∀ r ∈ B, r ∉ (lrun (lstart B) ops).cr → (lrun (lstart B) ops).row r = Pi.single r 1) + (hW : W ⊆ B0 ∩ (lrun (lstart (K := K) B) ops).cr) + (hWS0 : ∀ μ ∈ W, resB B ((lrun (lstart B) ops).rho μ) ∈ + span K ((fun b => resB B (Pi.single b (1 : K))) '' (B0 : Set Reg))) + (land : Reg → C) (G : D → C) (hG : Function.Injective G) + (y x e : D → (B → K)) (A : D → Reg → K) + (hT2b : ∀ p, y p = ∑ μ ∈ (lrun (lstart (K := K) B) ops).cr, + A p μ • resB B ((lrun (lstart B) ops).rho μ)) + (hsupp : ∀ p, ∀ μ ∈ (lrun (lstart (K := K) B) ops).cr, μ ∉ W → A p μ ≠ 0 → land μ = G p) + (hy : ∀ p, y p = x p + e p) + (he : ∀ p, e p ∈ span K ((fun b => resB B (Pi.single b (1 : K))) '' (B0 : Set Reg))) + (X : Submodule K (B → K)) (hx : ∀ p, x p ∈ X) + (hXS : X ⊓ span K ((fun b => resB B (Pi.single b (1 : K))) '' (B0 : Set Reg)) = ⊥) + (hx0 : ∀ p, x p ≠ 0) : + Fintype.card D ≤ finrank K (span K (Set.range x)) + + ((B0 ∩ (lrun (lstart (K := K) B) ops).cr) \ W).card := by + obtain ⟨hcrB, hc, -, -⟩ := T2_run B ops hL hst + set s := lrun (lstart (K := K) B) ops + refine slot_lemma_T2 s.cr B0 W (B \ s.cr) hW (fun μ => resB B (s.rho μ)) + (fun b => resB B (Pi.single b (1 : K))) hc.sup_eq_top ?_ ?_ hWS0 land G hG y x e A hT2b hsupp + hy he X hx hXS hx0 + · rw [Module.finrank_fintype_fun_eq_card, Fintype.card_coe, add_comm, + Finset.card_sdiff_add_card_eq_card hcrB] + · intro b hb hbC; exact Finset.mem_sdiff.mpr ⟨hB0 hb, hbC⟩ + +end T3T2 + + +/-! ## T4. Departer law, corrected scope (all arrivals, owned included) -/ + +section T4 + +open Module Submodule + +variable {K Reg : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] + +/-- events at ONE chart `c`, in time order: a register arrives with a row, a register is born at +`c` (row = its own token), an ADD `row_i += k·row_j`, or a register departs (moves up). -/ +inductive Ev (K Reg : Type*) + | arrive (i : Reg) (v : Reg → K) + | born (b : Reg) + | add (i j : Reg) (k : K) + | depart (i : Reg) + +/-- rows (initial-row coordinates `Reg → K`) and the set of registers present at `c`. -/ +structure St (K Reg : Type*) where + row : Reg → Reg → K + pres : Finset Reg + +def step : St K Reg → Ev K Reg → St K Reg + | s, .arrive i v => ⟨Function.update s.row i v, insert i s.pres⟩ + | s, .born b => ⟨Function.update s.row b (Pi.single b 1), insert b s.pres⟩ + | s, .add i j k => ⟨Function.update s.row i (s.row i + k • s.row j), s.pres⟩ + | s, .depart i => ⟨s.row, s.pres.erase i⟩ + +def run : St K Reg → List (Ev K Reg) → St K Reg + | s, [] => s + | s, ev :: evs => run (step s ev) evs + +/-- an ADD at `c` only reads and writes registers present at `c` (owned ones included: they are +registers like any other and must ARRIVE or be BORN at `c` to be present). -/ +def Legal : St K Reg → List (Ev K Reg) → Prop + | _, [] => True + | s, .add i j k :: evs => (i ∈ s.pres ∧ j ∈ s.pres) ∧ Legal (step s (.add i j k)) evs + | s, ev :: evs => Legal (step s ev) evs + +/-- invariant: every present row lies in `N` as long as all arrival rows and born tokens do. -/ +lemma run_inv (N : Submodule K (Reg → K)) : + ∀ (s : St K Reg) (evs : List (Ev K Reg)), Legal s evs → + (∀ i ∈ s.pres, s.row i ∈ N) → + (∀ i v, Ev.arrive i v ∈ evs → v ∈ N) → (∀ b, Ev.born b ∈ evs → Pi.single b 1 ∈ N) → + ∀ i ∈ (run s evs).pres, (run s evs).row i ∈ N + | s, [], _, hs, _, _ => hs + | s, ev :: evs, hL, hs, harr, hborn => by + have harr' : ∀ i v, Ev.arrive i v ∈ evs → v ∈ N := fun i v h => harr i v (by simp [h]) + have hborn' : ∀ b, Ev.born b ∈ evs → Pi.single b 1 ∈ N := fun b h => hborn b (by simp [h]) + cases ev with + | arrive i v => + refine run_inv N _ evs hL ?_ harr' hborn' + intro r hr + simp only [step, mem_insert] at hr ⊢ + by_cases hri : r = i + · subst hri; simp only [Function.update_self]; exact harr r v (by simp) + · rw [Function.update_of_ne hri]; exact hs r (hr.resolve_left hri) + | born b => + refine run_inv N _ evs hL ?_ harr' hborn' + intro r hr + simp only [step, mem_insert] at hr ⊢ + by_cases hrb : r = b + · subst hrb; simp only [Function.update_self]; exact hborn r (by simp) + · rw [Function.update_of_ne hrb]; exact hs r (hr.resolve_left hrb) + | add i j k => + obtain ⟨⟨hi, hj⟩, hL⟩ := hL + refine run_inv N _ evs hL ?_ harr' hborn' + intro r hr + simp only [step] at hr ⊢ + by_cases hri : r = i + · subst hri; simp only [Function.update_self] + exact N.add_mem (hs r hi) (N.smul_mem k (hs j hj)) + · rw [Function.update_of_ne hri]; exact hs r hr + | depart i => + refine run_inv N _ evs hL ?_ harr' hborn' + intro r hr + simp only [step, mem_erase] at hr ⊢ + exact hs r hr.2 + +/-- the c-born coordinates can be stripped: if `v ∈ span S ⊔ span tok(Born)`, every generator in +`S` vanishes on `Born`, and `v` vanishes on `Born`, then `v ∈ span S`. -/ +lemma strip_born (S : Set (Reg → K)) (Born : Finset Reg) (hS : ∀ u ∈ S, ∀ b ∈ Born, u b = 0) + (v : Reg → K) (hv : v ∈ span K S ⊔ span K ((fun b => Pi.single b (1 : K)) '' (Born : Set Reg))) + (hvB : ∀ b ∈ Born, v b = 0) : v ∈ span K S := by + let L : (Reg → K) →ₗ[K] (Reg → K) := + LinearMap.pi fun r => if r ∈ Born then LinearMap.proj r else 0 + have hL : ∀ u r, L u r = if r ∈ Born then u r else 0 := by + intro u r; by_cases hr : r ∈ Born <;> simp [L, hr] + have hA : span K S ≤ LinearMap.ker L := by + rw [Submodule.span_le]; intro u hu + simp only [SetLike.mem_coe, LinearMap.mem_ker]; funext r + rw [hL]; split_ifs with hr + · exact hS u hu r hr + · rfl + have hT : span K ((fun b => Pi.single b (1 : K)) '' (Born : Set Reg)) ≤ LinearMap.eqLocus L LinearMap.id := by + rw [Submodule.span_le]; rintro _ ⟨b, hb, rfl⟩ + simp only [SetLike.mem_coe, LinearMap.mem_eqLocus, LinearMap.id_coe, id_eq]; funext r + rw [hL]; split_ifs with hr + · rfl + · have : r ≠ b := fun h => hr (h ▸ hb) + simp [Pi.single_apply, this] + obtain ⟨a, ha, t, ht, rfl⟩ := Submodule.mem_sup.mp hv + have hLv : L (a + t) = 0 := by + funext r; rw [hL]; split_ifs with hr + · exact hvB r hr + · rfl + have hLa : L a = 0 := hA ha + have hLt : L t = t := LinearMap.mem_eqLocus.mp (hT ht) + rw [map_add, hLa, zero_add, hLt] at hLv + rw [hLv, add_zero]; exact ha + +/-- **T4 (departer law), corrected scope.** One chart `c ≠ V` with its event list `evs` (legal, from +the empty state). Arrivals `Arr = Pub ∪ Own` (public and OWNED registers arriving at `c`, disjoint), +arrival rows `arrRow`, which carry no `c`-born coordinates; `Born` = registers born at `c`, disjoint +from `Arr`. Class N: a public register still at `c` at the end (an ender), other than a Y main in +`Ey`, has final row = its own token, and `π` kills that token. Then +`dim π(Arr_c) ≤ #public departers + #owned arrivals + #Y enders`. -/ +theorem T4_departer (π : (Reg → K) →ₗ[K] (Reg → K)) (evs : List (Ev K Reg)) + (Pub Own Born Ey : Finset Reg) (arrRow : Reg → Reg → K) + (hL : Legal ⟨fun _ => 0, ∅⟩ evs) + (harr : ∀ i v, Ev.arrive i v ∈ evs → (i ∈ Pub ∪ Own) ∧ v = arrRow i) + (hborn : ∀ b, Ev.born b ∈ evs → b ∈ Born) + (hPO : Disjoint Pub Own) (hAB : Disjoint (Pub ∪ Own) Born) + (hrowB : ∀ i ∈ Pub ∪ Own, ∀ b ∈ Born, arrRow i b = 0) + (hfinal : ∀ h ∈ Pub, h ∈ (run ⟨fun _ => 0, ∅⟩ evs).pres → h ∉ Ey → + (run ⟨fun _ => 0, ∅⟩ evs).row h = Pi.single h 1) + (hπ : ∀ h ∈ Pub, h ∉ Ey → π (Pi.single h 1) = 0) : + finrank K ((span K (arrRow '' ((Pub ∪ Own : Finset Reg) : Set Reg))).map π) ≤ + (Pub.filter fun h => h ∉ (run ⟨fun _ => 0, ∅⟩ evs).pres).card + Own.card + Ey.card := by + classical + set sf := run ⟨fun _ => 0, ∅⟩ evs + set Arr := Pub ∪ Own + set A := span K (arrRow '' (Arr : Set Reg)) + set Etok := (Pub.filter fun h => h ∈ sf.pres) \ Ey + -- enders' tokens lie in A + have hEA : ∀ h ∈ Etok, (Pi.single h (1 : K) : Reg → K) ∈ A := by + intro h hh + simp only [Etok, mem_sdiff, mem_filter] at hh + have hM := run_inv (A ⊔ span K ((fun b => Pi.single b (1 : K)) '' (Born : Set Reg))) + ⟨fun _ => 0, ∅⟩ evs hL (by simp) + (fun i v hv => by + obtain ⟨hi, rfl⟩ := harr i v hv + exact Submodule.mem_sup_left (Submodule.subset_span ⟨i, hi, rfl⟩)) + (fun b hb => Submodule.mem_sup_right (Submodule.subset_span ⟨b, hborn b hb, rfl⟩)) + h hh.1.2 + rw [hfinal h hh.1.1 hh.1.2 hh.2] at hM + refine strip_born _ Born ?_ _ hM ?_ + · rintro _ ⟨i, hi, rfl⟩ b hb; exact hrowB i hi b hb + · intro b hb + have : h ≠ b := fun e => Finset.disjoint_left.mp hAB (mem_union_left _ hh.1.1) (e ▸ hb) + simp [Pi.single_apply, Ne.symm this] + -- rank–nullity on π restricted to A + let f := π.domRestrict A + have hrn := LinearMap.finrank_range_add_finrank_ker f + have hrange : LinearMap.range f = A.map π := LinearMap.range_domRestrict A π + -- Etok tokens are independent inside ker f + have hker : Etok.card ≤ finrank K (LinearMap.ker f) := by + let g : Etok → LinearMap.ker f := fun h => + ⟨⟨Pi.single h.1 1, hEA h.1 h.2⟩, by + have hh := h.2 + simp only [Etok, mem_sdiff, mem_filter] at hh + simp [f, hπ h.1 hh.1.1 hh.2]⟩ + have hli : LinearIndependent K g := by + apply LinearIndependent.of_comp ((LinearMap.ker f).subtype) + apply LinearIndependent.of_comp A.subtype + have e : (⇑A.subtype ∘ ⇑(LinearMap.ker f).subtype ∘ g) = fun h : Etok => Pi.single h.1 (1 : K) := by + funext h; rfl + rw [e] + have hb := (Pi.basisFun K Reg).linearIndependent + have : (fun h : Etok => Pi.single h.1 (1 : K)) = (Pi.basisFun K Reg) ∘ Subtype.val := by + funext h; simp + rw [this]; exact hb.comp _ Subtype.val_injective + simpa using hli.fintype_card_le_finrank + have hAc : finrank K A ≤ Arr.card := by + have : (arrRow '' (Arr : Set Reg)) = ((Arr.image arrRow : Finset (Reg → K)) : Set (Reg → K)) := by + simp + rw [show A = span K (arrRow '' (Arr : Set Reg)) from rfl, this] + exact (finrank_span_finset_le_card _).trans Finset.card_image_le + have hArr : Arr.card = Pub.card + Own.card := Finset.card_union_of_disjoint hPO + have hPub : Pub.card = (Pub.filter fun h => h ∉ sf.pres).card + (Pub.filter fun h => h ∈ sf.pres).card := by + rw [add_comm]; exact (Finset.card_filter_add_card_filter_not _).symm + have hEt : (Pub.filter fun h => h ∈ sf.pres).card ≤ Etok.card + Ey.card := by + calc _ ≤ (Etok ∪ Ey).card := by + apply card_le_card; intro h hh + by_cases hy : h ∈ Ey + · exact mem_union_right _ hy + · exact mem_union_left _ (mem_sdiff.mpr ⟨hh, hy⟩) + _ ≤ _ := card_union_le _ _ + rw [← hrange] + have : finrank K A = finrank K (LinearMap.range f) + finrank K (LinearMap.ker f) := hrn.symm + omega + +/-- T4 for the public arrival span: it sits inside the all-arrivals span, so the same right-hand +side (with the owned-arrival term) bounds it. Without `Own.card` it is false (`T4_public_only_false`). -/ +theorem T4_public (π : (Reg → K) →ₗ[K] (Reg → K)) (Pub Own : Finset Reg) (arrRow : Reg → Reg → K) : + finrank K ((span K (arrRow '' (Pub : Set Reg))).map π) ≤ + finrank K ((span K (arrRow '' ((Pub ∪ Own : Finset Reg) : Set Reg))).map π) := + Submodule.finrank_mono (Submodule.map_mono (Submodule.span_mono + (Set.image_mono (by simp)))) + +/-- each departer's move into `c` is not its final move, so it costs `h_e(a, dim c)` with +`dim c + 1 ≤ e`, which is `≥ κ = f(2)` (`kappa_le`). Re-export for T4. -/ +theorem T4_stop_cost (e a b : ℝ) (hab : 1 ≤ b - a) (hbe : 1 ≤ e - b) : fL 2 ≤ h fL e a b := + kappa_le e a b hab hbe + +/-- the public-arrivals-only version of T4 is FALSE in this model (GAPMAP scope finding: owned +register 1502 ADDs X content into Y main 213 at charts 593–595, 597). Registers `0` = public `h`, +`1` = owned `o`, `2` = X coordinate. `h` arrives with `e_h + e_x`, `o` arrives with `-e_x`, then +`h += o`: `h` ends at `c` as its own token (class N) and π kills it, yet the public arrival span has +`dim π = 1 > 0 = #public departers + #Y enders`. Counting the owned arrival (`T4_departer`) fixes it. -/ +theorem T4_public_only_false : + let π : (Fin 3 → ℚ) →ₗ[ℚ] (Fin 3 → ℚ) := (LinearMap.single ℚ (fun _ => ℚ) 2) ∘ₗ LinearMap.proj 2 + let evs : List (Ev ℚ (Fin 3)) := + [.arrive 0 (Pi.single 0 1 + Pi.single 2 1), .arrive 1 (-Pi.single 2 1), .add 0 1 1] + let sf := run (⟨fun _ => 0, ∅⟩ : St ℚ (Fin 3)) evs + Legal (⟨fun _ => 0, ∅⟩ : St ℚ (Fin 3)) evs ∧ (0 : Fin 3) ∈ sf.pres ∧ + sf.row 0 = Pi.single 0 1 ∧ π (Pi.single 0 1) = 0 ∧ + ¬ finrank ℚ ((span ℚ {(Pi.single 0 1 + Pi.single 2 1 : Fin 3 → ℚ)}).map π) ≤ 0 := by + intro π evs sf + refine ⟨?_, ?_, ?_, ?_, ?_⟩ + · simp [evs, Legal, step] + · simp [sf, evs, run, step] + · simp only [sf, evs, run, step] + funext r; fin_cases r <;> simp [Function.update, Pi.single_apply] + · simp [π] + · intro h0 + have hbot := Submodule.finrank_eq_zero.mp (Nat.le_zero.mp h0) + have hmem : π (Pi.single 0 1 + Pi.single 2 1) ∈ + (span ℚ {(Pi.single 0 1 + Pi.single 2 1 : Fin 3 → ℚ)}).map π := + Submodule.mem_map_of_mem (Submodule.mem_span_singleton_self _) + rw [hbot, Submodule.mem_bot] at hmem + have := congrFun hmem 2 + simp [π] at this + +end T4 + +end JunkLB2 + +#print axioms JunkLB2.hsum_tele +#print axioms JunkLB2.kappa_le +#print axioms JunkLB2.g9_nonneg +#print axioms JunkLB2.T1_Y +#print axioms JunkLB2.l_nonneg +#print axioms JunkLB2.T1_Y_le +#print axioms JunkLB2.Net.T1_bound +#print axioms JunkLB2.slot_lemma +#print axioms JunkLB2.proj_exists +#print axioms JunkLB2.run_inv +#print axioms JunkLB2.strip_born +#print axioms JunkLB2.Net.movesOf_chain +#print axioms JunkLB2.Net.chain_hsum +#print axioms JunkLB2.Net.reg_le_V +#print axioms JunkLB2.Net.reg_le_Y +#print axioms JunkLB2.Net.T1_cost +#print axioms JunkLB2.Net.T1_full +#print axioms JunkLB2.compl_of_sup +#print axioms JunkLB2.T2_run +#print axioms JunkLB2.slot_lemma_T2 +#print axioms JunkLB2.slot_lemma_run +#print axioms JunkLB2.T4_departer +#print axioms JunkLB2.T4_public +#print axioms JunkLB2.T4_stop_cost +#print axioms JunkLB2.T4_public_only_false diff --git a/research/p104-reader-ceiling/lean/Nov15/JunkLB2.md b/research/p104-reader-ceiling/lean/Nov15/JunkLB2.md new file mode 100644 index 0000000000..38163ae6b5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/JunkLB2.md @@ -0,0 +1,60 @@ +# JunkLB2.lean: JunkLB2 T1 (linked), T2, T3, T4 (Lean 4 + Mathlib), no sorry, ~9 s, 2.6 GB RSS +Source: internal notes (T1, T3, T4), with the T4 scope fix from internal notes §2. +Self-contained, namespace JunkLB2. h / gaps / hsum / two_point / Net / chain_append are copied from JunkM.lean. Axioms (all 25 printed): [propext, Classical.choice, Quot.sound]. + +**T1 (g9 pricing, class M).** +- `hsum_tele`: Σ h_e over any chain = f(e−d0) − f(e−last) − Σ f(gaps). The chain need not end at e. +- `T1_Y`: for Y_p with 0 < d1 < … < 8, the real cost Σ h_8(0::d1::…) equals the g9 charge on every move but the first, plus l(d1) = f(8) − f(d1) − f(9−d1). Needs f(0) = f(1) = 0. +- `l_nonneg` (1 ≤ d ≤ 8, by convexity), `l_one`, `T1_Y_le`: charged ≤ real. Direct Y (d1 = 8) is covered and gives 0. Registers ending at V: the charge is the real cost by definition. +- `g9_nonneg`: g9 ≥ 0 for a ≤ b ≤ 9. +- `Net.T1_bound`: Σ_{junk pairs} dist_c(A_q → G_p) ≤ cost. Hypotheses: + - a chain of moves A_q → G_p for each pair (JunkM `hpath_of_junk` now supplies it); + - chart 0 holds no X port; + - every move not leaving chart 0 is charged ≥ c (= g9); + - Σ_m w_m ≤ cost. +- Σ_m w_m ≤ public cost is now a THEOREM , `Net.T1_cost`; `Net.T1_full` chains it with `T1_bound`. + - Op semantics = JunkM's (`path_to_chain`): charts never decrease; `mv t i` is register i's move chart_t(i) → chart_{t+1}(i) when its chart rises. New hypothesis: the moves are EXACTLY these (each move is `mv t i` for one rising step t < n: `hsurj`, `hinj`). + - `movesOf i n` = register i's moves in time order; `movesOf_chain`: they form a chain birth chart → chart at time n. + - `chain_hsum`: Σ h_e over the chain's moves = hsum_e over its dim list (dim : C → ℕ, strictly monotone). + - Charge `wz`: 0 on moves out of chart z (dim 0), else c(s,t) = max(g9,0) (= g9 on every real move, `cg_eq`). + - Model M as hypotheses: Y mains (Ym) are born at z and end at dim 8; every other register ends at dim 9. Public cost := Σ_i hsum_{8 or 9}(i's dim chain) (I1). + - Per register: `reg_le_V` (charge ≤ Σ g9 = cost; 0-born non-Y first moves are charged 0 ≤ g9) and `reg_le_Y` (first move free, rest g9, then `T1_Y_le`). + - Still hypotheses in T1_full: the pair chains (`hpath`, from JunkM `hpath_of_junk`), and chart z holds no X port. + +**T3 (slot lemma), `slot_lemma`.** Conclusion: |D| ≤ rank{x_p : p ∈ D} + |(B0 ∩ Cr) \ W|. Hypotheses, all explicit: +- T2(a): the crossing rows ρ(Cr) are independent. +- T2(b): y_p = Σ A_{pμ} ρ_μ. A non-W crosser has A ≠ 0 only if it lands at G_p, and G is injective. +- W ⊆ B0 ∩ Cr. Crossing rows of W lie in S0 = span tok(B0). +- y_p = x_p + e_p with e_p ∈ S0, 0 ≠ x_p ∈ X, and X ⊓ S0 = 0. +- A linear P that fixes ρ(Cr) and kills the tokens of 0-born non-crossers. `proj_exists` builds P from IsCompl (the complementarity the T2 proof asserts). + +Two findings from the formal proof: +1. The prose step "dim(S0/W) ≤ |Z| after removing stayers" needs this projection. The proof runs in P(S0), and rank{P x_p} ≤ rank{x_p}. +2. Directness of the Y_p in D is never used. D may be any set of Y mains with x_p ≠ 0. Non-direct ones are simply in Z themselves. + +**T2 (crossing-basis lemma), now PROVED from op semantics , `T2_run`.** +- Model at level k: ops are ADD i += c·j (i ≠ j, both on the same side of level k, i.e. co-present) and `cross i` (i's first move from dim ≤ k to > k; its row then is ρ_i). Moves that do not cross k change nothing at this level and are omitted. Time 0: every row is its own token; B = registers born at dim ≤ k. +- Hypothesis (class N): every stayer (in B, never crosses) ends as its own token. +- Conclusions, in V = B → K (rows restricted to B's coordinates, `resB`): + - cr ⊆ B; + - complementarity: span ρ(Cr) and span tok(B \ Cr) are complementary (`IsCompl`); + - T2(a): the crossing rows are linearly independent; + - T2(b), existence: every register above k at the end has its restricted final row in span ρ(Cr). +- Proof (formal): invariants (`LInv`) = above-k rows stay in the span of crossing rows so far; all rows span everything (ADD with i ≠ j is invertible). Then `compl_of_sup`: a ⊔ b = ⊤ with dim a ≤ |Cr|, dim b ≤ |St|, dim V = |Cr| + |St| forces IsCompl and dim a = |Cr|. Stayer-token independence is not needed as input. +- Discharged in T3: `slot_lemma_T2` replaces slot_lemma's independence + projection hypotheses by "ρ(Cr) ∪ tok(St) spans V, dim V = |Cr| + |St|, 0-born non-crossers are stayers". `slot_lemma_run` instantiates it on the run (V = B → K, B0 ⊆ B). +- Still hypotheses in slot_lemma_run: T2(b)'s coefficients A and their support (A_{pμ} ≠ 0 ⇒ μ lands at G_p for non-W μ; the path/landing argument), W's rows in S0, e_p ∈ S0, X ⊓ S0 = 0, x_p ≠ 0. The expansion's existence is proved (T2_run part 4), and with independence A is unique. + +**T4 (departer law), CHOSEN SCOPE: owned arrivals counted.** +- Model: one chart's event list (arrive / born / ADD / depart), with ADDs only between registers present at c. Owned registers are registers too, so to be present at c they must arrive or be born there. +- `run_inv`: every present row lies in span(arrival rows) + span(c-born tokens). This is the prose's first step, and it holds only when ALL arrivals are counted. +- `strip_born`: a row with no c-born coordinates lies in the arrival span. This needs arrival rows to carry no c-born coordinates (a hypothesis). +- `T4_departer`: dim π(Arr_c^all) ≤ #public departers + #owned arrivals + #Y enders. Class-N hypothesis: public enders other than Y end as their own token, and π kills it. +- `T4_public`: the public-arrival span obeys the same bound. +- `T4_stop_cost` / `kappa_le`: a non-final move costs h_e(a,b) ≥ f(2) when b − a ≥ 1 and e − b ≥ 1. +- **Statement found false:** `T4_public_only_false`. The prose T4 (Arr_c = public arrivals, a ≤ d (+1)) fails in the same model, mirroring the gap map's owned-1502 → Y-213 charts. A public h arrives with e_h + e_x and owned o arrives with −e_x. Then h += o, so h ends as its own token. Yet dim π(public span) = 1 > 0. The gap is exactly step one of the prose proof. With no owned arrivals, `T4_departer` gives the prose statement back. + +Still prose / hypotheses: +- "arrivals carry no c-born coordinates" (content only flows upward); +- class-N final rows; +- one arrival per register at c. +- T5 path bound: charging half formalized in Nov15/JunkT5.lean . It is stated with the corrected T4 (owned arrivals) and needs root charts to be terminal. Descent is still prose. diff --git a/research/p104-reader-ceiling/lean/Nov15/NumCertK.lean b/research/p104-reader-ceiling/lean/Nov15/NumCertK.lean new file mode 100644 index 0000000000..1398c28ed5 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/NumCertK.lean @@ -0,0 +1,382 @@ +import Mathlib.Analysis.SpecialFunctions.Log.Deriv +import Mathlib.Analysis.SpecialFunctions.Pow.Deriv +import Mathlib.Analysis.Complex.ExponentialBounds +import Mathlib.Analysis.Calculus.Deriv.MeanValue + +/-! +NUMCERT-K . Kernel-checked interval arithmetic for the numeric crossing hypotheses of the kappa ceilings. +Section 1: rational enclosures of ln r (chain ln(c+2) = ln(c+1) + 2 atanh(1/(2c+3)) with an explicit geometric tail) and of exp (Taylor of x/8, explicit +remainder `Real.exp_bound'`, eighth power), packaged as `pow_lo`/`pow_hi`: r^s in [pLo r a, pHi r b] for s in [a,b]. Kernel only; no native_decide. +-/ + +namespace NumCertK +open Finset + +def SC : ℚ := 10 ^ 30 +def rdn (q : ℚ) : ℚ := ((⌊q * SC⌋ : ℤ) : ℚ) / SC +def rup (q : ℚ) : ℚ := ((⌈q * SC⌉ : ℤ) : ℚ) / SC +theorem SC_pos : (0 : ℚ) < SC := by unfold SC; positivity +theorem rdn_le (q : ℚ) : rdn q ≤ q := by + unfold rdn; rw [div_le_iff₀ SC_pos]; exact Int.floor_le _ +theorem le_rup (q : ℚ) : q ≤ rup q := by + unfold rup; rw [le_div_iff₀ SC_pos]; exact Int.le_ceil _ +theorem rdn_nonneg {q : ℚ} (h : 0 ≤ q) : 0 ≤ rdn q := by + unfold rdn + have : (0 : ℤ) ≤ ⌊q * SC⌋ := Int.floor_nonneg.mpr (mul_nonneg h SC_pos.le) + have h2 : (0 : ℚ) ≤ ((⌊q * SC⌋ : ℤ) : ℚ) := by exact_mod_cast this + exact div_nonneg h2 SC_pos.le +theorem rup_nonneg {q : ℚ} (h : 0 ≤ q) : 0 ≤ rup q := le_trans h (le_rup q) +theorem rdn_mono {p q : ℚ} (h : p ≤ q) : rdn p ≤ rdn q := by + unfold rdn + apply div_le_div_of_nonneg_right _ SC_pos.le + exact_mod_cast Int.floor_mono (mul_le_mul_of_nonneg_right h SC_pos.le) +theorem rup_mono {p q : ℚ} (h : p ≤ q) : rup p ≤ rup q := by + unfold rup + apply div_le_div_of_nonneg_right _ SC_pos.le + exact_mod_cast Int.ceil_mono (mul_le_mul_of_nonneg_right h SC_pos.le) + +/-! ### 1. ln -/ +def aS (a n : ℕ) : ℚ := + ∑ k ∈ range n, 2 * (1 / (2 * (k : ℚ) + 1)) * (1 / (2 * (a : ℚ) + 1)) ^ (2 * k + 1) +def aTail (a n : ℕ) : ℚ := + 2 * (1 / (2 * (a : ℚ) + 1)) ^ (2 * n + 1) / ((2 * (n : ℚ) + 1) * (1 - (1 / (2 * (a : ℚ) + 1)) ^ 2)) + +theorem atanh_bounds (a n : ℕ) (ha : 0 < a) : + ((aS a n : ℚ) : ℝ) ≤ Real.log (1 + (a : ℝ)⁻¹) ∧ + Real.log (1 + (a : ℝ)⁻¹) ≤ ((aS a n : ℚ) : ℝ) + ((aTail a n : ℚ) : ℝ) := by + have haR : (0 : ℝ) < a := by exact_mod_cast ha + have hs := Real.hasSum_log_one_add_inv haR + set y : ℝ := 1 / (2 * (a : ℝ) + 1) with hy + have hy0 : 0 < y := by rw [hy]; positivity + have hy1 : y < 1 := by + rw [hy, div_lt_one (by positivity)]; have : (1:ℝ) ≤ a := by exact_mod_cast ha + linarith + set f : ℕ → ℝ := fun k => 2 * (1 / (2 * (k : ℝ) + 1)) * y ^ (2 * k + 1) with hf + have hS : ((aS a n : ℚ) : ℝ) = ∑ k ∈ range n, f k := by + simp only [aS, hf, hy]; push_cast; rfl + have ht := (hasSum_nat_add_iff' n).mpr hs + rw [hS] + have hfpos : ∀ k, 0 ≤ f k := fun k => by simp only [hf]; positivity + constructor + · have := ht.nonneg (fun k => hfpos (k + n)) + linarith + · set c : ℝ := 2 * (1 / (2 * (n : ℝ) + 1)) * y ^ (2 * n + 1) with hc + have hy2 : y ^ 2 < 1 := by nlinarith + have hg : HasSum (fun k : ℕ => c * (y ^ 2) ^ k) (c * (1 - y ^ 2)⁻¹) := + (hasSum_geometric_of_lt_one (by positivity) hy2).mul_left c + have hle : ∀ k : ℕ, f (k + n) ≤ c * (y ^ 2) ^ k := by + intro k + simp only [hf, hc] + have e : y ^ (2 * (k + n) + 1) = y ^ (2 * n + 1) * (y ^ 2) ^ k := by + rw [← pow_mul]; rw [← pow_add]; congr 1; ring + push_cast + rw [e] + have h1 : 1 / (2 * ((k : ℝ) + n) + 1) ≤ 1 / (2 * (n : ℝ) + 1) := by + apply one_div_le_one_div_of_le (by positivity); nlinarith [(Nat.cast_nonneg k : (0:ℝ) ≤ k)] + have h2 : 0 ≤ y ^ (2 * n + 1) * (y ^ 2) ^ k := by positivity + nlinarith [mul_le_mul_of_nonneg_right h1 h2] + have := hasSum_le hle ht hg + have hT : ((aTail a n : ℚ) : ℝ) = c * (1 - y ^ 2)⁻¹ := by + simp only [aTail, hc, hy]; push_cast + have : (1 - (1 / (2 * (a : ℝ) + 1)) ^ 2) ≠ 0 := by + have := hy2; rw [hy] at this; intro h; linarith + field_simp + rw [hT]; linarith + +def N : ℕ := 36 +def lnLoC : ℕ → ℚ + | 0 => 0 + | c + 1 => lnLoC c + rdn (aS (c + 1) N) +def lnHiC : ℕ → ℚ + | 0 => 0 + | c + 1 => lnHiC c + rup (aS (c + 1) N + aTail (c + 1) N) +/-- bounds for ln r (r >= 1) -/ +def lnLo (r : ℕ) : ℚ := lnLoC (r - 1) +def lnHi (r : ℕ) : ℚ := lnHiC (r - 1) + +theorem aS_nonneg (a n : ℕ) : 0 ≤ aS a n := by + unfold aS; apply Finset.sum_nonneg; intro k _; positivity +theorem aTail_nonneg (a n : ℕ) : 0 ≤ aTail a n := by + unfold aTail + apply div_nonneg (by positivity) + apply mul_nonneg (by positivity) + by_cases h : a = 0 + · subst h; simp + · have : (1:ℚ) ≤ a := by exact_mod_cast Nat.pos_of_ne_zero h + have h1 : 1 / (2 * (a : ℚ) + 1) ≤ 1 := by rw [div_le_one (by positivity)]; linarith + have h0 : 0 ≤ 1 / (2 * (a : ℚ) + 1) := by positivity + nlinarith + +theorem ln_chain (c : ℕ) : + ((lnLoC c : ℚ) : ℝ) ≤ Real.log ((c : ℝ) + 1) ∧ Real.log ((c : ℝ) + 1) ≤ ((lnHiC c : ℚ) : ℝ) := by + induction c with + | zero => simp [lnLoC, lnHiC] + | succ c ih => + obtain ⟨h1, h2⟩ := ih + have hc : (0 : ℝ) < (c : ℝ) + 1 := by positivity + have e : Real.log (((c + 1 : ℕ) : ℝ) + 1) = Real.log ((c : ℝ) + 1) + Real.log (1 + (((c + 1 : ℕ) : ℝ))⁻¹) := by + rw [← Real.log_mul hc.ne' (by positivity)] + congr 1; push_cast; field_simp + obtain ⟨b1, b2⟩ := atanh_bounds (c + 1) N (Nat.succ_pos c) + rw [e] + constructor + · have : ((rdn (aS (c + 1) N) : ℚ) : ℝ) ≤ ((aS (c + 1) N : ℚ) : ℝ) := by exact_mod_cast rdn_le _ + simp only [lnLoC]; push_cast at *; linarith + · have : ((aS (c + 1) N + aTail (c + 1) N : ℚ) : ℝ) ≤ ((rup (aS (c + 1) N + aTail (c + 1) N) : ℚ) : ℝ) := + by exact_mod_cast le_rup _ + simp only [lnHiC]; push_cast at *; linarith + +theorem lnLo_le (r : ℕ) (hr : 1 ≤ r) : ((lnLo r : ℚ) : ℝ) ≤ Real.log r := by + have h := (ln_chain (r - 1)).1 + unfold lnLo + have : ((r - 1 : ℕ) : ℝ) + 1 = r := by rw [Nat.cast_sub hr]; simp + rwa [this] at h +theorem le_lnHi (r : ℕ) (hr : 1 ≤ r) : Real.log r ≤ ((lnHi r : ℚ) : ℝ) := by + have h := (ln_chain (r - 1)).2 + unfold lnHi + have : ((r - 1 : ℕ) : ℝ) + 1 = r := by rw [Nat.cast_sub hr]; simp + rwa [this] at h + +theorem lnLoC_nonneg (c : ℕ) : 0 ≤ lnLoC c := by + induction c with + | zero => simp [lnLoC] + | succ c ih => simp only [lnLoC]; exact add_nonneg ih (rdn_nonneg (aS_nonneg _ _)) +theorem lnHiC_mono : Monotone lnHiC := by + apply monotone_nat_of_le_succ; intro c + simp only [lnHiC] + have := rup_nonneg (add_nonneg (aS_nonneg (c + 1) N) (aTail_nonneg (c + 1) N)) + linarith +theorem lnLo_nonneg (r : ℕ) : 0 ≤ lnLo r := lnLoC_nonneg _ +theorem lnHi_nonneg (r : ℕ) : 0 ≤ lnHi r := by + have : (0:ℚ) ≤ lnHiC 0 := by simp [lnHiC] + exact le_trans this (lnHiC_mono (Nat.zero_le _)) + +theorem lnHi_145 : lnHi 145 ≤ 5 := by unfold lnHi; decide +kernel +theorem lnHi_le_5 (r : ℕ) (hr : r ≤ 145) : lnHi r ≤ 5 := by + refine le_trans ?_ lnHi_145 + exact lnHiC_mono (by omega) + +/-! ### 2. exp -/ +def NE : ℕ := 24 +def eS (y : ℚ) : ℚ := ∑ m ∈ range NE, y ^ m / (Nat.factorial m : ℚ) +def eR (y : ℚ) : ℚ := y ^ NE * ((NE : ℚ) + 1) / ((Nat.factorial NE : ℚ) * NE) +/-- lower / upper enclosure of exp x: (Taylor of x/8)^8 with outward fixed-point rounding -/ +def eLo (x : ℚ) : ℚ := rdn ((rdn (eS (x / 8))) ^ 8) +def eHi (x : ℚ) : ℚ := rup ((rup (eS (x / 8) + eR (x / 8))) ^ 8) + +theorem eLo_le (x : ℚ) (hx : 0 ≤ x) : ((eLo x : ℚ) : ℝ) ≤ Real.exp x := by + have hx0 : (0:ℝ) ≤ x := by exact_mod_cast hx + have hy : (0 : ℝ) ≤ (x : ℝ) / 8 := by positivity + have h1 := Real.sum_le_exp_of_nonneg hy NE + have hS : ((eS (x / 8) : ℚ) : ℝ) = ∑ m ∈ range NE, ((x : ℝ) / 8) ^ m / (Nat.factorial m : ℝ) := by + simp only [eS]; push_cast; rfl + have h0 : 0 ≤ eS (x / 8) := by + unfold eS; apply Finset.sum_nonneg; intro m _; have : 0 ≤ x / 8 := by positivity + positivity + have h2 : ((rdn (eS (x / 8)) : ℚ) : ℝ) ≤ Real.exp ((x : ℝ) / 8) := by + have : ((rdn (eS (x / 8)) : ℚ) : ℝ) ≤ ((eS (x / 8) : ℚ) : ℝ) := by exact_mod_cast rdn_le _ + linarith + have h3 : (0 : ℝ) ≤ ((rdn (eS (x / 8)) : ℚ) : ℝ) := by exact_mod_cast rdn_nonneg h0 + have h4 : (((rdn (eS (x / 8))) ^ 8 : ℚ) : ℝ) ≤ Real.exp x := by + push_cast + calc ((rdn (eS (x / 8)) : ℚ) : ℝ) ^ 8 ≤ (Real.exp ((x : ℝ) / 8)) ^ 8 := pow_le_pow_left₀ h3 h2 8 + _ = Real.exp x := by rw [← Real.exp_nat_mul]; congr 1; push_cast; ring + have h5 : ((rdn ((rdn (eS (x / 8))) ^ 8) : ℚ) : ℝ) ≤ (((rdn (eS (x / 8))) ^ 8 : ℚ) : ℝ) := by + exact_mod_cast rdn_le _ + unfold eLo; linarith + +theorem le_eHi (x : ℚ) (hx : 0 ≤ x) (hx8 : x ≤ 8) : Real.exp x ≤ ((eHi x : ℚ) : ℝ) := by + have hx0 : (0:ℝ) ≤ x := by exact_mod_cast hx + have hx8' : (x:ℝ) ≤ 8 := by exact_mod_cast hx8 + have hy : (0 : ℝ) ≤ (x : ℝ) / 8 := by positivity + have hy1 : (x : ℝ) / 8 ≤ 1 := by linarith + have h1 := Real.exp_bound' hy hy1 (n := NE) (by unfold NE; norm_num) + have hS : ((eS (x / 8) + eR (x / 8) : ℚ) : ℝ) = + (∑ m ∈ range NE, ((x : ℝ) / 8) ^ m / (Nat.factorial m : ℝ)) + + ((x : ℝ) / 8) ^ NE * ((NE : ℝ) + 1) / ((Nat.factorial NE : ℝ) * NE) := by + simp only [eS, eR]; push_cast; rfl + have h2 : Real.exp ((x : ℝ) / 8) ≤ ((rup (eS (x / 8) + eR (x / 8)) : ℚ) : ℝ) := by + have : ((eS (x / 8) + eR (x / 8) : ℚ) : ℝ) ≤ ((rup (eS (x / 8) + eR (x / 8)) : ℚ) : ℝ) := by + exact_mod_cast le_rup _ + linarith + have h3 : Real.exp x ≤ (((rup (eS (x / 8) + eR (x / 8))) ^ 8 : ℚ) : ℝ) := by + push_cast + calc Real.exp x = (Real.exp ((x : ℝ) / 8)) ^ 8 := by rw [← Real.exp_nat_mul]; congr 1; push_cast; ring + _ ≤ _ := pow_le_pow_left₀ (Real.exp_pos _).le h2 8 + have h5 : (((rup (eS (x / 8) + eR (x / 8))) ^ 8 : ℚ) : ℝ) ≤ ((rup ((rup (eS (x / 8) + eR (x / 8))) ^ 8) : ℚ) : ℝ) := by + exact_mod_cast le_rup _ + unfold eHi; linarith + +/-! ### 3. r^s on an interval of exponents -/ +def pLo (r : ℕ) (a : ℚ) : ℚ := eLo (rdn (a * lnLo r)) +def pHi (r : ℕ) (b : ℚ) : ℚ := eHi (rup (b * lnHi r)) + +/-- **rpow bound (lower)**: for 1 <= r, 0 <= a <= s: pLo r a <= r^s. -/ +theorem pow_lo (r : ℕ) (hr : 1 ≤ r) (a : ℚ) (ha : 0 ≤ a) (s : ℝ) (hs : (a : ℝ) ≤ s) : + ((pLo r a : ℚ) : ℝ) ≤ (r : ℝ) ^ s := by + have hr1 : (1 : ℝ) ≤ r := by exact_mod_cast hr + have hrp : (0 : ℝ) < r := by linarith + have ha0 : (0:ℝ) ≤ a := by exact_mod_cast ha + have h1 : (r : ℝ) ^ (a : ℝ) ≤ (r : ℝ) ^ s := Real.rpow_le_rpow_of_exponent_le hr1 hs + have hx0 : 0 ≤ rdn (a * lnLo r) := rdn_nonneg (mul_nonneg ha (lnLo_nonneg r)) + have h2 := eLo_le _ hx0 + have h3 : ((rdn (a * lnLo r) : ℚ) : ℝ) ≤ Real.log r * a := by + have a1 : ((rdn (a * lnLo r) : ℚ) : ℝ) ≤ ((a * lnLo r : ℚ) : ℝ) := by exact_mod_cast rdn_le _ + have a2 := lnLo_le r hr + push_cast at a1 + nlinarith + have e := Real.rpow_def_of_pos hrp (a : ℝ) + unfold pLo + have := Real.exp_le_exp.mpr h3 + linarith + +/-- **rpow bound (upper)**: for 1 <= r <= 145, 0 <= s <= b <= 1: r^s <= pHi r b. -/ +theorem pow_hi (r : ℕ) (hr : 1 ≤ r) (hr2 : r ≤ 145) (b : ℚ) (hb0 : 0 ≤ b) (hb1 : b ≤ 1) (s : ℝ) + (hs : s ≤ (b : ℝ)) : + (r : ℝ) ^ s ≤ ((pHi r b : ℚ) : ℝ) := by + have hr1 : (1 : ℝ) ≤ r := by exact_mod_cast hr + have hrp : (0 : ℝ) < r := by linarith + have h1 : (r : ℝ) ^ s ≤ (r : ℝ) ^ (b : ℝ) := Real.rpow_le_rpow_of_exponent_le hr1 hs + have hx0 : 0 ≤ rup (b * lnHi r) := rup_nonneg (mul_nonneg hb0 (lnHi_nonneg r)) + have h5 := lnHi_le_5 r hr2 + have hx8 : rup (b * lnHi r) ≤ 8 := by + have : b * lnHi r ≤ 5 := by nlinarith [lnHi_nonneg r] + have h6 := rup_mono this + have h7 : rup 5 = 5 := by unfold rup SC; norm_num + linarith + have h2 := le_eHi _ hx0 hx8 + have h3 : Real.log r * b ≤ ((rup (b * lnHi r) : ℚ) : ℝ) := by + have a1 : ((b * lnHi r : ℚ) : ℝ) ≤ ((rup (b * lnHi r) : ℚ) : ℝ) := by exact_mod_cast le_rup _ + have a2 := le_lnHi r hr + have hb : (0:ℝ) ≤ b := by exact_mod_cast hb0 + push_cast at a1 + nlinarith + have e := Real.rpow_def_of_pos hrp (b : ℝ) + unfold pHi + have := Real.exp_le_exp.mpr h3 + linarith + +/-! ### 4. F(s) = sum c_r r^s: enclosures of F and F', monotonicity -/ +abbrev CF := List (ℕ × ℤ) +noncomputable def Fc (cf : CF) (s : ℝ) : ℝ := (cf.map fun p => (p.2 : ℝ) * (p.1 : ℝ) ^ s).sum +noncomputable def dFc (cf : CF) (s : ℝ) : ℝ := (cf.map fun p => (p.2 : ℝ) * (Real.log p.1 * (p.1 : ℝ) ^ s)).sum +def okR (cf : CF) : Prop := ∀ p ∈ cf, 1 ≤ p.1 ∧ p.1 ≤ 145 +instance (cf : CF) : Decidable (okR cf) := by unfold okR; infer_instance +/-- upper bound of F on s in [a,b] -/ +def Fup (cf : CF) (a b : ℚ) : ℚ := + (cf.map fun p => if 0 ≤ p.2 then (p.2 : ℚ) * pHi p.1 b else (p.2 : ℚ) * pLo p.1 a).sum +/-- lower bound of F' on s in [a,b] -/ +def dLo (cf : CF) (a b : ℚ) : ℚ := + (cf.map fun p => if 0 ≤ p.2 then (p.2 : ℚ) * (lnLo p.1 * pLo p.1 a) + else (p.2 : ℚ) * (lnHi p.1 * pHi p.1 b)).sum + +theorem Fc_le (cf : CF) (hok : okR cf) (a b : ℚ) (ha : 0 ≤ a) (hb1 : b ≤ 1) (s : ℝ) + (h1 : (a : ℝ) ≤ s) (h2 : s ≤ (b : ℝ)) : Fc cf s ≤ ((Fup cf a b : ℚ) : ℝ) := by + have ha0 : (0:ℝ) ≤ a := by exact_mod_cast ha + have hb0 : 0 ≤ b := by + have : (0:ℝ) ≤ b := by linarith + exact_mod_cast this + induction cf with + | nil => simp [Fc, Fup] + | cons p l ih => + have hp := hok p (by simp) + have hl : okR l := fun q hq => hok q (by simp [hq]) + have ih := ih hl + simp only [Fc, Fup, List.map_cons, List.sum_cons] at ih ⊢ + rw [Rat.cast_add] + have hlo := pow_lo p.1 hp.1 a ha s h1 + have hhi := pow_hi p.1 hp.1 hp.2 b hb0 hb1 s h2 + split_ifs with hc + · have hc' : (0:ℝ) ≤ p.2 := by exact_mod_cast hc + simp only [Rat.cast_mul, Rat.cast_intCast] + nlinarith [mul_le_mul_of_nonneg_left hhi hc'] + · have hc' : (p.2:ℝ) ≤ 0 := by exact_mod_cast (show p.2 ≤ 0 by omega) + simp only [Rat.cast_mul, Rat.cast_intCast] + nlinarith [mul_le_mul_of_nonpos_left hlo hc'] + +theorem dFc_ge (cf : CF) (hok : okR cf) (a b : ℚ) (ha : 0 ≤ a) (hb1 : b ≤ 1) (s : ℝ) + (h1 : (a : ℝ) ≤ s) (h2 : s ≤ (b : ℝ)) : ((dLo cf a b : ℚ) : ℝ) ≤ dFc cf s := by + have ha0 : (0:ℝ) ≤ a := by exact_mod_cast ha + have hb0 : 0 ≤ b := by + have : (0:ℝ) ≤ b := by linarith + exact_mod_cast this + induction cf with + | nil => simp [dFc, dLo] + | cons p l ih => + have hp := hok p (by simp) + have hl : okR l := fun q hq => hok q (by simp [hq]) + have ih := ih hl + simp only [dFc, dLo, List.map_cons, List.sum_cons] at ih ⊢ + rw [Rat.cast_add] + have hlo := pow_lo p.1 hp.1 a ha s h1 + have hhi := pow_hi p.1 hp.1 hp.2 b hb0 hb1 s h2 + have hr1 : (1:ℝ) ≤ p.1 := by exact_mod_cast hp.1 + have hL0 : 0 ≤ Real.log p.1 := Real.log_nonneg hr1 + have hl1 := lnLo_le p.1 hp.1 + have hl2 := le_lnHi p.1 hp.1 + have hn0 : (0:ℝ) ≤ ((lnLo p.1 : ℚ) : ℝ) := by exact_mod_cast lnLo_nonneg p.1 + have hn1 : (0:ℝ) ≤ ((lnHi p.1 : ℚ) : ℝ) := by exact_mod_cast lnHi_nonneg p.1 + have hq0 : (0:ℝ) ≤ ((pLo p.1 a : ℚ) : ℝ) := by + have : 0 ≤ pLo p.1 a := by + unfold pLo eLo + apply rdn_nonneg; apply pow_nonneg; apply rdn_nonneg + unfold eS; apply Finset.sum_nonneg; intro m _ + have : 0 ≤ rdn (a * lnLo p.1) / 8 := div_nonneg (rdn_nonneg (mul_nonneg ha (lnLo_nonneg _))) (by norm_num) + positivity + exact_mod_cast this + have hrs : (0:ℝ) ≤ (p.1 : ℝ) ^ s := by positivity + split_ifs with hc + · have hc' : (0:ℝ) ≤ p.2 := by exact_mod_cast hc + simp only [Rat.cast_mul, Rat.cast_intCast] + have m1 : ((lnLo p.1 : ℚ) : ℝ) * ((pLo p.1 a : ℚ) : ℝ) ≤ Real.log p.1 * (p.1 : ℝ) ^ s := + mul_le_mul hl1 hlo hq0 hL0 + nlinarith [mul_le_mul_of_nonneg_left m1 hc'] + · have hc' : (p.2:ℝ) ≤ 0 := by exact_mod_cast (show p.2 ≤ 0 by omega) + simp only [Rat.cast_mul, Rat.cast_intCast] + have m1 : Real.log p.1 * (p.1 : ℝ) ^ s ≤ ((lnHi p.1 : ℚ) : ℝ) * ((pHi p.1 b : ℚ) : ℝ) := + mul_le_mul hl2 hhi hrs hn1 + nlinarith [mul_le_mul_of_nonpos_left m1 hc'] + +theorem Fc_hasDerivAt (cf : CF) (hok : okR cf) (s : ℝ) : HasDerivAt (Fc cf) (dFc cf s) s := by + induction cf with + | nil => simp only [Fc, dFc, List.map_nil, List.sum_nil]; exact hasDerivAt_const s (0 : ℝ) + | cons p l ih => + have hp := hok p (by simp) + have hl : okR l := fun q hq => hok q (by simp [hq]) + have ih := ih hl + have hrp : (0:ℝ) < p.1 := by have : (1:ℝ) ≤ p.1 := by exact_mod_cast hp.1 + linarith + have h1 := ((Real.hasStrictDerivAt_const_rpow hrp s).hasDerivAt.const_mul (p.2 : ℝ)).add ih + have e : Fc (p :: l) = fun s => (p.2 : ℝ) * (p.1 : ℝ) ^ s + Fc l s := by + funext s; simp [Fc] + have e2 : dFc (p :: l) s = (p.2 : ℝ) * ((p.1 : ℝ) ^ s * Real.log p.1) + dFc l s := by + simp only [dFc, List.map_cons, List.sum_cons]; ring + rw [e, e2]; exact h1 + +/-- if F' >= dLo > 0 on [a,b] then F(s) <= F(b) on [a,b] -/ +theorem Fc_mono (cf : CF) (hok : okR cf) (a b : ℚ) (ha : 0 ≤ a) (hb1 : b ≤ 1) (hd : 0 < dLo cf a b) + (s : ℝ) (h1 : (a : ℝ) ≤ s) (h2 : s ≤ (b : ℝ)) : Fc cf s ≤ Fc cf b := by + have hab : (a : ℝ) ≤ b := le_trans h1 h2 + have hcont : ContinuousOn (Fc cf) (Set.Icc (a : ℝ) b) := + fun x _ => (Fc_hasDerivAt cf hok x).continuousAt.continuousWithinAt + have hm : StrictMonoOn (Fc cf) (Set.Icc (a : ℝ) b) := by + apply strictMonoOn_of_deriv_pos (convex_Icc _ _) hcont + intro x hx + rw [interior_Icc] at hx + rw [(Fc_hasDerivAt cf hok x).deriv] + have := dFc_ge cf hok a b ha hb1 x hx.1.le hx.2.le + have hd' : (0:ℝ) < ((dLo cf a b : ℚ) : ℝ) := by exact_mod_cast hd + linarith + exact hm.monotoneOn ⟨h1, h2⟩ ⟨hab, le_refl _⟩ h2 + +theorem Fc_neg_piece (cf : CF) (hok : okR cf) (a b : ℚ) (ha : 0 ≤ a) (hb1 : b ≤ 1) (h : Fup cf a b < 0) + (s : ℝ) (h1 : (a : ℝ) ≤ s) (h2 : s ≤ (b : ℝ)) : Fc cf s < 0 := by + have := Fc_le cf hok a b ha hb1 s h1 h2 + have h' : ((Fup cf a b : ℚ) : ℝ) < 0 := by exact_mod_cast h + linarith + +end NumCertK + +#print axioms NumCertK.pow_lo +#print axioms NumCertK.pow_hi +#print axioms NumCertK.Fc_mono diff --git a/research/p104-reader-ceiling/lean/Nov15/NumCertK.md b/research/p104-reader-ceiling/lean/Nov15/NumCertK.md new file mode 100644 index 0000000000..5bd62abfc0 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/NumCertK.md @@ -0,0 +1,17 @@ +# NumCertK.lean + NumCertKData.lean + NumCertK22.lean: kernel-checked interval arithmetic; NumCert22 discharged +No sorry, no native_decide; axioms [propext, Classical.choice, Quot.sound] (all three files). Build order: NumCertK (13 s / 2.9 GB), NumCertKData (32 s / 3.4 GB), FloorK22, NumCertK22 (7 s / 2.9 GB); each with `-o .lake/build/lib/lean/Nov15/.olean`. NumCertK22 is a separate file only because importing FloorK22 + the checks in one run exceeds the 3.5 GB guard. + +## Library (NumCertK.lean, Mathlib only) +- ln: chain ln(c+2) = ln(c+1) + 2 atanh(1/(2c+3)) from `Real.hasSum_log_one_add_inv`, 36 terms, explicit geometric tail (`atanh_bounds`), outward rounding to 1e-30 (`rdn`/`rup`). `lnLo r <= ln r <= lnHi r`, r >= 1; accuracy ~1e-28 for r <= 145. +- exp: (Taylor_24(x/8))^8 with `Real.exp_bound'` remainder, outward rounding (`eLo_le`: 0 <= x; `le_eHi`: 0 <= x <= 8). +- **`pow_lo`**: 1 <= r, 0 <= a <= s => pLo r a <= r^s. **`pow_hi`**: 1 <= r <= 145, s <= b <= 1 => r^s <= pHi r b. (s-form: s = 1 - t, so r^(1-t) in [pLo r (1-t_hi), pHi r (1-t_lo)].) Rational, checked by `decide +kernel`. +- F(s) = sum c_r r^s (`Fc`): `Fc_le` (upper enclosure `Fup` on [a,b]), `dFc_ge` (lower enclosure `dLo` of F'), `Fc_hasDerivAt`, `Fc_mono` (dLo > 0 on [a,b] => F(s) <= F(b)). + +## Crossing for K(S22) (NumCertKData.lean, NumCertK22.lean) +- `cfK`: the 17-call invoice caller(6|7) + 17 x nK22, merged by rank: 24 ranks, c_1 = -42272, c_2 = 6494, ..., c_137 = 208 (`invoice_eq_Fc`, simp + ring: identical to the Finv of FloorK22). +- `cfK_neg`: F(s) < 0 for every s in [0, 9939802595/10^10 = 1 - .0060197405]. Proof: six `Fup` boxes cover [0, .9] (grid 0, .45, .6, .7, .8, .85, .9; F <= -3.3e3 at worst); on [.9, s0] one box gives dLo >= 2.5e4 > 0, so F(s) <= F(s0), and the point enclosure gives Fup(s0, s0) < 0 (true F(s0) = -4.83e-6, relative margin 1e-10 of the 2.8e4-sized terms, so the 1e-28 enclosure is ample). +- **`numCert22 : NumCert22 tbar22`** and **`ceiling22_unconditional`**: kappa <= .0060197405 on class K(S22) with NumCert22 discharged; other hypotheses of `ceiling22` unchanged (ClassK22 rank input, cost-model link `hF`). +- The crossing is TRUE: F(1 - .0060197405) = -4.83e-6 (root .00601974047925), F' = 2.33e5 there. + +## Not done +- JointCeiling's `NumCert th0 tbar`: it quantifies over ALL a, b >= 1 (R1 tail Jensen/MVT step, ~1,800 pairs, unaudited per its docstring); the library applies per (a,b) but the infinite tail is not an interval check. WholeFloor's (kappa <= .0204) was not available. diff --git a/research/p104-reader-ceiling/lean/Nov15/RankLaw.lean b/research/p104-reader-ceiling/lean/Nov15/RankLaw.lean new file mode 100644 index 0000000000..fd4ec249d3 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/RankLaw.lean @@ -0,0 +1,597 @@ +import Nov15.TokenCancel +import Mathlib.LinearAlgebra.Matrix.ToLin +import Mathlib.LinearAlgebra.Determinant +import Mathlib.LinearAlgebra.Matrix.Block +import Mathlib.LinearAlgebra.Matrix.Transvection +import Mathlib.LinearAlgebra.Matrix.NonsingularInverse +import Mathlib.LinearAlgebra.Projection +import Mathlib.LinearAlgebra.Isomorphisms +import Mathlib.LinearAlgebra.Dimension.Constructions +import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas + +set_option linter.unusedSectionVars false +namespace RankLaw +open Submodule Module + +section Equiv +variable {K V W : Type*} [Field K] [AddCommGroup V] [Module K V] [AddCommGroup W] [Module K W] + [FiniteDimensional K V] + +/-- Two linear maps out of a finite-dimensional space with the same range differ by an +automorphism of the source. -/ +theorem exists_equiv_comp (f g : V →ₗ[K] W) (h : LinearMap.range f = LinearMap.range g) : + ∃ φ : V ≃ₗ[K] V, f ∘ₗ φ.toLinearMap = g := by + obtain ⟨Qg, hQg⟩ := Submodule.exists_isCompl (LinearMap.ker g) + obtain ⟨Qf, hQf⟩ := Submodule.exists_isCompl (LinearMap.ker f) + have hk : finrank K (LinearMap.ker g) = finrank K (LinearMap.ker f) := by + have h1 := LinearMap.finrank_range_add_finrank_ker f + have h2 := LinearMap.finrank_range_add_finrank_ker g + rw [h] at h1; omega + let e1 : LinearMap.ker g ≃ₗ[K] LinearMap.ker f := LinearEquiv.ofFinrankEq _ _ hk + let e2 : Qg ≃ₗ[K] Qf := + (Submodule.quotientEquivOfIsCompl _ _ hQg).symm ≪≫ₗ g.quotKerEquivRange ≪≫ₗ + (LinearEquiv.ofEq _ _ h.symm) ≪≫ₗ f.quotKerEquivRange.symm ≪≫ₗ + Submodule.quotientEquivOfIsCompl _ _ hQf + let φ : V ≃ₗ[K] V := (Submodule.prodEquivOfIsCompl _ _ hQg).symm ≪≫ₗ (e1.prodCongr e2) ≪≫ₗ + Submodule.prodEquivOfIsCompl _ _ hQf + refine ⟨φ, ?_⟩ + -- key: f (e2 q) = g q + have key : ∀ q : Qg, f (e2 q : V) = g q := by + intro q + set y : Qf := e2 q + have hy : (Submodule.Quotient.mk (y : V) : V ⧸ LinearMap.ker f) = + f.quotKerEquivRange.symm (LinearEquiv.ofEq _ _ h.symm + (g.quotKerEquivRange (Submodule.Quotient.mk (q : V)))) := by + have := Submodule.mk_quotientEquivOfIsCompl_apply hQf + (f.quotKerEquivRange.symm (LinearEquiv.ofEq _ _ h.symm + (g.quotKerEquivRange (Submodule.Quotient.mk (q : V))))) + convert this using 2 + simp [y, e2, Submodule.quotientEquivOfIsCompl_symm_apply] + have := congrArg (fun t => (f.quotKerEquivRange t : W)) hy + simpa using this + apply LinearMap.ext; intro v + obtain ⟨⟨k, q⟩, rfl⟩ := (Submodule.prodEquivOfIsCompl _ _ hQg).surjective v + have hφ : φ ((Submodule.prodEquivOfIsCompl _ _ hQg) (k, q)) = (e1 k : V) + (e2 q : V) := by + simp only [φ, LinearEquiv.trans_apply, LinearEquiv.symm_apply_apply] + rfl + rw [LinearMap.comp_apply, LinearEquiv.coe_coe, hφ, coe_prodEquivOfIsCompl', map_add, map_add] + have hk0 : f (e1 k : V) = 0 := (e1 k).2 + have hg0 : g (k : V) = 0 := k.2 + rw [hk0, hg0, key] +end Equiv + + +section Mix +variable {K G ι : Type*} [Field K] [Fintype G] [DecidableEq G] + +/-- **The V-mix target, as a linear system.** Given the end rows `X` of the registers that end at V +(indexed by `G`) and their target rows `R`, a V mix is an invertible `C` with `C * X = R`. -/ +def VMixM (X R : Matrix G ι K) : Prop := ∃ C : Matrix G G K, IsUnit C.det ∧ C * X = R + +/-- The V-mix system is solvable iff the end rows and the target rows span the same space. -/ +theorem vmixM_iff_span (X R : Matrix G ι K) : + VMixM X R ↔ span K (Set.range X.row) = span K (Set.range R.row) := by + constructor + · rintro ⟨C, hC, hCX⟩ + have hR : ∀ g, R.row g ∈ span K (Set.range X.row) := by + intro g; rw [← hCX] + have : (C * X).row g = Matrix.vecMul (C g) X := rfl + rw [this, ← range_vecMulLinear X]; exact ⟨C g, rfl⟩ + have hX : X = C⁻¹ * R := by rw [← hCX, ← Matrix.mul_assoc, Matrix.nonsing_inv_mul _ hC, Matrix.one_mul] + have hXR : ∀ g, X.row g ∈ span K (Set.range R.row) := by + intro g; rw [hX] + have : (C⁻¹ * R).row g = Matrix.vecMul (C⁻¹ g) R := rfl + rw [this, ← range_vecMulLinear R]; exact ⟨C⁻¹ g, rfl⟩ + apply le_antisymm + · exact span_le.2 (by rintro _ ⟨g, rfl⟩; exact hXR g) + · exact span_le.2 (by rintro _ ⟨g, rfl⟩; exact hR g) + · intro h + have h' : LinearMap.range X.vecMulLinear = LinearMap.range R.vecMulLinear := by + rw [range_vecMulLinear, range_vecMulLinear]; exact h + obtain ⟨φ, hφ⟩ := exists_equiv_comp X.vecMulLinear R.vecMulLinear h' + refine ⟨(LinearMap.toMatrix' φ.toLinearMap).transpose, ?_, ?_⟩ + · rw [Matrix.det_transpose, LinearMap.det_toMatrix'] + exact LinearEquiv.isUnit_det' φ + · ext g j + have e := congrArg (fun F : (G → K) →ₗ[K] (ι → K) => F (Pi.single g 1) j) hφ + simp only [LinearMap.comp_apply, Matrix.vecMulLinear_apply, LinearEquiv.coe_coe] at e + rw [Matrix.single_one_vecMul] at e + have hrow : (fun k => (LinearMap.toMatrix' φ.toLinearMap).transpose g k) = φ (Pi.single g 1) := by + funext k; simp [Matrix.transpose_apply, LinearMap.toMatrix'_apply] + change Matrix.vecMul _ X j = R.row g j + rw [hrow, e] +/-- If the targets are independent, a V mix makes the end rows independent too ("G1 rows are +|G1| independent vectors inside span(G1 targets)"). -/ +theorem vmixM_indep (X R : Matrix G ι K) (h : VMixM X R) (hR : LinearIndependent K R.row) : + LinearIndependent K X.row := by + obtain ⟨C, hC, hCX⟩ := h + have hX : X = C⁻¹ * R := by + rw [← hCX, ← Matrix.mul_assoc, Matrix.nonsing_inv_mul _ hC, Matrix.one_mul] + rw [← Matrix.vecMul_injective_iff] at hR ⊢ + have hCi : Function.Injective (fun v : G → K => Matrix.vecMul v C⁻¹) := + Matrix.vecMul_injective_iff_isUnit.2 ((Matrix.isUnit_iff_isUnit_det _).2 ((Matrix.isUnit_nonsing_inv_det_iff).2 hC)) + intro v w hvw + apply hCi; apply hR + simpa [hX, Matrix.vecMul_vecMul] using hvw + +/-- **Uniqueness.** With independent end rows, the V mix is unique. -/ +theorem vmixM_unique (X R : Matrix G ι K) (hX : LinearIndependent K X.row) + (C C' : Matrix G G K) (h : C * X = R) (h' : C' * X = R) : C = C' := by + rw [← Matrix.vecMul_injective_iff] at hX + ext g h0 + have : Matrix.vecMul (C g) X = Matrix.vecMul (C' g) X := by + have e1 : (C * X).row g = Matrix.vecMul (C g) X := rfl + have e2 : (C' * X).row g = Matrix.vecMul (C' g) X := rfl + rw [← e1, ← e2, h, h'] + exact congrFun (hX this) h0 + +/-- **Token order affects only fill.** `vmixM_iff_span` (and `rank_law`) carry no order hypothesis: +existence of the V mix does not depend on any carrier/token order. An order only shapes `C`: +if the end rows are a block-triangular (w.r.t. the order `b`) invertible recombination of the +targets, the V mix is block-triangular, so it has no fill outside the triangle. -/ +theorem vmixM_fill {α : Type*} [LinearOrder α] (b : G → α) (X R : Matrix G ι K) + (Tg : Matrix G G K) (hT : Tg.BlockTriangular b) (hdet : IsUnit Tg.det) (hX : X = Tg * R) : + ∃ C : Matrix G G K, IsUnit C.det ∧ C * X = R ∧ C.BlockTriangular b := by + letI := Matrix.invertibleOfIsUnitDet Tg hdet + refine ⟨Tg⁻¹, (Matrix.isUnit_nonsing_inv_det_iff).2 hdet, ?_, + Matrix.blockTriangular_inv_of_blockTriangular hT⟩ + rw [hX, ← Matrix.mul_assoc, Matrix.nonsing_inv_mul _ hdet, Matrix.one_mul] + +/-- **Realisability by V-hub ops.** Every V mix factors into transvections (ADD i += c·j between +two V-enders), a diagonal with nonzero entries (SCALEs), and transvections. -/ +theorem vmix_ops (Cm : Matrix G G K) (hC : IsUnit Cm.det) : + ∃ (L L' : List (Matrix.TransvectionStruct G K)) (D : G → K), (∀ g, D g ≠ 0) ∧ + Cm = (L.map Matrix.TransvectionStruct.toMatrix).prod * Matrix.diagonal D * + (L'.map Matrix.TransvectionStruct.toMatrix).prod := by + obtain ⟨L, L', D, hM⟩ := Matrix.Pivot.exists_list_transvec_mul_diagonal_mul_list_transvec Cm + refine ⟨L, L', D, fun g hg => ?_, hM⟩ + have hdet : Cm.det = ∏ g, D g := by + rw [hM, Matrix.det_mul, Matrix.det_mul, Matrix.TransvectionStruct.det_toMatrix_prod, + Matrix.TransvectionStruct.det_toMatrix_prod, Matrix.det_diagonal]; simp + rw [hdet] at hC + exact hC.ne_zero (Finset.prod_eq_zero (Finset.mem_univ g) hg) + +end Mix + +section Run +open TokenCancel +variable {K Reg C : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] [DecidableEq C] + +/-- Span of the rows of a state. -/ +abbrev Sp (s : St K Reg C) : Submodule K (Reg → K) := span K (Set.range s.row) + +/-- Rows of the other registers. -/ +abbrev Oth (s : St K Reg C) (i : Reg) : Submodule K (Reg → K) := span K (s.row '' {r | r ≠ i}) + +theorem span_range_update (f : Reg → Reg → K) (i : Reg) (v : Reg → K) : + span K (Set.range (Function.update f i v)) = span K (f '' {r | r ≠ i}) ⊔ K ∙ v := by + have : Set.range (Function.update f i v) = f '' {r | r ≠ i} ∪ {v} := by + ext x; constructor + · rintro ⟨r, rfl⟩ + by_cases hr : r = i + · subst hr; simp + · left; exact ⟨r, hr, by simp [Function.update_of_ne hr]⟩ + · rintro (⟨r, hr, rfl⟩ | hx) + · exact ⟨r, by simp [Function.update_of_ne (show r ≠ i from hr)]⟩ + · rw [Set.mem_singleton_iff] at hx; exact ⟨i, by simp [hx]⟩ + rw [this, span_union] + +theorem span_range_eq (f : Reg → Reg → K) (i : Reg) : + span K (Set.range f) = span K (f '' {r | r ≠ i}) ⊔ K ∙ f i := by + conv_lhs => rw [show f = Function.update f i (f i) by simp] + exact span_range_update f i (f i) + +theorem sup_singleton_add (S : Submodule K (Reg → K)) (x w : Reg → K) (hw : w ∈ S) : + S ⊔ K ∙ (x + w) = S ⊔ K ∙ x := by + apply le_antisymm + · refine sup_le le_sup_left ((span_singleton_le_iff_mem _ _).2 ?_) + exact add_mem (mem_sup_right (mem_span_singleton_self x)) (mem_sup_left hw) + · refine sup_le le_sup_left ((span_singleton_le_iff_mem _ _).2 ?_) + have h := sub_mem (mem_sup_right (mem_span_singleton_self (x + w)) : x + w ∈ S ⊔ K ∙ (x + w)) + (mem_sup_left hw : w ∈ S ⊔ K ∙ (x + w)) + simpa using h + +/-- A loss of rank: CLEAR or COPY (onto a different source) of a row that is not in the span of +the other rows at that instant. -/ +def Lossy (s : St K Reg C) : Ev K Reg C → Prop + | .clear i _ => s.row i ∉ Oth s i + | .copy i j _ => i ≠ j ∧ s.row i ∉ Oth s i + | _ => False + +/-- A loss somewhere along the run. -/ +def Loss : St K Reg C → List (Ev K Reg C) → Prop + | _, [] => False + | s, e :: es => Lossy s e ∨ Loss (step s e) es + +/-- Every SCALE factor is nonzero (a SCALE by 0 is a CLEAR). -/ +def NZ : Ev K Reg C → Prop + | .scale _ u _ => u ≠ 0 + | _ => True + +/-- Tokens: registers present at the start plus registers born so far. -/ +def tokStep (T : Finset Reg) : Ev K Reg C → Finset Reg + | .born i _ => insert i T + | _ => T + +def tokRun (T : Finset Reg) : List (Ev K Reg C) → Finset Reg + | [] => T + | e :: es => tokRun (tokStep T e) es + +/-- Token span. -/ +abbrev TS (T : Finset Reg) : Submodule K (Reg → K) := + span K ((fun r => (Pi.single r (1 : K) : Reg → K)) '' (T : Set Reg)) + +theorem finrank_TS (T : Finset Reg) : finrank K (TS (K := K) T) = T.card := by + let b : T → Reg → K := fun r => Pi.single (r : Reg) (1 : K) + have hb : LinearIndependent K b := by + have := (Pi.basisFun K Reg).linearIndependent.comp (Subtype.val : T → Reg) Subtype.val_injective + convert this using 1; funext r; simp [b, Pi.basisFun_apply] + have hr : Set.range b = (fun r => (Pi.single r (1 : K) : Reg → K)) '' (T : Set Reg) := by + ext x; simp [b] + have := finrank_span_eq_card hb + rw [hr] at this + rw [this, Fintype.card_coe] + +variable (z V : C) + +/-- Bookkeeping invariant: absent registers have row 0; tokens are present registers. -/ +def Good (s : St K Reg C) (T : Finset Reg) : Prop := + (∀ r, s.loc r = none → s.row r = 0) ∧ (∀ r ∈ T, s.loc r ≠ none) + +theorem good_step (s : St K Reg C) (T : Finset Reg) (e : Ev K Reg C) + (hL : LegalEv z V s e) (hG : Good s T) : Good (step s e) (tokStep T e) := by + obtain ⟨h1, h2⟩ := hG + cases e with + | born i c => + refine ⟨fun r hr => ?_, fun r hr => ?_⟩ + · by_cases hri : r = i + · subst hri; simp [step] at hr + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact h1 r hr + · by_cases hri : r = i + · subst hri; simp [step] + · simp only [tokStep, Finset.mem_insert, hri, false_or] at hr + simp only [step, Function.update_of_ne hri]; exact h2 r hr + | init i c => + refine ⟨fun r hr => ?_, fun r hr => ?_⟩ + · by_cases hri : r = i + · subst hri; simp [step] + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact h1 r hr + · by_cases hri : r = i + · subst hri; simp [step] + · simp only [step, Function.update_of_ne hri]; exact h2 r hr + | move i c => + refine ⟨fun r hr => ?_, fun r hr => ?_⟩ + · by_cases hri : r = i + · subst hri; simp [step] at hr + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact h1 r hr + · by_cases hri : r = i + · subst hri; simp [step] + · simp only [step, Function.update_of_ne hri]; exact h2 r hr + | add i j a c => + obtain ⟨-, hi, -⟩ := hL + refine ⟨fun r hr => ?_, h2⟩ + by_cases hri : r = i + · subst hri; simp [step, hi] at hr + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact h1 r hr + | scale i u c => + have hi : s.loc i = some c := hL + refine ⟨fun r hr => ?_, h2⟩ + by_cases hri : r = i + · subst hri; simp only [step] at hr; rw [hi] at hr; exact absurd hr (by simp) + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact h1 r hr + | clear i c => + refine ⟨fun r hr => ?_, h2⟩ + by_cases hri : r = i + · subst hri; simp [step] + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact h1 r hr + | copy i j c => + obtain ⟨hi, -⟩ := hL + refine ⟨fun r hr => ?_, h2⟩ + by_cases hri : r = i + · subst hri; simp [step, hi] at hr + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact h1 r hr + +theorem Sp_eq_oth (s : St K Reg C) (i : Reg) : Sp s = Oth s i ⊔ K ∙ s.row i := + span_range_eq s.row i + +theorem Sp_update (s : St K Reg C) (i : Reg) (v : Reg → K) (l : Reg → Option C) : + Sp (⟨Function.update s.row i v, l⟩ : St K Reg C) = Oth s i ⊔ K ∙ v := + span_range_update s.row i v + +theorem mem_oth (s : St K Reg C) {i j : Reg} (h : j ≠ i) : s.row j ∈ Oth s i := + subset_span ⟨j, h, rfl⟩ + +/-- **Only CLEAR (and COPY) can lose rank.** Every non-birth op keeps the row span inside the +old one. -/ +theorem Sp_step_le (s : St K Reg C) (T : Finset Reg) (e : Ev K Reg C) (hb : ∀ i c, e ≠ .born i c) + (hL : LegalEv z V s e) (hG : Good s T) : Sp (step s e) ≤ Sp s := by + cases e with + | born i c => exact absurd rfl (hb i c) + | init i c => + have h0 : s.row i = 0 := hG.1 i hL + simp only [step]; rw [Sp_update, Sp_eq_oth s i, h0] + | move i c => exact le_rfl + | add i j a c => + simp only [step]; rw [Sp_update, Sp_eq_oth s i, + sup_singleton_add _ _ _ (smul_mem _ _ (mem_oth s (Ne.symm hL.1)))] + | scale i u c => + simp only [step]; rw [Sp_update, Sp_eq_oth s i] + exact sup_le_sup_left ((span_singleton_le_iff_mem _ _).2 + (smul_mem _ _ (mem_span_singleton_self _))) _ + | clear i c => + simp only [step]; rw [Sp_update, Sp_eq_oth s i, span_singleton_eq_bot.2 rfl, sup_bot_eq] + exact le_sup_left + | copy i j c => + simp only [step]; rw [Sp_update, Sp_eq_oth s i] + by_cases hij : j = i + · subst hij; exact le_rfl + · exact sup_le le_sup_left (le_trans ((span_singleton_le_iff_mem _ _).2 (mem_oth s hij)) + le_sup_left) + +theorem TS_insert (T : Finset Reg) (i : Reg) : + TS (K := K) (insert i T) = TS (K := K) T ⊔ K ∙ (Pi.single i (1 : K) : Reg → K) := by + simp only [TS, Finset.coe_insert, Set.image_insert_eq, span_insert]; exact sup_comm _ _ + +/-- A non-lossy step keeps the row span equal to the token span (SCALE factors nonzero). -/ +theorem Sp_step_noloss (s : St K Reg C) (T : Finset Reg) (e : Ev K Reg C) + (hL : LegalEv z V s e) (hN : NZ e) (hG : Good s T) (hS : Sp s = TS T) (hl : ¬ Lossy s e) : + Sp (step s e) = TS (tokStep T e) := by + cases e with + | born i c => + have h0 : s.row i = 0 := hG.1 i hL + have : Sp s = Oth s i := by rw [Sp_eq_oth s i, h0, span_singleton_eq_bot.2 rfl, sup_bot_eq] + simp only [step, tokStep]; rw [Sp_update, TS_insert, ← hS, this] + | init i c => + have h0 : s.row i = 0 := hG.1 i hL + simp only [step, tokStep]; rw [Sp_update, ← hS, Sp_eq_oth s i, h0] + | move i c => exact hS + | add i j a c => + simp only [step, tokStep]; rw [Sp_update, ← hS, Sp_eq_oth s i, + sup_singleton_add _ _ _ (smul_mem _ _ (mem_oth s (Ne.symm hL.1)))] + | scale i u c => + simp only [step, tokStep]; rw [Sp_update, ← hS, Sp_eq_oth s i, + span_singleton_smul_eq (IsUnit.mk0 _ hN)] + | clear i c => + have hm : s.row i ∈ Oth s i := not_not.1 hl + simp only [step, tokStep]; rw [Sp_update, ← hS, Sp_eq_oth s i, span_singleton_eq_bot.2 rfl, + sup_bot_eq, sup_eq_left.2 ((span_singleton_le_iff_mem _ _).2 hm)] + | copy i j c => + simp only [step, tokStep] + by_cases hij : j = i + · subst hij; simpa using hS + · have hm : s.row i ∈ Oth s i := by + by_contra h; exact hl ⟨Ne.symm hij, h⟩ + rw [Sp_update, ← hS, Sp_eq_oth s i, sup_eq_left.2 ((span_singleton_le_iff_mem _ _).2 hm), + sup_eq_left.2 ((span_singleton_le_iff_mem _ _).2 (mem_oth s hij))] + +open Classical in +/-- Rank bookkeeping for one step: rank + tokens never gains, and a lossy step loses one. -/ +theorem rank_step (s : St K Reg C) (T : Finset Reg) (e : Ev K Reg C) + (hL : LegalEv z V s e) (hG : Good s T) : + finrank K (Sp (step s e)) + T.card + (if Lossy s e then 1 else 0) ≤ + finrank K (Sp s) + (tokStep T e).card := by + classical + by_cases hb : ∃ i c, e = .born i c + · obtain ⟨i, c, rfl⟩ := hb + have hloc : s.loc i = none := hL + have h0 : s.row i = 0 := hG.1 i hloc + have hiT : i ∉ T := fun h => hG.2 i h hloc + have hl : ¬ Lossy s (.born i c : Ev K Reg C) := id + simp only [hl, if_false, add_zero, tokStep, Finset.card_insert_of_notMem hiT] + have hS : Sp s = Oth s i := by rw [Sp_eq_oth s i, h0, span_singleton_eq_bot.2 rfl, sup_bot_eq] + have hE : Sp (step s (.born i c)) = Oth s i ⊔ K ∙ (Pi.single i (1:K) : Reg → K) := by + simp only [step]; rw [Sp_update] + have e1 := congrArg (fun S : Submodule K (Reg → K) => finrank K S) hE + have e2 := congrArg (fun S : Submodule K (Reg → K) => finrank K S) hS + have := Submodule.finrank_add_le_finrank_add_finrank (Oth s i) (K ∙ (Pi.single i (1:K) : Reg → K)) + have hv : (Pi.single i (1:K) : Reg → K) ≠ 0 := fun h => by simpa using congrFun h i + have h1 := finrank_span_singleton (K := K) hv + omega + · push Not at hb + have hle := Sp_step_le z V s T e hb hL hG + have hT : tokStep T e = T := by cases e <;> simp_all [tokStep] + rw [hT] + by_cases hl : Lossy s e + · simp only [hl, if_true] + have hlt : Sp (step s e) < Sp s := by + refine lt_of_le_of_ne hle (fun heq => ?_) + cases e with + | clear i c => + apply hl + have : s.row i ∈ Sp s := subset_span ⟨i, rfl⟩ + rw [← heq] at this; simp only [step] at this + rw [Sp_update, span_singleton_eq_bot.2 rfl, sup_bot_eq] at this; exact this + | copy i j c => + apply hl.2 + have : s.row i ∈ Sp s := subset_span ⟨i, rfl⟩ + rw [← heq] at this; simp only [step] at this + rwa [Sp_update, sup_eq_left.2 ((span_singleton_le_iff_mem _ _).2 (mem_oth s hl.1.symm))] + at this + | _ => exact hl.elim + have := Submodule.finrank_lt_finrank_of_lt hlt + omega + · simp only [hl, if_false] + have := Submodule.finrank_mono hle + omega + +/-- No loss along a legal run (SCALE factors nonzero): the final row span is the token span. -/ +theorem span_run (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (hl : ¬ Loss s evs) : Sp (run s evs) = TS (tokRun T evs) := by + induction evs generalizing s T with + | nil => exact hS + | cons e es ih => + simp only [Loss, not_or] at hl + exact ih (step s e) (tokStep T e) hL.2 (fun e' he' => hN e' (List.mem_cons_of_mem _ he')) + (good_step z V s T e hL.1 hG) + (Sp_step_noloss z V s T e hL.1 (hN e List.mem_cons_self) hG hS hl.1) hl.2 + +/-- Rank bookkeeping along a legal run: any slack m is kept, and a loss adds one more unit. -/ +theorem rank_run (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hG : Good s T) (m : ℕ) (hm : finrank K (Sp s) + m ≤ T.card) : + finrank K (Sp (run s evs)) + m ≤ (tokRun T evs).card ∧ + (Loss s evs → finrank K (Sp (run s evs)) + m + 1 ≤ (tokRun T evs).card) := by + induction evs generalizing s T m with + | nil => exact ⟨hm, fun h => h.elim⟩ + | cons e es ih => + simp only [run, tokRun] + have hst := rank_step z V s T e hL.1 hG + have hG' := good_step z V s T e hL.1 hG + by_cases hl : Lossy s e + · simp only [hl, if_true] at hst + have := (ih (step s e) (tokStep T e) hL.2 hG' (m + 1) (by omega)).1 + exact ⟨le_trans (Nat.le_succ _) this, fun _ => this⟩ + · simp only [hl, if_false, add_zero] at hst + have := ih (step s e) (tokStep T e) hL.2 hG' m (by omega) + refine ⟨this.1, fun hlo => ?_⟩ + simp only [Loss, hl, false_or] at hlo + exact this.2 hlo + +/-- **Rank is lost exactly at lossy CLEAR/COPY.** For a legal run from a state whose rows span its +tokens (all SCALE factors nonzero), the final row span equals the final token span iff the run +contains no lossy event. -/ +theorem full_rank_iff_noloss (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) : + Sp (run s evs) = TS (tokRun T evs) ↔ ¬ Loss s evs := by + refine ⟨fun h hl => ?_, span_run z V s T evs hL hN hG hS⟩ + have h0 : finrank K (Sp s) + 0 ≤ T.card := by + rw [hS, finrank_TS]; simp + have := (rank_run z V s T evs hL hG 0 h0).2 hl + have e := congrArg (fun S : Submodule K (Reg → K) => finrank K S) h + rw [e, finrank_TS] at this + omega + +/-- Cancellation: two subspaces of `U` with the same sum against a complement-to-`U` piece agree. -/ +theorem eq_of_sup_eq {M : Type*} [AddCommGroup M] [Module K M] (A B N U : Submodule K M) + (hA : A ≤ U) (hB : B ≤ U) (hUN : U ⊓ N = ⊥) (h : A ⊔ N = B ⊔ N) : A = B := by + have key : ∀ A B : Submodule K M, A ≤ U → B ≤ U → A ⊔ N = B ⊔ N → A ≤ B := by + intro A B hA hB h x hx + have : x ∈ B ⊔ N := h ▸ mem_sup_left hx + obtain ⟨b, hb, n, hn, rfl⟩ := mem_sup.1 this + have hnU : n ∈ U := by + have := sub_mem (hA hx) (hB hb); simpa using this + have : n ∈ U ⊓ N := ⟨hnU, hn⟩ + rw [hUN, mem_bot] at this; subst this; simpa using hb + exact le_antisymm (key A B hA hB h) (key B A hB hA h.symm) + +theorem span_range_split (f : Reg → Reg → K) (G1 : Finset Reg) : + span K (Set.range f) = span K (f '' (G1 : Set Reg)) ⊔ span K (f '' (G1 : Set Reg)ᶜ) := by + rw [← span_union, ← Set.image_union, Set.union_compl_self, Set.image_univ] + +theorem range_restrict (f : Reg → Reg → K) (G1 : Finset Reg) : + Set.range (Matrix.of fun g : G1 => f g).row = f '' (G1 : Set Reg) := by + ext x; constructor + · rintro ⟨g, rfl⟩; exact ⟨g, g.2, rfl⟩ + · rintro ⟨g, hg, rfl⟩; exact ⟨⟨g, hg⟩, rfl⟩ + +/-- The V mix of a run: an invertible `C` over the registers `G1` that end at V with +`C · X[G1] = Rf[G1]`, where `X` are the end rows of the run (all V-hub ops deleted). -/ +def VMix (X Rf : Reg → Reg → K) (G1 : Finset Reg) : Prop := + VMixM (Matrix.of fun g : G1 => X g) (Matrix.of fun g : G1 => Rf g) + +/-- **RANK law (internal notes).** Run a legal word (V-hub ops deleted, SCALE factors +nonzero) from a state whose rows span its tokens. Let `G1` end at V; assume every other register +already ends at its target (`hNon`), and the target end state has full token rank (`hTgt`). +Let `U` be the "zero-W0" subspace (T_X + tokens): it contains the V targets (`hRU`) and meets the +span of the non-V targets only in 0 (`hUN`). Then a V mix exists iff +(i) no CLEAR/COPY loses rank and (ii) every V-ender row lies in `U`. -/ +theorem rank_law (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (Rf : Reg → Reg → K) (G1 : Finset Reg) (U : Submodule K (Reg → K)) + (hNon : ∀ r ∉ G1, (run s evs).row r = Rf r) + (hTgt : span K (Set.range Rf) = TS (tokRun T evs)) + (hRU : ∀ g ∈ G1, Rf g ∈ U) + (hUN : U ⊓ span K (Rf '' (G1 : Set Reg)ᶜ) = ⊥) : + VMix (run s evs).row Rf G1 ↔ ¬ Loss s evs ∧ ∀ g ∈ G1, (run s evs).row g ∈ U := by + set X := (run s evs).row with hXdef + have hNim : X '' (G1 : Set Reg)ᶜ = Rf '' (G1 : Set Reg)ᶜ := + Set.image_congr (fun r hr => hNon r (by simpa using hr)) + have hBU : span K (Rf '' (G1 : Set Reg)) ≤ U := + span_le.2 (by rintro _ ⟨g, hg, rfl⟩; exact hRU g hg) + unfold VMix + rw [vmixM_iff_span, range_restrict, range_restrict] + constructor + · intro hAB + have hfull : Sp (run s evs) = TS (tokRun T evs) := by + rw [← hTgt, Sp, ← hXdef, span_range_split X G1, span_range_split Rf G1, hAB, hNim] + refine ⟨(full_rank_iff_noloss z V s T evs hL hN hG hS).1 hfull, fun g hg => ?_⟩ + exact hBU (hAB ▸ subset_span ⟨g, hg, rfl⟩) + · rintro ⟨hl, hU⟩ + have hfull := span_run z V s T evs hL hN hG hS hl + have hsum : span K (X '' (G1 : Set Reg)) ⊔ span K (Rf '' (G1 : Set Reg)ᶜ) = + span K (Rf '' (G1 : Set Reg)) ⊔ span K (Rf '' (G1 : Set Reg)ᶜ) := by + rw [← hNim, ← span_range_split X G1, hNim, ← span_range_split Rf G1, hTgt]; exact hfull + exact eq_of_sup_eq _ _ _ U (span_le.2 (by rintro _ ⟨g, hg, rfl⟩; exact hU g hg)) hBU hUN hsum + +/-- ADD and SCALE (nonzero) are invertible ops: an inverse op restores the state exactly. -/ +theorem add_inverse (s : St K Reg C) (i j : Reg) (a : K) (c : C) (hij : i ≠ j) : + step (step s (.add i j a c)) (.add i j (-a) c) = s := by + obtain ⟨row, loc⟩ := s + simp only [step, St.mk.injEq, and_true] + funext r; by_cases hr : r = i + · subst hr; simp [Function.update_of_ne (Ne.symm hij)] + · simp [Function.update_of_ne hr] + +theorem scale_inverse (s : St K Reg C) (i : Reg) (u : K) (c : C) (hu : u ≠ 0) : + step (step s (.scale i u c)) (.scale i u⁻¹ c) = s := by + obtain ⟨row, loc⟩ := s + simp only [step, St.mk.injEq, and_true] + funext r; by_cases hr : r = i + · subst hr; simp [smul_smul, inv_mul_cancel₀ hu] + · simp [Function.update_of_ne hr] + +/-- The canonical start: present registers carry their own coordinate, absent ones 0. -/ +def start (l : Reg → Option C) : St K Reg C := + ⟨fun r => if l r = none then 0 else Pi.single r 1, l⟩ + +def startTok (l : Reg → Option C) : Finset Reg := Finset.univ.filter fun r => l r ≠ none + +theorem start_good (l : Reg → Option C) : Good (start (K := K) l) (startTok l) := + ⟨fun r hr => by simp only [start] at hr ⊢; simp [hr], fun r hr => by simpa [start, startTok] using hr⟩ + +theorem start_span (l : Reg → Option C) : Sp (start (K := K) l) = TS (startTok l) := by + apply le_antisymm + · refine span_le.2 ?_ + rintro _ ⟨r, rfl⟩ + by_cases hr : l r = none + · simp [start, hr] + · simp only [start, hr, if_false] + exact subset_span ⟨r, by simpa [startTok] using hr, rfl⟩ + · refine span_le.2 ?_ + rintro _ ⟨r, hr, rfl⟩ + have hr' : l r ≠ none := by simpa [startTok] using hr + exact subset_span ⟨r, by simp [start, hr']⟩ + +/-- **Finding: COPY is not invertible either.** The prose lists CLEAR as the only rank-losing op; +in the op model with COPY (i := j's row), COPY onto a row outside the others' span loses rank. -/ +theorem copy_lossy_example : + Lossy (start (K := ℚ) (C := Unit) (fun _ : Fin 2 => some ())) (.copy 0 1 ()) := by + refine ⟨by decide, fun h => ?_⟩ + have himg : (start (K := ℚ) (C := Unit) (fun _ : Fin 2 => some ())).row '' {r | r ≠ 0} = + {Pi.single 1 1} := by + ext x; simp only [Set.mem_image, Set.mem_ofPred_eq, Set.mem_singleton_iff, start] + constructor + · rintro ⟨r, hr, rfl⟩ + have : r = 1 := by fin_cases r <;> simp_all + subst this; simp + · rintro rfl; exact ⟨1, by decide, by simp⟩ + rw [Oth, himg, mem_span_singleton] at h + obtain ⟨a, ha⟩ := h + have := congrFun ha 0 + simp [start] at this + +end Run + +end RankLaw + +#print axioms RankLaw.rank_law +#print axioms RankLaw.full_rank_iff_noloss +#print axioms RankLaw.vmixM_iff_span +#print axioms RankLaw.vmixM_fill +#print axioms RankLaw.vmix_ops +#print axioms RankLaw.vmixM_unique +#print axioms RankLaw.vmixM_indep +#print axioms RankLaw.copy_lossy_example +#print axioms RankLaw.add_inverse +#print axioms RankLaw.scale_inverse +#print axioms RankLaw.start_span diff --git a/research/p104-reader-ceiling/lean/Nov15/RankLaw.md b/research/p104-reader-ceiling/lean/Nov15/RankLaw.md new file mode 100644 index 0000000000..fbd610a6ce --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/RankLaw.md @@ -0,0 +1,48 @@ +# RankLaw.lean: rebuild's RANK law (RESULT §7, internal log CORE r2). No sorry, ~7 s, 2.2 GB RSS +Source: internal notes §7 and the CORE r2 line in internal log.md. +Axioms: [propext, Classical.choice, Quot.sound]. + +Build (imports the TokenCancel olean): + lake env lean -o .lake/build/lib/lean/Nov15/TokenCancel.olean Nov15/TokenCancel.lean + lake env lean -o .lake/build/lib/lean/Nov15/RankLaw.olean Nov15/RankLaw.lean + +**Model.** TokenCancel's op model and legality (born/init/move/add/scale/clear/copy, co-presence; z, V arbitrary). +- Tokens = registers present at the start plus births so far (`tokRun`). Token span `TS T` = span of the e_r, r ∈ T, with `finrank_TS` = |T|. +- `Good`: absent registers have row 0 and tokens are present. `start l` (own coordinate if present, 0 if absent) satisfies `Good`, and its rows span its tokens (`start_good`, `start_span`). +- `Lossy s e`: a CLEAR of i, or a COPY into i from j ≠ i, while row i ∉ span(other rows) at that instant. `Loss` = some lossy event in the run. `NZ`: SCALE factor ≠ 0. + +**The V-mix target (a linear system).** `VMixM X R` := ∃ C, det C a unit, C·X = R. X = end rows of the V-enders G1 after a run with the V-hub ops deleted, R = their targets. +- `vmixM_iff_span`: solvable iff rowspan X = rowspan R. Built on `exists_equiv_comp`: two maps with equal range differ by an automorphism. +- `vmix_ops`: every such C is a product transvections · diag(D) · transvections with all D ≠ 0, i.e. V-hub ADDs and nonzero SCALEs (Mathlib Pivot). +- `vmixM_indep`: independent targets imply independent end rows. `vmixM_unique`: independent end rows make C unique. + +**Only CLEAR (and COPY) lose rank.** +- `add_inverse` and `scale_inverse` (u ≠ 0): the inverse op restores the state exactly. +- `Sp_step_le`: no non-birth op enlarges the row span. +- `rank_step`, `rank_run`: (row rank) + (slack) never exceeds |tokens|, and a lossy step costs one unit for good. +- `span_run`: with no loss, end row span = token span. +- `full_rank_iff_noloss`: end row span = token span ⟺ no lossy CLEAR/COPY. + +**`rank_law` (the iff).** Assume: +- a legal run with NZ, from a state whose rows span its tokens; +- non-V registers already end on their targets (`hNon`); +- the target end state spans the final tokens (`hTgt`; true when the target is the end of any loss-free legal word with the same births, by `span_run`); +- U ⊇ V targets (`hRU`), and U ∩ span(non-V targets) = 0 (`hUN`). + +Then: V mix exists ⟺ (i) no lossy CLEAR/COPY and (ii) every V-ender end row ∈ U. + +**Token order** (`vmixM_fill` + the shape of `rank_law`). +- Neither existence statement has an order hypothesis, so correctness never depends on the LATE order. +- An order b only shapes C: if X = T·R with T block-triangular for b and invertible, then the V mix C = T⁻¹ is block-triangular. No fill outside the triangle. + +**Findings (prose statements false or underspecified as written).** +1. **"Every op except CLEAR is invertible" is false with COPY.** `copy_lossy_example` (over ℚ, 2 registers): COPY 0←1 is lossy. + - Also SCALE by 0 is a CLEAR. + - Minimal fix: "every op except CLEAR, COPY-over-a-live-row and SCALE 0", or treat COPY as CLEAR + ADD. The law then holds verbatim with Lossy covering COPY. + - #7623 behaviour is unaffected if its words contain no such COPY. Not checked here. +2. **(ii) "zero W0 part" is only the right criterion relative to a U that meets the span of the non-V targets trivially (`hUN`).** Without that, the iff fails. + - Hand example: G1 = {g}, N = {n}, Rf g = e1, Rf n = e2, U = everything, X g = e1 + e2. There is no loss and X g ∈ U, but X g ∉ span{e1}. + - The "only if" of (i) also needs `hTgt`, the target state's full token rank. +3. "The V mix is unique" needs independent end rows. rank X[G1] = |G1| was checked [C] on #7623. + +**Scope.** "Owned" is not used; the law holds for any register. The W0/T_X split enters only through U. diff --git a/research/p104-reader-ceiling/lean/Nov15/RankLawC.lean b/research/p104-reader-ceiling/lean/Nov15/RankLawC.lean new file mode 100644 index 0000000000..5c72771505 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/RankLawC.lean @@ -0,0 +1,167 @@ +/- +RankLaw (c) fix, See RankLawC.md. + +`rank_law` needs U ⊓ span(non-V targets) = ⊥. This file drops that hypothesis: +* `rank_law_gen`: with no U at all, V mix ⟺ no loss ∧ every V-ender row ∈ B ∧ B ⊓ N ≤ A + (B = span V targets, N = span non-V targets, A = span V-ender rows). +* `rank_law_proj`: for any U ⊇ B and any linear π vanishing on B and injective on U ⊓ N, + condition (ii) becomes "row ∈ U and π(row) = 0" (the (U ⊓ N)-component vanishes). +* `rank_law_indep`: if B ⊓ N = ⊥ (independent targets) the third clause disappears. +* `rank_law_of_gen`: the original `rank_law` is the case π = 0. + +Build (imports the RankLaw olean, itself built on TokenCancel): + lake env lean -o .lake/build/lib/lean/Nov15/TokenCancel.olean Nov15/TokenCancel.lean + lake env lean -o .lake/build/lib/lean/Nov15/RankLaw.olean Nov15/RankLaw.lean + lake env lean -o .lake/build/lib/lean/Nov15/RankLawC.olean Nov15/RankLawC.lean +-/ +import Nov15.RankLaw + +set_option linter.unusedSectionVars false + +namespace RankLawC +open Submodule Module TokenCancel RankLaw + +section Lat +variable {K M : Type*} [Field K] [AddCommGroup M] [Module K M] + +/-- Cancellation without a complement: given A ⊔ N = B ⊔ N, A = B iff A ≤ B and B ⊓ N ≤ A. -/ +theorem eq_iff_of_sup_eq (A B N : Submodule K M) (h : A ⊔ N = B ⊔ N) : + A = B ↔ A ≤ B ∧ B ⊓ N ≤ A := by + constructor + · rintro rfl; exact ⟨le_rfl, inf_le_left⟩ + · rintro ⟨hAB, hBN⟩ + refine le_antisymm hAB fun b hb => ?_ + have : b ∈ A ⊔ N := h ▸ mem_sup_left hb + obtain ⟨a, ha, n, hn, rfl⟩ := mem_sup.1 this + have hnB : n ∈ B := by + have := sub_mem hb (hAB ha); simpa using this + exact add_mem ha (hBN ⟨hnB, hn⟩) + +/-- The (U ⊓ N)-component test: if B ≤ U, x ∈ U ⊓ (B ⊔ N), π vanishes on B and is injective on U ⊓ N, +then x ∈ B ⟺ π x = 0. -/ +theorem mem_iff_proj {M' : Type*} [AddCommGroup M'] [Module K M'] (B N U : Submodule K M) + (π : M →ₗ[K] M') (hBU : B ≤ U) (hπB : ∀ b ∈ B, π b = 0) + (hπ : LinearMap.ker π ⊓ (U ⊓ N) = ⊥) (x : M) (hxU : x ∈ U) (hx : x ∈ B ⊔ N) : + x ∈ B ↔ π x = 0 := by + refine ⟨hπB x, fun h0 => ?_⟩ + obtain ⟨b, hb, n, hn, rfl⟩ := mem_sup.1 hx + have hnU : n ∈ U := by + have := sub_mem hxU (hBU hb); simpa using this + have hπn : π n = 0 := by rw [map_add, hπB b hb, zero_add] at h0; exact h0 + have : n ∈ LinearMap.ker π ⊓ (U ⊓ N) := ⟨hπn, hnU, hn⟩ + rw [hπ, mem_bot] at this + subst this; simpa using hb + +end Lat + +section Run +variable {K Reg C : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] [DecidableEq C] +variable (z V : C) + +/-- With no loss (and the RankLaw hypotheses), A ⊔ N = B ⊔ N. -/ +theorem sup_eq_of_noloss (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (Rf : Reg → Reg → K) (G1 : Finset Reg) + (hNon : ∀ r ∉ G1, (run s evs).row r = Rf r) + (hTgt : span K (Set.range Rf) = TS (tokRun T evs)) (hl : ¬ Loss s evs) : + span K ((run s evs).row '' (G1 : Set Reg)) ⊔ span K (Rf '' (G1 : Set Reg)ᶜ) = + span K (Rf '' (G1 : Set Reg)) ⊔ span K (Rf '' (G1 : Set Reg)ᶜ) := by + set X := (run s evs).row with hXdef + have hNim : X '' (G1 : Set Reg)ᶜ = Rf '' (G1 : Set Reg)ᶜ := + Set.image_congr (fun r hr => hNon r (by simpa using hr)) + have hfull := span_run z V s T evs hL hN hG hS hl + rw [← hNim, ← span_range_split X G1, hNim, ← span_range_split Rf G1, hTgt]; exact hfull + +/-- **RankLaw, general form (no U).** Same hypotheses as `RankLaw.rank_law` minus `hRU`/`hUN`. +B = span V targets, N = span non-V targets, A = span V-ender end rows. -/ +theorem rank_law_gen (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (Rf : Reg → Reg → K) (G1 : Finset Reg) + (hNon : ∀ r ∉ G1, (run s evs).row r = Rf r) + (hTgt : span K (Set.range Rf) = TS (tokRun T evs)) : + VMix (run s evs).row Rf G1 ↔ ¬ Loss s evs ∧ + (∀ g ∈ G1, (run s evs).row g ∈ span K (Rf '' (G1 : Set Reg))) ∧ + span K (Rf '' (G1 : Set Reg)) ⊓ span K (Rf '' (G1 : Set Reg)ᶜ) ≤ + span K ((run s evs).row '' (G1 : Set Reg)) := by + set X := (run s evs).row with hXdef + have hNim : X '' (G1 : Set Reg)ᶜ = Rf '' (G1 : Set Reg)ᶜ := + Set.image_congr (fun r hr => hNon r (by simpa using hr)) + unfold VMix + rw [vmixM_iff_span, range_restrict, range_restrict] + have hAle : (∀ g ∈ G1, X g ∈ span K (Rf '' (G1 : Set Reg))) ↔ + span K (X '' (G1 : Set Reg)) ≤ span K (Rf '' (G1 : Set Reg)) := + ⟨fun h => span_le.2 (by rintro _ ⟨g, hg, rfl⟩; exact h g hg), + fun h g hg => h (subset_span ⟨g, hg, rfl⟩)⟩ + constructor + · intro hAB + have hfull : Sp (run s evs) = TS (tokRun T evs) := by + rw [← hTgt, Sp, ← hXdef, span_range_split X G1, span_range_split Rf G1, hAB, hNim] + refine ⟨(full_rank_iff_noloss z V s T evs hL hN hG hS).1 hfull, hAle.2 hAB.le, ?_⟩ + rw [hAB]; exact inf_le_left + · rintro ⟨hl, hB, hBN⟩ + have hsum := sup_eq_of_noloss z V s T evs hL hN hG hS Rf G1 hNon hTgt hl + exact (eq_iff_of_sup_eq _ _ _ hsum).2 ⟨hAle.1 hB, hBN⟩ + +/-- **Corrected condition (ii) relative to an arbitrary U ⊇ V targets.** π is any linear map that +vanishes on the V targets and is injective on U ⊓ N (it reads the "(U ⊓ N)-component"). -/ +theorem rank_law_proj {M' : Type*} [AddCommGroup M'] [Module K M'] + (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (Rf : Reg → Reg → K) (G1 : Finset Reg) (U : Submodule K (Reg → K)) (π : (Reg → K) →ₗ[K] M') + (hNon : ∀ r ∉ G1, (run s evs).row r = Rf r) + (hTgt : span K (Set.range Rf) = TS (tokRun T evs)) + (hRU : ∀ g ∈ G1, Rf g ∈ U) (hπR : ∀ g ∈ G1, π (Rf g) = 0) + (hπ : LinearMap.ker π ⊓ (U ⊓ span K (Rf '' (G1 : Set Reg)ᶜ)) = ⊥) : + VMix (run s evs).row Rf G1 ↔ ¬ Loss s evs ∧ + (∀ g ∈ G1, (run s evs).row g ∈ U ∧ π ((run s evs).row g) = 0) ∧ + span K (Rf '' (G1 : Set Reg)) ⊓ span K (Rf '' (G1 : Set Reg)ᶜ) ≤ + span K ((run s evs).row '' (G1 : Set Reg)) := by + set B := span K (Rf '' (G1 : Set Reg)) + have hBU : B ≤ U := span_le.2 (by rintro _ ⟨g, hg, rfl⟩; exact hRU g hg) + have hπB : ∀ b ∈ B, π b = 0 := by + intro b hb + have : B ≤ LinearMap.ker π := span_le.2 (by rintro _ ⟨g, hg, rfl⟩; exact hπR g hg) + exact this hb + rw [rank_law_gen z V s T evs hL hN hG hS Rf G1 hNon hTgt] + constructor + · rintro ⟨hl, hB, h3⟩ + exact ⟨hl, fun g hg => ⟨hBU (hB g hg), hπB _ (hB g hg)⟩, h3⟩ + · rintro ⟨hl, hU, h3⟩ + have hsum := sup_eq_of_noloss z V s T evs hL hN hG hS Rf G1 hNon hTgt hl + refine ⟨hl, fun g hg => ?_, h3⟩ + have hx : (run s evs).row g ∈ B ⊔ span K (Rf '' (G1 : Set Reg)ᶜ) := + hsum ▸ mem_sup_left (subset_span ⟨g, hg, rfl⟩) + exact (mem_iff_proj B _ U π hBU hπB hπ _ (hU g hg).1 hx).2 (hU g hg).2 + +/-- Independent targets (B ⊓ N = ⊥; true on #7623, whose 1501 public target rows have rank 1501): +the third clause is vacuous, and (ii) is "every V-ender row lies in the span of the V targets". -/ +theorem rank_law_indep (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (Rf : Reg → Reg → K) (G1 : Finset Reg) + (hNon : ∀ r ∉ G1, (run s evs).row r = Rf r) + (hTgt : span K (Set.range Rf) = TS (tokRun T evs)) + (hBN : span K (Rf '' (G1 : Set Reg)) ⊓ span K (Rf '' (G1 : Set Reg)ᶜ) = ⊥) : + VMix (run s evs).row Rf G1 ↔ ¬ Loss s evs ∧ + ∀ g ∈ G1, (run s evs).row g ∈ span K (Rf '' (G1 : Set Reg)) := by + rw [rank_law_gen z V s T evs hL hN hG hS Rf G1 hNon hTgt, hBN] + simp + +/-- Consistency: the original `rank_law` (U ⊓ N = ⊥) is `rank_law_proj` with π = 0. -/ +theorem rank_law_of_gen (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (Rf : Reg → Reg → K) (G1 : Finset Reg) (U : Submodule K (Reg → K)) + (hNon : ∀ r ∉ G1, (run s evs).row r = Rf r) + (hTgt : span K (Set.range Rf) = TS (tokRun T evs)) + (hRU : ∀ g ∈ G1, Rf g ∈ U) + (hUN : U ⊓ span K (Rf '' (G1 : Set Reg)ᶜ) = ⊥) : + VMix (run s evs).row Rf G1 ↔ ¬ Loss s evs ∧ ∀ g ∈ G1, (run s evs).row g ∈ U := by + have hBU : span K (Rf '' (G1 : Set Reg)) ≤ U := + span_le.2 (by rintro _ ⟨g, hg, rfl⟩; exact hRU g hg) + have hBN : span K (Rf '' (G1 : Set Reg)) ⊓ span K (Rf '' (G1 : Set Reg)ᶜ) = ⊥ := + eq_bot_iff.2 (fun x hx => hUN ▸ ⟨hBU hx.1, hx.2⟩) + rw [rank_law_proj (M' := K) z V s T evs hL hN hG hS Rf G1 U 0 hNon hTgt hRU (by simp) + (by simp [hUN]), hBN] + simp + +end Run +end RankLawC diff --git a/research/p104-reader-ceiling/lean/Nov15/RankLawC.md b/research/p104-reader-ceiling/lean/Nov15/RankLawC.md new file mode 100644 index 0000000000..8559526b12 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/RankLawC.md @@ -0,0 +1,30 @@ +# RankLawC.lean: RankLaw condition (ii) when U meets span(non-V targets). No sorry, ~15 s, < 2.2 GB RSS +Imports the RankLaw olean (header has the build chain). Axioms: [propext, Classical.choice, Quot.sound]. + +Notation (end rows of the run with the V-hub ops deleted): +- X = those end rows; +- A = span X[G1]; +- B = span of the V targets Rf[G1]; +- N = span of the non-V targets. + +Hypotheses are those of `RankLaw.rank_law` (legal, NZ, Good, token span, hNon, hTgt), with no hUN. + +- `eq_iff_of_sup_eq`: if A ⊔ N = B ⊔ N, then A = B ⟺ A ≤ B ∧ B ⊓ N ≤ A. +- `rank_law_gen` (no U at all): V mix ⟺ (i) no lossy CLEAR/COPY ∧ (ii) every X g ∈ B ∧ (iii) B ⊓ N ≤ A. +- **`rank_law_proj` (the corrected (ii) for any U ⊇ B).** Let π be any linear map with π = 0 on the V targets and ker π ⊓ (U ⊓ N) = ⊥ (π reads the (U ⊓ N)-component). + Then V mix ⟺ (i) ∧ (ii') every X g ∈ U **and π(X g) = 0** ∧ (iii). + - So "zero W0 part" must be strengthened to "zero W0 part and zero (U ⊓ N)-component". +- `rank_law_indep`: if B ⊓ N = ⊥, (iii) is vacuous and (ii) reads "X g ∈ span V targets". + - This holds on #7623: the 1501 public target rows have rank 1501 (CopyCheck.md), and owned targets are 0. +- `rank_law_of_gen`: the original `rank_law` is `rank_law_proj` with π = 0. + - When U ⊓ N = ⊥, (iii) is automatic because B ⊓ N ≤ U ⊓ N = ⊥. + +Hand examples (why each extra clause is needed): +- **(ii').** RankLaw finding 2: G1 = {g}, N = {n}, Rf g = e1, Rf n = e2, U = everything, X g = e1 + e2. + - Here X g ∈ U but π(X g) ≠ 0 for π = e2-coordinate, and there is no V mix. +- **(iii).** One token e1; Rf g = Rf n = e1; X n = e1, X g = 0; empty run, so no loss. + - X g ∈ B, but A = 0 ≠ B. + - Only possible with dependent targets. + +**Finding.** RankLaw's prose "(ii) zero W0 part" is false when U ⊓ N ≠ 0, which is the natural case U = T_X + tokens: helper tokens e_h are non-V targets. +- Minimal fix: "(ii) every V-ender row is in U and has zero (U ⊓ N)-component"; with dependent targets, add (iii). diff --git a/research/p104-reader-ceiling/lean/Nov15/RelaySandwich.lean b/research/p104-reader-ceiling/lean/Nov15/RelaySandwich.lean new file mode 100644 index 0000000000..e3ad3667c8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/RelaySandwich.lean @@ -0,0 +1,157 @@ +/- +RELAY-SANDWICH law (NEWNATIVE R4 sec 3), See RelaySandwich.md. +Abstract: charts form a lattice; resident i of a relay chart c arrives from chart p i and departs to n i +(p i ≤ c ≤ n i, public steps ascend). Pinned: c = ⨆ p = ⨅ n. Then any chart c' that keeps every +resident's route ascending equals c. Bridge to FrameSep.Route (frames = submodules) included. +Also the cost identity for a 0 -> e helper with k evenly spaced stops: e * ln (k+1) (e = 9: 9 ln (k+1)). +-/ +import Nov15.FrameSep +import Nov15.JunkLB2 + +namespace RelaySandwich + +section Lattice +variable {L ι : Type*} [CompleteLattice L] + +/-- c is pinned by residents with arrival charts p and departure charts n. -/ +structure Pinned (p n : ι → L) (c : L) : Prop where + arrive : ∀ i, p i ≤ c + depart : ∀ i, c ≤ n i + join : c = ⨆ i, p i + meet : c = ⨅ i, n i + +/-- Admissible replacement of the stop: every resident's route stays ascending through c'. -/ +def Admissible (p n : ι → L) (c' : L) : Prop := ∀ i, p i ≤ c' ∧ c' ≤ n i + +/-- **RELAY-SANDWICH**: the only admissible stop chart is c itself. -/ +theorem admissible_unique {p n : ι → L} {c : L} (h : Pinned p n c) {c' : L} + (hc : Admissible p n c') : c' = c := by + apply le_antisymm + · rw [h.meet]; exact le_iInf fun i => (hc i).2 + · rw [h.join]; exact iSup_le fun i => (hc i).1 + +theorem admissible_iff {p n : ι → L} {c : L} (h : Pinned p n c) (c' : L) : + Admissible p n c' ↔ c' = c := + ⟨admissible_unique h, fun e => e ▸ fun i => ⟨h.arrive i, h.depart i⟩⟩ + +/-- Collapse onto a neighbour chart (some resident's previous or next chart d) is impossible +when no neighbour chart equals c. -/ +theorem no_neighbour_collapse {p n : ι → L} {c : L} (h : Pinned p n c) + (hp : ∀ i, p i ≠ c) (hn : ∀ i, n i ≠ c) (j : ι) : + ¬ Admissible p n (p j) ∧ ¬ Admissible p n (n j) := + ⟨fun a => hp j (admissible_unique h a), fun a => hn j (admissible_unique h a)⟩ + +/-- Non-degenerate pinned relay needs two residents (indeed no single resident's chart is c). -/ +theorem pinned_nontrivial {p n : ι → L} {c : L} (h : Pinned p n c) + (hp : ∀ i, p i ≠ c) [Nonempty ι] : ¬ Subsingleton ι := by + intro hs + obtain ⟨i⟩ := ‹Nonempty ι› + apply hp i + rw [h.join] + apply le_antisymm + · exact le_iSup p i + · exact iSup_le fun j => by rw [Subsingleton.elim j i] + +/-- The non-equality hypotheses are not redundant (degenerate resident with p = n = c): the +"neighbour" chart p 0 is admissible, but it equals c, so nothing is collapsed. -/ +example : ∃ (p n : Fin 1 → Prop) (c : Prop), Pinned p n c ∧ Admissible p n (p 0) ∧ p 0 = c := + ⟨fun _ => False, fun _ => False, False, + ⟨fun _ => le_rfl, fun _ => le_rfl, by simp, by simp⟩, fun _ => ⟨le_rfl, le_rfl⟩, rfl⟩ + +end Lattice + +section Route +open FrameSep +variable {K V : Type*} [Field K] [AddCommGroup V] [Module K V] + +/-- Replace the frame at time t+1 by c'. -/ +def restop (R : Route K V) (t : ℕ) (c' : Submodule K V) : ℕ → Submodule K V := + Function.update R.f (t + 1) c' + +/-- If steps t and t+1 are public, the stop-replaced frame sequence has every step ascending +iff c' sits between the frames at t and t+2 (the route-ordering side of a collapse). -/ +theorem restop_valid_iff (R : Route K V) (t : ℕ) (h0 : ¬ R.owned t) (h1 : ¬ R.owned (t + 1)) + (c' : Submodule K V) : + (∀ s, ¬ R.owned s → restop R t c' s ≤ restop R t c' (s + 1)) ↔ + (R.f t ≤ c' ∧ c' ≤ R.f (t + 2)) := by + constructor + · intro h + have a := h t h0 + have b := h (t + 1) h1 + simp only [restop, Function.update_self, Function.update_of_ne (show t ≠ t + 1 by omega), + Function.update_of_ne (show t + 2 ≠ t + 1 by omega)] at a b + exact ⟨a, b⟩ + · rintro ⟨a, b⟩ s hs + by_cases e1 : s = t + · subst e1; simpa [restop] using a + by_cases e2 : s = t + 1 + · subst e2; simpa [restop] using b + have n1 : s ≠ t + 1 := e2 + have n2 : s + 1 ≠ t + 1 := fun h => e1 (by omega) + simpa [restop, Function.update_of_ne n1, Function.update_of_ne n2] using R.pub s hs + +/-- **Frame form.** Residents i with routes R i, each with public steps t i, t i + 1 and +frame c at time t i + 1; pinned by their frames at t i and t i + 2. If every resident's +stop-replaced route (stop chart c') is valid, c' = c. -/ +theorem route_collapse {ι : Type*} (R : ι → Route K V) (t : ι → ℕ) + (h0 : ∀ i, ¬ (R i).owned (t i)) (h1 : ∀ i, ¬ (R i).owned (t i + 1)) + {c : Submodule K V} + (hp : Pinned (fun i => (R i).f (t i)) (fun i => (R i).f (t i + 2)) c) + {c' : Submodule K V} + (hv : ∀ i, ∀ s, ¬ (R i).owned s → restop (R i) (t i) c' s ≤ restop (R i) (t i) c' (s + 1)) : + c' = c := + admissible_unique hp fun i => (restop_valid_iff (R i) (t i) (h0 i) (h1 i) c').1 (hv i) + +end Route + +section Cost +open JunkLB2 + +/-- Cost of a helper going 0 -> e in k+1 equal moves (k stops), per-stay accounting: +D0 = f(e) - Σ f(gap) over the k+1 moves. -/ +noncomputable def stopCost (f : ℝ → ℝ) (e : ℝ) (k : ℕ) : ℝ := + f e - ((List.replicate (k + 1) (f (e / (k + 1)))).sum) + +theorem stopCost_eq (f : ℝ → ℝ) (e : ℝ) (k : ℕ) : + stopCost f e k = f e - (k + 1) * f (e / (k + 1)) := by + simp [stopCost, List.sum_replicate, nsmul_eq_mul] + +/-- For f(r) = r ln r the cost is e ln (k+1). -/ +theorem stopCost_fL (e : ℝ) (k : ℕ) : stopCost fL e k = e * Real.log (k + 1) := by + have hk : (0 : ℝ) < (k : ℝ) + 1 := by positivity + rw [stopCost_eq] + unfold fL + by_cases he : e = 0 + · simp [he] + have hd : e / ((k : ℝ) + 1) ≠ 0 := div_ne_zero he hk.ne' + rw [Real.log_div he hk.ne'] + field_simp + ring + +/-- The 0 -> 9 helper: 9 ln (k+1). -/ +theorem stopCost_nine (k : ℕ) : stopCost fL 9 k = 9 * Real.log (k + 1) := stopCost_fL 9 k + +/-- Integer-gap cases (gap 9/(k+1) integral): k = 0, 2, 8 give 0, 9 ln 3, 9 ln 9 = 18 ln 3. -/ +theorem stopCost_k2 : stopCost fL 9 2 = 9 * Real.log 3 := by + rw [stopCost_nine]; norm_num + +/-- Stops are paid: cost is strictly increasing in k (convexity not needed for f = r ln r). -/ +theorem stopCost_strictMono {k m : ℕ} (h : k < m) : stopCost fL 9 k < stopCost fL 9 m := by + rw [stopCost_nine, stopCost_nine] + have : Real.log ((k : ℝ) + 1) < Real.log ((m : ℝ) + 1) := + Real.log_lt_log (by positivity) (by exact_mod_cast Nat.add_lt_add_right h 1) + linarith + +end Cost + +#print axioms admissible_unique +#print axioms no_neighbour_collapse +#print axioms pinned_nontrivial +#print axioms restop_valid_iff +#print axioms route_collapse +#print axioms stopCost_fL +#print axioms stopCost_nine +#print axioms stopCost_k2 +#print axioms stopCost_strictMono + +end RelaySandwich diff --git a/research/p104-reader-ceiling/lean/Nov15/RelaySandwich.md b/research/p104-reader-ceiling/lean/Nov15/RelaySandwich.md new file mode 100644 index 0000000000..ecd7b9337e --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/RelaySandwich.md @@ -0,0 +1,17 @@ +# RelaySandwich.lean: NEWNATIVE R4 LAW RELAY-SANDWICH + stop-cost identity +Imports Nov15.FrameSep, Nov15.JunkLB2. Kernel-only, 5 s / 2.3 GB, no sorry/native_decide; 9 `#print axioms` all within [propext, Classical.choice, Quot.sound] (the lattice theorems use none). +Build: FrameSep olean was missing; built with `runlean.sh Nov15/FrameSep.lean .lake/build/lib/lean/Nov15/FrameSep.olean`. + +## Results +- `Pinned p n c`: p i ≤ c ≤ n i, c = ⨆ p, c = ⨅ n (any complete lattice, any index type). +- `admissible_unique` / `admissible_iff`: a chart c' keeping every resident ascending (p i ≤ c' ≤ n i) equals c. So no stop can be moved or collapsed to another chart while all residents still meet there. +- `no_neighbour_collapse`: if no p i or n i equals c, no neighbour chart (p j or n j) is admissible. +- `pinned_nontrivial`: under p i ≠ c a pinned relay has at least 2 residents. +- `restop_valid_iff`, `route_collapse`: frame form on FrameSep.Route (submodules). Replacing the frame at t+1 by c' keeps all public steps ascending iff f t ≤ c' ≤ f (t+2); for residents pinned by those frames, c' = c. +- `stopCost_fL`: helper 0 -> e with k stops (k+1 equal moves), D0 = f(e) - Σ f(gap) = e ln(k+1) for f = r ln r; `stopCost_nine`: 9 ln(k+1). `stopCost_strictMono`: strictly increasing in k. k = 2 gives 9 ln 3 (integer gap 3). + +## Scope / statements checked +- R4's law is TRUE as written, with one reading made explicit: "collapse" means a chart change that keeps ALL residents at one common chart (they must meet to relay). If a single resident drops its stop it stops meeting the others; that is partner-changing re-routing, which R4 puts out of scope (its test (c)). +- The non-equality hypothesis is needed only to make neighbour charts distinct from c; uniqueness of an admissible chart holds without it (example in the file: degenerate p = n = c). +- Cost identity: "evenly spaced" gives integer dims only for (k+1) | 9 (k = 0, 2, 8). For other k the identity is the real-gap version (PRICEKIT charges |Δ dim| with integer dims, so it needs integer gaps). Per-stay form: this is FloorD0's chD0 = f(e - d0) - Σ f(|Δ|) specialised to equal gaps; I proved the closed form directly, not via the MChain machinery. +- Not formalised: that the 238/254 families in R4 (c) really satisfy Pinned (computational [C] fact). diff --git a/research/p104-reader-ceiling/lean/Nov15/SwapNull.lean b/research/p104-reader-ceiling/lean/Nov15/SwapNull.lean new file mode 100644 index 0000000000..c106f29bce --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/SwapNull.lean @@ -0,0 +1,732 @@ +/- +SwapNull, See SwapNull.md. +Formalises LAWBUILD M3's law SWAP-NULL (internal notes). + +Part A (op level, TokenCancel's model): the 4-op swap gadget + add h1 h2 (+1); add h2 h1 (-1); add h1 h2 (+1); scale h2 (-1) (3 ADD + SCALE -1, all at chart c) +exchanges the rows of h1 and h2. Tail swap = gadget, then every later event renamed h1<->h2: +the final state is the unswapped final state with the rows of h1, h2 exchanged (`tail_run`). +Head swap = earlier events renamed, then gadget: every final row has its h1/h2 COORDINATES +exchanged (`head_run`). +Part B (hub model, matrix level): only a V mix L (acts on V-ender rows) or a {0}-prefix M (acts on +G0 columns) can undo that; exact statements `tail_iff`, `head_iff`, `undo_one_iff`. +Part C (ladder): per-helper cost f(e-b) - sum f(gaps) (RelaySandwich.stopCost); the swap leaves the +stay multiset unchanged and changes the span terms by a rectangle difference, which is 0 iff the +ends agree or the births agree (`delta_eq`, `delta_zero_end`, `delta_zero_birth`). +Part D: law bundle and a concrete witness. +-/ +import Nov15.TokenCancel +import Nov15.RelaySandwich +import Nov15.SwapWord +import Mathlib.Data.Matrix.Mul +import Mathlib.LinearAlgebra.Matrix.ToLin + +set_option linter.unusedSectionVars false + +namespace SwapNull +open TokenCancel + +/-! ### Part A: the gadget and the two renamings -/ +section Op +variable {K Reg C : Type*} [Field K] [DecidableEq Reg] [DecidableEq C] + +/-- The 4-op swap gadget at chart `c`. -/ +def gadget (h1 h2 : Reg) (c : C) : List (Ev K Reg C) := + [.add h1 h2 1 c, .add h2 h1 (-1) c, .add h1 h2 1 c, .scale h2 (-1) c] + +theorem gadget_legal (h1 h2 : Reg) (hne : h1 ≠ h2) (c : C) (z V : C) (s : St K Reg C) + (a : s.loc h1 = some c) (b : s.loc h2 = some c) : + Legal z V s (gadget h1 h2 c) := by + simp [gadget, Legal, LegalEv, step, hne, hne.symm, a, b] + +/-- Rows and locations read through a register permutation. -/ +def permSt (σ : Equiv.Perm Reg) (s : St K Reg C) : St K Reg C := + ⟨fun r => s.row (σ r), fun r => s.loc (σ r)⟩ + +/-- Rows with their coordinates read through σ. -/ +def cpermSt (σ : Equiv.Perm Reg) (s : St K Reg C) : St K Reg C := + ⟨fun r => fun k => s.row r (σ k), s.loc⟩ + +def ren (σ : Equiv.Perm Reg) : Ev K Reg C → Ev K Reg C + | .born i c => .born (σ i) c + | .init i c => .init (σ i) c + | .move i c => .move (σ i) c + | .add i j a c => .add (σ i) (σ j) a c + | .scale i u c => .scale (σ i) u c + | .clear i c => .clear (σ i) c + | .copy i j c => .copy (σ i) (σ j) c + +theorem gadget_run (h1 h2 : Reg) (hne : h1 ≠ h2) (c : C) (s : St K Reg C) : + (run s (gadget h1 h2 c)).row = (fun r => s.row (Equiv.swap h1 h2 r)) ∧ + (run s (gadget h1 h2 c)).loc = s.loc := by + refine ⟨?_, ?_⟩ + · funext r + by_cases r1 : r = h1 + · subst r1 + simp [gadget, run, step, hne, hne.symm] + · by_cases r2 : r = h2 + · subst r2 + simp [gadget, run, step, hne, hne.symm, Function.update_apply] + · simp [gadget, run, step, r1, r2, Function.update_apply, Equiv.swap_apply_of_ne_of_ne] + · simp [gadget, run, step] + +lemma upd_perm {β : Type*} (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (f : Reg → β) + (i : Reg) (v : β) : + (fun r => Function.update f i v (σ r)) = Function.update (fun r => f (σ r)) (σ i) v := by + funext r + simp only [Function.update_apply] + have : σ r = i ↔ r = σ i := ⟨fun h => by rw [← h, hσ], fun h => by rw [h, hσ]⟩ + simp only [this] + +theorem step_permSt (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (s : St K Reg C) + (e : Ev K Reg C) (hb : ∀ i c, e = .born i c → σ i = i) : + step (permSt σ s) (ren σ e) = permSt σ (step s e) := by + cases e with + | born i c => + have hi := hb i c rfl + simp only [step, ren, permSt, St.mk.injEq] + rw [upd_perm σ hσ, upd_perm σ hσ, hi] + simp + | init i c => + simp only [step, ren, permSt, St.mk.injEq] + rw [upd_perm σ hσ, upd_perm σ hσ] + simp + | move i c => + simp only [step, ren, permSt, St.mk.injEq] + rw [upd_perm σ hσ] + simp + | add i j a c => + simp only [step, ren, permSt, St.mk.injEq] + rw [upd_perm σ hσ] + simp [hσ] + | scale i u c => + simp only [step, ren, permSt, St.mk.injEq] + rw [upd_perm σ hσ] + simp [hσ] + | clear i c => + simp only [step, ren, permSt, St.mk.injEq] + rw [upd_perm σ hσ] + simp + | copy i j a => + simp only [step, ren, permSt, St.mk.injEq] + rw [upd_perm σ hσ] + simp [hσ] + +theorem run_permSt (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (evs : List (Ev K Reg C)) + (hb : ∀ e ∈ evs, ∀ i c, e = .born i c → σ i = i) (s : St K Reg C) : + run (permSt σ s) (evs.map (ren σ)) = permSt σ (run s evs) := by + induction evs generalizing s with + | nil => rfl + | cons e es ih => + simp only [List.map_cons, run] + rw [step_permSt σ hσ s e (hb e (by simp)), ih (fun e' he' => hb e' (by simp [he']))] + +/-- Tail swap: gadget at the shared chart, then every later event renamed h1 <-> h2. +Final rows = unswapped final rows with h1, h2 exchanged; locations unchanged. -/ +theorem tail_run (h1 h2 : Reg) (hne : h1 ≠ h2) (c : C) (s : St K Reg C) + (a : s.loc h1 = some c) (b : s.loc h2 = some c) (evs : List (Ev K Reg C)) + (hb : ∀ e ∈ evs, ∀ i c, e = .born i c → i ≠ h1 ∧ i ≠ h2) : + run s (gadget h1 h2 c ++ evs.map (ren (Equiv.swap h1 h2))) = + permSt (Equiv.swap h1 h2) (run s evs) := by + have hσ : ∀ r, Equiv.swap h1 h2 (Equiv.swap h1 h2 r) = r := fun r => Equiv.swap_apply_self _ _ _ + have hg := gadget_run h1 h2 hne c s + have hs : run s (gadget h1 h2 c) = permSt (Equiv.swap h1 h2) s := by + have hloc : ∀ r, s.loc (Equiv.swap h1 h2 r) = s.loc r := by + intro r + by_cases r1 : r = h1 + · subst r1; simp [a, b] + · by_cases r2 : r = h2 + · subst r2; simp [a, b] + · rw [Equiv.swap_apply_of_ne_of_ne r1 r2] + cases hr : run s (gadget h1 h2 c) with + | mk row loc => + rw [hr] at hg + simp only [permSt, St.mk.injEq] + obtain ⟨hg1, hg2⟩ := hg + simp only at hg1 hg2 + refine ⟨hg1, ?_⟩ + rw [hg2]; funext r; exact (hloc r).symm + rw [SwapWord.run_append, hs] + exact run_permSt _ hσ evs (fun e he i c h => by + obtain ⟨x, y⟩ := hb e he i c h + exact Equiv.swap_apply_of_ne_of_ne x y) s + +/-- Registers and coordinates both read through σ (the state of a run whose events were renamed). -/ +def bothSt (σ : Equiv.Perm Reg) (s : St K Reg C) : St K Reg C := + ⟨fun r k => s.row (σ r) (σ k), fun r => s.loc (σ r)⟩ + +lemma upd_both (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (f : Reg → Reg → K) + (i : Reg) (v : Reg → K) : + (fun r k => Function.update f i v (σ r) (σ k)) = + Function.update (fun r k => f (σ r) (σ k)) (σ i) (fun k => v (σ k)) := by + funext r k + have : σ r = i ↔ r = σ i := ⟨fun h => by rw [← h, hσ], fun h => by rw [h, hσ]⟩ + by_cases h : r = σ i + · subst h + simp [Function.update_apply, hσ] + · have h' : ¬ σ r = i := fun x => h (this.1 x) + simp [Function.update_apply, h, h'] + +theorem step_bothSt (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (s : St K Reg C) + (e : Ev K Reg C) : + step (bothSt σ s) (ren σ e) = bothSt σ (step s e) := by + cases e with + | born i c => + simp only [step, ren, bothSt, St.mk.injEq] + rw [upd_both σ hσ, upd_perm σ hσ] + have : (fun k => (Pi.single i (1 : K) : Reg → K) (σ k)) = Pi.single (σ i) 1 := by + funext k + have : σ k = i ↔ k = σ i := ⟨fun h => by rw [← h, hσ], fun h => by rw [h, hσ]⟩ + by_cases h : k = σ i + · simp [Pi.single_apply, h, this.2 h, hσ] + · have hn : ¬ σ k = i := fun x => h (this.1 x) + simp [Pi.single_apply, h, hn] + rw [this]; simp + | init i c => + simp only [step, ren, bothSt, St.mk.injEq] + rw [upd_both σ hσ, upd_perm σ hσ]; simp; congr 1 + | move i c => + simp only [step, ren, bothSt, St.mk.injEq] + rw [upd_perm σ hσ]; simp + | add i j a c => + simp only [step, ren, bothSt, St.mk.injEq] + rw [upd_both σ hσ]; simp [hσ]; congr 1 + | scale i u c => + simp only [step, ren, bothSt, St.mk.injEq] + rw [upd_both σ hσ]; simp [hσ]; congr 1 + | clear i c => + simp only [step, ren, bothSt, St.mk.injEq] + rw [upd_both σ hσ]; simp; congr 1 + | copy i j c => + simp only [step, ren, bothSt, St.mk.injEq] + rw [upd_both σ hσ]; simp [hσ] + +theorem run_bothSt (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (evs : List (Ev K Reg C)) + (s : St K Reg C) : + run (bothSt σ s) (evs.map (ren σ)) = bothSt σ (run s evs) := by + induction evs generalizing s with + | nil => rfl + | cons e es ih => + simp only [List.map_cons, run] + rw [step_bothSt σ hσ s e, ih] + +theorem step_cpermSt (σ : Equiv.Perm Reg) (s : St K Reg C) + (e : Ev K Reg C) (hσ : ∀ r, σ (σ r) = r) (hb : ∀ i c, e = .born i c → σ i = i) : + step (cpermSt σ s) e = cpermSt σ (step s e) := by + cases e with + | born i c => + have hi := hb i c rfl + simp only [step, cpermSt] + congr 1 + funext r k + by_cases h : r = i + · subst h + have : σ k = r ↔ k = r := ⟨fun h => by rw [← hi, ← h, hσ], fun h => by rw [h, hi]⟩ + by_cases hk : k = r + · simp [Pi.single_apply, hk, hi] + · have hn : ¬ σ k = r := fun x => hk (this.1 x) + simp [Pi.single_apply, hk, hn] + · simp [Function.update_apply, h] + | init i c => + simp only [step, cpermSt] + congr 1 + funext r k; by_cases h : r = i <;> simp [Function.update_apply, h] + | move i c => simp [step, cpermSt] + | add i j a c => + simp only [step, cpermSt] + congr 1 + funext r k; by_cases h : r = i <;> simp [Function.update_apply, h] + | scale i u c => + simp only [step, cpermSt] + congr 1 + funext r k; by_cases h : r = i <;> simp [Function.update_apply, h] + | clear i c => + simp only [step, cpermSt] + congr 1 + funext r k; by_cases h : r = i <;> simp [Function.update_apply, h] + | copy i j c => + simp only [step, cpermSt] + congr 1 + funext r k; by_cases h : r = i <;> simp [Function.update_apply, h] + +theorem run_cpermSt (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (evs : List (Ev K Reg C)) + (hb : ∀ e ∈ evs, ∀ i c, e = .born i c → σ i = i) (s : St K Reg C) : + run (cpermSt σ s) evs = cpermSt σ (run s evs) := by + induction evs generalizing s with + | nil => rfl + | cons e es ih => + simp only [run] + rw [step_cpermSt σ s e hσ (hb e (by simp)), ih (fun e' he' => hb e' (by simp [he']))] + +/-- Head swap: earlier events (`pre`) renamed h1 <-> h2, then the gadget at the shared chart, then the +original later events (`post`, no births of h1, h2). If the start state is σ-symmetric, every +final row has its h1/h2 coordinates exchanged; locations are unchanged. -/ +theorem head_run (h1 h2 : Reg) (hne : h1 ≠ h2) (c : C) (s0 : St K Reg C) + (hs0 : bothSt (Equiv.swap h1 h2) s0 = s0) + (pre post : List (Ev K Reg C)) + (a : (run s0 pre).loc h1 = some c) (b : (run s0 pre).loc h2 = some c) + (hb : ∀ e ∈ post, ∀ i c, e = .born i c → i ≠ h1 ∧ i ≠ h2) : + run s0 (pre.map (ren (Equiv.swap h1 h2)) ++ gadget h1 h2 c ++ post) = + cpermSt (Equiv.swap h1 h2) (run s0 (pre ++ post)) := by + have hσ : ∀ r, Equiv.swap h1 h2 (Equiv.swap h1 h2 r) = r := fun r => Equiv.swap_apply_self _ _ _ + set σ := Equiv.swap h1 h2 with hσdef + set t := run s0 pre with ht + have h1' : run s0 (pre.map (ren σ)) = bothSt σ t := by + conv_lhs => rw [← hs0] + exact run_bothSt σ hσ pre s0 + have hg := gadget_run h1 h2 hne c (bothSt σ t) + have hloc : ∀ r, t.loc (σ r) = t.loc r := by + intro r + by_cases r1 : r = h1 + · subst r1; simp [σ, a, b] + · by_cases r2 : r = h2 + · subst r2; simp [σ, a, b] + · rw [Equiv.swap_apply_of_ne_of_ne r1 r2] + have hs : run (bothSt σ t) (gadget h1 h2 c) = cpermSt σ t := by + cases hr : run (bothSt σ t) (gadget h1 h2 c) with + | mk row loc => + rw [hr] at hg + obtain ⟨hg1, hg2⟩ := hg + simp only [bothSt] at hg1 hg2 + simp only [cpermSt, St.mk.injEq] + refine ⟨?_, ?_⟩ + · rw [hg1]; funext r k; exact congrArg (fun x => t.row x (σ k)) (hσ r) + · rw [hg2]; funext r; exact hloc r + rw [SwapWord.run_append, SwapWord.run_append, h1', hs, + run_cpermSt σ hσ post (fun e he i c h => by + obtain ⟨x, y⟩ := hb e he i c h + exact Equiv.swap_apply_of_ne_of_ne x y), SwapWord.run_append s0 pre post] + +end Op + +/-! ### Part B: what the hubs can undo (matrix level; HubSettle's V mix and {0}-prefix) -/ +section Hub +variable {K Reg : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] + +/-- `A` is the identity outside the `S × S` block (a hub op acts only inside its own block). -/ +def Blk (S : Reg → Prop) (A : Matrix Reg Reg K) : Prop := + ∀ i k, ¬ (S i ∧ S k) → A i k = (1 : Matrix Reg Reg K) i k + +/-- F' can be restored to F by a V mix `L` (block on V-enders, acts on rows) and a {0}-prefix `M` +(block on G0 columns, right multiplication). Invertibility is not demanded (strengthens the +only-if directions); the witnesses used for the if directions are permutation matrices. -/ +def Undo (V G0 : Reg → Prop) (F F' : Matrix Reg Reg K) : Prop := + ∃ L M : Matrix Reg Reg K, Blk V L ∧ Blk G0 M ∧ L * F' * M = F + +/-- Tail swap of the final matrix: rows h1,h2 exchanged. -/ +def rowSw (σ : Equiv.Perm Reg) (F : Matrix Reg Reg K) : Matrix Reg Reg K := + Matrix.of fun i k => F (σ i) k +/-- Head swap of the final matrix: coordinates h1,h2 exchanged. -/ +def colSw (σ : Equiv.Perm Reg) (F : Matrix Reg Reg K) : Matrix Reg Reg K := + Matrix.of fun i k => F i (σ k) + +def swapMat (σ : Equiv.Perm Reg) : Matrix Reg Reg K := + Matrix.of fun i k => if k = σ i then 1 else 0 + +lemma blk_one (S : Reg → Prop) : Blk S (1 : Matrix Reg Reg K) := fun _ _ _ => rfl + +lemma swapMat_mul (σ : Equiv.Perm Reg) (A : Matrix Reg Reg K) : swapMat σ * A = rowSw σ A := by + ext i k + simp [Matrix.mul_apply, swapMat, rowSw] + +lemma mul_swapMat (σ : Equiv.Perm Reg) (hσ : ∀ r, σ (σ r) = r) (A : Matrix Reg Reg K) : + A * swapMat σ = colSw σ A := by + ext i k + simp only [Matrix.mul_apply, swapMat, colSw, Matrix.of_apply] + have : ∀ j, (k = σ j) ↔ (j = σ k) := fun j => ⟨fun h => by rw [h, hσ], fun h => by rw [h, hσ]⟩ + simp [this] + +lemma swapMat_blk (h1 h2 : Reg) (S : Reg → Prop) (a : S h1) (b : S h2) : + Blk S (swapMat (Equiv.swap h1 h2) : Matrix Reg Reg K) := by + intro i k hik + simp only [swapMat, Matrix.of_apply, Matrix.one_apply] + have hk1 : ∀ x, S x → ¬ S k → x ≠ k := fun x hx hk h => hk (h ▸ hx) + by_cases i1 : i = h1 + · subst i1 + have hk : ¬ S k := fun h => hik ⟨a, h⟩ + simp [hk1 _ a hk, hk1 _ b hk, (hk1 _ a hk).symm, (hk1 _ b hk).symm] + · by_cases i2 : i = h2 + · subst i2 + have hk : ¬ S k := fun h => hik ⟨b, h⟩ + simp [hk1 _ a hk, hk1 _ b hk, (hk1 _ a hk).symm, (hk1 _ b hk).symm] + · rw [Equiv.swap_apply_of_ne_of_ne i1 i2] + simp [eq_comm] + +lemma blk_row {V : Reg → Prop} {L : Matrix Reg Reg K} (hL : Blk V L) {x : Reg} (hx : ¬ V x) + (Y : Matrix Reg Reg K) : (L * Y) x = Y x := by + funext k + have : ∀ m, L x m = if x = m then 1 else 0 := fun m => by + simpa [Matrix.one_apply] using hL x m (fun h => hx h.1) + simp [Matrix.mul_apply, this] + +lemma mul_blk_col {G0 : Reg → Prop} {M : Matrix Reg Reg K} (hM : Blk G0 M) {a : Reg} + (ha : ¬ G0 a) (Y : Matrix Reg Reg K) (i : Reg) : (Y * M) i a = Y i a := by + have : ∀ j, M j a = if j = a then 1 else 0 := fun j => by + simpa [Matrix.one_apply] using hM j a (fun h => ha h.2) + simp [Matrix.mul_apply, this] + +lemma row_eq {V : Reg → Prop} {F F' L M : Matrix Reg Reg K} (hL : Blk V L) + (h : L * F' * M = F) {x : Reg} (hx : ¬ V x) : (F' * M) x = F x := by + rw [Matrix.mul_assoc] at h + have := blk_row hL hx (F' * M) + rw [h] at this + exact this.symm + +section Swap +variable (h1 h2 : Reg) + +local notation "σ" => Equiv.swap h1 h2 + +lemma swap_inv (r : Reg) : σ (σ r) = r := Equiv.swap_apply_self _ _ _ + +/-- Both helpers end in V: the V mix undoes the tail swap. -/ +theorem tail_if (V G0 : Reg → Prop) (F : Matrix Reg Reg K) (a : V h1) (b : V h2) : + Undo V G0 F (rowSw σ F) := by + refine ⟨swapMat σ, 1, swapMat_blk h1 h2 V a b, blk_one _, ?_⟩ + rw [Matrix.mul_one, swapMat_mul] + ext i k + simp [rowSw, swap_inv] + +/-- Both helpers born in {0}: the {0}-prefix undoes the head swap. -/ +theorem head_if (V G0 : Reg → Prop) (F : Matrix Reg Reg K) (a : G0 h1) (b : G0 h2) : + Undo V G0 F (colSw σ F) := by + refine ⟨1, swapMat σ, blk_one _, swapMat_blk h1 h2 G0 a b, ?_⟩ + rw [Matrix.one_mul, mul_swapMat σ (swap_inv h1 h2)] + ext i k + simp [colSw, swap_inv] + +lemma ab_cases (a : Reg) (ha : a = h1 ∨ a = h2) (hne : h1 ≠ h2) : + (a = h1 ∧ σ a = h2) ∨ (a = h2 ∧ σ a = h1) := by + rcases ha with rfl | rfl + · left; simp + · right; simp + +/-- Tail swap, only-if. `hrig`: the unchanged non-V rows pin every {0}-prefix to the identity +(`rigid_of_span` gives this from a spanning condition). Then a tail swap is undone only if both +helpers end in V. -/ +theorem tail_only_if (V G0 : Reg → Prop) (hne : h1 ≠ h2) (F : Matrix Reg Reg K) + (hF1 : F h1 = Pi.single h1 1) (hF2 : F h2 = Pi.single h2 1) + (hrig : ∀ M : Matrix Reg Reg K, Blk G0 M → + (∀ x, x ≠ h1 → x ≠ h2 → ¬ V x → (F * M) x = F x) → M = 1) : + Undo V G0 F (rowSw σ F) → V h1 ∧ V h2 := by + rintro ⟨L, M, hL, hM, h⟩ + by_contra hn + obtain ⟨a, ha, haV⟩ : ∃ a, (a = h1 ∨ a = h2) ∧ ¬ V a := by + by_cases v1 : V h1 + · exact ⟨h2, Or.inr rfl, fun v2 => hn ⟨v1, v2⟩⟩ + · exact ⟨h1, Or.inl rfl, v1⟩ + have key : ∀ x, ¬ V x → (rowSw σ F * M) x = F x := fun x hx => row_eq hL h hx + have hM1 : M = 1 := by + refine hrig M hM (fun x hx1 hx2 hxV => ?_) + have := key x hxV + have hsx : σ x = x := Equiv.swap_apply_of_ne_of_ne hx1 hx2 + funext k + have := congrFun this k + simpa [rowSw, Matrix.mul_apply, hsx] using this + subst hM1 + have e : F (σ a) = F a := by + have := key a haV + rw [Matrix.mul_one] at this + exact this + rcases ab_cases h1 h2 a ha hne with ⟨rfl, h'⟩ | ⟨rfl, h'⟩ + · rw [h', hF1, hF2] at e + have := congrFun e a + simp [Pi.single_apply, hne.symm] at this + · rw [h', hF1, hF2] at e + have := congrFun e a + simp [Pi.single_apply, hne] at this + +/-- Head swap, only-if: if some non-V row distinguishes the h1 and h2 coordinates, the swap is +undone only if both helpers are born in {0}. -/ +theorem head_only_if (V G0 : Reg → Prop) (hne : h1 ≠ h2) (F : Matrix Reg Reg K) + (hw : ∃ x, ¬ V x ∧ F x h1 ≠ F x h2) : + Undo V G0 F (colSw σ F) → G0 h1 ∧ G0 h2 := by + rintro ⟨L, M, hL, hM, h⟩ + obtain ⟨x, hxV, hxne⟩ := hw + by_contra hn + obtain ⟨a, ha, haG⟩ : ∃ a, (a = h1 ∨ a = h2) ∧ ¬ G0 a := by + by_cases v1 : G0 h1 + · exact ⟨h2, Or.inr rfl, fun v2 => hn ⟨v1, v2⟩⟩ + · exact ⟨h1, Or.inl rfl, v1⟩ + have e := congrFun (row_eq hL h hxV) a + rw [mul_blk_col hM haG] at e + simp only [colSw, Matrix.of_apply] at e + rcases ab_cases h1 h2 a ha hne with ⟨rfl, h'⟩ | ⟨rfl, h'⟩ + · rw [h'] at e; exact hxne e.symm + · rw [h'] at e; exact hxne e + +/-- Identity-final case: the swap matrix is the same for both kinds; it is undone iff both +helpers end in V or both are born in {0}. -/ +theorem undo_one_iff (V G0 : Reg → Prop) (hne : h1 ≠ h2) : + Undo V G0 (1 : Matrix Reg Reg K) (rowSw σ 1) ↔ (V h1 ∧ V h2) ∨ (G0 h1 ∧ G0 h2) := by + constructor + · rintro ⟨L, M, hL, hM, h⟩ + by_cases hv : V h1 ∧ V h2 + · exact Or.inl hv + right + obtain ⟨a, ha, haV⟩ : ∃ a, (a = h1 ∨ a = h2) ∧ ¬ V a := by + by_cases v1 : V h1 + · exact ⟨h2, Or.inr rfl, fun v2 => hv ⟨v1, v2⟩⟩ + · exact ⟨h1, Or.inl rfl, v1⟩ + have e := congrFun (row_eq hL h haV) a + have hMa : M (σ a) a = 1 := by + have : (rowSw σ (1 : Matrix Reg Reg K) * M) a a = M (σ a) a := by + simp [rowSw, Matrix.mul_apply, Matrix.one_apply] + rw [this] at e + simpa using e + have hG : G0 (σ a) ∧ G0 a := by + by_contra hc + have := hM (σ a) a hc + rw [hMa] at this + have hn : σ a ≠ a := by + rcases ab_cases h1 h2 a ha hne with ⟨rfl, h'⟩ | ⟨rfl, h'⟩ + · rw [h']; exact hne.symm + · rw [h']; exact hne + simp [Matrix.one_apply, hn] at this + rcases ab_cases h1 h2 a ha hne with ⟨rfl, h'⟩ | ⟨rfl, h'⟩ + · rw [h'] at hG; exact ⟨hG.2, hG.1⟩ + · rw [h'] at hG; exact hG + · rintro (⟨a, b⟩ | ⟨a, b⟩) + · exact tail_if h1 h2 V G0 1 a b + · have := head_if h1 h2 V G0 (1 : Matrix Reg Reg K) a b + have e : colSw σ (1 : Matrix Reg Reg K) = rowSw σ 1 := by + ext i k + have : (σ i = k) ↔ (i = σ k) := + ⟨fun h => by rw [← h, swap_inv], fun h => by rw [h, swap_inv]⟩ + simp [colSw, rowSw, Matrix.one_apply, this] + rwa [e] at this + +end Swap + +end Hub + +section Rigid +variable {K Reg : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] + +lemma single_vecMul (M : Matrix Reg Reg K) (i : Reg) : + Matrix.vecMul (Pi.single i (1 : K) : Reg → K) M = M i := by + funext j + simp [Matrix.vecMul, dotProduct, Pi.single_apply] + +/-- A spanning condition forces rigidity: if the (unchanged, non-V) rows of F together with the unit +vectors of the non-G0 coordinates span everything, then a G0-block prefix that fixes those rows is 1. -/ +theorem rigid_of_span (G0 : Reg → Prop) (T : Set Reg) (F : Matrix Reg Reg K) + (hspan : Submodule.span K ((fun x => F x) '' T ∪ + Set.range (fun k : {k // ¬ G0 k} => (Pi.single k.1 (1 : K) : Reg → K))) = ⊤) + (M : Matrix Reg Reg K) (hM : Blk G0 M) (hfix : ∀ x ∈ T, (F * M) x = F x) : M = 1 := by + let φ : (Reg → K) →ₗ[K] (Reg → K) := Matrix.vecMulLinear M - LinearMap.id + have hle : Submodule.span K ((fun x => F x) '' T ∪ + Set.range (fun k : {k // ¬ G0 k} => (Pi.single k.1 (1 : K) : Reg → K))) ≤ + LinearMap.ker φ := by + rw [Submodule.span_le] + rintro v (⟨x, hx, rfl⟩ | ⟨k, rfl⟩) + · have := hfix x hx + simp only [SetLike.mem_coe, LinearMap.mem_ker, φ, LinearMap.sub_apply, + Matrix.vecMulLinear_apply, LinearMap.id_apply, sub_eq_zero] + funext j + have := congrFun this j + simpa [Matrix.mul_apply, Matrix.vecMul, dotProduct] using this + · simp only [SetLike.mem_coe, LinearMap.mem_ker, φ, LinearMap.sub_apply, + Matrix.vecMulLinear_apply, LinearMap.id_apply, sub_eq_zero] + rw [single_vecMul] + funext j + have := hM k.1 j (fun h => k.2 h.1) + simp only [Matrix.one_apply] at this + rw [this] + simp [Pi.single_apply, eq_comm] + have hall : ∀ v, φ v = 0 := fun v => hle (by rw [hspan]; trivial) + ext i k + have := congrFun (hall (Pi.single i 1)) k + simp only [φ, LinearMap.sub_apply, Matrix.vecMulLinear_apply, LinearMap.id_apply, + Pi.sub_apply, single_vecMul] at this + simp only [Matrix.one_apply] + simp only [Pi.zero_apply, Pi.single_apply] at this + have h3 := sub_eq_zero.1 this + rw [h3]; simp [eq_comm] + +end Rigid + +section Iff +variable {K Reg : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] (h1 h2 : Reg) +local notation "σ" => Equiv.swap h1 h2 + +/-- (1), tail swap: undone iff both helpers end in V (under rigidity of the {0}-prefix). -/ +theorem tail_iff (V G0 : Reg → Prop) (hne : h1 ≠ h2) (F : Matrix Reg Reg K) + (hF1 : F h1 = Pi.single h1 1) (hF2 : F h2 = Pi.single h2 1) + (hrig : ∀ M : Matrix Reg Reg K, Blk G0 M → + (∀ x, x ≠ h1 → x ≠ h2 → ¬ V x → (F * M) x = F x) → M = 1) : + Undo V G0 F (rowSw σ F) ↔ V h1 ∧ V h2 := + ⟨tail_only_if h1 h2 V G0 hne F hF1 hF2 hrig, fun ⟨a, b⟩ => tail_if h1 h2 V G0 F a b⟩ + +/-- (1), head swap: undone iff both helpers are born in {0} (when some non-V row separates h1, h2). -/ +theorem head_iff (V G0 : Reg → Prop) (hne : h1 ≠ h2) (F : Matrix Reg Reg K) + (hw : ∃ x, ¬ V x ∧ F x h1 ≠ F x h2) : + Undo V G0 F (colSw σ F) ↔ G0 h1 ∧ G0 h2 := + ⟨head_only_if h1 h2 V G0 hne F hw, fun ⟨a, b⟩ => head_if h1 h2 V G0 F a b⟩ + +/-- Tail swap, spanning form of the rigidity hypothesis. -/ +theorem tail_iff_span (V G0 : Reg → Prop) (hne : h1 ≠ h2) (F : Matrix Reg Reg K) + (hF1 : F h1 = Pi.single h1 1) (hF2 : F h2 = Pi.single h2 1) + (hspan : Submodule.span K ((fun x => F x) '' {x | x ≠ h1 ∧ x ≠ h2 ∧ ¬ V x} ∪ + Set.range (fun k : {k // ¬ G0 k} => (Pi.single k.1 (1 : K) : Reg → K))) = ⊤) : + Undo V G0 F (rowSw σ F) ↔ V h1 ∧ V h2 := + tail_iff h1 h2 V G0 hne F hF1 hF2 fun M hM hfix => + rigid_of_span G0 _ F hspan M hM fun x hx => hfix x hx.1 hx.2.1 hx.2.2 + +lemma colSw_one (V : Reg → Prop) : colSw σ (1 : Matrix Reg Reg K) = rowSw σ 1 := by + ext i k + have : (σ i = k) ↔ (i = σ k) := + ⟨fun h => by rw [← h, swap_inv], fun h => by rw [h, swap_inv]⟩ + simp [colSw, rowSw, Matrix.one_apply, this] + +end Iff + +/-! ### Part C: ladder cost -/ +section Ladder +open JunkLB2 RelaySandwich + +/-- A helper's trajectory: birth dim `b`, end dim `e`, stay gaps before (`pre`) and after (`suf`) the +shared chart. -/ +structure Traj where + b : ℝ + e : ℝ + pre : List ℝ + suf : List ℝ + +/-- Per-helper ladder cost: span term minus the sum over stays (RelaySandwich.stopCost's accounting). -/ +noncomputable def Traj.cost (f : ℝ → ℝ) (t : Traj) : ℝ := + f (t.e - t.b) - ((t.pre ++ t.suf).map f).sum + +/-- Both helpers sit at the shared chart (dim `s`) and their gaps add up. -/ +def Traj.Wf (s : ℝ) (t : Traj) : Prop := t.b + t.pre.sum = s ∧ s + t.suf.sum = t.e + +/-- The swap (tail or head: same pair of trajectories, only the names differ). -/ +def Traj.swap (t1 t2 : Traj) : Traj × Traj := + (⟨t1.b, t2.e, t1.pre, t2.suf⟩, ⟨t2.b, t1.e, t2.pre, t1.suf⟩) + +theorem swap_wf (s : ℝ) (t1 t2 : Traj) (a : t1.Wf s) (b : t2.Wf s) : + (Traj.swap t1 t2).1.Wf s ∧ (Traj.swap t1 t2).2.Wf s := + ⟨⟨a.1, b.2⟩, ⟨b.1, a.2⟩⟩ + +/-- The multiset of stays is unchanged. -/ +theorem stays_multiset (t1 t2 : Traj) : + ((↑((Traj.swap t1 t2).1.pre ++ (Traj.swap t1 t2).1.suf ++ + ((Traj.swap t1 t2).2.pre ++ (Traj.swap t1 t2).2.suf)) : Multiset ℝ)) = + ↑(t1.pre ++ t1.suf ++ (t2.pre ++ t2.suf)) := by + simp only [Traj.swap, ← Multiset.coe_add] + abel + +theorem cost_stopCost (f : ℝ → ℝ) (e : ℝ) (k : ℕ) : + Traj.cost f ⟨0, e, List.replicate (k + 1) (e / (k + 1)), []⟩ = stopCost f e k := by + simp [Traj.cost, stopCost, List.map_replicate] + +/-- (2): the ladder change is exactly the rectangle difference of the span terms. -/ +theorem delta_eq (f : ℝ → ℝ) (t1 t2 : Traj) : + (Traj.swap t1 t2).1.cost f + (Traj.swap t1 t2).2.cost f - (t1.cost f + t2.cost f) = + (f (t2.e - t1.b) + f (t1.e - t2.b)) - (f (t1.e - t1.b) + f (t2.e - t2.b)) := by + simp only [Traj.cost, Traj.swap, List.map_append, List.sum_append] + ring + +/-- Both helpers end in V (same dim): ladder change 0. -/ +theorem delta_zero_end (f : ℝ → ℝ) (t1 t2 : Traj) (h : t1.e = t2.e) : + (Traj.swap t1 t2).1.cost f + (Traj.swap t1 t2).2.cost f - (t1.cost f + t2.cost f) = 0 := by + rw [delta_eq, h]; ring + +/-- Both helpers born in {0} (same dim 0): ladder change 0. -/ +theorem delta_zero_birth (f : ℝ → ℝ) (t1 t2 : Traj) (h : t1.b = t2.b) : + (Traj.swap t1 t2).1.cost f + (Traj.swap t1 t2).2.cost f - (t1.cost f + t2.cost f) = 0 := by + rw [delta_eq, h]; ring + +end Ladder + +/-! ### Part D: the law and the converse witness -/ +section Law +open JunkLB2 + +variable {K Reg : Type*} [Field K] [Fintype Reg] [DecidableEq Reg] (h1 h2 : Reg) +local notation "σ" => Equiv.swap h1 h2 + +/-- SWAP-NULL: a legal (hub-undoable) swap has ladder change 0 (ends of V-enders share the dim of V, +{0}-born helpers share dim 0). -/ +theorem swap_null (f : ℝ → ℝ) (V G0 : Reg → Prop) (dV : ℝ) (t1 t2 : Traj) (hne : h1 ≠ h2) + (hV1 : V h1 → t1.e = dV) (hV2 : V h2 → t2.e = dV) + (hG1 : G0 h1 → t1.b = 0) (hG2 : G0 h2 → t2.b = 0) + (hu : Undo V G0 (1 : Matrix Reg Reg K) (rowSw σ 1)) : + (Traj.swap t1 t2).1.cost f + (Traj.swap t1 t2).2.cost f - (t1.cost f + t2.cost f) = 0 := by + rcases (undo_one_iff h1 h2 V G0 hne).1 hu with ⟨a, b⟩ | ⟨a, b⟩ + · exact delta_zero_end f t1 t2 ((hV1 a).trans (hV2 b).symm) + · exact delta_zero_birth f t1 t2 ((hG1 a).trans (hG2 b).symm) + +/-- (3), contrapositive: a nonzero ladder change cannot be hub-undone. -/ +theorem nonzero_not_undoable (f : ℝ → ℝ) (V G0 : Reg → Prop) (dV : ℝ) (t1 t2 : Traj) + (hne : h1 ≠ h2) + (hV1 : V h1 → t1.e = dV) (hV2 : V h2 → t2.e = dV) + (hG1 : G0 h1 → t1.b = 0) (hG2 : G0 h2 → t2.b = 0) + (hd : (Traj.swap t1 t2).1.cost f + (Traj.swap t1 t2).2.cost f - (t1.cost f + t2.cost f) ≠ 0) : + ¬ Undo V G0 (1 : Matrix Reg Reg K) (rowSw σ 1) := + fun hu => hd (swap_null (K := K) h1 h2 f V G0 dV t1 t2 hne hV1 hV2 hG1 hG2 hu) + +/-- The numerical core: 7 ln 7 + 4 ln 4 < 2 ln 2 + 9 ln 9. -/ +theorem witness_num : fL (9 - 5) + fL (7 - 0) - (fL (7 - 5) + fL (9 - 0)) < 0 := by + have h : (7 : ℝ) * Real.log 7 + 6 * Real.log 2 < 18 * Real.log 3 := by + have := Real.log_lt_log (by positivity : (0 : ℝ) < 7 ^ 7 * 2 ^ 6) (by norm_num : (7 : ℝ) ^ 7 * 2 ^ 6 < 3 ^ 18) + rw [Real.log_mul (by positivity) (by positivity), Real.log_pow, Real.log_pow, Real.log_pow] at this + push_cast at this + exact this + have h4 : Real.log 4 = 2 * Real.log 2 := by + rw [show (4 : ℝ) = 2 ^ 2 by norm_num, Real.log_pow]; norm_num + have h9 : Real.log 9 = 2 * Real.log 3 := by + rw [show (9 : ℝ) = 3 ^ 2 by norm_num, Real.log_pow]; norm_num + unfold fL + norm_num + rw [h4, h9] + linarith + +end Law + +/-- Concrete witness (Reg = Fin 2; helper 0 born dim 5, ends dim 7, in neither hub; helper 1 born {0}, +ends in V of dim 9; shared chart dim 6). Its ladder change is strictly negative (f = r ln r, about +-1.995), and the swap, tail or head, cannot be undone by any V mix and {0}-prefix. -/ +theorem converse_witness : + let t1 : Traj := ⟨5, 7, [1], [1]⟩ + let t2 : Traj := ⟨0, 9, [6], [3]⟩ + t1.Wf 6 ∧ t2.Wf 6 ∧ + ((Traj.swap t1 t2).1.cost JunkLB2.fL + (Traj.swap t1 t2).2.cost JunkLB2.fL + - (t1.cost JunkLB2.fL + t2.cost JunkLB2.fL) < 0) ∧ + ¬ Undo (fun r : Fin 2 => r = 1) (fun r : Fin 2 => r = 1) (1 : Matrix (Fin 2) (Fin 2) ℚ) + (rowSw (Equiv.swap 0 1) 1) ∧ + ¬ Undo (fun r : Fin 2 => r = 1) (fun r : Fin 2 => r = 1) (1 : Matrix (Fin 2) (Fin 2) ℚ) + (colSw (Equiv.swap 0 1) 1) := by + intro t1 t2 + have hne : (0 : Fin 2) ≠ 1 := by decide + have hn : ¬ Undo (fun r : Fin 2 => r = 1) (fun r : Fin 2 => r = 1) (1 : Matrix (Fin 2) (Fin 2) ℚ) + (rowSw (Equiv.swap 0 1) 1) := by + rw [undo_one_iff 0 1 _ _ hne]; decide + refine ⟨by norm_num [Traj.Wf, t1], by norm_num [Traj.Wf, t2], ?_, hn, ?_⟩ + · rw [delta_eq] + simpa [t1, t2] using witness_num + · rw [colSw_one 0 1 (fun r : Fin 2 => r = 1)]; exact hn + +/-- Scope of the per-kind iff: with identity finals and both helpers in G0 but not in V, the TAIL +swap IS undone (by the prefix), so "tail swap legal iff both end in V" needs the rigidity hypothesis. -/ +theorem tail_prefix_counterexample : + Undo (fun _ : Fin 2 => False) (fun _ : Fin 2 => True) (1 : Matrix (Fin 2) (Fin 2) ℚ) + (rowSw (Equiv.swap 0 1) 1) ∧ ¬ (False ∧ False) := by + refine ⟨?_, by simp⟩ + rw [undo_one_iff 0 1 _ _ (by decide)]; simp + +#print axioms tail_run +#print axioms head_run +#print axioms gadget_legal +#print axioms tail_iff +#print axioms tail_iff_span +#print axioms head_iff +#print axioms undo_one_iff +#print axioms delta_eq +#print axioms swap_null +#print axioms converse_witness +#print axioms tail_prefix_counterexample +#print axioms stays_multiset +#print axioms cost_stopCost + +end SwapNull diff --git a/research/p104-reader-ceiling/lean/Nov15/SwapNull.md b/research/p104-reader-ceiling/lean/Nov15/SwapNull.md new file mode 100644 index 0000000000..c8950480ee --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/SwapNull.md @@ -0,0 +1,24 @@ +# SwapNull.lean: LAWBUILD M3 law SWAP-NULL. No sorry, 8 s, 2.45 GB RSS +Nov 17. Imports TokenCancel (op model), SwapWord (`run_append`), RelaySandwich (`stopCost`, `fL` via JunkLB2). Axioms: [propext, Classical.choice, Quot.sound]. +Source: (internal notes) HubSettle's V mix and {0}-prefix are modelled as `Blk V` / `Blk G0` matrices (left / right multiplication). + +**Gadget (4 ops, at the shared chart c):** `add h1 h2 (+1); add h2 h1 (-1); add h1 h2 (+1); scale h2 (-1)`. `gadget_run`: rows of h1,h2 exchanged, nothing else changes; `gadget_legal`. +- `tail_run`: gadget, then every later event renamed h1<->h2 => final state = unswapped final with rows h1,h2 exchanged (F' = P F). +- `head_run`: earlier events renamed, gadget, original later events (sigma-symmetric start) => every final row has its h1/h2 coordinates exchanged (F' = F P). + +**(1) legality.** `Undo V G0 F F'` := exists V mix L (identity off V x V) and prefix M (identity off G0 x G0) with L F' M = F. +- `tail_if`/`head_if`: both in V (tail) / both in G0 (head) => undone (L = P, resp. M = P). +- `undo_one_iff` (identity finals, no other hypothesis): undone iff (both V) or (both G0). +- `tail_iff`, `tail_iff_span`: tail swap undone iff both V, GIVEN rigidity of the prefix (the unchanged non-V rows pin M = 1; `rigid_of_span` derives it from a spanning condition). +- `head_iff`: head swap undone iff both G0, GIVEN a non-V row with F x h1 != F x h2. + +**(2) ladder.** `Traj.cost f t = f(e-b) - sum f(gaps)` (`cost_stopCost`: equals RelaySandwich.stopCost on the equal-move ladder). `Traj.swap`: (b1,e2,pre1++suf2), (b2,e1,pre2++suf1). +- `stays_multiset`: the multiset of stays is unchanged; `swap_wf`: swapped trajectories are again consistent. +- `delta_eq`: change = f(e2-b1)+f(e1-b2)-f(e1-b1)-f(e2-b2). +- `delta_zero_end` (e1 = e2, both end in V), `delta_zero_birth` (b1 = b2 = 0), `swap_null`: hub-undoable => ladder change 0. + +**(3) converse.** `nonzero_not_undoable`: nonzero change => not undoable. `converse_witness` (concrete): helper 0 born dim 5 ends 7 (no hub), helper 1 born {0} ends V (dim 9): f = r ln r change = 7 ln 7 + 4 ln 4 - 2 ln 2 - 9 ln 9 ~ -1.995 < 0 (`witness_num`, 7^7 2^6 < 3^18), and neither the tail nor the head swap is undone by any L, M. + +**Finding (M3 wording needs scope).** "tswap legal iff both end in V; hswap iff both born in {0}" is true only with a hypothesis: `tail_prefix_counterexample` (identity finals, both helpers in G0, none in V) is a tail swap undone by the prefix alone. Corrected statement: for identity-final helpers the swap is undone iff (both V) or (both G0) (`undo_one_iff`); the per-kind iff needs prefix rigidity (tail) / a separating non-V row (head). In the real word the non-V rows do pin the prefix (M3's controls XT/XH fail at settle3), but that is an input [C], not a consequence. + +**Scope.** Matrix-level model: L, M are not required invertible (strengthens only-if). The M3 census numbers (8,282 pairs, 7,390 absorbable) are data, not re-proved. Mixed gadget placement (swap back later) is not modelled. diff --git a/research/p104-reader-ceiling/lean/Nov15/SwapWord.lean b/research/p104-reader-ceiling/lean/Nov15/SwapWord.lean new file mode 100644 index 0000000000..49dfdcbae8 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/SwapWord.lean @@ -0,0 +1,181 @@ +/- +SwapWord, See SwapWord.md. + +The SWAPBUILD edit (internal notes, from BIG/TOKENRANK TR2): at a moment when helper h's row +is exactly e_h, inject `j += c·h` (data: c = −1, just before the native's own `h += j`, so the pair is +the swap `j -= h; h += j`). General facts in TokenCancel's op model: +* `run_diff`: the run is affine in the rows; the difference of two runs with equal locations is the + run of the difference with births read as INITs. +* `inject`: the injection changes the final rows ONLY in column h: final' r = final r + δ r • e_h. +* `inject_two`: two injections (457 → 242, 461 → X10) change the final rows only in columns h1, h2. +* `inject_col`: every final row is unchanged on every column k ≠ h, for every register (non-V-enders included). +* `absorb`: the debt is absorbed by the V mix: if e_h lies in the span of the V targets (h ends at V + with target e_h), the non-V-enders end on target, the original V-ender rows lie in that span and + targets are independent, then the edited run has a V mix iff it is loss-free. + +Build (imports the RankLawC olean; see RankLawC.lean for the chain): + lake env lean -o .lake/build/lib/lean/Nov15/RankLawC.olean Nov15/RankLawC.lean + lake env lean Nov15/SwapWord.lean +-/ +import Nov15.RankLawC + +set_option linter.unusedSectionVars false + +namespace SwapWord +open Submodule Module TokenCancel RankLaw + +variable {K Reg C : Type*} [Field K] [DecidableEq Reg] [DecidableEq C] + +/-- Births read as INITs (a birth writes the same e_i in both runs, so the difference row is 0). -/ +def unborn : Ev K Reg C → Ev K Reg C + | .born i c => .init i c + | e => e + +theorem run_append (s : St K Reg C) (p q : List (Ev K Reg C)) : + run s (p ++ q) = run (run s p) q := by + induction p generalizing s with + | nil => rfl + | cons e p ih => exact ih (step s e) + +lemma upd_sub (f g : Reg → Reg → K) (i : Reg) (a b : Reg → K) : + Function.update f i a - Function.update g i b = Function.update (f - g) i (a - b) := by + funext k; by_cases hk : k = i + · subst hk; simp + · simp [Function.update_of_ne hk] + +/-- One step of the difference. -/ +theorem step_diff (s t : St K Reg C) (hl : s.loc = t.loc) (e : Ev K Reg C) : + (step t e).loc = (step s e).loc ∧ + (step t e).row - (step s e).row = (step ⟨t.row - s.row, s.loc⟩ (unborn e)).row := by + cases e with + | born i c => exact ⟨by simp [step, hl], by simp [step, unborn, upd_sub]⟩ + | init i c => exact ⟨by simp [step, hl], by simp [step, unborn, upd_sub]⟩ + | move i c => exact ⟨by simp [step, hl], by simp [step, unborn]⟩ + | add i j a c => + refine ⟨by simp [step, hl], ?_⟩ + simp only [step, unborn, upd_sub, Pi.sub_apply] + congr 1; rw [smul_sub]; abel + | scale i u c => exact ⟨by simp [step, hl], by simp [step, unborn, upd_sub, smul_sub]⟩ + | clear i c => exact ⟨by simp [step, hl], by simp [step, unborn, upd_sub]⟩ + | copy i j c => exact ⟨by simp [step, hl], by simp [step, unborn, upd_sub]⟩ + +/-- **Difference law.** Two runs of the same events from states with equal locations differ by the +run of the difference state (births read as INITs). -/ +theorem run_diff : ∀ (evs : List (Ev K Reg C)) (s t : St K Reg C), s.loc = t.loc → + (run t evs).loc = (run s evs).loc ∧ + (run t evs).row - (run s evs).row = (run ⟨t.row - s.row, s.loc⟩ (evs.map unborn)).row + | [], s, t, hl => ⟨hl.symm, rfl⟩ + | e :: es, s, t, hl => by + obtain ⟨h1, h2⟩ := step_diff s t hl e + have ih := run_diff es (step s e) (step t e) h1.symm + refine ⟨ih.1, ?_⟩ + simp only [run, List.map_cons] + rw [ih.2] + have hst : (⟨(step t e).row - (step s e).row, (step s e).loc⟩ : St K Reg C) = + step ⟨t.row - s.row, s.loc⟩ (unborn e) := by + cases e <;> simp only [step, unborn] at h2 ⊢ <;> rw [h2] + rw [hst] + +/-- With no births, every op keeps all rows inside a fixed subspace P. -/ +theorem rows_in_run (P : Submodule K (Reg → K)) : + ∀ (evs : List (Ev K Reg C)) (d : St K Reg C), (∀ r, d.row r ∈ P) → + ∀ r, (run d (evs.map unborn)).row r ∈ P + | [], d, hd => hd + | e :: es, d, hd => by + simp only [List.map_cons, run] + refine rows_in_run P es _ (fun r => ?_) + by_cases hr : r = (match e with + | .born i _ | .init i _ | .move i _ | .add i _ _ _ | .scale i _ _ | .clear i _ | .copy i _ _ => i) + · cases e <;> simp only [step, unborn] at hr ⊢ <;> subst hr <;> + simp [P.zero_mem, P.add_mem, P.smul_mem, hd] + · cases e <;> simp only [step, unborn] at hr ⊢ <;> simp [Function.update_of_ne hr, hd] + +/-- **Injection law.** If h's row is exactly e_h after the prefix p, injecting `j += c·h` there +changes the final rows only by multiples of e_h. -/ +theorem inject (s : St K Reg C) (p q : List (Ev K Reg C)) (h j : Reg) (c : K) (ch : C) + (hrow : (run s p).row h = Pi.single h 1) : + ∃ δ : Reg → K, ∀ r, (run s (p ++ .add j h c ch :: q)).row r = + (run s (p ++ q)).row r + δ r • (Pi.single h 1 : Reg → K) := by + set s0 := run s p + set t := step s0 (.add j h c ch) + have hl : s0.loc = t.loc := rfl + obtain ⟨-, hd⟩ := run_diff q s0 t hl + have hin : ∀ r, (t.row - s0.row) r ∈ K ∙ (Pi.single h 1 : Reg → K) := by + intro r + by_cases hr : r = j + · subst hr; simp [t, step, hrow, mem_span_singleton] + · simp [t, step, Function.update_of_ne hr] + have hall := rows_in_run (K ∙ (Pi.single h 1 : Reg → K)) q ⟨t.row - s0.row, s0.loc⟩ hin + have : ∀ r, ∃ a : K, a • (Pi.single h 1 : Reg → K) = + (run t q).row r - (run s0 q).row r := by + intro r + have e := congrFun hd r + rw [Pi.sub_apply] at e + rw [e]; exact mem_span_singleton.1 (hall r) + choose δ hδ using this + refine ⟨δ, fun r => ?_⟩ + rw [run_append, run_append] + change (run t q).row r = _ + rw [← sub_add_cancel ((run t q).row r) ((run s0 q).row r), ← hδ r, add_comm] + +/-- Column form: every final row (non-V-enders included) is unchanged on every column k ≠ h. -/ +theorem inject_col (s : St K Reg C) (p q : List (Ev K Reg C)) (h j : Reg) (c : K) (ch : C) + (hrow : (run s p).row h = Pi.single h 1) (r k : Reg) (hk : k ≠ h) : + (run s (p ++ .add j h c ch :: q)).row r k = (run s (p ++ q)).row r k := by + obtain ⟨δ, hδ⟩ := inject s p q h j c ch hrow + rw [hδ r]; simp [hk] + +/-- **Two injections** (the SWAPBUILD "both" word: 457 → 242, then 461 → X10). Hypotheses: h1 = e_h1 +at the first point of the unedited prefix, and h2 = e_h2 at the second point of the once-edited word. -/ +theorem inject_two (s : St K Reg C) (p1 q1 q2 : List (Ev K Reg C)) (h1 j1 h2 j2 : Reg) (c1 c2 : K) + (ch1 ch2 : C) + (hrow1 : (run s p1).row h1 = Pi.single h1 1) + (hrow2 : (run s (p1 ++ .add j1 h1 c1 ch1 :: q1)).row h2 = Pi.single h2 1) : + ∃ δ1 δ2 : Reg → K, ∀ r, + (run s (p1 ++ .add j1 h1 c1 ch1 :: q1 ++ .add j2 h2 c2 ch2 :: q2)).row r = + (run s (p1 ++ q1 ++ q2)).row r + δ1 r • (Pi.single h1 1 : Reg → K) + + δ2 r • (Pi.single h2 1 : Reg → K) := by + obtain ⟨δ2, hδ2⟩ := inject s (p1 ++ .add j1 h1 c1 ch1 :: q1) q2 h2 j2 c2 ch2 hrow2 + obtain ⟨δ1, hδ1⟩ := inject s p1 (q1 ++ q2) h1 j1 c1 ch1 hrow1 + refine ⟨δ1, δ2, fun r => ?_⟩ + rw [hδ2 r] + have e1 : p1 ++ Ev.add j1 h1 c1 ch1 :: q1 ++ q2 = p1 ++ Ev.add j1 h1 c1 ch1 :: (q1 ++ q2) := by simp + rw [e1, hδ1 r, List.append_assoc] + +/-- Two-column form: every final row is unchanged on every column outside {h1, h2}. -/ +theorem inject_two_col (s : St K Reg C) (p1 q1 q2 : List (Ev K Reg C)) (h1 j1 h2 j2 : Reg) + (c1 c2 : K) (ch1 ch2 : C) + (hrow1 : (run s p1).row h1 = Pi.single h1 1) + (hrow2 : (run s (p1 ++ .add j1 h1 c1 ch1 :: q1)).row h2 = Pi.single h2 1) + (r k : Reg) (hk1 : k ≠ h1) (hk2 : k ≠ h2) : + (run s (p1 ++ .add j1 h1 c1 ch1 :: q1 ++ .add j2 h2 c2 ch2 :: q2)).row r k = + (run s (p1 ++ q1 ++ q2)).row r k := by + obtain ⟨δ1, δ2, hδ⟩ := inject_two s p1 q1 q2 h1 j1 h2 j2 c1 c2 ch1 ch2 hrow1 hrow2 + rw [hδ r]; simp [hk1, hk2] + +/-- **The debt is absorbed by the V mix.** Let `evs` be the edited (hub-deleted) word and `X0` the +unedited end rows. Suppose the edited end rows differ from X0 only along e_h (`inject`), the +non-V-enders end on target (the TR2 column condition, data), the unedited V-ender rows lie in +B = span V targets, e_h ∈ B (h ends at V with target e_h) and B ⊓ N = ⊥. Then the edited run has a +V mix iff it is loss-free. -/ +theorem absorb [Fintype Reg] (z V : C) (s : St K Reg C) (T : Finset Reg) (evs : List (Ev K Reg C)) + (hL : Legal z V s evs) (hN : ∀ e ∈ evs, NZ e) (hG : Good s T) (hS : Sp s = TS T) + (Rf : Reg → Reg → K) (G1 : Finset Reg) (h : Reg) (X0 : Reg → Reg → K) (δ : Reg → K) + (hX : ∀ r, (run s evs).row r = X0 r + δ r • (Pi.single h 1 : Reg → K)) + (hNon : ∀ r ∉ G1, (run s evs).row r = Rf r) + (hTgt : span K (Set.range Rf) = TS (tokRun T evs)) + (hX0 : ∀ g ∈ G1, X0 g ∈ span K (Rf '' (G1 : Set Reg))) + (he : (Pi.single h 1 : Reg → K) ∈ span K (Rf '' (G1 : Set Reg))) + (hBN : span K (Rf '' (G1 : Set Reg)) ⊓ span K (Rf '' (G1 : Set Reg)ᶜ) = ⊥) : + VMix (run s evs).row Rf G1 ↔ ¬ Loss s evs := by + rw [RankLawC.rank_law_indep z V s T evs hL hN hG hS Rf G1 hNon hTgt hBN] + refine ⟨And.left, fun hl => ⟨hl, fun g hg => ?_⟩⟩ + rw [hX g]; exact add_mem (hX0 g hg) (smul_mem _ _ he) + +end SwapWord + +#print axioms SwapWord.absorb +#print axioms SwapWord.inject_two_col +#print axioms SwapWord.inject_col +#print axioms RankLawC.rank_law_proj +#print axioms RankLawC.rank_law_of_gen diff --git a/research/p104-reader-ceiling/lean/Nov15/SwapWord.md b/research/p104-reader-ceiling/lean/Nov15/SwapWord.md new file mode 100644 index 0000000000..e4c791cf91 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/SwapWord.md @@ -0,0 +1,37 @@ +# SwapWord.lean: the SWAPBUILD two-swap edit (h457 → 242, h461 → X10). No sorry, ~5 s, 2.1 GB RSS +Imports the RankLawC olean. Axioms: [propext, Classical.choice, Quot.sound]. +Source: internal notes (not included). + +**The edit (data).** After rebirth (h = e_h at its first chart), the edit injects `j += −1·h` just before the native's own `h += j`. Together they are the swap. +- 457 → 242 at index 11392 of the hub-deleted mid program; 461 → X10 at index 11498. +- h = e_h holds at both points; the second is checked in the once-edited word (Nov15/swapword_data.py). + +**General lemmas** (TokenCancel's op model, any field): +- `run_diff`: two runs of the same events from states with equal locations differ by the run of the difference state, with births read as INITs. +- `rows_in_run`: with no births, all rows stay in any subspace P that contains them initially. +- **`inject`**: if h's row is e_h after prefix p, injecting `add j h c` changes every final row by δ r • e_h only. + - `inject_col`: every row, non-V-enders included, is unchanged on every column k ≠ h. +- `inject_two`, `inject_two_col`: the same for two injections (h1 = e_h1 in the unedited prefix, h2 = e_h2 in the once-edited one). The change is δ1 e_h1 + δ2 e_h2. +- **`absorb`** (the debt is absorbed by the V mix). Hypotheses: + - the edited rows = X0 + δ e_h; + - non-V-enders on target (TR2); + - X0[G1] ⊆ B; + - e_h ∈ B; + - B ⊓ N = ⊥. + + Then: V mix for the edited run ⟺ edited run is loss-free (via RankLawC.rank_law_indep). + +**Data (exact, swapword_data.py).** +- Debt support is exactly column {h}. +- Non-V-enders changed: 157/160/210/219 for 457 (column 457: −1/2 → 0) and 120/179/192/207 for 461 (column 461: +1 → 0). +- Every non-G0 mismatch vs native Rf on non-V-enders: 4 → 0. +- V-enders absorb the debt; 457 and 461 are themselves V-enders with Rf h = e_h, so e_h ∈ B. +- Loss-freeness/joint feasibility is the JointG + exact replay data (SWAPBUILD: final rows == native rows). + +**Scope.** +- `absorb` is stated for rows after the z-prefix. HubSettle's [X_n | X_0·M] acts only on G0 columns, and after rebirth h ∉ G0, so the e_h debt commutes with it. + +**Finding (prose false as written).** "The swap preserves every non-V-ender row exactly" is false against the unswapped (rebirth-only) word: it changes 4 non-V-ender rows per swap. +- True form: the swap changes final rows only in column e_h (`inject_col`). On non-V-enders the change is exactly the TR2 canceller, which zeroes their column h (now non-G0 after rebirth, so the z-hub can no longer clean it). +- Minimal fix: "preserves every row off column h; on non-V-enders it cancels column h (TR2), and the remaining e_h debt sits on V-enders, absorbed by the V mix because e_h ∈ span V targets (h is a V-ender)". +- Without e_h ∈ B and with B ⊓ N = ⊥, a nonzero V-ender debt can never be absorbed. diff --git a/research/p104-reader-ceiling/lean/Nov15/TokenCancel.lean b/research/p104-reader-ceiling/lean/Nov15/TokenCancel.lean new file mode 100644 index 0000000000..5686668ec3 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/TokenCancel.lean @@ -0,0 +1,452 @@ +/- +BIG-TOKENCANCEL T1 (hub blindness) and T2 (difference lemma), Source: internal notes See TokenCancel.md. + +Op model: registers `Reg`, charts `C` with two hubs `z` (= {0}) and `V`; rows in initial-row +coordinates `Reg → K`. Events carry their chart. Legal = co-presence plus the two [C] facts of +T1(a)/(b): no MOVE enters z and no MOVE leaves V. +-/ +import Mathlib.LinearAlgebra.Span.Basic +import Mathlib.LinearAlgebra.Pi +import Mathlib.Tactic.Abel +import Mathlib.Algebra.BigOperators.Fin + +set_option linter.unusedSectionVars false + +namespace TokenCancel + +inductive Ev (K Reg C : Type*) + | born (i : Reg) (c : C) + | init (i : Reg) (c : C) + | move (i : Reg) (c : C) + | add (i j : Reg) (a : K) (c : C) + | scale (i : Reg) (u : K) (c : C) + | clear (i : Reg) (c : C) + | copy (i j : Reg) (c : C) + +structure St (K Reg C : Type*) where + row : Reg → Reg → K + loc : Reg → Option C + +variable {K Reg C : Type*} [Field K] [DecidableEq Reg] [DecidableEq C] + +def step (s : St K Reg C) : Ev K Reg C → St K Reg C + | .born i c => ⟨Function.update s.row i (Pi.single i 1), Function.update s.loc i (some c)⟩ + | .init i c => ⟨Function.update s.row i 0, Function.update s.loc i (some c)⟩ + | .move i c => ⟨s.row, Function.update s.loc i (some c)⟩ + | .add i j a _ => ⟨Function.update s.row i (s.row i + a • s.row j), s.loc⟩ + | .scale i u _ => ⟨Function.update s.row i (u • s.row i), s.loc⟩ + | .clear i _ => ⟨Function.update s.row i 0, s.loc⟩ + | .copy i j _ => ⟨Function.update s.row i (s.row j), s.loc⟩ + +def run (s : St K Reg C) : List (Ev K Reg C) → St K Reg C + | [] => s + | e :: es => run (step s e) es + +variable (z V : C) + +/-- Legality: co-presence at the event's chart; births/INITs of absent registers; +MOVEs never enter `z` and never leave `V` (T1(a), T1(b), checked [C] on #7623). -/ +def LegalEv (s : St K Reg C) : Ev K Reg C → Prop + | .born i _ => s.loc i = none + | .init i _ => s.loc i = none + | .move i c => ∃ c0, s.loc i = some c0 ∧ c0 ≠ V ∧ c ≠ z + | .add i j _ c => i ≠ j ∧ s.loc i = some c ∧ s.loc j = some c + | .scale i _ c => s.loc i = some c + | .clear i c => s.loc i = some c + | .copy i j c => s.loc i = some c ∧ s.loc j = some c + +def Legal : St K Reg C → List (Ev K Reg C) → Prop + | _, [] => True + | s, e :: es => LegalEv z V s e ∧ Legal (step s e) es + +/-- An op (not a birth/INIT/MOVE) at a hub. -/ +def hubOp : Ev K Reg C → Prop + | .add _ _ _ c | .scale _ _ c | .clear _ c | .copy _ _ c => c = z ∨ c = V + | _ => False + +instance (e : Ev K Reg C) : Decidable (hubOp z V e) := by + cases e <;> simp only [hubOp] <;> infer_instance + +variable (h : Reg) + +/-- The interior coefficient program: tracks the e_h-coefficient, ignoring every hub op. -/ +def sig (σ : Reg → K) : Ev K Reg C → Reg → K + | .born i _ => Function.update σ i (if i = h then 1 else 0) + | .init i _ => Function.update σ i 0 + | .move _ _ => σ + | .add i j a c => if c = z ∨ c = V then σ else Function.update σ i (σ i + a * σ j) + | .scale i u c => if c = z ∨ c = V then σ else Function.update σ i (u * σ i) + | .clear i c => if c = z ∨ c = V then σ else Function.update σ i 0 + | .copy i j c => if c = z ∨ c = V then σ else Function.update σ i (σ j) + +def sigRun (σ : Reg → K) : List (Ev K Reg C) → Reg → K + | [] => σ + | e :: es => sigRun (sig z V h σ e) es + +/-- The program is blind to hub ops: it equals the program run on the interior subsequence. -/ +theorem sigRun_filter (σ : Reg → K) (evs : List (Ev K Reg C)) : + sigRun z V h σ evs = sigRun z V h σ (evs.filter fun e => ¬ hubOp z V e) := by + induction evs generalizing σ with + | nil => rfl + | cons e es ih => + by_cases he : hubOp z V e + · have : sig z V h σ e = σ := by + cases e <;> simp_all [hubOp, sig] + simp [sigRun, he, this, ih] + · simp [sigRun, he, ih] + +/-- Invariant: rows not at V carry the program's e_h-coefficient; rows at z carry 0. -/ +def Inv (s : St K Reg C) (σ : Reg → K) : Prop := + (∀ r, s.loc r ≠ some V → s.row r h = σ r) ∧ (∀ r, s.loc r = some z → s.row r h = 0) + +lemma inv_update (s : St K Reg C) (σ σ' : Reg → K) (i : Reg) (nr : Reg → K) + (hI : Inv z V h s σ) (hσ : ∀ r, r ≠ i → σ' r = σ r) + (hnew : s.loc i ≠ some V → nr h = σ' i) (hz : s.loc i = some z → nr h = 0) : + Inv z V h ⟨Function.update s.row i nr, s.loc⟩ σ' := by + refine ⟨fun r hr => ?_, fun r hr => ?_⟩ + · by_cases hri : r = i + · subst hri; simpa using hnew hr + · simp only [Function.update_of_ne hri]; rw [hσ r hri]; exact hI.1 r hr + · by_cases hri : r = i + · subst hri; simpa using hz hr + · simp only [Function.update_of_ne hri]; exact hI.2 r hr + +theorem inv_step (s : St K Reg C) (σ : Reg → K) (e : Ev K Reg C) + (hI : Inv z V h s σ) (hL : LegalEv z V s e) (hb : ∀ c, e = .born h c → c ≠ z) : + Inv z V h (step s e) (sig z V h σ e) := by + have hI1 := hI.1 + have hI2 := hI.2 + -- coefficient of a register present at chart c + have atz : ∀ i c, s.loc i = some c → c = z → s.row i h = 0 := fun i c hi hc => + hI2 i (hc ▸ hi) + have notV : ∀ i c, s.loc i = some c → c ≠ V → s.row i h = σ i := fun i c hi hc => + hI1 i (by rw [hi]; simpa using hc) + cases e with + | born i c => + refine ⟨fun r _ => ?_, fun r hr => ?_⟩ + · by_cases hri : r = i + · subst hri; simp [step, sig, Pi.single_apply, eq_comm] + · simp only [step, sig, Function.update_of_ne hri] at * + exact hI1 r (by simpa [step, Function.update_of_ne hri] using ‹_›) + · by_cases hri : r = i + · subst hri + simp only [step, Function.update_self, Option.some.injEq] at hr + have : r ≠ h := fun hrh => hb c (by rw [hrh]) hr + simp [step, this.symm] + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact hI2 r hr + | init i c => + refine ⟨fun r hr => ?_, fun r hr => ?_⟩ + · by_cases hri : r = i + · subst hri; simp [step, sig] + · simp only [step, sig, Function.update_of_ne hri] at hr ⊢; exact hI1 r hr + · by_cases hri : r = i + · subst hri; simp [step] + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact hI2 r hr + | move i c => + obtain ⟨c0, hc0, hc0V, hcz⟩ := hL + refine ⟨fun r hr => ?_, fun r hr => ?_⟩ + · by_cases hri : r = i + · subst hri; exact hI1 r (by rw [hc0]; simpa using hc0V) + · simp only [step, sig, Function.update_of_ne hri] at hr ⊢; exact hI1 r hr + · by_cases hri : r = i + · subst hri; simp [step] at hr; exact absurd hr hcz + · simp only [step, Function.update_of_ne hri] at hr ⊢; exact hI2 r hr + | add i j a c => + obtain ⟨hij, hi, hj⟩ := hL + by_cases hc : c = z ∨ c = V + · have hs : sig z V h σ (.add i j a c) = σ := by simp [sig, hc] + rw [hs] + apply inv_update z V h s σ σ i _ hI (fun _ _ => rfl) + · intro hiV + have hcV : c ≠ V := fun h' => hiV (h' ▸ hi) + have hcz : c = z := hc.resolve_right hcV + simp [atz i c hi hcz, atz j c hj hcz, ← notV i c hi hcV] + · intro hiz + have hcz : c = z := by rw [hi] at hiz; exact Option.some.inj hiz + simp [atz i c hi hcz, atz j c hj hcz] + · push Not at hc + have hs : sig z V h σ (.add i j a c) = Function.update σ i (σ i + a * σ j) := by + simp [sig, hc] + rw [hs] + apply inv_update z V h s σ _ i _ hI (fun r hr => Function.update_of_ne hr _ _) + · intro _; simp [notV i c hi hc.2, notV j c hj hc.2] + · intro hiz; rw [hi] at hiz; exact absurd (Option.some.inj hiz) hc.1 + | scale i u c => + have hi : s.loc i = some c := hL + by_cases hc : c = z ∨ c = V + · have hs : sig z V h σ (.scale i u c) = σ := by simp [sig, hc] + rw [hs] + apply inv_update z V h s σ σ i _ hI (fun _ _ => rfl) + · intro hiV + have hcV : c ≠ V := fun h' => hiV (h' ▸ hi) + have hcz : c = z := hc.resolve_right hcV + simp [atz i c hi hcz, ← notV i c hi hcV] + · intro hiz + have hcz : c = z := by rw [hi] at hiz; exact Option.some.inj hiz + simp [atz i c hi hcz] + · push Not at hc + have hs : sig z V h σ (.scale i u c) = Function.update σ i (u * σ i) := by + simp [sig, hc] + rw [hs] + apply inv_update z V h s σ _ i _ hI (fun r hr => Function.update_of_ne hr _ _) + · intro _; simp [notV i c hi hc.2] + · intro hiz; rw [hi] at hiz; exact absurd (Option.some.inj hiz) hc.1 + | clear i c => + have hi : s.loc i = some c := hL + by_cases hc : c = z ∨ c = V + · have hs : sig z V h σ (.clear i c) = σ := by simp [sig, hc] + rw [hs] + apply inv_update z V h s σ σ i _ hI (fun _ _ => rfl) + · intro hiV + have hcV : c ≠ V := fun h' => hiV (h' ▸ hi) + have hcz : c = z := hc.resolve_right hcV + simp [← notV i c hi hcV, atz i c hi hcz] + · intro _; simp + · push Not at hc + have hs : sig z V h σ (.clear i c) = Function.update σ i 0 := by simp [sig, hc] + rw [hs] + apply inv_update z V h s σ _ i _ hI (fun r hr => Function.update_of_ne hr _ _) + · intro _; simp + · intro _; simp + | copy i j c => + obtain ⟨hi, hj⟩ := hL + by_cases hc : c = z ∨ c = V + · have hs : sig z V h σ (.copy i j c) = σ := by simp [sig, hc] + rw [hs] + apply inv_update z V h s σ σ i _ hI (fun _ _ => rfl) + · intro hiV + have hcV : c ≠ V := fun h' => hiV (h' ▸ hi) + have hcz : c = z := hc.resolve_right hcV + simp [atz j c hj hcz, ← notV i c hi hcV, atz i c hi hcz] + · intro hiz + have hcz : c = z := by rw [hi] at hiz; exact Option.some.inj hiz + simp [atz j c hj hcz] + · push Not at hc + have hs : sig z V h σ (.copy i j c) = Function.update σ i (σ j) := by simp [sig, hc] + rw [hs] + apply inv_update z V h s σ _ i _ hI (fun r hr => Function.update_of_ne hr _ _) + · intro _; simp [notV j c hj hc.2] + · intro hiz; rw [hi] at hiz; exact absurd (Option.some.inj hiz) hc.1 + +def start : St K Reg C := ⟨fun _ => 0, fun _ => none⟩ + +theorem inv_run : ∀ (s : St K Reg C) (σ : Reg → K) (evs : List (Ev K Reg C)), + Inv z V h s σ → Legal z V s evs → (∀ c, Ev.born h c ∈ evs → c ≠ z) → + Inv z V h (run s evs) (sigRun z V h σ evs) + | _, _, [], hI, _, _ => hI + | s, σ, e :: es, hI, ⟨hL, hLs⟩, hb => + inv_run (step s e) (sig z V h σ e) es + (inv_step z V h s σ e hI hL (fun c he => hb c (by simp [he]))) + hLs (fun c hc => hb c (by simp [hc])) + +/-- **T1 (hub blindness).** In a legal run from the empty state in which `h` is not born at the +hub z (h off-hub born), every register r not at V at the end has e_h-coefficient equal to the +interior program's value: hub ops never enter it. -/ +theorem T1_hub_blind (evs : List (Ev K Reg C)) (hL : Legal z V start evs) + (hb : ∀ c, Ev.born h c ∈ evs → c ≠ z) (r : Reg) (hr : (run start evs).loc r ≠ some V) : + (run start evs).row r h = sigRun z V h (fun _ => 0) (evs.filter fun e => ¬ hubOp z V e) r := by + have hI : Inv z V h (start : St K Reg C) (fun _ => 0) := + ⟨fun _ _ => rfl, fun r hr => by simp [start] at hr⟩ + rw [(inv_run z V h start _ evs hI hL hb).1 r hr, sigRun_filter] + +/-- **T1, two-run form.** Two legal runs with the same interior subsequence give every register +that is not at V at the end of both the same e_h-coefficient. -/ +theorem T1_two_runs (evs evs' : List (Ev K Reg C)) + (hL : Legal z V start evs) (hL' : Legal z V start evs') + (hb : ∀ c, Ev.born h c ∈ evs → c ≠ z) (hb' : ∀ c, Ev.born h c ∈ evs' → c ≠ z) + (hfil : evs.filter (fun e => ¬ hubOp z V e) = evs'.filter (fun e => ¬ hubOp z V e)) + (r : Reg) (hr : (run start evs).loc r ≠ some V) (hr' : (run start evs').loc r ≠ some V) : + (run start evs).row r h = (run start evs').row r h := by + rw [T1_hub_blind z V h evs hL hb r hr, T1_hub_blind z V h evs' hL' hb' r hr', hfil] + +/-! ## T2 difference lemma (direct carrier) + +y's row evolves only by: `addK a r` (y += a·row_k, with row_k's e_k-coefficient 1), `addO w` +(y += w with w's e_k-coefficient 0) and `scale u` (prose leaves SCALE of y unstated; it is allowed). +`recv` tracks the net receipt from k, `A` the accumulated e_k-coefficient. -/ + +inductive YOp (K Reg : Type*) + | addK (a : K) (r : Reg → K) + | addO (w : Reg → K) + | scale (u : K) + +/-- (y, receipt from k, effective coefficient sum). -/ +def yStep : (Reg → K) × (Reg → K) × K → YOp K Reg → (Reg → K) × (Reg → K) × K + | (y, R, A), .addK a r => (y + a • r, R + a • r, A + a) + | (y, R, A), .addO w => (y + w, R, A) + | (y, R, A), .scale u => (u • y, u • R, u * A) + +def yRun (st : (Reg → K) × (Reg → K) × K) : List (YOp K Reg) → (Reg → K) × (Reg → K) × K + | [] => st + | o :: os => yRun (yStep st o) os + +/-- Invariant of the y-replay: y's e_k-coefficient equals the accumulated coefficient A, and +R − A·r1 stays in any submodule N containing every (row_k at a contact) − r1. -/ +theorem T2_inv (k : Reg) (r1 : Reg → K) (N : Submodule K (Reg → K)) : + ∀ (ops : List (YOp K Reg)) (y R : Reg → K) (A : K), + (∀ a r, YOp.addK a r ∈ ops → r k = 1 ∧ r - r1 ∈ N) → (∀ w, YOp.addO w ∈ ops → w k = 0) → + y k = A → R - A • r1 ∈ N → + (yRun (y, R, A) ops).1 k = (yRun (y, R, A) ops).2.2 ∧ + (yRun (y, R, A) ops).2.1 - (yRun (y, R, A) ops).2.2 • r1 ∈ N + | [], _, _, _, _, _, hy, hR => ⟨hy, hR⟩ + | o :: os, y, R, A, hK, hO, hy, hR => by + have hK' : ∀ a r, YOp.addK a r ∈ os → r k = 1 ∧ r - r1 ∈ N := + fun a r h => hK a r (List.mem_cons_of_mem _ h) + have hO' : ∀ w, YOp.addO w ∈ os → w k = 0 := fun w h => hO w (List.mem_cons_of_mem _ h) + cases o with + | addK a r => + obtain ⟨hrk, hrN⟩ := hK a r List.mem_cons_self + apply T2_inv k r1 N os (y + a • r) (R + a • r) (A + a) hK' hO' + · simp [hy, hrk] + · have : R + a • r - (A + a) • r1 = (R - A • r1) + a • (r - r1) := by + rw [add_smul, smul_sub]; abel + rw [this]; exact N.add_mem hR (N.smul_mem a hrN) + | addO w => + have hwk := hO w List.mem_cons_self + apply T2_inv k r1 N os (y + w) R A hK' hO' + · simp [hy, hwk] + · exact hR + | scale u => + apply T2_inv k r1 N os (u • y) (u • R) (u * A) hK' hO' + · simp [hy] + · have : u • R - (u * A) • r1 = u • (R - A • r1) := by rw [smul_sub, mul_smul] + rw [this]; exact N.smul_mem u hR + +/-- **T2 (difference lemma, direct carrier).** y starts with e_k-coefficient 0 and its row changes +only through `ops`: contacts y += a·row_k(t) (row_k(t) has e_k-coefficient 1), additions of rows +free of e_k, and SCALEs of y. If y's final e_k-coefficient is 0 (its SPEC final row has no helper +coordinate; T1: no hub op can fix it), then +* the effective coefficients sum to 0, and +* the net receipt from k lies in span{row_k(t_i) − row_k(t_1)}: what k carried into its first + contact with y never reaches y net (any reference row r1, in particular row_k at the first contact). -/ +theorem T2_difference (k : Reg) (r1 : Reg → K) (ops : List (YOp K Reg)) (y0 : Reg → K) + (hy0 : y0 k = 0) + (hK : ∀ a r, YOp.addK a r ∈ ops → r k = 1) (hO : ∀ w, YOp.addO w ∈ ops → w k = 0) + (hfin : (yRun (y0, 0, 0) ops).1 k = 0) : + (yRun (y0, 0, 0) ops).2.2 = 0 ∧ + (yRun (y0, 0, 0) ops).2.1 ∈ + Submodule.span K {x | ∃ a r, YOp.addK a r ∈ ops ∧ x = r - r1} := by + set N := Submodule.span K {x | ∃ a r, YOp.addK a r ∈ ops ∧ x = r - r1} + have := T2_inv k r1 N ops y0 0 0 + (fun a r h => ⟨hK a r h, Submodule.subset_span ⟨a, r, h, rfl⟩⟩) hO hy0 (by simp) + have hA : (yRun (y0, 0, 0) ops).2.2 = 0 := by rw [← this.1, hfin] + refine ⟨hA, ?_⟩ + have h2 := this.2 + rwa [hA, zero_smul, sub_zero] at h2 + +/-- The receipt bookkeeping is faithful: the final row is y0 scaled, plus the receipt from k, plus +the other additions (scaled by later SCALEs). Here only the e_k-coordinate part matters, so we +record the coefficient identity: final e_k-coefficient = (Π scales)·y0_k + A. With y0_k = 0 this is A. -/ +theorem T2_coeff (k : Reg) : ∀ (ops : List (YOp K Reg)) (y R : Reg → K) (A : K), + (∀ a r, YOp.addK a r ∈ ops → r k = 1) → (∀ w, YOp.addO w ∈ ops → w k = 0) → + y k = A → (yRun (y, R, A) ops).1 k = (yRun (y, R, A) ops).2.2 := by + intro ops y R A hK hO hy + exact (T2_inv k 0 ⊤ ops y R A (fun a r h => ⟨hK a r h, Submodule.mem_top⟩) hO hy + Submodule.mem_top).1 + +/-! ## T2, corrected Σ statement + +The literal "Σ a_i = 0" is false once y is SCALEd between contacts (`T2_literal_false`). The +correct statement uses EFFECTIVE coefficients: contact i contributes a_i · Π(scales of y after it). +`scl ops` = product of all SCALE factors of y in `ops`; `contacts ops` = (effective coefficient, +row_k at the contact) for each contact, in order. -/ + +/-- product of the SCALE factors of y in `ops`. -/ +def scl : List (YOp K Reg) → K + | [] => 1 + | .scale u :: os => u * scl os + | .addK _ _ :: os => scl os + | .addO _ :: os => scl os + +/-- contacts with their effective coefficients a_i · Π(later scales). -/ +def contacts : List (YOp K Reg) → List (K × (Reg → K)) + | [] => [] + | .addK a r :: os => (a * scl os, r) :: contacts os + | .addO _ :: os => contacts os + | .scale _ :: os => contacts os + +/-- Closed form of the coefficient and receipt trackers. -/ +theorem yRun_closed : ∀ (ops : List (YOp K Reg)) (y R : Reg → K) (A : K), + (yRun (y, R, A) ops).2.2 = scl ops * A + ((contacts ops).map Prod.fst).sum ∧ + (yRun (y, R, A) ops).2.1 = scl ops • R + ((contacts ops).map (fun p => p.1 • p.2)).sum + | [], y, R, A => by simp [yRun, scl, contacts] + | o :: os, y, R, A => by + cases o with + | addK a r => + obtain ⟨h1, h2⟩ := yRun_closed os (y + a • r) (R + a • r) (A + a) + simp only [yRun, yStep, scl, contacts, List.map_cons, List.sum_cons] + refine ⟨by rw [h1]; ring, ?_⟩ + rw [h2, smul_add, smul_smul, mul_comm (scl os) a]; abel + | addO w => + obtain ⟨h1, h2⟩ := yRun_closed os (y + w) R A + simpa only [yRun, yStep, scl, contacts] using ⟨h1, h2⟩ + | scale u => + obtain ⟨h1, h2⟩ := yRun_closed os (u • y) (u • R) (u * A) + simp only [yRun, yStep, scl, contacts] + refine ⟨by rw [h1]; ring, ?_⟩ + rw [h2, smul_smul, mul_comm (scl os) u] + +/-- **T2, corrected.** Hypotheses as in `T2_difference`. Then +* Σ (effective coefficients a_i · Π later scales of y) = 0; +* the net receipt from k is Σ eff_i · row_k(t_i) = Σ eff_i · (row_k(t_i) − r1) for ANY r1, in + particular r1 = row_k(t_1): content k carried into its first contact never reaches y net. -/ +theorem T2_corrected (k : Reg) (ops : List (YOp K Reg)) (y0 : Reg → K) + (hy0 : y0 k = 0) + (hK : ∀ a r, YOp.addK a r ∈ ops → r k = 1) (hO : ∀ w, YOp.addO w ∈ ops → w k = 0) + (hfin : (yRun (y0, 0, 0) ops).1 k = 0) (r1 : Reg → K) : + ((contacts ops).map Prod.fst).sum = 0 ∧ + (yRun (y0, 0, 0) ops).2.1 = ((contacts ops).map (fun p => p.1 • p.2)).sum ∧ + (yRun (y0, 0, 0) ops).2.1 = ((contacts ops).map (fun p => p.1 • (p.2 - r1))).sum := by + obtain ⟨h1, h2⟩ := yRun_closed ops y0 0 0 + have hA := (T2_difference k r1 ops y0 hy0 hK hO hfin).1 + rw [h1, mul_zero, zero_add] at hA + have hrec : (yRun (y0, 0, 0) ops).2.1 = ((contacts ops).map (fun p => p.1 • p.2)).sum := by + rw [h2, smul_zero, zero_add] + refine ⟨hA, hrec, ?_⟩ + have hsplit : ∀ l : List (K × (Reg → K)), + (l.map (fun p => p.1 • (p.2 - r1))).sum + = (l.map (fun p => p.1 • p.2)).sum - (l.map Prod.fst).sum • r1 := by + intro l; induction l with + | nil => simp + | cons p l ih => + simp only [List.map_cons, List.sum_cons]; rw [ih, add_smul, smul_sub]; abel + rw [hsplit, hA, zero_smul, sub_zero, hrec] + +/-- Without SCALEs of y the effective coefficients are the literal a_i, so the prose "Σ a_i = 0" +holds verbatim. -/ +theorem contacts_noscale : ∀ (ops : List (YOp K Reg)), (∀ u, YOp.scale u ∉ ops) → + (contacts ops).map Prod.fst = ops.filterMap (fun o => match o with + | .addK a _ => some a | _ => none) + | [], _ => rfl + | o :: os, h => by + have h' : ∀ u, YOp.scale u ∉ os := fun u hu => h u (List.mem_cons_of_mem _ hu) + have hs : scl os = 1 := by + clear h; induction os with + | nil => rfl + | cons o' os' ih => + cases o' with + | scale u => exact absurd List.mem_cons_self (h' u) + | addK a r => exact ih (fun u hu => h' u (List.mem_cons_of_mem _ hu)) + | addO w => exact ih (fun u hu => h' u (List.mem_cons_of_mem _ hu)) + cases o with + | addK a r => simp [contacts, hs, contacts_noscale os h'] + | addO w => simpa [contacts] using contacts_noscale os h' + | scale u => exact absurd List.mem_cons_self (h u) + +/-- The finding, formal: y += k, y *= 2, y += (−2)·k. Final e_k-coefficient 0, literal Σ a = −1, +effective Σ = 1·2 + (−2) = 0. Over ℚ with one register. -/ +theorem T2_literal_false : + let ek : Unit → ℚ := fun _ => 1 + let ops : List (YOp ℚ Unit) := [.addK 1 ek, .scale 2, .addK (-2) ek] + (yRun ((0 : Unit → ℚ), 0, 0) ops).1 () = 0 ∧ (1 : ℚ) + (-2) ≠ 0 ∧ + ((contacts ops).map Prod.fst).sum = 0 := by + refine ⟨?_, by norm_num, ?_⟩ <;> simp [yRun, yStep, contacts, scl] + +end TokenCancel + +#print axioms TokenCancel.T1_hub_blind +#print axioms TokenCancel.T1_two_runs +#print axioms TokenCancel.T2_difference +#print axioms TokenCancel.T2_corrected +#print axioms TokenCancel.contacts_noscale +#print axioms TokenCancel.T2_literal_false diff --git a/research/p104-reader-ceiling/lean/Nov15/TokenCancel.md b/research/p104-reader-ceiling/lean/Nov15/TokenCancel.md new file mode 100644 index 0000000000..06a05563e7 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/TokenCancel.md @@ -0,0 +1,36 @@ +# TokenCancel.lean: BIG-TOKENCANCEL T1 (hub blindness) + T2 (difference lemma). No sorry, ~6 s, 1.7 GB RSS +Source: internal notes (not included). Axioms (3 printed): [propext, Quot.sound]. + +**Model.** +- Registers Reg, charts C, hubs z (= {0}) and V. Rows are in initial-row coordinates. +- Events: born (row e_i), init (row 0), move, add i += a·j (i ≠ j), scale, clear, copy. Each event carries its chart. +- Legal = births/INITs of absent registers and co-presence at the event's chart, plus the two [C] facts of T1(a)/(b): no MOVE enters z, and no MOVE leaves V (0 of 6,257 on #7623). +- `hubOp` = an add/scale/clear/copy at z or V. + +**T1.** +- `sigRun` is the interior coefficient program: it tracks the e_h-coefficient and ignores hub ops. `sigRun_filter` shows it depends only on the non-hub-op subsequence. +- `T1_hub_blind`: in a legal run where h is not born at z (h off-hub born), every register not at V at the end has row[h] = sigRun on the interior subsequence. +- `T1_two_runs`: two legal runs with the same interior subsequence agree on the e_h-coefficient of every register that is off V at the end of both. +- Proof invariant: rows not at V carry the program's value; rows at z carry 0. +- The hypothesis z ≠ V is NOT needed. T1' (the joint-hub D-mix corollary) is plain invertibility and is not formalized. + +**T2.** +- y's row changes only through `addK a r` (contact y += a·row_k, with r_k = 1), `addO w` (w_k = 0) and `scale u` of y. +- `T2_difference`: if y₀_k = 0 and y's final e_k-coefficient is 0, then + - the effective coefficient sum is 0; + - the net receipt from k lies in span{r_i − r1} for ANY reference row r1, in particular row_k at the first contact. So content k carried into the first contact never reaches y net. +- `T2_coeff`: final e_k-coefficient = A. + +**Finding (scope, T2).** The literal "Σ a_i = 0" is FALSE if y is SCALEd between contacts. Example: y += k, y *= 2, y += (−2)·k gives Σ a = −1, yet y_k = 0. +- Minimal fix: use effective coefficients a_i·Π(later scales of y), or require that y is not SCALEd between contacts. +- The conclusion (receipt ∈ span of post-first-contact differences) survives SCALE. +- CLEAR/COPY of y and relays through third registers remain outside scope, as the prose says. + +**T2 corrected .** Same file, axioms [propext, Quot.sound] (the counterexample also uses Classical.choice). +- `contacts ops` lists (a_i · Π(later scales of y), row_k(t_i)) for each contact. +- `yRun_closed` gives the closed forms of the coefficient and receipt trackers. +- `T2_corrected`: under T2's hypotheses, + - Σ effective coefficients = 0; + - the net receipt = Σ eff_i · row_k(t_i) = Σ eff_i · (row_k(t_i) − r1) for ANY r1 (take r1 = row_k(t_1)). +- `contacts_noscale`: without SCALEs of y, eff_i = a_i, so the literal prose "Σ a_i = 0" holds. +- `T2_literal_false`: the finding, formal over ℚ. y += k, y *= 2, y += (−2)k gives final y_k = 0 and Σ a = −1, while effective Σ = 0. diff --git a/research/p104-reader-ceiling/lean/Nov15/WholeFloorCover.lean b/research/p104-reader-ceiling/lean/Nov15/WholeFloorCover.lean new file mode 100644 index 0000000000..7c04dd9336 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/WholeFloorCover.lean @@ -0,0 +1,24 @@ +import Nov15.WholeFloorCoverData +import Nov15.JointCeiling + +/-! WholeFloorCover : the cover F < 0 on [.0204110964, 1] for (caller 6 7) + 17 * natFloor; data in WholeFloorCoverData. -/ +namespace WholeFloorCover +open NumCertK JointCeiling CallerCost + +theorem invoice_eq_Fc (s : ℝ) : Finv s (invoice (caller 6 7) natFloor 17) = Fc cfW s := by + simp only [Finv, Fh, invoice, caller, callerT, callerP, armT, armP, natFloor, scale, Fc, cfW, + List.range_succ, List.range_zero] + norm_num + ring + +/-- **the cover**: F < 0 on [.0204110964, 1] (t = 1 - s) for the floor-native invoice. -/ +theorem cover (t : ℝ) (ht : (204110965 : ℝ) / 10 ^ 10 ≤ t) (ht1 : t ≤ 1) : + Finv (1 - t) (invoice (caller 6 7) natFloor 17) < 0 := by + rw [invoice_eq_Fc] + apply cfW_neg _ (by linarith) + push_cast + linarith + +end WholeFloorCover + +#print axioms WholeFloorCover.cover diff --git a/research/p104-reader-ceiling/lean/Nov15/WholeFloorCoverData.lean b/research/p104-reader-ceiling/lean/Nov15/WholeFloorCoverData.lean new file mode 100644 index 0000000000..8d59602eab --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/WholeFloorCoverData.lean @@ -0,0 +1,47 @@ +import Nov15.WholeFloorCoverData1 + +namespace WholeFloorCover +open NumCertK + +theorem cfW_p6 : Fup cfW (763/1000) (163/200) < 0 := by decide +kernel +theorem cfW_p7 : Fup cfW (163/200) (851/1000) < 0 := by decide +kernel +theorem cfW_p8 : Fup cfW (851/1000) (879/1000) < 0 := by decide +kernel +theorem cfW_p9 : Fup cfW (879/1000) (901/1000) < 0 := by decide +kernel +theorem cfW_p10 : Fup cfW (901/1000) (459/500) < 0 := by decide +kernel +theorem cfW_p11 : Fup cfW (459/500) (93/100) < 0 := by decide +kernel +theorem cfW_d : 0 < dLo cfW (93/100) (9795889035/10^10) := by decide +kernel +theorem cfW_end : Fup cfW (9795889035/10^10) (9795889035/10^10) < 0 := by decide +kernel + +theorem cfW_neg (s : ℝ) (h0 : 0 ≤ s) (hs : s ≤ ((9795889035 / 10 ^ 10 : ℚ) : ℝ)) : Fc cfW s < 0 := by + have o := cfW_ok + by_cases a1 : s ≤ (((73/250) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o 0 (73/250) (le_refl _) (by norm_num) cfW_p1 s (by simpa using h0) a1 + by_cases a2 : s ≤ (((59/125) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (73/250) (59/125) (by norm_num) (by norm_num) cfW_p2 s (by push_neg at a1; exact a1.le) a2 + by_cases a3 : s ≤ (((301/500) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (59/125) (301/500) (by norm_num) (by norm_num) cfW_p3 s (by push_neg at a2; exact a2.le) a3 + by_cases a4 : s ≤ (((87/125) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (301/500) (87/125) (by norm_num) (by norm_num) cfW_p4 s (by push_neg at a3; exact a3.le) a4 + by_cases a5 : s ≤ (((763/1000) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (87/125) (763/1000) (by norm_num) (by norm_num) cfW_p5 s (by push_neg at a4; exact a4.le) a5 + by_cases a6 : s ≤ (((163/200) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (763/1000) (163/200) (by norm_num) (by norm_num) cfW_p6 s (by push_neg at a5; exact a5.le) a6 + by_cases a7 : s ≤ (((851/1000) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (163/200) (851/1000) (by norm_num) (by norm_num) cfW_p7 s (by push_neg at a6; exact a6.le) a7 + by_cases a8 : s ≤ (((879/1000) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (851/1000) (879/1000) (by norm_num) (by norm_num) cfW_p8 s (by push_neg at a7; exact a7.le) a8 + by_cases a9 : s ≤ (((901/1000) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (879/1000) (901/1000) (by norm_num) (by norm_num) cfW_p9 s (by push_neg at a8; exact a8.le) a9 + by_cases a10 : s ≤ (((459/500) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (901/1000) (459/500) (by norm_num) (by norm_num) cfW_p10 s (by push_neg at a9; exact a9.le) a10 + by_cases a11 : s ≤ (((93/100) : ℚ) : ℝ) + · exact Fc_neg_piece cfW o (459/500) (93/100) (by norm_num) (by norm_num) cfW_p11 s (by push_neg at a10; exact a10.le) a11 + have h1 := Fc_mono cfW o (93/100) (9795889035/10^10) (by norm_num) (by norm_num) cfW_d s + (by push_neg at a11; exact a11.le) hs + have h2 := Fc_neg_piece cfW o (9795889035/10^10) (9795889035/10^10) (by norm_num) (by norm_num) cfW_end + ((9795889035/10^10 : ℚ) : ℝ) (le_refl _) (le_refl _) + linarith + +end WholeFloorCover + +#print axioms WholeFloorCover.cfW_neg diff --git a/research/p104-reader-ceiling/lean/Nov15/WholeFloorCoverData1.lean b/research/p104-reader-ceiling/lean/Nov15/WholeFloorCoverData1.lean new file mode 100644 index 0000000000..097aac7ee4 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/WholeFloorCoverData1.lean @@ -0,0 +1,23 @@ +import Nov15.NumCertK + +/-! +WholeFloorCoverData1 : discharges the interval-cover hypothesis of WholeFloorNest.kappa_whole_floor_nested +with kernel interval library (NumCertK): the fixed #7113 caller C(8|9) = caller 6 7 at 17 calls on the +floor native `natFloor` has F(s) < 0 for every s in [0, 1 - .0204110964]. Kernel only; no native_decide. +-/ +namespace WholeFloorCover +open NumCertK + +/-- F of (caller 6 7) + 17 * natFloor, merged by rank. -/ +def cfW : CF := [(1, -3648), (2, 1496), (8, -7456), (9, 384), + (16, -416), (17, 416), (24, -416), (25, 416), (32, -416), (33, 416), (40, -416), (41, 416), (48, -416), + (49, 416), (56, -416), (57, 416), (64, -208), (65, 416), (73, 208), (137, 208)] + +theorem cfW_ok : okR cfW := by decide +kernel +theorem cfW_p1 : Fup cfW 0 (73/250) < 0 := by decide +kernel +theorem cfW_p2 : Fup cfW (73/250) (59/125) < 0 := by decide +kernel +theorem cfW_p3 : Fup cfW (59/125) (301/500) < 0 := by decide +kernel +theorem cfW_p4 : Fup cfW (301/500) (87/125) < 0 := by decide +kernel +theorem cfW_p5 : Fup cfW (87/125) (763/1000) < 0 := by decide +kernel + +end WholeFloorCover diff --git a/research/p104-reader-ceiling/lean/Nov15/WordDuality.lean b/research/p104-reader-ceiling/lean/Nov15/WordDuality.lean new file mode 100644 index 0000000000..166ddb4d93 --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/WordDuality.lean @@ -0,0 +1,451 @@ +/- +WordDuality . See WordDuality.md. Source: internal notes + +D = sigma . perp . time-reversal . transpose. +Model: charts `C` with an involution `perp` (dim (perp c) = N - dim c, perp z = V), registers `Reg`, a word = initial chart of every +register + a list of events (MOVE a->b, ADD, SCALE, COPY, INIT, CLEAR). Legality = co-presence + hub rules (no MOVE leaves V, +none enters z) + a move relation R (ascent / owned descent) closed under (a,b) -> (perp b, perp a). + Part 1 legal words go to legal words, boundaries swap (`dual_run`). + Part 2 matrices (ADD / SCALE / MOVE): M(D l) = sigma-relabel of (M l)^T (`Mrec_dual`). + Part 3 invoice: helper (b,e,steps) -> (N-e, N-b, reversed swapped steps); Theorem K invoice (FibreK) unchanged (`dualH_invoice`). + Part 4 P104 boundary data under sigma: X_p, Y_p exchange (`selfdual_boundary`); 2x2 contract blocks (`hosted_block`, `nonhosted_block`). + Part 5 caveat: COPY does not dualise to an ADD at matrix level (`copy_not_add`). +Kernel only. +-/ +import Nov15.FibreK +import Mathlib.Data.Matrix.Basis +import Mathlib.Data.Matrix.Mul + +set_option linter.unusedSectionVars false +set_option linter.unusedVariables false + +namespace WordDuality +open FibreK CallerCost Matrix + +structure Charts (C : Type*) (N : ℕ) where + perp : C → C + perp_perp : ∀ c, perp (perp c) = c + dim : C → ℕ + dim_le : ∀ c, dim c ≤ N + dim_perp : ∀ c, dim (perp c) = N - dim c + z : C + V : C + perp_z : perp z = V + +namespace Charts +variable {C : Type*} {N : ℕ} (X : Charts C N) +theorem perp_V : X.perp X.V = X.z := by rw [← X.perp_z, X.perp_perp] +theorem ne_V_perp {a : C} (h : a ≠ X.V) : X.perp a ≠ X.z := by + intro h'; apply h; rw [← X.perp_perp a, h', X.perp_z] +theorem ne_z_perp {b : C} (h : b ≠ X.z) : X.perp b ≠ X.V := by + intro h'; apply h; rw [← X.perp_perp b, h', X.perp_V] +end Charts + +inductive Ev (K Reg C : Type*) + | move (i : Reg) (a b : C) + | add (i j : Reg) (q : K) (c : C) + | scale (i : Reg) (u : K) (c : C) + | copy (i j : Reg) (c : C) + | init (i : Reg) (c : C) + | clear (i : Reg) (c : C) + +variable {K Reg C : Type*} {N : ℕ} + +section Words +variable [DecidableEq Reg] + +def stepL (ℓ : Reg → C) : Ev K Reg C → (Reg → C) + | .move i _ b => Function.update ℓ i b + | _ => ℓ + +def runL (ℓ : Reg → C) : List (Ev K Reg C) → (Reg → C) + | [] => ℓ + | e :: es => runL (stepL ℓ e) es + +theorem runL_append (ℓ : Reg → C) (l1 l2 : List (Ev K Reg C)) : + runL ℓ (l1 ++ l2) = runL (runL ℓ l1) l2 := by + induction l1 generalizing ℓ with + | nil => rfl + | cons e es ih => simp [runL, ih] + +def LegalEv (X : Charts C N) (R : C → C → Prop) (ℓ : Reg → C) : Ev K Reg C → Prop + | .move i a b => ℓ i = a ∧ a ≠ X.V ∧ b ≠ X.z ∧ R a b + | .add i j _ c => i ≠ j ∧ ℓ i = c ∧ ℓ j = c + | .scale i _ c => ℓ i = c + | .copy i j c => i ≠ j ∧ ℓ i = c ∧ ℓ j = c + | .init i c => ℓ i = c + | .clear i c => ℓ i = c + +def LegalL (X : Charts C N) (R : C → C → Prop) : (Reg → C) → List (Ev K Reg C) → Prop + | _, [] => True + | ℓ, e :: es => LegalEv X R ℓ e ∧ LegalL X R (stepL ℓ e) es + +theorem LegalL_append (X : Charts C N) (R : C → C → Prop) (ℓ : Reg → C) (l1 l2 : List (Ev K Reg C)) : + LegalL X R ℓ (l1 ++ l2) ↔ LegalL X R ℓ l1 ∧ LegalL X R (runL ℓ l1) l2 := by + induction l1 generalizing ℓ with + | nil => simp [LegalL, runL] + | cons e es ih => simp [LegalL, runL, ih, and_assoc] + +variable [One K] + +/-- the dual of one event. COPY becomes ADD (valid on a clean target only; see `copy_not_add`). -/ +def dualEv (X : Charts C N) (σ : Reg ≃ Reg) : Ev K Reg C → Ev K Reg C + | .move i a b => .move (σ i) (X.perp b) (X.perp a) + | .add i j q c => .add (σ j) (σ i) q (X.perp c) + | .scale i u c => .scale (σ i) u (X.perp c) + | .copy i j c => .add (σ j) (σ i) 1 (X.perp c) + | .init i c => .clear (σ i) (X.perp c) + | .clear i c => .init (σ i) (X.perp c) + +/-- time reversal of the dualised events. -/ +def dualList (X : Charts C N) (σ : Reg ≃ Reg) (l : List (Ev K Reg C)) : List (Ev K Reg C) := + (l.map (dualEv X σ)).reverse + +theorem dualList_cons (X : Charts C N) (σ : Reg ≃ Reg) (e : Ev K Reg C) (l : List (Ev K Reg C)) : + dualList X σ (e :: l) = dualList X σ l ++ [dualEv X σ e] := by + simp [dualList] + +/-- PART 1. A legal word dualises to a legal word; the dual starts at perp of the final charts and ends at perp of the initial +charts (births and ends exchange). -/ +theorem dual_run (X : Charts C N) (R : C → C → Prop) (hR : ∀ a b, R a b → R (X.perp b) (X.perp a)) + (σ : Reg ≃ Reg) : + ∀ (l : List (Ev K Reg C)) (ℓ : Reg → C), LegalL X R ℓ l → + runL (fun r => X.perp (runL ℓ l (σ.symm r))) (dualList X σ l) = (fun r => X.perp (ℓ (σ.symm r))) ∧ + LegalL X R (fun r => X.perp (runL ℓ l (σ.symm r))) (dualList X σ l) := by + intro l + induction l with + | nil => intro ℓ _; exact ⟨rfl, trivial⟩ + | cons e es ih => + intro ℓ h + obtain ⟨he, hes⟩ := h + obtain ⟨A, B⟩ := ih (stepL ℓ e) hes + have hS : (fun r => X.perp (runL ℓ (e :: es) (σ.symm r))) = + (fun r => X.perp (runL (stepL ℓ e) es (σ.symm r))) := rfl + rw [hS, dualList_cons, runL_append, LegalL_append, A] + -- the last event + cases e with + | move i a b => + obtain ⟨h1, h2, h3, h4⟩ := he + subst h1 + refine ⟨?_, B, ?_⟩ + · simp only [runL, dualEv, stepL] + funext r + by_cases hr : r = σ i + · subst hr; simp + · have : σ.symm r ≠ i := by + intro h; apply hr; rw [← h]; simp + simp [Function.update_of_ne hr, Function.update_of_ne this] + · exact ⟨⟨by simp [stepL], X.ne_z_perp h3, X.ne_V_perp h2, hR _ _ h4⟩, trivial⟩ + | add i j q c => + obtain ⟨h1, h2, h3⟩ := he + refine ⟨?_, B, ?_⟩ + · simp [runL, dualEv, stepL] + · simp [LegalL, LegalEv, runL, dualEv, stepL, A, h2, h3] + exact fun h => h1 h.symm + | scale i u c => + refine ⟨?_, B, ?_⟩ + · simp [runL, dualEv, stepL] + · simp [LegalL, LegalEv, runL, dualEv, stepL, A]; simp [LegalEv] at he; simp [he] + | copy i j c => + obtain ⟨h1, h2, h3⟩ := he + refine ⟨?_, B, ?_⟩ + · simp [runL, dualEv, stepL] + · simp [LegalL, LegalEv, runL, dualEv, stepL, A, h2, h3] + exact fun h => h1 h.symm + | init i c => + refine ⟨?_, B, ?_⟩ + · simp [runL, dualEv, stepL] + · simp [LegalL, LegalEv, runL, dualEv, stepL, A]; simp [LegalEv] at he; simp [he] + | clear i c => + refine ⟨?_, B, ?_⟩ + · simp [runL, dualEv, stepL] + · simp [LegalL, LegalEv, runL, dualEv, stepL, A]; simp [LegalEv] at he; simp [he] + +/-- ascent and descent both survive: (a,b) ascending (dim a ≤ dim b) gives (perp b, perp a) ascending. -/ +theorem ascent_dual (X : Charts C N) : ∀ a b, X.dim a ≤ X.dim b → X.dim (X.perp b) ≤ X.dim (X.perp a) := by + intro a b h; rw [X.dim_perp, X.dim_perp]; have := X.dim_le a; have := X.dim_le b; omega + +theorem descent_dual (X : Charts C N) : ∀ a b, X.dim b ≤ X.dim a → X.dim (X.perp b) ≥ X.dim (X.perp a) := by + intro a b h; rw [X.dim_perp, X.dim_perp]; have := X.dim_le a; have := X.dim_le b; omega + +/-! ### words, boundaries -/ + +structure Word (K Reg C : Type*) where + init0 : Reg → C + evs : List (Ev K Reg C) + +def Word.fin (w : Word K Reg C) : Reg → C := runL w.init0 w.evs + +def dualWord (X : Charts C N) (σ : Reg ≃ Reg) (w : Word K Reg C) : Word K Reg C := + ⟨fun r => X.perp (w.fin (σ.symm r)), dualList X σ w.evs⟩ + +theorem dual_legal (X : Charts C N) (R : C → C → Prop) (hR : ∀ a b, R a b → R (X.perp b) (X.perp a)) + (σ : Reg ≃ Reg) (w : Word K Reg C) (h : LegalL X R w.init0 w.evs) : + LegalL X R (dualWord X σ w).init0 (dualWord X σ w).evs := (dual_run X R hR σ w.evs w.init0 h).2 + +/-- births of the dual are perp of the ends; ends of the dual are perp of the births. -/ +theorem dual_boundary (X : Charts C N) (R : C → C → Prop) (hR : ∀ a b, R a b → R (X.perp b) (X.perp a)) + (σ : Reg ≃ Reg) (w : Word K Reg C) (h : LegalL X R w.init0 w.evs) (r : Reg) : + (dualWord X σ w).init0 (σ r) = X.perp (w.fin r) ∧ (dualWord X σ w).fin (σ r) = X.perp (w.init0 r) := by + constructor + · simp [dualWord] + · have := congrFun (dual_run X R hR σ w.evs w.init0 h).1 (σ r) + simpa [Word.fin, dualWord] using this + +theorem dual_dim_boundary (X : Charts C N) (R : C → C → Prop) (hR : ∀ a b, R a b → R (X.perp b) (X.perp a)) + (σ : Reg ≃ Reg) (w : Word K Reg C) (h : LegalL X R w.init0 w.evs) (r : Reg) : + X.dim ((dualWord X σ w).init0 (σ r)) = N - X.dim (w.fin r) ∧ + X.dim ((dualWord X σ w).fin (σ r)) = N - X.dim (w.init0 r) := by + obtain ⟨a, b⟩ := dual_boundary X R hR σ w h r + rw [a, b, X.dim_perp, X.dim_perp]; exact ⟨rfl, rfl⟩ + +end Words + +/-! ### Part 2: matrices -/ +section Mat +variable [Fintype Reg] [DecidableEq Reg] [CommRing K] + +def evMat : Ev K Reg C → Matrix Reg Reg K + | .add i j q _ => 1 + Matrix.single i j q + | .scale i u _ => Matrix.diagonal (Function.update (1 : Reg → K) i u) + | _ => 1 + +/-- events with a matrix semantics (MOVE only changes location). -/ +def Lin : Ev K Reg C → Prop + | .move .. => True + | .add .. => True + | .scale .. => True + | _ => False + +/-- total matrix of a word in initial-row coordinates: later events multiply on the left. -/ +def Mrec : List (Ev K Reg C) → Matrix Reg Reg K + | [] => 1 + | e :: es => Mrec es * evMat e + +theorem Mrec_append (l1 l2 : List (Ev K Reg C)) : Mrec (l1 ++ l2) = Mrec l2 * Mrec l1 := by + induction l1 with + | nil => simp [Mrec] + | cons e es ih => simp [Mrec, ih, Matrix.mul_assoc] + +theorem evMat_dual (X : Charts C N) (σ : Reg ≃ Reg) (e : Ev K Reg C) (he : Lin e) : + evMat (dualEv X σ e) = (evMat e)ᵀ.submatrix σ.symm σ.symm := by + cases e with + | move i a b => simp [evMat, dualEv] + | add i j q c => + ext a b + simp [evMat, dualEv, Matrix.single_apply, Matrix.one_apply, Matrix.transpose_apply, Matrix.submatrix_apply, Equiv.eq_symm_apply] + | scale i u c => + ext a b + simp [evMat, dualEv, Matrix.diagonal_apply, Function.update_apply, Equiv.symm_apply_eq] + | copy _ _ _ => exact absurd he (by simp [Lin]) + | init _ _ => exact absurd he (by simp [Lin]) + | clear _ _ => exact absurd he (by simp [Lin]) + +/-- PART 2. M(D l) is the sigma-relabel of the transpose of M(l). -/ +theorem Mrec_dual (X : Charts C N) (σ : Reg ≃ Reg) : + ∀ l : List (Ev K Reg C), (∀ e ∈ l, Lin e) → Mrec (dualList X σ l) = (Mrec l)ᵀ.submatrix σ.symm σ.symm := by + intro l + induction l with + | nil => intro _; simp [dualList, Mrec] + | cons e es ih => + intro h + have he := h e (by simp) + have hes := ih (fun x hx => h x (by simp [hx])) + rw [dualList_cons, Mrec_append, hes] + simp only [Mrec, Matrix.one_mul, Matrix.transpose_mul] + rw [evMat_dual X σ e he, Matrix.submatrix_mul_equiv] + +end Mat + +/-! ### Part 3: the Theorem-K invoice is unchanged -/ +section Invoice +variable [DecidableEq Reg] + +/-- the MOVE steps (source dim, target dim) of register `r`. -/ +def regSteps (X : Charts C N) (r : Reg) (l : List (Ev K Reg C)) : List (ℕ × ℕ) := + l.filterMap fun e => match e with + | .move i a b => if i = r then some (X.dim a, X.dim b) else none + | _ => none + +def swapN (N : ℕ) (s : ℕ × ℕ) : ℕ × ℕ := (N - s.2, N - s.1) + +/-- register `r` as a FibreK helper: birth dim, end dim, steps. -/ +def helperOf (X : Charts C N) (w : Word K Reg C) (r : Reg) : Helper := + ⟨X.dim (w.init0 r), X.dim (w.fin r), regSteps X r w.evs⟩ + +/-- a helper b -> e becomes (N-e) -> (N-b), with reversed swapped steps. -/ +def dualH (N : ℕ) (h : Helper) : Helper := ⟨N - h.e, N - h.b, (h.steps.map (swapN N)).reverse⟩ + +variable [One K] + +theorem regSteps_dual (X : Charts C N) (σ : Reg ≃ Reg) (r : Reg) : + ∀ l : List (Ev K Reg C), regSteps X (σ r) (dualList X σ l) = ((regSteps X r l).map (swapN N)).reverse := by + intro l + induction l with + | nil => simp [dualList, regSteps] + | cons e es ih => + rw [dualList_cons] + have : regSteps X (σ r) (dualList X σ es ++ [dualEv X σ e]) = + regSteps X (σ r) (dualList X σ es) ++ regSteps X (σ r) [dualEv X σ e] := by + simp [regSteps, List.filterMap_append] + rw [this, ih] + cases e with + | move i a b => + by_cases h : i = r + · subst h; simp [regSteps, dualEv, swapN, X.dim_perp] + · simp [regSteps, dualEv, h] + | add i j q c => simp [regSteps, dualEv] + | scale i u c => simp [regSteps, dualEv] + | copy i j c => simp [regSteps, dualEv] + | init i c => simp [regSteps, dualEv] + | clear i c => simp [regSteps, dualEv] + +/-- PART 3a. The dual word's register `sigma r` is the dual helper of `r` (b,e) -> (N-e, N-b). -/ +theorem helperOf_dual (X : Charts C N) (R : C → C → Prop) (hR : ∀ a b, R a b → R (X.perp b) (X.perp a)) + (σ : Reg ≃ Reg) (w : Word K Reg C) (h : LegalL X R w.init0 w.evs) (r : Reg) : + helperOf X (dualWord X σ w) (σ r) = dualH N (helperOf X w r) := by + obtain ⟨b1, b2⟩ := dual_dim_boundary X R hR σ w h r + simp only [helperOf, dualH, dualWord, b1, b2] + simp only [dualWord] at b1 b2 + rw [b1, b2] + simp [regSteps_dual X σ r] + +theorem gap_swapN (N : ℕ) (s : ℕ × ℕ) (h1 : s.1 ≤ N) (h2 : s.2 ≤ N) : gap (swapN N s) = gap s := by + simp only [gap, swapN]; omega + +/-- PART 3b. Dualising a helper list leaves FibreK's invoice (Theorem K) unchanged: +births/ends (b,e) -> (N-e,N-b) keep the climb, every MOVE keeps its |Δdim|. -/ +theorem dualH_invoice (E : Inv) (tb : Table) (H : List Helper) + (hN : ∀ h ∈ H, h.b ≤ h.e ∧ h.e ≤ N ∧ ∀ s ∈ h.steps, s.1 ≤ N ∧ s.2 ≤ N) (t : ℝ) : + Fi (nativeInv E tb (H.map (dualH N))) t = Fi (nativeInv E tb H) t := by + rw [K_word, K_word] + unfold FK + have hP : PiW (H.map (dualH N)) = PiW H := by + unfold PiW + congr 1 + rw [List.map_map] + apply List.map_congr_left + intro h hh + obtain ⟨a, b, _⟩ := hN h hh + simp only [Function.comp, dualH]; omega + have hS : (((Ssum (H.map (dualH N))).map fun s => Fh (tb.tP (gap s)) t).sum) = + ((Ssum H).map fun s => Fh (tb.tP (gap s)) t).sum := by + simp only [Ssum, Multiset.map_coe, Multiset.sum_coe] + rw [sum_flatMap_map, sum_flatMap_map, List.map_map] + congr 1 + apply List.map_congr_left + intro h hh + obtain ⟨_, _, c⟩ := hN h hh + simp only [Function.comp, dualH, List.map_reverse, List.sum_reverse, List.map_map] + congr 1 + apply List.map_congr_left + intro s hs + obtain ⟨c1, c2⟩ := c s hs + simp only [Function.comp, gap_swapN N s c1 c2] + rw [hP, hS] + +theorem dualH_root (c E : Inv) (tb : Table) (H : List Helper) (L : ℕ) + (hN : ∀ h ∈ H, h.b ≤ h.e ∧ h.e ≤ N ∧ ∀ s ∈ h.steps, s.1 ≤ N ∧ s.2 ≤ N) (κ : ℝ) : + IsRoot (Fi (invoice c (nativeInv E tb (H.map (dualH N))) L)) κ ↔ + IsRoot (Fi (invoice c (nativeInv E tb H) L)) κ := by + unfold IsRoot + rw [Fi_invoice, Fi_invoice, dualH_invoice E tb H hN κ] + +/-- PART 3c, word level: the helpers of `D w` (registers `sigma r`) have the same invoice as those of `w`. +Hypothesis: the listed registers climb (birth dim <= end dim), as helpers do. -/ +theorem word_invoice (X : Charts C N) (R : C → C → Prop) (hR : ∀ a b, R a b → R (X.perp b) (X.perp a)) + (σ : Reg ≃ Reg) (w : Word K Reg C) (h : LegalL X R w.init0 w.evs) (rs : List Reg) + (hc : ∀ r ∈ rs, X.dim (w.init0 r) ≤ X.dim (w.fin r)) (E : Inv) (tb : Table) (t : ℝ) : + Fi (nativeInv E tb ((rs.map σ).map (helperOf X (dualWord X σ w)))) t = + Fi (nativeInv E tb (rs.map (helperOf X w))) t := by + have : (rs.map σ).map (helperOf X (dualWord X σ w)) = (rs.map (helperOf X w)).map (dualH N) := by + rw [List.map_map, List.map_map] + apply List.map_congr_left + intro r _ + exact helperOf_dual X R hR σ w h r + rw [this] + apply dualH_invoice + intro h' hh' + obtain ⟨r, hr, rfl⟩ := List.mem_map.mp hh' + refine ⟨hc r hr, X.dim_le _, ?_⟩ + intro s hs + simp only [helperOf, regSteps, List.mem_filterMap] at hs + obtain ⟨e, _, he⟩ := hs + cases e <;> simp at he + obtain ⟨_, rfl⟩ := he + exact ⟨X.dim_le _, X.dim_le _⟩ + +end Invoice + +/-! ### Part 4: P104 boundary data -/ +section P104 +variable [DecidableEq Reg] [One K] {ι : Type*} + +/-- hypotheses (from DU1 section 1): X_p runs

-> V, Y_p runs {0} -> p^perp, sigma swaps X_p, Y_p, perp

= p^perp. +The dual word has the same register boundaries (g = id): the problem is self-dual. -/ +theorem selfdual_boundary (X : Charts C N) (R : C → C → Prop) (hR : ∀ a b, R a b → R (X.perp b) (X.perp a)) + (σ : Reg ≃ Reg) (w : Word K Reg C) (h : LegalL X R w.init0 w.evs) + (Xr Yr : ι → Reg) (line hyp : ι → C) + (hσX : ∀ p, σ (Xr p) = Yr p) (hσY : ∀ p, σ (Yr p) = Xr p) (hperp : ∀ p, X.perp (line p) = hyp p) + (hX : ∀ p, w.init0 (Xr p) = line p ∧ w.fin (Xr p) = X.V) + (hY : ∀ p, w.init0 (Yr p) = X.z ∧ w.fin (Yr p) = hyp p) (p : ι) : + ((dualWord X σ w).init0 (Xr p) = line p ∧ (dualWord X σ w).fin (Xr p) = X.V) ∧ + ((dualWord X σ w).init0 (Yr p) = X.z ∧ (dualWord X σ w).fin (Yr p) = hyp p) := by + have hl : ∀ p, X.perp (hyp p) = line p := fun p => by rw [← hperp, X.perp_perp] + obtain ⟨a1, a2⟩ := dual_boundary X R hR σ w h (Yr p) + obtain ⟨b1, b2⟩ := dual_boundary X R hR σ w h (Xr p) + rw [hσY] at a1 a2 + rw [hσX] at b1 b2 + refine ⟨⟨?_, ?_⟩, ⟨?_, ?_⟩⟩ + · rw [a1, (hY p).2, hl] + · rw [a2, (hY p).1, X.perp_z] + · rw [b1, (hX p).2, X.perp_V] + · rw [b2, (hX p).1, hperp] + +end P104 + +/-! ### contract blocks (from DU1.md; the non-hosted block is reconstructed from the card's dual [[1/2,-1],[1/2,1]]) -/ +section Blocks +def sw : Equiv.Perm (Fin 2) := Equiv.swap 0 1 + +/-- hosted block [[1,0],[1,1]] is invariant under transpose + sigma. -/ +theorem hosted_block : + (!![1, 0; 1, 1] : Matrix (Fin 2) (Fin 2) ℚ)ᵀ.submatrix sw.symm sw.symm = !![1, 0; 1, 1] := by + ext i j; fin_cases i <;> fin_cases j <;> simp [sw, Equiv.swap_apply_def] + +/-- non-hosted block F = [[1,-1],[1/2,1/2]]: D(F) = [[1/2,-1],[1/2,1]] and diag(1,1/2) D(F) diag(2,1) = F +(one SCALE 2 and one SCALE 1/2, unpriced). -/ +theorem nonhosted_block : + (!![1, -1; 1/2, 1/2] : Matrix (Fin 2) (Fin 2) ℚ)ᵀ.submatrix sw.symm sw.symm = !![1/2, -1; 1/2, 1] ∧ + Matrix.diagonal ![1, 1/2] * (!![1/2, -1; 1/2, 1] : Matrix (Fin 2) (Fin 2) ℚ) * Matrix.diagonal ![2, 1] = + !![1, -1; 1/2, 1/2] := by + constructor + · ext i j; fin_cases i <;> fin_cases j <;> simp [sw, Equiv.swap_apply_def] + · ext i j; fin_cases i <;> fin_cases j <;> simp [Matrix.mul_apply, Fin.sum_univ_two] <;> norm_num + +end Blocks + +/-! ### Part 5: caveat, COPY does not dualise to an ADD at matrix level -/ +section Caveat +/-- COPY 0 <- 1 on two registers has matrix [[0,1],[0,1]]; its transpose is [[0,0],[1,1]], which is not an ADD matrix +1 + q e_ab (a != b: every ADD matrix has diagonal 1). DU1's "COPY becomes ADD" holds only for a clean target. -/ +theorem copy_not_add (a b : Fin 2) (hab : a ≠ b) (q : ℚ) : + (!![0, 1; 0, 1] : Matrix (Fin 2) (Fin 2) ℚ)ᵀ ≠ 1 + Matrix.single a b q := by + intro h + have := congrFun (congrFun h 0) 0 + simp [Matrix.single_apply] at this + by_cases h0 : a = 0 ∧ b = 0 + · exact hab (h0.1.trans h0.2.symm) + · simp [h0] at this + +end Caveat + +end WordDuality + +#print axioms WordDuality.dual_run +#print axioms WordDuality.Mrec_dual +#print axioms WordDuality.dualH_invoice +#print axioms WordDuality.word_invoice +#print axioms WordDuality.selfdual_boundary +#print axioms WordDuality.nonhosted_block +#print axioms WordDuality.copy_not_add diff --git a/research/p104-reader-ceiling/lean/Nov15/WordDuality.md b/research/p104-reader-ceiling/lean/Nov15/WordDuality.md new file mode 100644 index 0000000000..4459df8d1c --- /dev/null +++ b/research/p104-reader-ceiling/lean/Nov15/WordDuality.md @@ -0,0 +1,12 @@ +# WordDuality : DU1's D = sigma . perp . reversal . transpose in Lean + +`Nov15/WordDuality.lean`, kernel only: no `sorry`, no `native_decide`; axioms within `[propext, Classical.choice, Quot.sound]`. Builds in 11 s / 2.9 GB. Reuses `FibreK` (Table, Helper, nativeInv, K_word, FK) and `CallerCost`. +Model (problem data as hypotheses): `Charts C N` = charts with an involution `perp`, `dim (perp c) = N - dim c`, hubs z, V, `perp z = V` (P104: N = 9). Registers `Reg`, a word = initial chart of each register + a list of events (MOVE a→b, ADD, SCALE, COPY, INIT, CLEAR). Legal = co-presence at the event chart, no MOVE leaves V, none enters z (T1), and a move relation R (public ascent / owned descent) with R a b → R (perp b) (perp a). +1. `dual_run`, `dual_legal`: if w is legal then D w (events reversed, MOVE a→b ↦ perp b→perp a, ADD r += q s @U ↦ ADD s += q r @U^perp, SCALE kept, INIT ↔ CLEAR, COPY ↦ ADD) is legal, starts at perp of w's final charts and ends at perp of w's initial charts (`dual_boundary`; dims: `dual_dim_boundary`). Hub rules swap (z ↔ V), ascent stays ascent (`ascent_dual`) and descent stays descent (`descent_dual`). +2. `Mrec_dual`: for words of MOVE/ADD/SCALE, the product matrix of D l is the σ-relabelled transpose of that of l (K a commutative ring). +3. Invoice: `helperOf_dual`: register σ r of D w is the dual helper (b,e,steps) ↦ (N−e, N−b, reversed swapped steps) of r. `dualH_invoice`: FibreK's Theorem-K invoice Fi(nativeInv E tb H) is unchanged (hypotheses b ≤ e ≤ N, step dims ≤ N), `dualH_root`: same roots of the caller invoice (κ-neutral), `word_invoice` at word level (listed registers climb). Births/ends (b,e) ↦ (N−e,N−b), climb e−b and every MOVE |Δdim| preserved. +4. `selfdual_boundary`: with σ swapping X_p ↔ Y_p, X_p: ⟨p⟩ → V, Y_p: {0} → p^perp, perp ⟨p⟩ = p^perp: D w has exactly the same register boundaries (g = id). `hosted_block`: [[1,0],[1,1]] is invariant under transpose + swap; `nonhosted_block`: with F = [[1,−1],[1/2,1/2]] (reconstructed from DU1's dual [[1/2,−1],[1/2,1]]), D(F) = [[1/2,−1],[1/2,1]] and diag(1,1/2)·D(F)·diag(2,1) = F. + +## Correction to DU1 wording (stated at once) +DU1: "COPY becomes ADD". As matrices this is false: `copy_not_add` (COPY 0←1 has matrix [[0,1],[0,1]], whose transpose [[0,0],[1,1]] is not 1 + q·e_ab for any a ≠ b, ADD matrices have diagonal 1). The dual of a COPY is an ADD only on a clean target (the usual INIT-then-COPY use) and must carry the dual of the target's INIT (a CLEAR). `dualEv` sends COPY ↦ ADD for legality only; matrix semantics (`Mrec_dual`) is restricted to MOVE/ADD/SCALE. +Not formalised: the P104 chart/physical check (DU1 caveat 2), the 271 missing perp frames, and the palindromic construction W = D(A).A. diff --git a/research/p104-reader-ceiling/lean/lake-manifest.json b/research/p104-reader-ceiling/lean/lake-manifest.json new file mode 100644 index 0000000000..e4290db056 --- /dev/null +++ b/research/p104-reader-ceiling/lean/lake-manifest.json @@ -0,0 +1,117 @@ +{ + "version": "1.2.0", + "packagesDir": ".lake/packages", + "packages": [ + { + "url": "https://github.com/leanprover-community/mathlib4.git", + "type": "git", + "subDir": null, + "scope": "", + "rev": "55b7917b472489c7c56a0fa6393af05cfd536599", + "name": "mathlib", + "manifestFile": "lake-manifest.json", + "inputRev": "55b7917b472489c7c56a0fa6393af05cfd536599", + "inherited": false, + "configFile": "lakefile.lean" + }, + { + "url": "https://github.com/leanprover-community/plausible", + "type": "git", + "subDir": null, + "scope": "leanprover-community", + "rev": "b1c4a69a7e247ab7df20460212001673d74f08c0", + "name": "plausible", + "manifestFile": "lake-manifest.json", + "inputRev": "main", + "inherited": true, + "configFile": "lakefile.toml" + }, + { + "url": "https://github.com/leanprover-community/LeanSearchClient", + "type": "git", + "subDir": null, + "scope": "leanprover-community", + "rev": "0498c7c070c143a3bf7379f4d99a2c63bb9d9715", + "name": "LeanSearchClient", + "manifestFile": "lake-manifest.json", + "inputRev": "main", + "inherited": true, + "configFile": "lakefile.toml" + }, + { + "url": "https://github.com/leanprover-community/import-graph", + "type": "git", + "subDir": null, + "scope": "leanprover-community", + "rev": "18a90119a5d316358fde6c86e0ca24e59212e32c", + "name": "importGraph", + "manifestFile": "lake-manifest.json", + "inputRev": "main", + "inherited": true, + "configFile": "lakefile.toml" + }, + { + "url": "https://github.com/leanprover-community/ProofWidgets4", + "type": "git", + "subDir": null, + "scope": "leanprover-community", + "rev": "b1436dc749e722c9920036b52cdc43b3451d0b69", + "name": "proofwidgets", + "manifestFile": "lake-manifest.json", + "inputRev": "main", + "inherited": true, + "configFile": "lakefile.lean" + }, + { + "url": "https://github.com/leanprover-community/aesop", + "type": "git", + "subDir": null, + "scope": "leanprover-community", + "rev": "57d3325be72a842920813bcb40f96a6f7393c185", + "name": "aesop", + "manifestFile": "lake-manifest.json", + "inputRev": "master", + "inherited": true, + "configFile": "lakefile.toml" + }, + { + "url": "https://github.com/leanprover-community/quote4", + "type": "git", + "subDir": null, + "scope": "leanprover-community", + "rev": "ee41917ae11d38479fb8fb24745f7ca4bf0a784d", + "name": "Qq", + "manifestFile": "lake-manifest.json", + "inputRev": "master", + "inherited": true, + "configFile": "lakefile.toml" + }, + { + "url": "https://github.com/leanprover-community/batteries", + "type": "git", + "subDir": null, + "scope": "leanprover-community", + "rev": "2c810760f0a0c4536b397dbe30ca9b2f2f467366", + "name": "batteries", + "manifestFile": "lake-manifest.json", + "inputRev": "main", + "inherited": true, + "configFile": "lakefile.toml" + }, + { + "url": "https://github.com/leanprover/lean4-cli", + "type": "git", + "subDir": null, + "scope": "leanprover", + "rev": "da07ca808b6718cb2aed14dba154e5a08b8f8ecf", + "name": "Cli", + "manifestFile": "lake-manifest.json", + "inputRev": "v4.33.0-rc1", + "inherited": true, + "configFile": "lakefile.toml" + } + ], + "name": "Nov16Core", + "lakeDir": ".lake", + "fixedToolchain": false +} diff --git a/research/p104-reader-ceiling/lean/lakefile.toml b/research/p104-reader-ceiling/lean/lakefile.toml new file mode 100644 index 0000000000..a5692331ac --- /dev/null +++ b/research/p104-reader-ceiling/lean/lakefile.toml @@ -0,0 +1,12 @@ +name = "NativeCeiling" +defaultTargets = ["Nov15"] + +[[require]] +name = "mathlib" +git = "https://github.com/leanprover-community/mathlib4.git" +# pinned to the exact commit used for every check in this package (same as lake-manifest.json) +rev = "55b7917b472489c7c56a0fa6393af05cfd536599" + +[[lean_lib]] +name = "Nov15" +globs = ["Nov15.+"] diff --git a/research/p104-reader-ceiling/lean/lean-toolchain b/research/p104-reader-ceiling/lean/lean-toolchain new file mode 100644 index 0000000000..fd85b262bf --- /dev/null +++ b/research/p104-reader-ceiling/lean/lean-toolchain @@ -0,0 +1 @@ +leanprover/lean4:v4.33.0-rc1