Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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.

A two-site TT truncation can increase energy after an exact solve

Example

Let ψ=223∣00⟩+13∣11⟩,H=I4−2ψψ∗. Take the initial state ∣00⟩ with rank-one open-boundary TT cores Gk(1,ik,1)=1{ik=1} for k=1,2, and run one width-two sweep with rank cap c1=1. The exact two-site solve returns the deterministically selected unit ground vector ψ with energy −1. The post-sweep rank-one TT rounding keeps the larger Schmidt term, returns the normalized state ∣00⟩, and raises the energy to −7/9, an increase of 2/9.

Facts & Assumptions

Given: The target state ψ, initial ∣00⟩ core list, Hermitian reflection Hamiltonian, and one width-two sweep with rank cap c1=1 specified above.

[F1]

Finite matrix-product states and Hermitian Hamiltonians: states use the Frobenius norm and a finite Hamiltonian input is Hermitian.

[F2]

Finite alternating tensor optimization with effective eigenproblems: an exact width-two update solves the full local Hermitian problem, then rank-cap rounding may be applied after the completed sweep.

[F3]

Finite Hermitian ground vectors and a deterministic tie rule: the exact ground rule projects standard basis vectors in order and returns the normalized first nonzero projection.

[F4]

Tensor-train rounding: TT rounding applies its exact truncated SVDs at the prescribed rank caps and records each discarded singular-value tail.

[F5]

TT discarded weights bound the post-sweep DMRG energy increase: when the total TT tail τ<1, the energy increase from the unrounded exact-sweep output to the normalized rounded output is at most 4∥H∥opτ.

Verification

1.1givenF1algebra

The squared norm of ψ is 8/9+1/9=1. Since ψψ∗ is the orthogonal projection onto span⁡{ψ}, Hψ=−ψ and Hx=x for every x⊥ψ. Thus H is Hermitian, its unique ground energy is −1, and ∥H∥op=1. Also EH(∣00⟩)=1−2(8/9)=−7/9.

2.1givenF2F3F4step 1.1algebra

The width-two center spans all four coordinates, so Heff=H. Its ground eigenspace is span⁡{ψ}, and its ground projection sends ∣00⟩ to (22/3)ψ; [F3]'s rule therefore returns exactly ψ. The backward pass leaves it unchanged. Reshaping ψ into a 2×2 matrix gives diag⁡(22/3,1/3); its singular values are distinct and ordered as written, so rank-one rounding in [F4] retains (22/3)∣00⟩, records discarded tail τ=1/3, and after normalization gives ∣00⟩.

3.1F5step 1.1step 2.1algebra∎

The rounded energy is the value from step 1.1, so its increase from the exact-sweep energy is −7/9−(−1)=2/9>0. The bound in [F5] permits at most 4⋅1⋅(1/3)=4/3, which indeed exceeds 2/9. This exhibits a possible post-truncation increase while satisfying the discarded-weight estimate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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.