Relevant polynomials, compatible weights, and the generic lower-bound inequalities
DefinitionMonoABPWidth_Hierarchy_Supplement_weightsFor a fixed monotone real polynomial , a monotone polynomial is relevant when there exist monotone polynomials with , exactly as stated in §7. A weight takes finite nonnegative real values on polynomials, is subadditive and submultiplicative on monotone polynomials, and is at most one on variables and nonnegative constants. A growth function is nondecreasing, is at least one, bounds for relevant of each degree, and equals at every monomial degree present in .
For an arbitrary extended nonnegative lower-bound function , the complete conditions are
The ratio is formed in nonnegative real arithmetic before conversion to extended values. One-part decompositions are included, and can be infinite. These conditions contain no formula lower bound as an assumption. Growth bounds are read as bounds on relevant polynomials, following the surrounding §7 text.
import Definitions.Def_MonoABPWidth_Hierarchy_Supplement_formulas
open scoped BigOperators ENNReal
namespace MonoABPWidth.Hierarchy.Supplement
/-- §7, p.18: the source's explicit relevance predicate. No bound or desired
formula lower bound is built into relevance. -/
def Relevant {σ : Type} (p q : MvPolynomial σ ℝ) : Prop :=
MonotonePolynomial q ∧ ∃ a b : MvPolynomial σ ℝ,
MonotonePolynomial a ∧ MonotonePolynomial b ∧ p = q * a + b
/-- Nonnegative, subadditive and submultiplicative weights on monotone polynomials,
with the leaf bounds of §7. Scalar-variable leaves follow by submultiplicativity. -/
structure PolynomialWeight (σ : Type) where
weight : MvPolynomial σ ℝ → NNReal
add_le : ∀ q r, MonotonePolynomial q → MonotonePolynomial r →
weight (q + r) ≤ weight q + weight r
mul_le : ∀ q r, MonotonePolynomial q → MonotonePolynomial r →
weight (q * r) ≤ weight q * weight r
variable_le : ∀ x : σ, weight (MvPolynomial.X x) ≤ 1
constant_le : ∀ c : NNReal, weight (MvPolynomial.C (c : ℝ)) ≤ 1
/-- Growth bounds concern relevant polynomials, as clarified by the §7 context.
Equality is required for every degree present in p, not only its maximum degree. -/
def Compatible {σ : Type} (p : MvPolynomial σ ℝ) (w : PolynomialWeight σ)
(Gr : ℕ → NNReal) : Prop :=
Monotone Gr ∧ (∀ n, 1 ≤ Gr n) ∧
(∀ q, Relevant p q → w.weight q ≤ Gr q.totalDegree) ∧
(∀ m ∈ p.support, Gr (m.sum (fun _ e => e)) = w.weight p)
/-- Both (7.3) and (7.4). All positive ordered decompositions, including one part,
are quantified. Coefficients are positive real ratios, then embedded into ENNReal.
The lower-bound function can take +infinity. -/
def LowerBoundConditions (Gr : ℕ → NNReal) (L : ℕ → ℕ → ℝ≥0∞) : Prop :=
(∀ d : ℕ, L 1 d ≤ (Gr 1 : ℝ≥0∞)) ∧
(∀ (d ℓ : ℕ), 1 ≤ d → 1 ≤ ℓ → ∀ ns : Fin ℓ → ℕ,
(∀ i, 1 ≤ ns i) →
L (∑ i, ns i) d ≤
(↑(Gr (∑ i, ns i) / ∏ i, Gr (ns i)) : ℝ≥0∞) *
∑ i, L (ns i) (d - 1))
end MonoABPWidth.Hierarchy.Supplement