Symbolic and Numerical Checks

Formal verification for the theorem chain, monitoring bookkeeping, and cached experiment bounds.

Generated 2026-04-24 10:00:02 Eastern Daylight Time
Python 3.13.5 on Windows-11-10.0.22631-SP0

This report verifies the paper's main mathematical steps in three ways: exact symbolic identities for the theorem package and the rank-1 hazard-score proposition, numerical stress tests for the low-rank inequalities, and direct consistency checks against the cached experiment summaries already committed in the repository.

10 Total
10 Passed
5 Exact Symbolic
2 Numerical
3 Artifact Consistency
All verification checks passed.
Run Command

Reproduce the report

The verifier reads the manuscript-adjacent artifacts from the repository and writes both JSON and HTML outputs into proof_verification/.

python proof_verification/generate_report.py
  • Exact symbolic checks Sharpness of the PoincarĂ© bound, a deterministic equality case for the Jacobian-velocity theorem, the composition-chain identity, the rank-1 hazard-score bookkeeping identity, and the Bernoulli cross-entropy derivative bound.
  • Numerical checks Randomized low-rank stress tests and a nontrivial expectation example verifying the full inequality chain.
  • Artifact checks Row-by-row validation that the cached synthetic experiment summaries satisfy the stored upper bounds.
Verification Block

Exact Symbolic Checks

These checks use SymPy to simplify the main algebraic identities and sharp examples exactly, including the rank-1 hazard-score bookkeeping proposition.

sympy Pass

Poincaré / Wirtinger sharpness

The first cosine eigenfunction attains equality in the time-domain bound.

\[\bar r = \frac{1}{T}\int_0^T \cos\!\left(\frac{\pi t}{T}\right) dt = 0\]
\[\mathrm{Var}_U(r(U)) = \frac{1}{T}\int_0^T \cos^2\!\left(\frac{\pi t}{T}\right) dt = \frac{1}{2}\]
\[\frac{T}{\pi^2}\int_0^T (r'(t))^2 dt = \frac{1}{2}\]
  • Used r(t) = cos(pi t / T), the first zero-mean eigenfunction on [0, T].
  • Verified the temporal mean is exactly zero.
  • Verified Var_U(r(U)) and (T / pi^2) int_0^T (r'(t))^2 dt simplify to the same closed form.
MetricValue
mean0
variance1/2
rhs1/2
gap0
sympy Pass

Jacobian-velocity theorem on a deterministic path

For X_t = t, g = f, and f(x) = cos(pi x / T), the theorem is exact with beta = 1.

\[X_t = t,\qquad \dot X_t = 1,\qquad f(x) = g(x) = \cos\!\left(\frac{\pi x}{T}\right)\]
\[J_f(X_t)\dot X_t = -\frac{\pi}{T}\sin\!\left(\frac{\pi t}{T}\right)\]
\[\mathrm{Var}_U(r(U)) = \frac{T}{\pi^2}\int_0^T \left\|J_f(X_t)\dot X_t\right\|^2 dt = \frac{1}{2}\]
  • The deployment path is deterministic, so the expectation operators collapse exactly.
  • Because g = f, Assumption A3 holds with beta = 1 and |grad g dot Xdot| = |J_f Xdot|.
  • The Jacobian-velocity right-hand side equals the exact volatility from the lemma-sharp example.
MetricValue
variance1/2
jv rhs1/2
gap0
sympy Pass

Composition case in Remark A3

Directional derivatives of g = h o f factor exactly into h'(f) and the score Jacobian term.

\[g(x) = h(f(x)),\qquad h(z) = \arctan(z)\]
\[\nabla g(x)\cdot v = h'(f(x))\, \nabla f(x)\cdot v\]
  • Used a nontrivial smooth score field f(x1, x2) = x1^2 + x1 x2 + sin(x2).
  • Used h(z) = atan(z), so g(x1, x2) = atan(f(x1, x2)).
  • Simplified grad g dot v - h'(f) grad f dot v to zero exactly.
MetricValue
difference0
sympy Pass

Rank-1 hazard-score bookkeeping

The pointwise algebra behind Proposition 1 is exact; the expectation form follows by averaging these identities.

\[\frac{\Delta \mu_t}{\Delta} = a v + r u,\qquad v_t = c v + s u,\qquad v^\top u = 0\]
\[s_t^2 = \left\|\frac{\Delta \mu_t}{\Delta}\right\|^2 = |a|^2 + |r|^2\]
\[\|J_f v_t\|^2 = c^2\|J_f v\|^2 + s^2\|J_f u\|^2 + 2cs\langle J_f v, J_f u\rangle\]
  • Worked in an orthonormal basis with v = e1, u = e2, Delta mu / Delta = (a, r), and a generic 2 x 2 Jacobian matrix.
  • Verified s_t^2 = |a|^2 + |r|^2 from the orthogonal block-drift decomposition.
  • Verified the directional energy splits into aligned, orthogonal, and overlap terms with coefficients c^2, s^2, and 2cs.
MetricValue
s sq gap0
g gap0
h gap0
sympy + dense numeric sweep Pass

Bernoulli cross-entropy derivative bound

The soft-target Bernoulli cross-entropy derivative is sigma(z) - q, so its magnitude never exceeds 1.

\[h(z) = -q \log \sigma(z) - (1-q)\log(1-\sigma(z))\]
\[h'(z) = \sigma(z) - q,\qquad |h'(z)| \le 1 \text{ for } q \in [0,1]\]
  • Differentiated the scalar loss h(z) = -q log sigma(z) - (1-q) log(1-sigma(z)) exactly.
  • Verified the closed form h'(z) = sigma(z) - q symbolically.
  • Checked the beta = 1 bound over a dense grid in z and q.
MetricValue
identity gap0
max abs derivative on grid0.999994
Verification Block

Numerical Stress Tests

These checks verify the theorem chain and low-rank inequalities in settings where exact symbolic proof is less natural but dense numerical evaluation is informative.

numpy randomized stress test Pass

Low-rank corollary inequalities

The triangle and Frobenius inequalities used in the low-rank corollary hold across randomized orthonormal decompositions.

\[\|u+w\|^2 \le 2\|u\|^2 + 2\|w\|^2\]
\[\|MVa\|^2 \le \|MV\|_F^2 \|a\|^2\]
\[\begin{aligned} \|M(Va+\rho)\|^2 &\le 2\|MV\|_F^2\|a\|^2 \\ &\quad + 2\|M\rho\|^2 \end{aligned}\]
  • Generated random orthonormal drift bases V with QR factorization.
  • Projected residual drift rho into the orthogonal complement of span(V).
  • Checked the split inequality, the Frobenius inequality, and the combined corollary bound trial by trial.
MetricValue
trials5000
max split violation-0.553367
max frobenius violation-0.049472
max combined violation-0.999537
min combined slack0.999537
max orthogonality error3.027151e-15
dense quadrature on a smooth finite-mixture path Pass

Jacobian-velocity theorem with a nontrivial expectation

A smooth mixture path satisfies the full inequality chain Var <= derivative-energy bound <= Jacobian-velocity bound.

\[X_t = t + Z,\qquad Z \in \{-0.2, 0, 0.15\}\]
\[f(x) = \cos(\pi x),\qquad g(x) = \arctan(f(x)),\qquad \beta \le 1\]
\[\begin{aligned} \mathrm{Var}_U(r(U)) &\le \frac{T}{\pi^2}\int_0^T (r'(t))^2 dt \\ &\le \frac{T}{\pi^2}\int_0^T \mathbb{E}\!\left[\|J_f(X_t)\dot X_t\|^2\right] dt \end{aligned}\]
  • Used X_t = t + Z with a three-point discrete random offset Z and deterministic velocity Xdot = 1.
  • Used f(x) = cos(pi x) and g(x) = atan(f(x)), so A3 holds with beta <= 1.
  • Integrated the continuous-time quantities on a dense grid to verify the theorem in a genuine expectation setting.
MetricValue
beta upper1
volatility0.296534
chain bound0.298842
jv bound0.5
chain minus volatility0.002309
jv minus chain0.201158
Verification Block

Cached Experiment Artifact Checks

These checks validate the inequality columns stored in the committed CSV summaries that drive the synthetic theorem and directional-ablation figures.

pandas cached-summary validation Pass

Synthetic theorem summary bounds

Every cached synthetic theorem run satisfies the finite-difference, chain-rule, and Jacobian-velocity bounds.

\[\begin{aligned} \mathrm{volatility} &\le \mathrm{bound\_fd} \\ \mathrm{volatility} &\le \mathrm{bound\_chain} \\ \mathrm{volatility} &\le \mathrm{bound\_jv} \end{aligned}\]
  • Loaded 80 rows from figures/synthetic_theorem_summary.csv.
  • Checked volatility <= bound_fd, volatility <= bound_chain, and volatility <= bound_jv wherever those columns exist.
  • Allowed an absolute tolerance of 1e-4 for cached numerical summaries, since those bounds come from finite grids and Monte Carlo estimates rather than exact algebra.
MetricValue
rows80
absolute tolerance1.000000e-04
min slack bound fd0.001071
min slack bound chain-6.602279e-05
min slack bound jv0.042823
pandas cached-summary validation Pass

Directional comparison bounds

Every cached directional-comparison run preserves the volatility upper bounds used in the paper.

\[\begin{aligned} \mathrm{volatility} &\le \mathrm{bound\_fd} \\ \mathrm{volatility} &\le \mathrm{bound\_chain} \\ \mathrm{volatility} &\le \mathrm{bound\_jv} \end{aligned}\]
  • Loaded 140 rows from figures/synthetic_directional_comparison_summary.csv.
  • Checked volatility <= bound_fd, volatility <= bound_chain, and volatility <= bound_jv wherever those columns exist.
  • Allowed an absolute tolerance of 1e-4 for cached numerical summaries, since those bounds come from finite grids and Monte Carlo estimates rather than exact algebra.
MetricValue
rows140
absolute tolerance1.000000e-04
min slack bound fd7.220234e-04
min slack bound chain-6.602279e-05
min slack bound jv0.042823
pandas cached-summary validation Pass

Misspecification bounds

Every cached misspecification run preserves the volatility upper bounds under subspace rotation.

\[\begin{aligned} \mathrm{volatility} &\le \mathrm{bound\_fd} \\ \mathrm{volatility} &\le \mathrm{bound\_chain} \\ \mathrm{volatility} &\le \mathrm{bound\_jv} \end{aligned}\]
  • Loaded 60 rows from figures/synthetic_directional_misspecification_summary.csv.
  • Checked volatility <= bound_fd, volatility <= bound_chain, and volatility <= bound_jv wherever those columns exist.
  • Allowed an absolute tolerance of 1e-4 for cached numerical summaries, since those bounds come from finite grids and Monte Carlo estimates rather than exact algebra.
MetricValue
rows60
absolute tolerance1.000000e-04
min slack bound fd9.769829e-04
min slack bound chain7.011415e-07
min slack bound jv0.11503