PHI.Monographs.Bernstein.choose_real_factorial (n k : ℕ) (hk : k ≤ n) :
  ↑(n.choose k) = ↑n.factorial / (↑k.factorial * ↑(n - k).factorial)
'PHI.Monographs.Bernstein.choose_real_factorial' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.weighted_convex_bounds.{u_1} {ι : Type u_1} (s : Finset ι) (w c : ι → ℝ) (lo hi : ℝ)
  (hw : ∀ i ∈ s, 0 ≤ w i) (hs : ∑ i ∈ s, w i = 1) (hc : ∀ i ∈ s, lo ≤ c i ∧ c i ≤ hi) :
  lo ≤ ∑ i ∈ s, w i * c i ∧ ∑ i ∈ s, w i * c i ≤ hi
'PHI.Monographs.Bernstein.weighted_convex_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.empty_weights_not_normalized.{u_1} {ι : Type u_1} (w : ι → ℝ) : ∑ i ∈ ∅, w i ≠ 1
'PHI.Monographs.Bernstein.empty_weights_not_normalized' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.weight_nonnegative (n k : ℕ) (t : ℝ) (ht0 : 0 ≤ t) (ht1 : t ≤ 1) :
  0 ≤ PHI.Monographs.Bernstein.weight n k t
'PHI.Monographs.Bernstein.weight_nonnegative' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.weights_partition_unity (n : ℕ) (t : ℝ) :
  ∑ k ∈ Finset.range (n + 1), PHI.Monographs.Bernstein.weight n k t = 1
'PHI.Monographs.Bernstein.weights_partition_unity' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.bernstein_bounds (n : ℕ) (c : ℕ → ℝ) (t lo hi : ℝ) (ht0 : 0 ≤ t) (ht1 : t ≤ 1)
  (hc : ∀ k < n + 1, lo ≤ c k ∧ c k ≤ hi) :
  lo ≤ PHI.Monographs.Bernstein.value n c t ∧ PHI.Monographs.Bernstein.value n c t ≤ hi
'PHI.Monographs.Bernstein.bernstein_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.degree_zero_value (c : ℕ → ℝ) (t : ℝ) : PHI.Monographs.Bernstein.value 0 c t = c 0
'PHI.Monographs.Bernstein.degree_zero_value' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.affine_parameter_bounds (a b x : ℝ) (hab : a < b) (hx : a ≤ x ∧ x ≤ b) :
  0 ≤ (x - a) / (b - a) ∧ (x - a) / (b - a) ≤ 1
'PHI.Monographs.Bernstein.affine_parameter_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.affine_reconstruction (a b x : ℝ) (hab : a < b) : a + (b - a) * ((x - a) / (b - a)) = x
'PHI.Monographs.Bernstein.affine_reconstruction' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.bernstein_interval_bounds (n : ℕ) (c : ℕ → ℝ) (f : ℝ → ℝ) (a b lo hi : ℝ) (hab : a < b)
  (hc : ∀ k < n + 1, lo ≤ c k ∧ c k ≤ hi)
  (hidentity : ∀ (t : ℝ), 0 ≤ t → t ≤ 1 → f (a + (b - a) * t) = PHI.Monographs.Bernstein.value n c t) (x : ℝ) :
  a ≤ x → x ≤ b → lo ≤ f x ∧ f x ≤ hi
'PHI.Monographs.Bernstein.bernstein_interval_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.empty_chain_cannot_cover (f : ℝ → ℝ) (lo hi a b : ℝ) (hab : a < b) :
  ¬PHI.Monographs.Bernstein.intervalChain f lo hi a b []
'PHI.Monographs.Bernstein.empty_chain_cannot_cover' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.contiguous_chain_bounds (f : ℝ → ℝ) (lo hi : ℝ) (points : List ℝ) (a b : ℝ) :
  a < b → PHI.Monographs.Bernstein.intervalChain f lo hi a b points → ∀ (x : ℝ), a ≤ x → x ≤ b → lo ≤ f x ∧ f x ≤ hi
'PHI.Monographs.Bernstein.contiguous_chain_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.certified_chain_implies_interval_chain (f : ℝ → ℝ) (lo hi : ℝ)
  (segments : List PHI.Monographs.Bernstein.Segment) (a b : ℝ) :
  PHI.Monographs.Bernstein.certifiedChain f lo hi a b segments →
    PHI.Monographs.Bernstein.intervalChain f lo hi a b (List.map PHI.Monographs.Bernstein.Segment.right segments)
'PHI.Monographs.Bernstein.certified_chain_implies_interval_chain' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
PHI.Monographs.Bernstein.certified_chain_sound (f : ℝ → ℝ) (lo hi a b : ℝ)
  (segments : List PHI.Monographs.Bernstein.Segment) (hab : a < b)
  (hcert : PHI.Monographs.Bernstein.certifiedChain f lo hi a b segments) (x : ℝ) : a ≤ x → x ≤ b → lo ≤ f x ∧ f x ≤ hi
'PHI.Monographs.Bernstein.certified_chain_sound' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.eval_bernsteinPolynomial (n : ℕ) (b : ℕ → ℝ) (t : ℝ) :
  Polynomial.eval t (PHI.Monographs.PolynomialBridge.bernsteinPolynomial n b) = PHI.Monographs.Bernstein.value n b t
'PHI.Monographs.PolynomialBridge.eval_bernsteinPolynomial' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.eval_affinePolynomial (n : ℕ) (c : ℕ → ℝ) (a w t : ℝ) :
  Polynomial.eval t (PHI.Monographs.PolynomialBridge.affinePolynomial n c a w) =
    PHI.Monographs.PolynomialBridge.powerValue n c (a + w * t)
'PHI.Monographs.PolynomialBridge.eval_affinePolynomial' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coeff_affine_power (a w : ℝ) (k j : ℕ) :
  ((Polynomial.C a + Polynomial.C w * Polynomial.X) ^ k).coeff j = ↑(k.choose j) * a ^ (k - j) * w ^ j
'PHI.Monographs.PolynomialBridge.coeff_affine_power' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coeff_one_sub_X_power (m j : ℕ) :
  ((1 - Polynomial.X) ^ m).coeff j = ↑(m.choose j) * (-1) ^ j
'PHI.Monographs.PolynomialBridge.coeff_one_sub_X_power' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coeff_bernstein_summand (n k j : ℕ) (b : ℝ) :
  (Polynomial.C (b * ↑(n.choose k)) * (Polynomial.X ^ k * (1 - Polynomial.X) ^ (n - k))).coeff j =
    if k ≤ j then b * ↑(n.choose k) * ↑((n - k).choose (j - k)) * (-1) ^ (j - k) else 0
'PHI.Monographs.PolynomialBridge.coeff_bernstein_summand' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coeff_affinePolynomial (n : ℕ) (c : ℕ → ℝ) (a w : ℝ) (j : ℕ) :
  (PHI.Monographs.PolynomialBridge.affinePolynomial n c a w).coeff j =
    PHI.Monographs.PolynomialBridge.affineCoefficient n c a w j
'PHI.Monographs.PolynomialBridge.coeff_affinePolynomial' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coeff_bernsteinPolynomial (n : ℕ) (b : ℕ → ℝ) (j : ℕ) (hj : j ≤ n) :
  (PHI.Monographs.PolynomialBridge.bernsteinPolynomial n b).coeff j =
    PHI.Monographs.PolynomialBridge.bernsteinCoefficient n b j
'PHI.Monographs.PolynomialBridge.coeff_bernsteinPolynomial' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coeff_bernstein_above (n : ℕ) (b : ℕ → ℝ) (j : ℕ) (hj : n < j) :
  (PHI.Monographs.PolynomialBridge.bernsteinPolynomial n b).coeff j = 0
'PHI.Monographs.PolynomialBridge.coeff_bernstein_above' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coeff_affine_above (n : ℕ) (c : ℕ → ℝ) (a w : ℝ) (j : ℕ) (hj : n < j) :
  (PHI.Monographs.PolynomialBridge.affinePolynomial n c a w).coeff j = 0
'PHI.Monographs.PolynomialBridge.coeff_affine_above' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.coefficient_identities_imply_polynomial_identity (n : ℕ) (b c : ℕ → ℝ) (a w : ℝ)
  (h :
    ∀ j ≤ n,
      PHI.Monographs.PolynomialBridge.bernsteinCoefficient n b j =
        PHI.Monographs.PolynomialBridge.affineCoefficient n c a w j) :
  PHI.Monographs.PolynomialBridge.bernsteinPolynomial n b = PHI.Monographs.PolynomialBridge.affinePolynomial n c a w
'PHI.Monographs.PolynomialBridge.coefficient_identities_imply_polynomial_identity' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
PHI.Monographs.PolynomialBridge.coefficient_identities_imply_function_identity (n : ℕ) (b c : ℕ → ℝ) (a w : ℝ)
  (h :
    ∀ j ≤ n,
      PHI.Monographs.PolynomialBridge.bernsteinCoefficient n b j =
        PHI.Monographs.PolynomialBridge.affineCoefficient n c a w j)
  (t : ℝ) : PHI.Monographs.Bernstein.value n b t = PHI.Monographs.PolynomialBridge.powerValue n c (a + w * t)
'PHI.Monographs.PolynomialBridge.coefficient_identities_imply_function_identity' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
PHI.Monographs.PolynomialBridge.coefficient_identities_imply_interval_bounds (n : ℕ) (b c : ℕ → ℝ) (a z lo hi : ℝ)
  (haz : a < z) (hb : ∀ k < n + 1, lo ≤ b k ∧ b k ≤ hi)
  (h :
    ∀ j ≤ n,
      PHI.Monographs.PolynomialBridge.bernsteinCoefficient n b j =
        PHI.Monographs.PolynomialBridge.affineCoefficient n c a (z - a) j)
  (x : ℝ) :
  a ≤ x →
    x ≤ z →
      lo ≤ PHI.Monographs.PolynomialBridge.powerValue n c x ∧ PHI.Monographs.PolynomialBridge.powerValue n c x ≤ hi
'PHI.Monographs.PolynomialBridge.coefficient_identities_imply_interval_bounds' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
PHI.Monographs.PolynomialBridge.chooseInteger_eq_choose (n k : ℕ) :
  PHI.Monographs.PolynomialBridge.chooseInteger n k = ↑(n.choose k)
'PHI.Monographs.PolynomialBridge.chooseInteger_eq_choose' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.chooseInteger_cast (n k : ℕ) :
  ↑(PHI.Monographs.PolynomialBridge.chooseInteger n k) = ↑(n.choose k)
'PHI.Monographs.PolynomialBridge.chooseInteger_cast' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.scaled_monomial_identity (n k j : ℕ) (hjk : j ≤ k) (hkn : k ≤ n)
  (D M H S a w p c L W q : ℝ) (hD : D = M * H * S ^ n) (hp : H * c = p) (ha : S * a = L) (hw : S * w = W) :
  D * (c * q * a ^ (k - j) * w ^ j) = M * p * q * L ^ (k - j) * W ^ j * S ^ (n - k)
'PHI.Monographs.PolynomialBridge.scaled_monomial_identity' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.scaled_bernsteinCoefficient (n : ℕ) (b : ℕ → ℝ) (B : ℕ → ℤ) (D : ℤ)
  (hb : ∀ k ≤ n, ↑D * b k = ↑(B k)) (j : ℕ) (hj : j ≤ n) :
  ↑D * PHI.Monographs.PolynomialBridge.bernsteinCoefficient n b j =
    ↑(PHI.Monographs.PolynomialBridge.integerBernsteinCoefficient n B j)
'PHI.Monographs.PolynomialBridge.scaled_bernsteinCoefficient' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.scaled_affineCoefficient (n : ℕ) (c : ℕ → ℝ) (p : ℕ → ℤ) (D M H L W S : ℤ) (a w : ℝ)
  (hD : D = M * H * S ^ n) (hp : ∀ k ≤ n, ↑H * c k = ↑(p k)) (ha : ↑S * a = ↑L) (hw : ↑S * w = ↑W) (j : ℕ) :
  ↑D * PHI.Monographs.PolynomialBridge.affineCoefficient n c a w j =
    ↑(PHI.Monographs.PolynomialBridge.integerAffineCoefficient n p M L W S j)
'PHI.Monographs.PolynomialBridge.scaled_affineCoefficient' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.PolynomialBridge.integer_identities_imply_function_identity (n : ℕ) (b c : ℕ → ℝ) (B p : ℕ → ℤ)
  (D M H L W S : ℤ) (a w : ℝ) (hD0 : D ≠ 0) (hD : D = M * H * S ^ n) (hb : ∀ k ≤ n, ↑D * b k = ↑(B k))
  (hp : ∀ k ≤ n, ↑H * c k = ↑(p k)) (ha : ↑S * a = ↑L) (hw : ↑S * w = ↑W)
  (h :
    ∀ j ≤ n,
      PHI.Monographs.PolynomialBridge.integerBernsteinCoefficient n B j =
        PHI.Monographs.PolynomialBridge.integerAffineCoefficient n p M L W S j)
  (t : ℝ) : PHI.Monographs.Bernstein.value n b t = PHI.Monographs.PolynomialBridge.powerValue n c (a + w * t)
'PHI.Monographs.PolynomialBridge.integer_identities_imply_function_identity' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
PHI.Monographs.PolynomialBridge.quotient_integer_identities_imply_function_identity (n : ℕ) (B p : ℕ → ℤ)
  (D M H L W S : ℤ) (hD0 : D ≠ 0) (hH0 : H ≠ 0) (hS0 : S ≠ 0) (hD : D = M * H * S ^ n)
  (h :
    ∀ j ≤ n,
      PHI.Monographs.PolynomialBridge.integerBernsteinCoefficient n B j =
        PHI.Monographs.PolynomialBridge.integerAffineCoefficient n p M L W S j)
  (t : ℝ) :
  PHI.Monographs.Bernstein.value n (fun k => ↑(B k) / ↑D) t =
    PHI.Monographs.PolynomialBridge.powerValue n (fun k => ↑(p k) / ↑H) (↑L / ↑S + ↑W / ↑S * t)
'PHI.Monographs.PolynomialBridge.quotient_integer_identities_imply_function_identity' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
PHI.Monographs.PolynomialBridge.integer_identities_imply_interval_bounds (n : ℕ) (b c : ℕ → ℝ) (B p : ℕ → ℤ)
  (D M H L W S : ℤ) (a z lo hi : ℝ) (haz : a < z) (hD0 : D ≠ 0) (hD : D = M * H * S ^ n)
  (hb : ∀ k ≤ n, ↑D * b k = ↑(B k)) (hp : ∀ k ≤ n, ↑H * c k = ↑(p k)) (ha : ↑S * a = ↑L) (hw : ↑S * (z - a) = ↑W)
  (h :
    ∀ j ≤ n,
      PHI.Monographs.PolynomialBridge.integerBernsteinCoefficient n B j =
        PHI.Monographs.PolynomialBridge.integerAffineCoefficient n p M L W S j)
  (hbounds : ∀ k < n + 1, lo ≤ b k ∧ b k ≤ hi) (x : ℝ) :
  a ≤ x →
    x ≤ z →
      lo ≤ PHI.Monographs.PolynomialBridge.powerValue n c x ∧ PHI.Monographs.PolynomialBridge.powerValue n c x ≤ hi
'PHI.Monographs.PolynomialBridge.integer_identities_imply_interval_bounds' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
