Local corners can approximate the whole inclusion

A useful local approximation has a support projection. To cover the whole algebra, we need the same local theorem inside every nonzero corner, including corners of irrational trace. We prove that heredity by retaining the projection in a binary matrix union along a new tunnel. Right-action averaging then gives a hypertrace with positive mass on the exact corner Hilbert space.

Orthogonal local errors can consequently fill the unit. A finite selection produces a commuting square, and its separate local tunnels can be placed inside one core. This proves finite global approximation from the relative Følner hypothesis with a factorial larger core. The finite approximation and relative matrix property require no separability assumption. Simultaneous tensor absorption additionally assumes separable predual, as does its provider theorem.

The human source is Sorin Popa, Classification of amenable subfactors of type II, Proposition 3.2.4(ii), Theorem 4.3.1 and Section 4.4, printed pp. 208–209 and 217–222. Theorem 4.1.2 separately imposes separability on its generating-tunnel formulations. Our corner proof uses a newly retained binary factor and operator averaging. It does not use the unrestricted deletion of a prescribed infinite factor refuted in Transported cups realize a smaller core.

We use Proposition 2.9 of Measuring an inclusion through modules and corners, Theorem 4.5 of Going up and down the Jones tower, the inherited-trace extension argument in Finite-index tunnels without finite depth, Theorem 49.2 of Relative hypertraces and finite Følner projections, Theorem 50.4 of A common tensor factor in a core inclusion, Lemmas 52.1–52.2 of Changing a core changes its canonical trace by n², Theorems 57.2–57.4 of Supported frames give local approximation corners, and Corollary 58.8 of Full support from a factorial larger core. Projection prescription, comparison, full-corner commutants and product-trace completion keep their precise programme providers declared in these lessons.

Throughout, is a proper finite-index inclusion of II₁ factors, , with normalized trace . Some Jones core satisfies the relative Følner criterion of Theorem 49.2, and is a factor. Write , for tunnel levels, and , . Corollary 58.8 gives the full-support bounded-frame property BF₁; Theorem 57.4 gives the relative Følner criterion for every core.

Retaining an arbitrary projection in a tunnel

Lemma 59.1. For every projection , a new tunnel admits increasing unital matrix factors such that

The algebra is a hyperfinite II₁ factor. The new core inclusion is trace-preservingly isomorphic to the old one; in particular its larger member remains a factor.

Proof. At stage , maintain the matrix decomposition

Here is a projection in the complementary II₁ factor, and the residual term is omitted when zero. At , take , .

If the normalized complementary trace of is at most , prescribe a trace- projection containing it. If the trace is larger, prescribe such a projection below it. Comparison supplies matrix units for this projection and its complement. They generate a unital in , refining to . The residual occupies one of the two refined cells; all other cells are full or empty. Under the standard matrix decomposition its diagonal coefficient is a projection in the new complementary factor. Thus (59.2) holds at . At zero or unit residual, use any such refinement and omit the residual.

Choose a next predecessor . Put a unital in and conjugate it to by a unitary in . Two finite matrix embeddings in a II₁ factor are unitarily conjugate: match their equal-trace diagonal projections by comparison and then match their matrix units. Now . Inside , choose a unital , and conjugate it to the refinement just constructed by a unitary in . The resulting predecessor contains . In its -complementary factor, prescribe a projection of the residual trace. Conjugate it to the actual residual coefficient by a unitary in . The final predecessor contains both and .

Every correction lies in , so it fixes earlier cups. Theorem 4.5 allows exactly this rotation of the continuation. Iterating gives (59.1): future lie in earlier , and earlier are retained. The projections converge to in , so . The compatible product trace identifies the matrix union with the binary tensor union. Its inherited-trace completion is the hyperfinite II₁ factor.

For core comparison, each correction commutes with the current earlier relative commutants. The conjugation maps on those relative commutants therefore stabilize exactly. Their compatible maps and inverse maps identify the increasing unions, preserving norm and trace. The inherited-trace Hilbert completion extends the identification normally, by the argument of lesson 29. It preserves the smaller union too, whether or not that closure has a center. No convergence of the conjugating unitaries is needed.

This lemma retains a factor specially built around . It asserts no deletion theorem for a previously specified infinite factor.

Averaging operators before using a singular state

Let be the retained core and put

Write and . The latter is an opposite-algebra representation. Because lies in every tunnel level, it commutes with .

Also . Indeed, on , right multiplication by commutes with right , so belongs to . The canonical commuting-square extension of Lemma 52.2 sends to , for . Lemma 52.1 gives , so this extension is actual right multiplication on . It commutes with left .

Lemma 59.2. There is an -compatible -hypertrace on satisfying, for every nonzero retained as above,

Proof. Theorems 57.4 and 49.2 provide a compatible hypertrace for this core. Average conjugations on by the compact unitary group of , with normalized Haar measure; call the map . Each map is unital completely positive and -bimodular, fixes , and commutes with , by expectation bimodularity.

Take a point-ultraweak cluster map in the product of the bounded operator balls. Positivity at every matrix level, unitality and bimodularity pass to the limit. Normality of makes its commutation relation pass too. Thus

For the last identity, every finite average of remains in the weakly closed factor . A cluster value commutes with every fixed , since all later averaging algebras contain it. Operator commutation extends to their strong closure, making the value scalar. Each average preserves the normal trace of , and that trace is ultraweakly continuous. The scalar is therefore .

Put . Equation (59.5) gives compatibility, centrality and trace restriction, with no normality assertion for either or . Since commutes with , the positive functional on is tracial. Its mass is . Uniqueness of the tracial state on a II₁ factor, including among singular states, makes it . Evaluation at gives .

The strong density of the matrix union would not extend invariance of a singular state to all of . The proof instead averages operators, uses the normal finite trace to determine their limit, and only then composes with the state.

The actual corner Jones projection

Lemma 59.3. The Hilbert space is the standard space of , with normalized trace . The compressed canonical pair is

Here is the Jones projection for , and the restriction of the old canonical trace is already the corner canonical trace.

Proof. The unitary from to sends to . Since the factor commutes with , trace factorization gives

Multiplication by is consequently faithful on , and identifies with that factor, with unit . The same trace identity holds for .

For , and . Hence , and is the projection onto the closure of in . Cyclicity on the finite -ideal gives , proving (59.6).

For the larger algebra, is the commutant of right . Its compression by is the commutant of that right action on , where it is exactly right . The standard commutant description of the basic construction gives .

For the smaller algebra, first compress on by the corresponding two-sided projection. The same commutant argument gives . The normal canonical isomorphism of Lemma 52.2 sends the two-sided projection to , as the right-action calculation above shows. It sends this compressed algebra to its canonical extension on : indeed in linear span, because and commutes with . Its Jones projection extends to the operator already computed. This proves the smaller equality.

For , direct cyclicity gives

The first identity identifies the trace on the full Jones corner with the normalized trace of . Full-corner trace uniqueness makes canonical; its smaller restriction is canonical too. The second map is the trace-preserving expectation, by bimodularity and . No additional scalar trace rescaling is required.

Every nonzero corner has the local theorem

Theorem 59.4 — corner heredity. For every nonzero , the index- inclusion has a factorial larger Jones core satisfying the relative Følner criterion. It has BF₁ and both local forms of Theorem 57.2.

Proof. First check the corner index. On , the dimension trace for left has total mass . Its restriction to right is , by factor trace uniqueness. Therefore has -dimension . Algebra compression by left , using Proposition 2.9, divides this by . Thus

Choose the retained tunnel of Lemma 59.1. Every level contains , and every cup commutes with . Its compressed cup has expectation onto the compressed middle factor. Theorem 4.5 recognizes the compressed triple, with predecessor .

Generation can also be checked directly. In that predecessor choose finitely many partial isometries with : split the unit into pieces of trace at most , and compare them with subprojections of . Inserting this sum in a spanning word , and using , gives

Full-corner commutant lifting gives

For a direct lift, choose with . If commutes with , put . Inserting that partition of the unit shows that commutes with , since every coefficient belongs to . Also , because belongs to that corner and commutes with . Conversely compression of an original commutant element plainly commutes with the corner. This proves (59.11).

The core closure is therefore . Its smaller intersection is : if , then , and faithfulness of multiplication by on forces .

Use the state on . It has mass one by (59.4), is -compatible by (59.8), and centralizes . For , its represented left action on is , and

Theorem 49.2 gives relative Følner for this actual corner core. Its larger member is a factor, so Corollary 58.8 gives BF₁ and both local forms. There was no restriction on .

Lemma 59.5 — finite corner lifting. If a whole tunnel retains through length , any corner tunnel of that length for can be realized by a whole tunnel retaining .

Proof. Lemma 57.3 in the corner gives identifying its finite levels with the compressed whole levels. Extend it to , and conjugate the finite whole tunnel in the required direction. A corner tail projection then belongs to the whole tail, and (59.11) identifies its local relative-commutant algebra exactly. This is a finite alignment only.

Filling the unit by orthogonal local errors

Lemma 59.6. Let be a projection, , and let be a block sum on orthogonal local supports summing to . If and , put and define

Then in , and

Proof. The - block of is zero, whereas . Inside , the three remaining blocks are , , and . They are pairwise orthogonal. The latter two, with opposite signs, are exactly the commutator . This proves both assertions for arbitrary, possibly non-self-adjoint .

Proposition 59.7 — finite piecewise squares. Given finite and , there is a unital finite-dimensional algebra such that is an algebra, is a commuting square inside , and

Proof. Fix . Consider families of orthogonal nonzero projections , with a finite tunnel for each, and candidates

Order families, including their fixed candidate data, by inclusion. The empty family qualifies. An orthogonal family is countable by faithfulness of the finite trace, regardless of separability of . Its candidate sum is bounded by and converges in . Chain unions retain the bound by increasing support convergence and convergence of block sums. The non-strict inequality in (59.16) makes this passage valid. Zorn's lemma gives a maximal family.

If , Theorem 59.4 gives BF₁ in . Its second local form supplies , lying in a finite corner tunnel tail, and the conditional expectation candidate , with

To obtain the ambient bounds, multiply both normalized corner inequalities by . The candidate is a contraction relative to . Lemma 59.5 lifts the finite tunnel. Lemma 59.6 gives a new orthogonal increment of squared norm less than . Adding it preserves (59.16), contradicting maximality. Hence .

For a finite subfamily , let , , and . If is the full maximal error, put . Then

The first error removes the residual block orthogonally from . Adding back is another orthogonal sum, and . We need no separate version of (59.16) for every finite subfamily.

Put , , and choose finite with . Then define

Omit a zero residual summand. Each support lies in , and ; hence , an actual algebra. On , the restriction of is , so . Taking adjoints gives . This is the commuting square. Equation (59.18) gives squared distance below . Orthogonal expectation realizes that distance, proving (59.15).

One core can contain the piecewise square

Theorem 59.8 — finite global approximation. For every finite and , some tunnel and finite stage satisfy

Proof. Take the piecewise square at tolerance . Extend its finitely many tunnels to a common length , retaining . At each new level, prescribe a projection of trace in a chosen predecessor and conjugate it to by a unitary in the current smaller factor. Earlier cups and the original local algebra stay fixed.

Take any whole tunnel through , choose a partition in its factor with traces and the residual trace, and conjugate the whole finite tunnel by a unitary in sending that partition to the actual supports. Inside each support, Lemma 57.3 identifies this compressed tunnel with the corresponding . Sum the finitely many corner unitaries and the residual unit. The resulting whole tunnel contains every in , and (59.11) puts every original local algebra in .

Choose an infinite continuation. Its later Jones-cup tail contains a unital II₁ factor , lying in the future core, by the faithful tail construction in Theorem 11.5 and Lemma 52.1. In , prescribe a partition of the same traces as the support partition. A unitary sends it to that partition. Rotate only the continuation beyond by . It fixes , since , and the new core contains both and all . Thus it contains exactly, including the scalar residual summand.

Expectations onto the increasing finite-stage converge in on this core. Choose one late approximating all the finitely many at tolerance . The candidate is then within of . Best approximation by proves (59.20).

This is the finite global implication under our larger-core factorial hypothesis. Its construction does not prescribe an arbitrary pre-existing tunnel prefix, so it does not yet establish a generating tunnel.

Corollary 59.9. The inclusion has the relative matrix property of Definition 50.2, without separability. If has separable predual, it has simultaneous trace-preserving absorption

Proof. In every support corner , choose a unital . It commutes with the corresponding local algebra. Choose another in when the residual is nonzero. Summing corresponding matrix units gives unital matrix units commuting with all of . Consequently

Arbitrarily accurate piecewise squares prove the relative matrix property. If has separable predual, so does , and Theorem 50.4 gives (59.21). Its countable tensor construction is not applied to a nonseparable factor.

Retained binary cells, two-sided compression, and orthogonal patching errors

Figure 59.1. The first panel uses exact trace coordinates for ; its outlined residual cell shrinks while containing the entire remaining projection. The second panel is the finite operator prototype with rank-three ; its nine-cell support has normalized Hilbert trace , whereas the rescaled Jones projection has ordinary trace one. The third panel shows the row and column supports that make the old and new errors orthogonal; block sizes are schematic. Proof locators: (59.1)–(59.8) and (59.13)–(59.18). Reproducible source: corner-heredity-and-global-patching.py.

Examples and solved exercises

Example 59.10. At , the first three filled-cell counts are , with traces . Their residual complementary traces are , , . The support-state mass is , the Jones multiplier is , and the corner Jones trace is one. Irrationality changes none of the heredity argument.

Exercise 59.1 — introductory. For , compute the filled-cell count and the complementary residual trace at stage four. Compute the squared error of the filled-cell approximation.

Solution. Since , the filled count is . The filled trace is , and the residual coefficient has trace . Thus

The residual projection stays in one cell of trace , rather than being discarded.

Exercise 59.2 — intermediate. On , let be diagonal of rank three and the identity-vector projection. Calculate the rank of , the nonzero eigenvalue of , and the traces of and .

Solution. The orthonormal matrix units are . The support consists of the nine units with , so its rank is nine and its normalized Hilbert trace is . The identity vector has equal coefficients on the six diagonal units; its compressed squared norm is . Therefore is rank one with eigenvalue and ordinary trace . Multiplication by two makes a projection of ordinary trace one. These are finite operator calculations, not an assertion that is a proper II₁ pair.

Exercise 59.3 — intermediate. Why does , rather than ? Explain the state normalization and canonical-trace normalization in the corner.

Solution. Operator averaging gives . The functional is positive and tracial on the factor , hence equals . Its value at is . Thus the state on is divided by . Separately, gives and , so . The old canonical trace already has the correct corner normalization and is not divided by .

Exercise 59.4 — advanced. In with normalized trace, let be the diagonal rank-two supports on coordinates , , . Put . Let have entries , and all others zero. Use in (59.13). Verify both orthogonality identities exactly.

Solution. The old error has only entry , so . The new diagonal error has entries , so its squared norm is . The new cross blocks have entries , whose summed squared norm is ; these are the two commutator entries, with one sign reversed. Hence

The distinct matrix positions prove orthogonality without assuming that is self-adjoint. This example checks an identity; it asserts no small-tolerance hypothesis.

Exercise 59.5 — intermediate. Suppose for every target and . With , how small a residual trace suffices in Proposition 59.7? Give its numerical error bound.

Solution. Here . A residual trace below

suffices. Equation (59.18) then gives squared error strictly below

Thus the error is below . The finite candidate need not itself satisfy the trace-weighted maximal-family bound; the orthogonal removal of the residual block provides the estimate actually used.

Exercise 59.6 — advanced. Distinguish the three conclusions: finite global approximation, simultaneous tensor absorption, and existence of a generating tunnel. State exactly which are proved here and which assumptions they use.

Solution. Theorem 59.8 proves approximation of every finite set by a finite higher relative commutant of some tunnel, from relative Følner and a factorial larger core, without separability. Corollary 59.9 proves the relative matrix property with the same assumptions; simultaneous absorption uses the additional separable-predual hypothesis of Theorem 50.4. A generating tunnel needs one coherent continuation for a dense sequence, with earlier approximation stages retained. Theorem 59.8 alone does not prescribe a pre-existing prefix. Approximation can preserve every chosen tunnel prefix, Theorems 60.4–60.5, supplies the required higher-inclusion comparison and coherent continuation, with separability for generation. No general nonfactor-core rounded input is established by these results.

The remaining work includes general nonfactor-core rounding and BF existence, smooth-representation and full bicommutant equivalences, the full represented/opposite-model trace comparison, and the corrected existential reconstruction at arbitrary depth. The prescribed-prefix and separable generating-tunnel results are now proved in lesson 60. The complete course remains in progress.

Written by OpenAI with Ultra reasoning effort, October 2026. Self-checked by the writing AI. Public domain (CC0).