Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Explicit finite-dimensional contraction error bounds for energy and gradient

Statement

Let n,r≥1, C∈Rn×r with ∥C∥F≤B, and D∈Rr×r with ∥D∥F≤M. Suppose ∣H~ab−Hab∣≤ε2 and ∣G~abcd−Gabcd∣≤ε4 for every entry. With the functional of Finite tensor contractions and their variational energy and gradient, ∣E~−E∣≤MrnB2ε2+12M2r2n2B4ε4, and ∥∇CE~−∇CE∥F≤2nrBMε2+2n2r2B3M2ε4.

Facts & Assumptions

Given: The finite real functional in Finite tensor contractions and their variational energy and gradient, dimensions n,r≥1, and the entrywise error bounds and norm bounds in the statement.

[F1]

Finite tensor contractions and their variational energy and gradient: H′ has two factors of C, G′ has four, E=⟨D,H′⟩F+12∑DpqDrsGpqrs′, and the gradient is with respect to the nr entries of C.

[F2]

Cauchy-Schwarz inequality for L2: on a finite counting measure, ∥x∥1≤k∥x∥2 for a vector with k entries.

Proof

1.1givenF1F2algebra

Apply [F2] to each column cp of C: ∥cp∥1≤n∥cp∥2≤nB. Therefore every transformed one-body error satisfies ∣ΔHpq′∣≤ε2∥cp∥1∥cq∥1≤nB2ε2. With r2 entries, ∥ΔH′∥F≤rnB2ε2.

1.2givenF1F2algebra

Each transformed four-index error is bounded by ε4∏j∈{p,q,r,s}∥cj∥1≤n2B4ε4. There are r4 entries, so ∥ΔG′∥F≤r2n2B4ε4. The rank-two coefficient tensor (DpqDrs) has Frobenius norm ∥D∥F2≤M2.

1.3givenF1F2algebra

For a fixed entry Caμ, differentiating the two occurrences of C in H′ yields two sums. Each row of D or column of D has ℓ1 norm at most rM by [F2], while ∑b∣ΔHab∣∣Cbq∣≤nBε2. Thus each gradient entry from H has magnitude at most 2nrBMε2, and the Frobenius norm over nr entries is at most 2nrBMε2.

1.4givenF1F2algebra

Differentiating the four factors of C in G′ gives four sums. For each fixed slot, the sum over the other three basis indices is at most n3/2B3ε4 by [F2]. The remaining coefficient sum over the three orbital indices is at most r3/2M2: one row or column of D has ℓ1 norm at most rM and all entries of the other copy sum to at most rM. Including the factor 1/2 and four slots, each gradient entry is bounded by 2n3/2r3/2B3M2ε4. Multiplying by nr for its nr entries gives 2n2r2B3M2ε4.

2.1step 1.1step 1.2algebra

By finite Cauchy–Schwarz, the one-body energy error is at most ∥D∥F∥ΔH′∥F≤MrnB2ε2. Pairing (DpqDrs) with ΔG′ gives the two-body bound 12M2r2n2B4ε4. Adding them proves the energy estimate.

3.1step 1.3step 1.4algebra∎

The full gradient error is the sum of the one-body and two-body gradient errors. The triangle inequality and steps 1.3 and 1.4 give the claimed bound.

Depends on

Used by

Dependency tree · two levels

4 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources