Constants Alpha Genesis Resummation Forcing Has Deriv At Neg Self

The forced dressing response

In the Recognition Science framework, a dressing response is a function g that gives the fraction of a coupling budget surviving a gap load ε. The framework's library proves that any such response obeying two plain conditions must be the exponential decay g(ε) = exp(−ε). The first condition, factorization, says that independent gap loads multiply survival fractions: g(x + y) = g(x) · g(y). The second, unit response, fixes the calibration at zero load by requiring the derivative g′(0) = −1.

The theorem hasDerivAt_neg_self states that for every real x, the derivative of g at x is minus the value of g at x: g′(x) = −g(x). This is the local differential equation whose unique solution, given the boundary condition g(0) = 1, is the exponential. Factorization propagates the calibrated derivative at zero to every point, so the whole curve is forced. The result is proved in the machine-checked library of formal theorems as a single declaration, with no unproven axioms beyond the kernel's standard three.

The classical exponential function appears throughout mathematics and physics, from radioactive decay to compound interest, wherever a quantity changes at a rate proportional to itself. The framework's contribution is to show that this particular differential equation is not chosen but forced: any response with the two stated properties must satisfy it. The additive display ε ↦ 1 − ε, which might look like a first-order approximation, fails the factorization law outright, as the library proves with the counterexample ε₁ = ε₂ = 1.

In Recognition Science, the theorem establishes that the exponential dressing of the alpha seed is not a resummation convention but a structural necessity. The same factorization premise that forces the T9 measure also forces this response, and the framework proves the dressing factor is identical to the forced measure evaluated at the spectral gap load per channel. The fine-structure constant is thereby expressed as the channel budget attenuated by this unique recognition weight, with no free parameters.

/-- The response is differentiable everywhere with `g′(x) = −g(x)`:
factorization propagates the calibrated derivative from 0 to every point. -/
theorem hasDerivAt_neg_self (x : ℝ) : HasDerivAt R.g (-(R.g x)) x := by
  have hshift : HasDerivAt (fun y : ℝ => y - x) 1 x := (hasDerivAt_id x).sub_const x
  have hcomp0 : HasDerivAt (R.g ∘ fun y : ℝ => y - x) (-1 * 1) x := by
    apply HasDerivAt.comp
    · show HasDerivAt R.g (-1) ((fun y : ℝ => y - x) x)
      simpa [sub_self] using R.unit_response
    · exact hshift
  have hcomp : HasDerivAt (fun y : ℝ => R.g (y - x)) (-1 * 1) x := by
    simpa [Function.comp] using hcomp0
  have hmul : HasDerivAt (fun y : ℝ => R.g x * R.g (y - x)) (R.g x * (-1 * 1)) x :=
    hcomp.const_mul (R.g x)
  have hfun : (fun y : ℝ => R.g x * R.g (y - x)) = R.g := by
    funext y
    rw [← R.factorizes x (y - x)]
    congr 1
    ring
  rw [hfun] at hmul
  convert hmul using 1
  ring

/-- **RESUMMATION FORCING.** Any factorizing dressing response with unit
linear response is exactly the exponential: `g(ε) = exp(−ε)`. There is no
resummation freedom. -/
theorem response_forced : ∀ ε : ℝ, R.g ε = Real.exp (-ε) := by
  -- h(x) = g(x)·exp(x) has zero derivative everywhere, hence is constant 1.
  have hd : ∀ x : ℝ, HasDerivAt (fun y : ℝ => R.g y * Real.exp y) 0 x := by
    intro x
    have hmul := (R.hasDerivAt_neg_self x).mul (Real.hasDerivAt_exp x)
    convert hmul using 1
    ring
  have hdiff : Differentiable ℝ (fun y : ℝ => R.g y * Real.exp y) :=
    fun x => (hd x).differentiableAt
  have hderiv : ∀ x : ℝ, deriv (fun y : ℝ => R.g y * Real.exp y) x = 0 :=
    fun x => (hd x).deriv
  have hconst : ∀ x : ℝ, R.g x * Real.exp x = R.g 0 * Real.exp 0 := by
    intro x
    exact is_const_of_deriv_eq_zero hdiff hderiv x 0
  intro ε
  have hε : R.g ε * Real.exp ε = 1 := by
    have hx := hconst ε
    simpa [R.g_zero] using hx
  have hexp : Real.exp ε ≠ 0 := (Real.exp_pos ε).ne'
  have hgε : R.g ε = (Real.exp ε)⁻¹ := by
    have h2 := congrArg (· * (Real.exp ε)⁻¹) hε
    simpa [mul_assoc, mul_inv_cancel₀ hexp] using h2
  rw [hgε, ← Real.exp_neg]

/-- **ADDITIVE FORM EXCLUDED.** No dressing response is the additive display
`ε ↦ 1 − ε`: it fails factorization (witness ε₁ = ε₂ = 1). Form (A) is a
truncation of form (E), not a structural alternative. -/
theorem no_additive_response : R.g ≠ fun ε => 1 - ε := by
  intro hcontra
  have h := R.factorizes 1 1
  rw [hcontra] at h
  norm_num at h

/-- The additive map fails the factorization law outright (independent of any
response structure). -/
theorem additive_map_not_factorizing :
    ¬ (∀ x y : ℝ, (1 - (x + y)) = (1 - x) * (1 - y)) := by
  intro h
  have h11 := h 1 1
  norm_num at h11

/-- The response that dresses α and the weight that forces the measure are
one function: `g(lnφ · t) = contWeight(t)` for every dressing response. -/
theorem response_is_forced_measure (R : DressingResponse) (t : ℝ) :
    R.g (Real.log Constants.phi * t) = Foundation.MeasureForcing.contWeight t := by
  rw [R.response_forced, Foundation.MeasureForcing.contWeight_gibbs]
  congr 1
  ring

What this page does not claim

The theorem does not derive the numerical value of the fine-structure constant from first principles. The theorem does not prove that the exponential is the only differentiable function satisfying the factorization law without the unit response condition. The theorem does not claim that the additive display is a valid alternative response, only that it fails the factorization premise.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Constants/AlphaGenesis/ResummationForcing.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: