Operations

A node is concluded by proof steps; each step applies one operation to premises. The first three are the roots of the proof DAG (they use only the node's own rule).

Operation	Meaning	Edges	Nodes
`preserver_image`	Image under a real-rootedness preserver	1485	1381
`basis_map`	Image under a basis map u^k -> P_k	1190	1056
`theorem_check` root	Theorem check of the node's own rule	370	304
`veronese_section`	Veronese coefficient section	233	221
`obreschkoff_combination`	Obreschkoff combination Pₙ + Pₙ₊₁	216	216
`definition_equality`	All-n equality of two definitions	181	163
`basis_map_theorem` root	Basis map theorem for the node's own rule	155	152
`parent_provers` root	Shared parent provers on the node's own rule	136	135
`gamma_polynomial`	Gamma polynomial of a palindromic parent	102	99