subadditive_f_generator_weight_eventuallyEq
For s continuous on (0, ∞) and x > 0, the weight g(y) = y² f''(y) of the generator f of equation (4) agrees with α y + s(y) on a neighbourhood of x.
Statement
theorem subadditive_f_generator_weight_eventuallyEq (α : ℝ) (s : ℝ → ℝ) (hs : ContinuousOn s (Set.Ioi 0)) {x : ℝ} (hx : 0 < x) : subadditive_f_weight (subadditive_f_generator α s) =ᶠ[nhds x] fun y => α * y + s y
- Source
- helper for arXiv:2610.21231 (On the subadditivity of mutual f-information), Corollary 1 (x² f''(x) = g(x) = α x + s(x))
- Verified
- 23 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- subadditive_f_weightThe weight g(x) = x² f''(x) attached to a generator f in Theorem 1 of arXiv:2610.21231 (f'' is the iterated derivative
deriv (deriv f)). - subadditive_f_generatorThe generator function f associated to parameter α and function s is f(x) = α x log x + ∫_1^x (x - t) (s(t) / t^2) dt.
- subadditive_f_generator_deriv2For s continuous on (0, ∞) and y > 0, the derivative of the generator f of equation (4) has derivative α/y + s(y)/y² at y, i.e. f''(y) =…
- subadditive_f_weightThe weight g(x) = x² f''(x) attached to a generator f in Theorem 1 of arXiv:2610.21231 (f'' is the iterated derivative
- Used by 1
- subadditive_f_generator_satisfies_weight_boundFirst claim of Corollary 1 of arXiv:2610.21231: let s be twice continuously differentiable and positive on (0, ∞) with s'' < 0, let K_s(x)…
The proof, explained
Since x > 0, the open ray (0, ∞) is a neighbourhood of x, so the eventual equality near x reduces to showing the equality pointwise for each y > 0. Unfolding the definition of the weight expresses it as y² f''(y), where f is the generator. Substituting the second derivative f''(y) = α / y + s(y) / y² and clearing denominators completes the proof.
To prove that the weight of the generator eventually equals α y + s(y) near x, it suffices to show that the equality holds pointwise for all y > 0.
Because x > 0, the open ray (0, ∞) is a neighbourhood of x by `lt_mem_nhds`. Therefore, the filter tactic `filter_upwards` reduces the eventual equality in the neighbourhood filter of x to showing the equality for all y > 0.
uses
lt_mem_nhdsfilter_upwards [lt_mem_nhds hx] with y hy
y² (α / y + s(y) / y²) = α y + s(y)
Unfolding the definition of `subadditive_f_weight` expands the left-hand side to y² f''(y), where f is the generator function. Rewriting with `subadditive_f_generator_deriv2` replaces the second derivative f''(y) with α / y + s(y) / y².
uses
subadditive_f_generator_deriv2unfold subadditive_f_weight rw [(subadditive_f_generator_deriv2 α s hs hy).deriv]
The pointwise equality holds for all y > 0. automation
Expanding the product y² (α / y + s(y) / y²) and cancelling denominators (which are non-zero since y > 0) simplifies the expression to α y + s(y).
field_simp
lt_mem_nhds- In a linearly ordered topological space, if a < b then the set {x | a < x} is a neighbourhood of b.
subadditive_f_generator_deriv2- If s is continuous on (0, ∞) and y > 0, the second derivative of the generator f is f''(y) = α / y + s(y) / y².
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem subadditive_f_generator_weight_eventuallyEq (α : ℝ) (s : ℝ → ℝ) (hs : ContinuousOn s (Set.Ioi 0)) {x : ℝ} (hx : 0 < x) : subadditive_f_weight (subadditive_f_generator α s) =ᶠ[nhds x] fun y => α * y + s y := by filter_upwards [lt_mem_nhds hx] with y hy unfold subadditive_f_weight rw [(subadditive_f_generator_deriv2 α s hs hy).deriv] field_simp