AFTD Auto-Formalizing Theoretical Domains

subadditive_f_generator_one

theoremverified

The generator function f satisfies f(1) = 0.

Statement

theorem subadditive_f_generator_one (α : ℝ) (s : ℝ → ℝ) : subadditive_f_generator α s 1 = 0
Source
arXiv:2610.21231, Corollary 1
Verified
22 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • 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.

Read back from the Lean

For every real number α and every function s : ℝ → ℝ, subadditive_f_generator α s 1 is equal to 0.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The theorem states that the generator function evaluated at 1 is 0. Unfolding the definition of the generator function gives a sum of a logarithmic term α * 1 * ln(1) and an integral from 1 to 1; both components vanish immediately, reducing the expression to zero.

  1. subadditive_f_generator α s 1 = 0 automation

    Unfolding the definition of the generator function at x = 1 yields α * 1 * ln(1) + ∫ t in 1..1, (1 - t) * s(t) / t^2 dt. The term ln(1) is 0 and the integral from 1 to 1 is 0, so the entire sum simplifies directly to 0.

    line 3

    uses subadditive_f_generator

      simp [subadditive_f_generator]
subadditive_f_generator
The definition of the generator function f(x) = α * x * ln(x) + ∫ t in 1..x, (x - t) * s(t) / t^2 dt

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

/-- The generator function f satisfies f(1) = 0. -/theorem subadditive_f_generator_one (α : ℝ) (s : ℝ → ℝ) : subadditive_f_generator α s 1 = 0 := by  simp [subadditive_f_generator]
See it in the graphDiscuss this resultChallenge it