Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generated
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.

First-order error for two Pauli terms

Example

For the Pauli matrices X=(0110),Z=(100−1),Y=(0−ii0), the two-term Hamiltonian H=X+Z has first-order commutator bound t2/r. Also, for every λ≥0, the same fixed total matrix H=Z has the decomposition H1=λX, H2=Z−λX, whose commutator certificate grows with λ although ∥H∥=1.

Facts & Assumptions

Given: The displayed matrices as endomorphisms of C2 with its standard inner product ⟨u,v⟩=v∗u (linear in the first argument), real t, integer r≥1, real λ≥0, and tolerance ϵ>0.

[F1]

First-order commutator error gives ∥S1(t/r)r−UH1+H2(t)∥≤t22r∥[H1,H2]∥ for two terms.

[F2]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2 states ∥T∗T∥=∥T∥2.

[F3]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| defines the operator norm as the maximum over unit vectors.

Verification

1.1givenalgebra

In the standard inner product, direct conjugate transpose gives X∗=X and Z∗=Z. Matrix multiplication gives XZ=(0−110)=−iY and ZX=(01−10)=iY. Therefore [X,Z]=XZ−ZX=−2iY.

2.1step 1.1F2F3algebra

The same matrices give Y∗Y=I2. Hence [F2] and [F3] give ∥Y∥=1, and scalar homogeneity of the operator norm yields ∥[X,Z]∥=2.

3.1step 2.1F1algebra

Substituting H1=X, H2=Z and ∥[X,Z]∥=2 into [F1] gives ∥S1(t/r)r−UX+Z(t)∥≤(t2/(2r))2=t2/r. For the exact finite boundary t=0, both evolutions are I2 and the error is zero.

4.1givenstep 2.1F1F2F3algebra∎

For H1=λX and H2=Z−λX, both terms are Hermitian and their sum is Z. Direct multiplication gives Z∗Z=I2, and [F2]–[F3] give ∥Z∥=1. Bilinearity and [X,X]=0 give [H1,H2]=λ[X,Z], whose norm is 2λ by [step 2.1] and λ≥0. Thus [F1] gives the sufficient certificate λt2/r. To make this particular bound at most ϵ requires r≥λt2/ϵ when t≠0. For fixed t≠0 and ϵ>0, this threshold is unbounded as λ grows while the total matrix and its norm stay fixed; it shows that this error certificate cannot choose a uniform r from ∥H∥ and ϵ alone. It is not a lower bound on the actual simulation error.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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