OAI/NumberTheory/TwoPoint/Bounds/PaddingCutCircuit.lean
10 declarations, 0 contain sorry, 0 declared as axioms
Arbitrary predicates of a bounded padding-prime state have a literal depth-two DNF. Conjoining a fixed divisor costs one layer.
- def
OAI.TwoPointCorrelations.activePredicateCircuitline 14 - lemma
OAI.TwoPointCorrelations.activePredicateCircuit_evalline 19 - lemma
OAI.TwoPointCorrelations.activePredicateCircuit_depthline 33 - lemma
OAI.TwoPointCorrelations.activePredicateCircuit_sizeline 37 - def
OAI.TwoPointCorrelations.stateDivisorCircuitline 48 - lemma
OAI.TwoPointCorrelations.stateDivisorCircuit_evalline 55 - lemma
OAI.TwoPointCorrelations.stateDivisorCircuit_depthline 70 - lemma
OAI.TwoPointCorrelations.stateDivisorCircuit_sizeline 80 - lemma
OAI.TwoPointCorrelations.stateDivisorCircuit_size_expline 93 - lemma
OAI.TwoPointCorrelations.stateDivisorCircuit_integerline 141