While this submission is a draft, it cannot be used by other submissions.

Proof of `Numerical recipes prescribe the concrete gradients on witness atoms`

groundedproofs/Lax342547Proofs/ConcreteRecipes.lean · lax-342547

What this proof establishes

no assumptions

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Choose the formal product bits from the numerical recipe alone. Every tag has an incident component, so the indexed product theorem applies. For any actual realization of these data, the concrete atom expansion identifies its gradient matrix with the prescribed one. Bilinearity then turns the matrix row sums into the gradients of both full witness sums.