AP055 — exp large argument truncation

Exact named statement

forall d x L ab ac K m N a0 s t p. ~d=0 ->
  Le(x,L*d) ->
  Le(2*L,K) ->
  NatScaledExpRecurrence(d,x,ab,ac,(K+m)+N) ->
  BetaAt(ab,ac,K,a0) ->
  Sum(ab,ac,K+m,s) ->
  Sum(ab,ac,S((K+m)+N),t) ->
  Pow(2,m,p) ->
  Le(s,t) /\ Le(p*t,p*s+2*a0)

PD0001 — Le · PD0013 — BetaAt · PD0015 — Sum · PD0020 — Pow · ND0443 — NatScaledExpRecurrence

Fully expanded target AST

Complete certificate and independent checks

157 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: 6d652892aa498fb4573642b7316fc9a30f17cc0102198e2d0ca31291e5c299b0
Bundle SHA-256: 4b2704a69fe125f681a594b0efd0eb04b37c832be124a46f148afc31eb798a53

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.

AP051 · AP052 · AP053 · AP054 · CV009 · CV068

Scope

identify the constructed large argument tail with two supplied sum values and prove both truncation orders with the supplied head and binary power including an empty short prefix without infinite analysis

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