Sources and proof status

These independently written chapters cite the human mathematics they use. Referenced books and papers are not reproduced in the download. The course remains incomplete.

Finite-trace proof comparisons

• Takesaki, Theory of Operator Algebras I, 1979 edition: III.2.14, III.3.6–3.11, III.5.4, IV.5.4, V.1.37–1.38 and V.2.2–2.4.
• Blackadar, Operator Algebras, revised author edition, 8 February 2017: III.1.1 and III.2.1.5. Author edition.
• Van Neerven, Functional Analysis, version 7, 17 July 2025: 4.7–4.9, 4.32–4.33, 4.50 and 5.1. Source edition.
• Namioka–Asplund, A geometric proof of Ryll-Nardzewski’s fixed point theorem, 1967, pp.443–445.
• Anantharaman–Popa, An introduction to II1 factors, author draft: 4.1.3, 6.1.3, 8.6.1 and 11.2. Author draft.

Hypertrace source context

Popa, Classification of amenable subfactors of type II, Acta Mathematica 172 (1994), Definitions 3.1.1–3.1.2 and Theorem 4.2.2. Project Euclid.

Finite partition and singular-state proofs

Popa’s Theorem 4.4.1(1), printed p.222, is retained with its full hypotheses and finite whole-tunnel partition conclusion. The exact approved source’s pp.209–210 and220–222 were compared. The new positive-monoid completion, overlap and bounded singular-state arguments are independently written. They prove their stated criteria and estimates; the general amenability implication remains open.

Compatible states and actual operator transfer

The new state-selection reading proves a compact minimum and exact operator-order dual, finite preservation tests, exact compatibility and uniform centrality estimates, and the corrected expectation in a singular state’s GNS representation. The budget reading constructs full finite supports with optimal physical movement, proves a dimension-free pinching bound and actual finite operator-transfer certificate, and preserves the actual smaller core center under compatible tunnel and corner operations. Both include complete solved exercises. The remaining general amenability implications are explicit.

Physical transfer and corner depth

The new tail-support reading retains fixed physical target candidates while forming finite full whole-tunnel cells under the stated near-cover hypothesis. Its whole-support compression uses two distinct traces and proves a strict same-depth obstruction. An explicit standard-space unitary realizes the tensor Jones example; a rank-two compression illustrates a retained factor with no ordinary finite tunnel depth. Both exercises include full solutions. General amenability has not supplied the stronger tail near-cover.

Finite reflected-tower source comparison

The finite reversed-commutant, coherent tower and skipped-level arguments in the reflected-trace reading use the complete module comparison, common compression and Jones recognition proofs. Their exact human source comparison is Popa (1994), section 1.3.1–1.3.2. The mathematical arguments and seven solved exercises are preserved. This source comparison concerns those finite statements and leaves broader prerequisite checks explicit.

State averaging and the remaining spectral endpoint

The actual transfer preserves compatibility and the physical trace. Positive finite averages have explicit centrality bounds; a proved norm return from the state completion supplies states on the original algebra. The entire bounded domination class has least cost equal to the lower endpoint of the fixed-algebra cost spectrum. A genuine minimizer has scalar ergodic cost. These complete arguments retain the original larger expectation and do not imply that averaging preserves an initially small cost. General amenability forcing zero remains unproved.

Common-center variance and actual corner tunnels

The actual compatible-state transfer has the completed common-center fixed algebra. Its original cost has zero lower spectral endpoint exactly when the conditional variance does, with complete norm return to the original algebra. The energy inequality is stated for selfadjoint vectors. Separately, actual corner maps retain both traces and marked cups. The index-nine tensor example satisfies amenability in every smooth representation and shows that arbitrary exact block retention cannot hold at any depth. Explicit odd-stage completions approximate fixed targets. Actual approximate corner chains with the stated physical error budget give full finite partitions; deriving those chains from unrestricted amenability remains open.

What the checks cover

The trace existence, hyperfinite corner, cup-tail, normal hypertrace component, finite residual completion, singular Jones-ideal/entropy, compatible-state selection and whole-tunnel budget-transfer readings have complete written proofs at their declared scope, with source comparisons, solved exercises and reader checks. Each chapter retains its precise prerequisite locators. A checked range does not certify every theorem or citation in a prerequisite file.

The full seven-condition compactness theorem for arbitrary predual functionals remains programme mathematics. The positive trace proof is an additional route; it does not remove or complete the broader theorem.

Original exposition and figures are dedicated under CC0 1.0. MathJax glyphs retain Apache 2.0; see third-party notices. Source access does not grant permission to reproduce protected expression.