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.
Projection comparison and unique normalized traces in finite factors
Statement
Assume AC. In a factor , any two projections are comparable by subequivalence. If has a faithful normal semifinite trace and , then if and only if , and equality means equivalence. Every nonzero corner of a diffuse factor is again a diffuse factor. If a diffuse factor is equipped with a faithful normal normalized trace, that trace is its unique normalized tracial state. Finite matrix amplifications of a II1 factor and all their nonzero corners are II1 factors.
Facts & Assumptions
Given: AC and the algebras, traces, Hilbert modules, and finite dimension hypotheses in the Statement.
AC is the global choice hypothesis. (The Axiom of Choice)
A concrete von Neumann algebra is a WOT-closed unital star-algebra; commutants are WOT closed and multiplication by a fixed bounded operator is WOT continuous. (Von Neumann algebras and commutants)
A faithful normal tracial state is positive, faithful, tracial, normalized, and WOT continuous on the operator unit ball. (States, tracial states and faithful normal traces on a von Neumann algebra)
Under AC, polar decomposition stays inside a von Neumann algebra, and any two nonzero projections in a factor have nonzero equivalent subprojections. No separability hypothesis occurs. (Polar decomposition inside a von Neumann algebra and nonzero partial isometries between nonzero projections in a factor)
Under AC, bounded Borel functional calculus supplies spectral projections, the star-homomorphism identities, the spectral norm estimate, and strong convergence for uniformly bounded pointwise convergent functions; all operators used below are bounded. (Borel functional calculus for bounded normal operators)
For a faithful normal semifinite trace , traciality gives for a partial isometry when these projection traces are finite, and positivity makes monotone on projections. (Given.)
Under AC, every nonempty poset in which every chain has an upper bound has a maximal element. (Zorn's lemma)
Proof
Given: The hypotheses of the Statement and the stated prerequisite contracts.
Use the canonical supplier: nonzero projections in a factor have nonzero equivalent subprojections, and polar decompositions stay in the algebra. By [F7], choose a maximal family of partial isometries with pairwise orthogonal initial projections under and pairwise orthogonal final projections under . Their strong sum is a partial isometry. If both and were nonzero, the supplier would give another nonzero partial isometry between them, contradicting maximality. This proves comparison. If , a witnessing partial isometry has initial projection and final projection , so [F6] gives . Conversely, suppose . If comparison gives , the conclusion already holds; otherwise . A witnessing partial isometry then has initial projection and final projection , so . Hence and ; faithfulness gives , so and are equivalent and in particular . If , the same argument applied to either subequivalence shows equivalence. Only finite-trace comparisons are used below; no claim is made that arbitrary infinite-trace projections in a nonseparable semifinite factor are equivalent.
For a corner , a nontrivial central projection would have , contradicting the canonical nonzero-corner supplier. The center has no nontrivial projections, so spectral calculus makes it scalar. A minimal projection in is also minimal in , since every subprojection of it belongs to the corner. This proves diffuseness. If has faithful normal normalized trace , every nonzero corner has faithful normal normalized trace . For a matrix amplification, commuting with all matrix units makes its center scalar when is a factor. It is diffuse: if it had a minimal projection , a nonzero corner linking to supplies a nonzero subprojection of equivalent to ; that would be a minimal projection in , a contradiction. Its matrix trace is faithful and normal by the finite sum formula, and every nonzero corner inherits the faithful normal normalized trace by dividing by its value at the corner projection. Thus the stated nonzero corners are II factors.
For uniqueness of trace, let be the faithful normal normalized trace supplied on the diffuse factor. First bisect every nonzero projection into equivalent halves. A maximal orthogonal family of pairs of equivalent nonzero projections under exhausts : a nonzero remainder splits into two nonzero projections, between which the canonical supplier supplies another pair. The sums of the first and second members are equivalent and sum to . Iterate to partition into equivalent projections. Every normalized tracial state takes value on each. For , choose with and let be the sum of the first pieces of this partition. The finite-trace comparison in step 1.1 gives . Hence every normalized tracial state satisfies . Letting gives ; the cases are immediate. Finite spectral step approximations give norm density of the linear span of projections in the self-adjoint part; positivity makes states bounded, so everywhere. No normality of is required.
Depends on
- The Axiom of Choice
- Von Neumann algebras and commutants
- States, tracial states and faithful normal traces on a von Neumann algebra
- Polar decomposition inside a von Neumann algebra and nonzero partial isometries between nonzero projections in a factor
- Zorn's lemma
- Borel functional calculus for bounded normal operators
Used by
Dependency tree · two levels
62 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
- Claire Anantharaman and Sorin Popa, An Introduction to II1 Factors (standard reference, not scraped)