Exact named statement
forall p t x v K vb vc. ~p=0 ->
(forall k y a b c. Lt(k,K) ->
BetaAt(vb,vc,k,y) ->
Pow(p,k,a) ->
Pow(t,k,b) ->
Pow(x,k,c) ->
a*y=(v*b)*c) ->
(Lt(0,K) ->
BetaAt(vb,vc,0,v)) /\ (forall k y z. Lt(S k,K) ->
BetaAt(vb,vc,k,y) ->
BetaAt(vb,vc,S k,z) ->
p*z=(t*x)*y)Complete certificate and independent checks
119 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: 1cac9f24c8b7573372bdfab838b9e0b9248a42d1681fde0d65e7da2768df79c8
Bundle SHA-256: 8dbc3b54ee1dc9cca4b6031ae181390bd9d73fde574f8e0b26207e7f9615710f
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
exact supplied composition monomial law implies actual head and adjacent row recurrence with nonzero scale and actual power cancellation not composition construction or analytic limit
None of these finite arithmetic statements closes an IR campaign parent. The analytic identification, interpolation and final positive irrationality certificate remain open.