Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Consistent finite classical laws define a quasilocal C-star state

Statement

Let q≥1 and, for every N≥1, let μN:{1,…,q}N→[0,1] satisfy ∑x∈{1,…,q}NμN(x)=1. Assume consistency under deleting the last coordinate in the explicit sense that, for every N≥1 and x∈{1,…,q}N, μN(x)=∑j=1qμN+1(x,j). For a local matrix A∈AN, N≥1, define ωN(A)=∑x∈{1,…,q}NμN(x)Axx. For each N≥1, if f:{1,…,q}N→C and Df is the diagonal matrix with entries (Df)xx=f(x), then ωN(Df)=∑xμN(x)f(x). This rule extends uniquely from the local algebra Aloc to a state on its norm completion A of Quasilocal completion of finite matrix registers. The theorem constructs a classical diagonal state; it does not say that every state on A is diagonal or classical.

Facts & Assumptions

Given: Consistent probability laws μN and the local embeddings in Quasilocal completion of finite matrix registers.

[F1]

Quasilocal completion of finite matrix registers: each local matrix has a well-defined operator norm, the embeddings preserve it, and Aloc is dense in its C*-completion.

[F2]

States and positive functionals on a C star algebra: a state is a positive bounded linear functional of norm one.

[F3]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: the inner-product pairing obeys ∣⟨u,v⟩∣≤∥u∥∥v∥.

Proof

1.1givenF1algebra

Under the inclusion A↦A⊗Iq, the diagonal entry at (x,j) equals Axx. Consistency of μN+1 says ∑jμN+1(x,j)=μN(x); substituting this identity into ωN+1(A⊗Iq) gives ωN(A). Hence the rule is well-defined on the union of positive-length local matrix algebras. Define ω0(cI)=c on A0=CI. It agrees with the N=1 formula because ∑xμ1(x)=1. Each ωN is linear, and these identities show the rule on the full union is linear and satisfies ω(1)=1.

2.1givenF1F3step 1.1algebra

For a local matrix A, positivity of the weights gives ∣ωN(A)∣≤∑xμN(x)∣Axx∣≤∥A∥ because ∣⟨Aex,ex⟩∣≤∥A∥ by [F3], and the same marginal calculation makes the functionals consistent. Thus ∣ω(A)∣≤∥A∥ on Aloc. If An is a norm-Cauchy sequence of local matrices, (ω(An)) is Cauchy; define its limit to extend ω. The bound proves independence of approximating sequence, linearity and continuity, and density makes the extension unique.

3.1givenF1F2step 2.1algebra∎

If An→A in norm, then An∗An→A∗A by continuity of multiplication and adjoint in the C*-norm. For local An, its diagonal entries obey ⟨An∗Anex,ex⟩=∥Anex∥2≥0, so ω(An∗An)≥0. Passing to the limit shows positivity of the extension. Its norm is at most one by step 2.1 and at least one because ω(1)=1 and ∥1∥=1. Hence it is a state by [F2].

Depends on

Dependency tree · 2 levels

Sources