Monotone Boolean formulas -- proof internals #
theorem
Complexity.MonotoneFormula.eval_toBoolFormula_internal
{N : ℕ}
(formula : MonotoneFormula N)
(input : BitString N)
:
theorem
Complexity.MonotoneFormula.size_toBoolFormula_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
theorem
Complexity.MonotoneFormula.leaves_toBoolFormula_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
theorem
Complexity.MonotoneFormula.depth_toBoolFormula_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
theorem
Complexity.MonotoneFormula.eval_monotone_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
IsMonotoneBoolFun fun (input : BitString N) => eval input formula
theorem
Complexity.MonotoneFormula.eval_eq_of_agree_internal
{N : ℕ}
(formula : MonotoneFormula N)
{x y : BitString N}
(agree : ∀ index ∈ formula.vars, x index = y index)
:
theorem
Complexity.MonotoneFormula.card_vars_le_leaves_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
theorem
Complexity.MonotoneFormula.leaves_le_two_pow_depth_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
theorem
Complexity.MonotoneFormula.essentialInputs_subset_vars_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
theorem
Complexity.MonotoneFormula.card_essentialInputs_le_leaves_internal
{N : ℕ}
(formula : MonotoneFormula N)
:
theorem
Complexity.MonotoneFormula.card_essentialInputs_le_leaves_of_computes_internal
{N : ℕ}
(formula : MonotoneFormula N)
(function : BitString N → Bool)
(computes : formula.Computes function)
: