AP035 — exp recurrence normalization

Exact named statement

forall d x tb tc N h. NatScaledExpRecurrence(d,x,tb,tc,N) ->
  BetaAt(tb,tc,0,h) ->
  forall j t f p q. Le(j,N) ->
  BetaAt(tb,tc,j,t) ->
  Factorial(j,f) ->
  Pow(d,j,p) ->
  Pow(x,j,q) ->
  (t*f)*p=h*q

PD0001 — Le · PD0013 — BetaAt · PD0020 — Pow · PD0023 — Factorial · ND0443 — NatScaledExpRecurrence

Fully expanded target AST

Complete certificate and independent checks

36 actual local proof nodes. Each node carries its complete ordinary HA proof body.

Full canonical proof bundle · Original HA receipt · Independent Lean receipt

Target SHA-256: 9b47638db02d23a2bbc549793da14c71bc39b811db179fadbf3410e4723bbdf6
Bundle SHA-256: 9cca6b66aa1a938f46ea6ec4dc47503a586239318bc48d616d5d68f48b8ee4bc

Checked statement containment

These exact targets occur inside this certificate. These links summarize containment, not direct dependency arrows; the downloadable bundle records every private lemma and ordered edge.

Scope

derive all index factorial power normalization from any supplied actual finite exponential recurrence and head by ordinary induction without cancellation including zero denominator numerator head and horizon

None of these finite arithmetic statements closes an IR campaign parent. The analytic identification, interpolation and final positive irrationality certificate remain open.