OAI/Computability/QuantumFactoring/PolynomialExpressions.lean
14 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.ExactQuantumFactoring.RatExpr.sumline 13 - lemma
OAI.ExactQuantumFactoring.RatExpr.eval_sumline 16 - inductive
OAI.ExactQuantumFactoring.PolyExprline 24Source documentation
Bounded polynomial arithmetic is itself finite rational syntax.
inductive PolyExpr (v : Type*) where …
- def
OAI.ExactQuantumFactoring.PolyExpr.evalline 34 - def
OAI.ExactQuantumFactoring.PolyExpr.coeffline 41 - lemma
OAI.ExactQuantumFactoring.PolyExpr.coeff_correctline 48 - def
OAI.ExactQuantumFactoring.PolyExpr.subline 62 - def
OAI.ExactQuantumFactoring.PolyExpr.constline 63 - def
OAI.ExactQuantumFactoring.PolyExpr.powline 64 - def
OAI.ExactQuantumFactoring.PolyExpr.compline 68 - lemma
OAI.ExactQuantumFactoring.PolyExpr.eval_constline 75 - lemma
OAI.ExactQuantumFactoring.PolyExpr.eval_subline 77 - lemma
OAI.ExactQuantumFactoring.PolyExpr.eval_powline 79 - lemma
OAI.ExactQuantumFactoring.PolyExpr.eval_compline 83