Unequal supports give finite local approximation

A rounded projection can have a different integer dimension over each central label. Its columns consequently have different initial supports. They can still be quantized, completed and transported together. The resulting projection has the first finite local approximation property: it almost commutes with the prescribed operators, and their compressions lie close to a finite relative-commutant corner. The proof retains the whole variable frame.

We use the actual bounded central-flag frames in 73.2 and 73.5, polar completion in 54.1, factor quantization in 55.7, finite matrix corners and their tunnel application in 57.1, and finite alignment and the every-core converse in 57.3–57.4. All are fully written in the current course. Projection comparison, tracial expectations and their finite-stage convergence retain the precise programme providers declared there. No new relative norm-averaging theorem is assumed.

Throughout, is a finite-index inclusion of factors, with normalized trace . For an ordinary tunnel write , , , and for its actual core. Neither core algebra is assumed factorial or extremal. No separability is needed.

Completing a frame with different initial projections

Lemma 74.1. Let be a finite factor, projections, and . The projections may overlap or be zero. Suppose

Put , , and . There are partial isometries satisfying

for every contraction in any finite tracial algebra containing , with the same trace. In particular when .

Proof. Apply 54.1 to , with available range one. Its error is at most ; put . Suppose the first ranges are orthogonal and . Set

The capacity calculation uses the actual supports:

For , the off-diagonal Gram bounds give . Expanding , and using , therefore gives

For the second estimate the squared norms add, because the final projections are orthogonal; the sum bound displayed is a convenient weaker bound. Lemma 54.1 now completes on its entire initial projection. The triangle inequality proves the induction with

Indeed every , so ; the geometric sum proves the last inequality. This also covers . A zero initial projection has zero input and zero output. Finally expand the coefficient difference as . The norms of are at most one and that of at most , even if is outside . This proves 74.2.

The capacity condition is necessary: the orthogonal ranges have total trace . It does not require the initial projections to be disjoint.

Quantization preserves each support

Fix a stage , a finite set , projections , and bounded elements , . Suppose

The projections may be unequal; centrality and nesting are not needed in the following construction. The input provided by 73.5 does have nested central supports. Write and . Fix these frame constants before quantization.

Theorem 74.2 — exact variable-support transport. For any and any positive trace cap on the quantizing projection, there are a nonzero projection , partial isometries , a projection , a later stage , and a unitary , with the following properties. In the conjugated tunnel, belongs to its smaller core. Its trace and estimates are

Here is a finite-dimensional algebra with identity , explicitly constructed below. This is a projection supported on a variable matrix corner; no approximation to a single central projection is asserted.

Proof. Put . The identity is 53.1. Apply 55.7 with the factor , to all and , at tolerance , and with the additional cap . It gives one nonzero satisfying

Every and commutes with ; also and . The factor trace identity 55.6 gives

Apply 74.1 in the factor , at the absolute tolerance . This produces , with , and

The contraction estimate of 74.1 is valid in even though the polar completion took place in . The sum of the orthogonal ranges is a projection of trace .

For any projection that is the range sum of these columns, finite trace cyclicity gives

To check this, expand using ; its summands are the squared coefficient norms. Each actual coefficient has norm at most , since its right initial support is below . The factor trace identity gives . 74.11 and the difference of two squares bound the change of every squared norm by . Summing over coefficients and using 74.7 proves the second line of 74.8.

Choose, by 57.1 and its tunnel application, a later and matrix units , with identity and . They commute with . Inside the unital II₁ cup tail in , choose a projection of trace

The last equality is the factor trace identity for and . Both lie in . Choose with , . It commutes with every and . Set

Each term of is a projection, and the terms are orthogonal: the commute with all the matrix units. The projection commutes with , so is a projection in . To verify the two products of , first use and , obtaining . For the other product use and ; the result is . These computations retain the individual .

In particular is a partial isometry. Equal traces of the complementary projections in the factor extend it to a unitary . Then . The exact trace bookkeeping is

The first identity uses and . The second uses , . There is no missing identity to pad: itself is the reference support inside . When all , it is ; when the supports differ it generally is not of that form.

Put . Multiplication by is an injective *-homomorphism on , by . Thus is finite dimensional, with identity . Its trace-preserving corner expectation is

Indeed the right side is positive, unital on , fixes , and is bimodular over that algebra. For trace preservation, pair against , , and use traciality and the expectation pairing with . The scalar factor is essential.

For , the identity gives the exact expansion and comparison

Each coefficient difference is supported on the original . Conjugation by preserves its trace norm, and multiplication by preserves that norm on those supports. Distinct row/column blocks are orthogonal in . Consequently

The orthogonal projection property of 74.16 bounds by this distance. Conjugate by , take , and divide by . This proves the last line of 74.8. The permitted trace cap was arbitrary throughout.

The first local form for general cores

Theorem 74.3. Suppose one actual core satisfies the relative Følner criterion of 49.2. For every finite , every , and every , some tunnel has a stage and a nonzero projection , with , such that

Neither factoriality of either core, constant central multiplicity, nor a common support for its frame columns is required.

Proof. First take a finite unitary set , and put . By 73.2 and 73.5, choose one bounded finite-stage flag frame satisfying 74.7 with . Here is the tolerance justification: choose the rounded projection with every normalized defect less than ; its squared defect is then less than . In 73.5 choose the normalized energy error less than . The resulting nonnegative energies are less than . The frame length , its mass , its norm bound , and are now fixed.

Choose

Apply 74.2 with the extra cap . Its projection has , since , and

where is a contraction in . For the first bound 74.8 gives a squared ratio less than , whose square root is less than . The second follows from 74.20. All these choices precede selection of the finite matrix corner.

Use the conjugated tunnel, dropping its tildes. Since , the projections

satisfy , by the projection threshold estimate proved in 57.1. Also . For each fixed , in , because . Compression produces the candidate . Expanding once on each side, with contractions and , gives

Take large enough that , , , and every last expectation error is below . The normalized commutator is then less than , and the normalized compression distance less than . The corner expectation realizes this distance. This proves 74.19 for unitaries, with the prescribed cap.

For arbitrary finite , let . A self-adjoint contraction is the real part of the unitary . Apply this to the real and imaginary parts of every . Each is a linear combination of four unitaries, with total absolute coefficient at most . Perform the unitary construction at tolerance ; linearity and triangle inequality give 74.19 for all , on the same projection. For an empty set, use to obtain a nonzero capped projection.

Corollary 74.4. For a proper finite-index inclusion, the following are equivalent: relative Følner for one actual core; the finite local property 74.19 for all finite sets and positive tolerances; relative Følner for every actual core. One may also include the compatible relative hypertrace condition of 49.2.

Proof. Theorem 74.3 gives the first implication. The reverse implication to every core is precisely 57.4: its hypothesis is the first local form, consisting of a projection in and the two relative errors; it requires no BF or central-support conclusion. Lemma 57.3 places that finite pair in any prescribed core, and the projection/expectation calculation of 57.4 gives its relative Følner projection. The every-core condition implies the one-core condition. The equivalence with a compatible relative hypertrace is 49.2. These are exact existing proof dependencies, not a new assumption.

A variable diagonal support is transported without discarding any column.

Figure 74.1. The top panel records the overlapping initial supports and the orthogonal range capacity in 74.1–74.4. The middle panel gives the exact trace arithmetic of 74.13–74.15 for three illustrative supports , , , and . The numerical labels illustrate those identities; they do not specify a Jones tunnel with that exact finite-stage value of . The bottom panel distinguishes the proved finite local form from the still unproved common-central-support form. The schematic objects, domain and range are those in 74.14 and 74.19. Editable source. Human sources: Sorin Popa, Theorem 4.3.1, printed pp. 217–219, for the first local form and every-core converse; Theorem 4.2.2, pp. 213–214, for the rounding motivation; Appendix A.2.1, pp. 249–251, for polar completion. The unequal-support proof and constants are supplied above.

Examples and complete solutions

Exercise 74.1 — overlapping initial supports. In with normalized trace, take , , and , , . Verify the Gram relations and capacity. What happens if a fourth column has zero initial projection?

Solution. Direct multiplication gives . The initial traces are , with total . Their supports overlap, but the ranges are , which are disjoint. A zero initial projection forces the fourth input and its partial isometry to be zero. The range sum is unchanged. No division by the trace of that individual support is needed in 74.1.

Exercise 74.2 — unequal-support coefficient energy. For the columns in Exercise 74.1, let swap coordinates three and five, four and six, and fix all other coordinates. Compute the nonzero coefficients , their total squared norm, and 74.12.

Solution. The four nonzero coefficients are , , , and . Every matrix unit has squared norm , so the sum is . The permutation preserves . Thus the commutator is zero and the right side of 74.12 is . The coefficient entries are supported on their respective unequal initial projections.

Exercise 74.3 — exact variable reference support. Take three supports , with . For commuting matrix units with , and , compute . Which terms are retained in ?

Solution. Here , , and . The third diagonal term is zero. Factor trace pairing gives , and . The actual initial traces are . Their sum is the same ; there is no additional padded range. These are illustrative commuting-tensor trace data, not a claim about a prescribed Jones stage.

Exercise 74.4 — choose the tolerance after fixing the frame. In 74.20 take . Compute and the first upper bound for . Verify that satisfies both bounds. Why can be chosen before the later stage ?

Solution. We have and . The first bound is , and the second is . The proposed value is smaller than the first; it is also smaller than , which is below the second because . Both bounds depend only on the fixed frame and target tolerance. They do not depend on the later corner trace , its finite dimension, the chosen , or the tunnel stage containing the matrix units.

Exercise 74.5 — check the transport domains. Why is it necessary in 74.14 to use , rather than ? Compute using the support identities.

Solution. The actual initial projection of is . Its matching reference initial projection is ; the factor supplies exactly that projection. Expanding the product gives

Removing the individual supports would falsely identify the initial projection with . Its trace is generally larger than , so it cannot be the initial projection of the indicated transport to .

Exercise 74.6 — identify the exact conclusion. Does 74.19 give a projection near a single as in the second local form of 57.30? Does it nevertheless supply the hypothesis of 57.4? Explain both answers.

Solution. No central approximation was proved: is a finite-stage projection, and its unequal diagonal supports need not form a single common . Neither nor its matrix-diagonal counterpart made from the original flags is asserted central in the whole smaller core. The finite projection and its two relative errors are exactly the first local form required in 57.4. Thus the every-core Følner converse applies, while common-central-support BF and the second local form remain separate obligations.

Source credit and the remaining scope

Sorin Popa, Classification of amenable subfactors of type II, DOI 10.1007/BF02392646, Theorem 4.3.1, printed pp. 217–219, is the direct source for the first local approximation form (74.19) and the every-core converse. Theorem 4.2.2, pp. 213–214, supplies the rounding motivation, and Appendix A.2.1, pp. 249–251, supplies the polar-completion method. Lemma 74.1 permits different initial supports and uses their total trace capacity. Theorem 74.2 transports the variable diagonal projection exactly, and Theorem 74.3 proves the first local form for general actual cores from relative Følner.

Constant-multiplicity rounding/common-support BF, the second local form with a projection close to one central support, unrestricted global approximation and generating-tunnel implications, the full bicommutant equivalence, general represented/opposite models and corrected arbitrary-depth reconstruction remain assigned. The factorial specializations already proved in 58–60 are unchanged. The finite local theorem alone is not declared to close these stronger conclusions.

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