Download data/lean/OAI/Algorithms/SubexponentialSAT/Subexp/BlockSearchConcreteContext.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.06 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algorithms/SubexponentialSAT/Subexp/BlockSearchConcreteContext.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Algorithms/SubexponentialSAT/Subexp/BlockSearchConcreteContext.lean
-
curl -L -o BlockSearchConcreteContext.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algorithms/SubexponentialSAT/Subexp/BlockSearchConcreteContext.lean
3.06 kB
| import OAI.Algorithms.SubexponentialSAT.LeanCompat | |
| import OAI.Algorithms.SubexponentialSAT.Subexp.BlockSearchConcrete | |
| import OAI.Algorithms.SubexponentialSAT.Subexp.BlockSearchOutputContext | |
| namespace OAI.Algorithms | |
| /-! Retained physical inputs available after concrete basis search. -/ | |
| namespace SubexponentialSAT.Subexp.BlockSearchConcreteContext | |
| open BitProgram BlockSearchPredicate | |
| theorem retains_with_alphabet (p : β) [Fact p.Prime] | |
| (alphabet : List (ZMod p)) (hfull : β x, x β alphabet) {m N : β} | |
| (M : Fin m β Fin N β ZMod p) (regs : Fin 24 β Bool) | |
| {budget : β} {next : StructuredProgram.State 24 42} | |
| (run : RunsIn BlockSearchConcrete.program budget | |
| ((BlockSearchExecution.inputState (BlockCoefficientProgram.context p M) | |
| (scalarCode p) alphabet N regs).withPC (some BlockSearchConcrete.program.entry)) | |
| (next.withPC none)) : | |
| BlockSearchOutputContext.Retained (BlockCoefficientProgram.context p M) next := | |
| BlockSearchOutputContext.program_retains BlockCoefficientProgram.matrixPair | |
| (BlockCoefficientProgram.context p M) (scalarCode p) alphabet M | |
| (BlockCoefficientProgram.coefficientCost p m N) rfl | |
| (BlockSearchConcrete.coefficientContract_with_alphabet p alphabet hfull M) regs run | |
| theorem retains (p : β) [Fact p.Prime] {m N : β} | |
| (M : Fin m β Fin N β ZMod p) (regs : Fin 24 β Bool) | |
| {budget : β} {next : StructuredProgram.State 24 42} | |
| (run : RunsIn BlockSearchConcrete.program budget | |
| ((BlockSearchConcrete.inputState p M regs).withPC (some BlockSearchConcrete.program.entry)) | |
| (next.withPC none)) : | |
| BlockSearchOutputContext.Retained (BlockCoefficientProgram.context p M) next := | |
| retains_with_alphabet p (QuarticSearch.elements p) (QuarticSearch.mem_elements p) M regs run | |
| theorem dimension_with_alphabet (p : β) [Fact p.Prime] | |
| (alphabet : List (ZMod p)) (hfull : β x, x β alphabet) {m N : β} | |
| (M : Fin m β Fin N β ZMod p) (regs : Fin 24 β Bool) | |
| {budget : β} {next : StructuredProgram.State 24 42} | |
| (run : RunsIn BlockSearchConcrete.program budget | |
| ((BlockSearchExecution.inputState (BlockCoefficientProgram.context p M) | |
| (scalarCode p) alphabet N regs).withPC (some BlockSearchConcrete.program.entry)) | |
| (next.withPC none)) : next.stacks 10 = List.replicate N true := | |
| (retains_with_alphabet p alphabet hfull M regs run).2.2.2.2 | |
| /-- Stack 10 supplies the actual unary dimension needed by the subsequent | |
| table-transpose program. No second construction of this count is required. -/ | |
| theorem dimension (p : β) [Fact p.Prime] {m N : β} | |
| (M : Fin m β Fin N β ZMod p) (regs : Fin 24 β Bool) | |
| {budget : β} {next : StructuredProgram.State 24 42} | |
| (run : RunsIn BlockSearchConcrete.program budget | |
| ((BlockSearchConcrete.inputState p M regs).withPC (some BlockSearchConcrete.program.entry)) | |
| (next.withPC none)) : next.stacks 10 = List.replicate N true := | |
| (retains p M regs run).2.2.2.2 | |
| end SubexponentialSAT.Subexp.BlockSearchConcreteContext | |
| end OAI.Algorithms | |