AFTD Auto-Formalizing Theoretical Domains

power_divergence_quarter_root_bounds

theoremverified

For x ≥ 0 and b ≥ 0, if a^4 ≤ x ≤ b^4 then a ≤ x^(1/4) ≤ b.

Statement

theorem power_divergence_quarter_root_bounds (x a b : ℝ) (hx : 0 ≤ x) (hb : 0 ≤ b)
    (h1 : a ^ 4 ≤ x) (h2 : x ≤ b ^ 4) : a ≤ x ^ ((1 : ℝ) / 4) ∧ x ^ ((1 : ℝ) / 4) ≤ b
Source
Helper for the refutations of subadditivity of mutual f_β-information, arXiv:2610.21231 (On the subadditivity of mutual f-information): rational bounds on real roots.
Verified
16 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 2

The proof, explained

To prove that $a \le x^{1/4} \le b$ given $a^4 \le x \le b^4$ with $x \ge 0$ and $b \ge 0$, the proof first establishes that $x^{1/4} \ge 0$ and that $(x^{1/4})^4 = x$. It then splits the goal into the lower and upper bounds. Each bound is proved by rewriting $x$ as $(x^{1/4})^4$ and applying the monotonicity of powers (le_of_pow_le_pow_left₀) to cancel the exponent 4.

  1. $0 \le x^{1/4}$

    Because $x \ge 0$ (by assumption $hx$), its real power $x^{1/4}$ is non-negative by Real.rpow_nonneg.

    line 3

    uses Real.rpow_nonneg

      have ht0 : 0 ≤ x ^ ((1 : ℝ) / 4) := Real.rpow_nonneg hx _
  2. $(x^{1/4})^4 = x$

    Rewriting the exponent $1/4$ as $4^{-1}$, the identity follows from Real.rpow_inv_natCast_pow using the assumptions that $x \ge 0$ and $4 \ne 0$.

    lines 4–6

    uses Real.rpow_inv_natCast_pow

      have ht : (x ^ ((1 : ℝ) / 4)) ^ 4 = x := by
        rw [show (1 : ℝ) / 4 = ((4 : ℕ) : ℝ)⁻¹ by norm_num]
        exact Real.rpow_inv_natCast_pow hx (by norm_num)
  3. $a \le x^{1/4}$

    Splitting the conjunction to address the lower bound first, we substitute $(x^{1/4})^4$ for $x$ in the hypothesis $a^4 \le x$ ($h1$) to obtain $a^4 \le (x^{1/4})^4$. Since $4 \ne 0$ and $x^{1/4} \ge 0$, the monotonicity lemma le_of_pow_le_pow_left₀ implies $a \le x^{1/4}$.

    lines 7–8

    uses le_of_pow_le_pow_left₀

      constructor
      · exact le_of_pow_le_pow_left₀ (by norm_num : (4 : ℕ) ≠ 0) ht0 (by rw [ht]; exact h1)
  4. $x^{1/4} \le b$

    For the upper bound, substituting $(x^{1/4})^4$ for $x$ in the hypothesis $x \le b^4$ ($h2$) gives $(x^{1/4})^4 \le b^4$. Since $4 \ne 0$ and $b \ge 0$ (by assumption $hb$), le_of_pow_le_pow_left₀ implies $x^{1/4} \le b$.

    line 9

    uses le_of_pow_le_pow_left₀

      · exact le_of_pow_le_pow_left₀ (by norm_num : (4 : ℕ) ≠ 0) hb (by rw [ht]; exact h2)
Real.rpow_nonneg
If a real number $x$ is non-negative, then any real power $x^y$ is also non-negative.
Real.rpow_inv_natCast_pow
For a non-negative real $x$ and a non-zero natural number $n$, raising the $n$-th root $x^{1/n}$ to the natural power $n$ yields $x$.
le_of_pow_le_pow_left₀
In an ordered monoid with zero, if $n \ne 0$, $0 \le b$, and $a^n \le b^n$, then $a \le b$.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem power_divergence_quarter_root_bounds (x a b : ℝ) (hx : 0 ≤ x) (hb : 0 ≤ b)    (h1 : a ^ 4 ≤ x) (h2 : x ≤ b ^ 4) : a ≤ x ^ ((1 : ℝ) / 4) ∧ x ^ ((1 : ℝ) / 4) ≤ b := by  have ht0 : 0 ≤ x ^ ((1 : ℝ) / 4) := Real.rpow_nonneg hx _  have ht : (x ^ ((1 : ℝ) / 4)) ^ 4 = x := by    rw [show (1 : ℝ) / 4 = ((4 : ℕ) : ℝ)⁻¹ by norm_num]    exact Real.rpow_inv_natCast_pow hx (by norm_num)  constructor  · exact le_of_pow_le_pow_left₀ (by norm_num : (4 : ℕ) ≠ 0) ht0 (by rw [ht]; exact h1)  · exact le_of_pow_le_pow_left₀ (by norm_num : (4 : ℕ) ≠ 0) hb (by rw [ht]; exact h2)
See it in the graphDiscuss this resultChallenge it