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

Type checks: rays, density operators, mixtures, local quantities and outcome laws

Physical scope

Worked type checks on the smallest nontrivial instances of the framework's state and observable assumptions: a pure spin-one-half preparation as a unit ray and as a rank-one density operator, a statistical mixture of two orthogonal pure preparations, the action of a local observable on a product state of two spin factors, and the outcome law of a finite-spectrum observable as a probability measure. The item verifies the mathematical types of the adopted objects and makes no empirical claim.

Example

Check the mathematical types of the objects introduced by the postulates of this page on explicit finite-dimensional data: the two-dimensional complex Hilbert space H=C2 with its standard inner product and the orthonormal basis (e+,e−), the spin operators Si=ℏJi of Finite spin matrices for s=12, and the composite H⊗^H with the product vectors and local operators of Bounded tensor maps: extension, norm estimate, adjoint and commutation.

Facts & Assumptions

Given: The state postulate State and composition postulate P1: Hilbert spaces, preparations and composite systems, the observable and probability postulate Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes, the spin assignment of Identical-particle and spin assignments P6: permutation sectors and finite-spin representations, the Hilbert space C2 with orthonormal basis (e+,e−) and the operators Sz=ℏJz with Jze±=±12e± of Finite spin matrices, and the number conventions of Dimensions, SI unit conventions and quantity types of the framework.

[L1]

Density operators and their scalar laws: a density operator is a self-adjoint positive trace-class operator with trace one; finite orthonormal expansions ρ=∑nwnTun,un with wn≥0, ∑nwn=1 are density operators, and for a projection-valued measure E the assignment B↦tr⁡(ρE(B)) is a probability measure reducing to ∥E(B)ψ∥2 for the pure operator ρ=Tψ,ψ with ∥ψ∥=1 (Density operators and scalar spectral probability clauses (a) and (b)).

[L2]

Rank-one calculus: Tu,vx=⟨x,v⟩u is trace class with tr⁡Tu,v=⟨u,v⟩, so Tψ,ψ is a rank-one positive operator with trace ∥ψ∥2 (Density operators and scalar spectral probability, Rank-one operator calculus).

[L3]

Bounded tensor maps act on product vectors by S⊗T(ψA⊗ψB)=(SψA)⊗(TψB), and (S⊗T)∗=S∗⊗T∗; hence tensoring the self-adjoint Sz with I gives a bounded self-adjoint operator (Bounded tensor maps: extension, norm estimate, adjoint and commutation clauses (a), (c)).

[L4]

The spectral family of Sz is ESz({ℏ/2})=P+ and ESz({−ℏ/2})=P−, the orthogonal projections onto the lines Ce+ and Ce−, and σ(Sz)={ℏ/2,−ℏ/2} (Finite spin matrices clauses (a) and (e), Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes clause (ii)).

Verification

technique · direct; compute the objects on the displayed data
1.1givenL1L2algebra

Let ψ:=12(e++e−), so ∥ψ∥=1 by orthonormality. The pure preparation is the unit ray [ψ]={zψ:z∈C∖{0}}: the vector eiθψ has the same norm and defines the same ray, and the associated density operator Tψ,ψ satisfies tr⁡Tψ,ψ=∥ψ∥2=1 by [L2]; hence it is a density operator in the sense of [L1].

1.2givenL1algebra

Let 0<w<1 and let ψ1,ψ2 be orthonormal vectors of H, and put ρ:=w Tψ1,ψ1+(1−w)Tψ2,ψ2. By [L1] ρ is a density operator with tr⁡ρ=w+(1−w)=1; orthogonality gives ρψ1=wψ1 and ρψ2=(1−w)ψ2. Both eigenvalues are positive, so the range of ρ contains the two linearly independent vectors ψ1,ψ2; hence ρ has rank at least two and is not a rank-one operator Tφ,φ for any φ. The mixture of two orthogonal pure preparations is therefore a preparation of a different type from either component.

1.3givenL3L4algebra

On the composite H⊗^H consider the product state Ψ:=e+⊗e+ and the local observable Sz⊗I. By [L3] and the self-adjointness of Sz in [L4], this tensor operator is self-adjoint, and (Sz⊗I)Ψ=(Sze+)⊗e+=ℏ2 Ψ. On the product basis of H⊗^H, the spectral projection for ℏ/2 is P+⊗I, so the local outcome probability for {ℏ/2} is ∥(P+⊗I)Ψ∥2=1.

1.4givenL1L4algebra

For the state ψ=12(e++e−) the outcome law of Sz is B↦μψSz(B)=tr⁡(Tψ,ψESz(B))=∥ESz(B)ψ∥2. By [L4] the projections are P± onto the lines Ce±, so μψSz({ℏ/2})=∥P+ψ∥2=12 and μψSz({−ℏ/2})=∥P−ψ∥2=12. Thus the law is 12δℏ/2+12δ−ℏ/2 on the two-point set σ(Sz) and is not concentrated at a single outcome; its finite mean is 12(ℏ/2)+12(−ℏ/2)=0.

2.1step 1.1step 1.2step 1.3step 1.4algebra∎

Combining steps 1.1-1.4: rays, density operators, mixtures, local tensor actions and outcome laws of the adopted postulates all have the mathematical types claimed for them, and the displayed computations are the ones the definitions and lemmas give.

Remarks

  • The checks are internal consistency checks of the adopted types: they verify that the objects named by the postulates are of the claimed mathematical kind and that the displayed computations are the ones the definitions give. They assert nothing about any laboratory preparation and record no measurement.
  • The number conventions of Dimensions, SI unit conventions and quantity types of the framework enter only through the reading of the outcomes ±ℏ/2 as angular-momentum values and through the dimensionless character of the weights w, 1−w and of the ray parameter eiθ.

Depends on

Dependency tree · 2 levels

Sources