Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

A matrix amplification gives an explicit finite-index II1 inclusion

Statement

Assume AC as inherited from the II1 factor and finite-index suppliers. Let (P,τP) be a II1 factor with faithful normal normalized trace and let k≥2. The inclusion N=P⊗1⊆M=P⊗ˉMk(C) with trace τP⊗tr⁡k has expectation EN=idP⊗tr⁡k, is extremal, has frame uab=k(1⊗eab) for 1≤a,b≤k, and has index [M:N]=k2. Its first basic construction has trace τ1(xeNy)=k−2τ(yx).

Facts & Assumptions

Given: A II1 factor (P,τP), an integer k≥2, the local frame and basic-construction results, and matrix units eab in Mk(C).

[F1]

A finite-index subfactor data package defines the right-module inner product by ⟨x,y⟩N=EN(x∗y) and index as the module-frame trace. (Finite-index extremal II1 subfactor data)

[F2]

A coordinate Parseval frame has index equal to the sum of the normalized traces of its inner products. (Ordinary finite Jones index supplies a bounded finite Parseval frame)

[F3]

The first basic-construction trace satisfies τ1(xeNy)=[M:N]−1τ(yx). (Ordinary finite-index II1 inclusions give the full Jones tower and Temperley–Lieb relations)

[F4]

In the specified coordinate model, the unnormalized module trace of T is ∑jτN(⟨uj,T(uj)⟩N). (Ordinary finite-index II1 inclusions give the full Jones tower and Temperley–Lieb relations)

[F5]

Polar decomposition of a bounded operator in a concrete von Neumann algebra has its partial isometry in that algebra. (Polar decomposition inside a von Neumann algebra and nonzero partial isometries between nonzero projections in a factor)

[A1]

AC is inherited from the tracial, finite-index module and full Jones-tower suppliers. (The Axiom of Choice)

Proof

Given: N=P⊗1, M=P⊗ˉMk, and the normalized matrix trace tr⁡k(eab)=δab/k.

1.1A1F1F5givenconstruct

For x=[xab]∈Mk(P), EN(x)=k−1∑axaa⊗1. If x≥0, each diagonal compression xaa is positive, so this sum is positive. The formula makes EN unital, fixes N, is N-bimodular, and preserves the product trace; its finite sum of normal diagonal maps is normal. If EN(x)=0 for x≥0, then τM(x)=τN(EN(x))=0, so faithfulness of τM gives x=0; hence EN is faithful. An element ∑c,dpcd⊗ecd commuting with every 1⊗eab must be p⊗1, and commuting also with P⊗1 forces p∈Z(P)=C1; thus M is a factor. It has no minimal projection: if q∈M were minimal, some diagonal corner r=(1⊗eii)q(1⊗eii) would be nonzero. Its support projection s in the diffuse factor P⊗eii is nonzero. The polar decomposition of q(1⊗eii) lies in M by [F5] and gives a partial isometry from s onto a nonzero subprojection of q. Since P has no minimal projections, choose 0<t<s; its image under that partial isometry is a nonzero proper subprojection of q, a contradiction. Thus M is a II1 factor; N≅P is one as well.

1.2A1F1F2givenalgebra

For matrix units, uab∗ucd=k 1⊗ebaecd=kδac(1⊗ebd), so EN(uab∗ucd)=δacδbd1. Thus the k2 vectors are orthonormal as a right N-module frame. More generally, for x=∑c,dxcd⊗ecd, EN(uab∗x)=k−1/2xab⊗1, and hence ∑a,buabEN(uab∗x)=x. These coordinates identify X isometrically with Nk2, so it is complete with projection model p=1k2; the inner-product traces sum to k2, and [F2] gives index k2.

2.1A1F1F2F4step 1.2algebra

An element ∑c,dpcd⊗ecd commutes with every p⊗1 exactly when each pcd is central in the factor P, hence when it lies in 1⊗Mk. On the right action of this relative commutant, [F4] gives unnormalized module trace ∑a,bτN(EN(uab∗uab(1⊗ecd)))=k 1c=d. Indeed ebaeabecd=1b=cebd, whose normalized matrix trace is 1b=c=d/k, the scalar factor k in uab cancels the normalized matrix trace 1/k, and the sum over a has k terms. Dividing by λ=k2 gives 1c=d/k=tr⁡k(ecd), so the right-action module trace and τ agree on N′∩M; the inclusion is extremal.

3.1A1F3step 1.2step 2.1algebra∎

Applying [F3] with λ=k2 gives τ1(xeNy)=k−2(τP⊗tr⁡k)(yx) for every x,y∈M. This is the claimed trace normalization.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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