General tail supports and controlled tunnels

We construct the larger-depth full corner inside an actual ordinary tunnel, compute both of its support traces, and retain the old physical operators after cutting. We then prove an exact criterion for replacing a whole-stage cell by a tail-supported cell through an actual corner tunnel. Exact retention of the entire selected finite block can fail at every finite length, even in an explicit amenable tensor inclusion. Controlled approximation in that same physical corner supplies a valid quantitative return. The unrestricted finite-partition theorem remains unproved by these constructions and is not refuted.

The original finite-partition theorem

Popa4.4.1(1), printed p.222, assumes an amenable proper finite-index inclusion of II₁ factors. For every finite and , it asserts unital finite-dimensional , , satisfying

and a finite orthogonal partition , with an individual actual whole-inclusion finite tunnel for every cell, such that

The source prints the first expectation order; its adjoint gives the other. Orthogonality follows from the projection sum, as in FP.0–FP.1. No separability, finite depth, extremality, factorial core or unique norm trace is added. A common stage, retention of an arbitrary ordinary prefix and generation are separate obligations. The original residual must be covered by finitely many actual cells, not left as an arbitrary finite-dimensional summand.

Popa's §1.3.2 states the skipped basic construction; the complete finite representation proof is 14.1–14.2 and 14.8. The preceding §4.4 argument selects supports in tail factors, compresses their tunnels and uses actual corner-tunnel uniqueness. Its unrestricted finite-partition statement does not identify the whole-stage supports of 76.2 with tail-factor supports. OT.1 gives the finite completion once an actual tail-supported near-cover is available. We examine the missing change of support class.

Earlier proofs used in this reading

Proof scope Earlier reading
1.2, actual basic construction and strong generation The projection and basic construction
2.1, 2.4 and 2.9, module restriction, two local traces and common compression Module dimension and local index
4.4–4.5, actual downward construction and finite marked uniqueness Towers and tunnels
14.1–14.2 and 14.8, finite reflected representations and skipped triples Reflected traces and uniform bounds
53.1, both expectation orders Bounded frames with central support
57.3, finite marked tunnel alignment Actual supported local approximation
61.1–61.2, complete nondegenerate expected and smooth representation definitions Smooth representations and tower compression
76.2–76.4, whole-stage near-covers and exact residual scope Whole relative-commutant blocks
OT.1–OT.2, finite tail-family return and both whole-support traces Tail supports and compressed tunnel depth
FP.0–FP.1, the original full finite-partition scope Finite residual cells and canonical overlap
HB2.1–HB2.3 and WT2.1–WT3.1, complete state extension and dual compactness Finite algebras and normal traces: supporting proofs

A full-corner identity, with its actual maps

Lemma GTB.1 — common-corner comparison. Let be II₁ factors of finite index , and a projection. Common compression gives . If is its canonical Jones tower, then , with projections , is its canonical common-corner tower. On every higher relative commutant the map

is a normal unital trace-preserving *-isomorphism. It carries the actual Jones projections to their common compressions and commutes with the inherited expectations. The same assertion holds for rectangles of this tower when belongs to their smaller factor.

Proof. Right compression of by multiplies its left- dimension by . Restriction to multiplies this by . Left algebra compression by divides by , giving . These are the actual module maps and trace normalizations of2.1/2.9, so this argument does not equate two different relative-commutant traces.

For the commutant assertion, choose finitely many partial isometries with and mutually orthogonal final projections summing to1. Such a finite cover follows from projection comparison in a finite factor: split1 into finitely many projections of trace at most , then compare each with a subprojection of . If , define

For , each commutes with ; inserting the covering sum on both sides proves . Furthermore, using and the same covering sum gives . Conversely, any obeys . Thus(GTB.2) has the displayed inverse. It is a *-homomorphism because commutes with ; the constructions are normal. For positive commuting with the factor , the normal functional on is tracial, so . This proves the normalized corner-trace assertion.

Every Jones projection commutes with , hence with . Compressing gives the corner identity, and the compressed expectation is on the corner, by bimodularity and trace pairing. The compressed projection has its original Jones weight: . The spanning identity survives: insert the finite covering sum on both sides of each uncompressed middle-algebra multiple of , and move past . This expresses the whole larger corner as the weak span of corner-middle multiples of . Basic-construction recognition now fixes all projections and expectations. Iteration proves the tower and rectangle assertions.

The correct skipped full corner does not change the compressed local index

Fix an actual ordinary tunnel , with . Write , . Take , , and a nonzero projection . Let denote the intrinsic left- commutant dimension trace on , normalized to total mass1. Put

The factor , its normalized trace, and the exact identities , , are established in OT.2. The two numbers are not silently identified. The trace is the intrinsic faithful normal finite trace on , with ; is its normalized trace. These traces are evaluated on the actual left support projection, not on an abstract matrix rank.

Theorem GTB.2 — actual cup padding. For , set , . The actual skipped triple has a Jones projection such that

For the actual support , all of the following hold:

Both the standard invariant of , with index , and that of the physical inclusion , with index , are preserved by their respective common-corner maps. These are two different towers; neither is being identified with the other, even when their index values happen to agree.

Proof. The finite proof of14.8 uses the tracial standard representation at the middle level . Its coherently identified larger level is , the basic construction of , by1.2. Lemma14.1 and the repeated finite identifications14.2 match the marked ordinary Jones triples of the given tunnel with this representation. They preserve the factor traces and actual marked projections, rather than merely the index. This supplies the actual skipped projection , its compression identity, its middle expectation and the spanning identity . Compressing that span and using proves the last equality in(GTB.5). This finite argument uses no finite-depth/trace-uniqueness part of14.3–14.7 and no assertion about an infinite representation. For , is the specified ordinary marked cup at this triple.

Since commutes with all of , is a projection and commutes with . The functional is normal tracial on the factor ; hence . This gives . The map , , is an actual faithful normal trace-preserving factor isomorphism, so

Here . Apply GTB.1 to : its common corner is exactly , with index , and with the marked tower/trace identifications proved there. Also apply GTB.1 to , using , to retain its physical index and its own marked tower.

The larger inclusion has index . Local formula2.4 at its actual relative-commutant projection therefore reads

Substitution of and cancellation of the strictly positive prove . Thus the second support trace is computed through the proved actual corner construction, not guessed by a tensor model or an assumed extremality. Finally , , and commutes with . This proves the physical operator inclusions in(GTB.6).

If is proper, OT.2 gives . For the padded smaller factor to be a terminal factor at length in an actual tunnel of , it is necessary that

This condition is independent of . In the padded whole stage the support product becomes , while its level becomes ; the two changes cancel in the compressed index. A larger-depth full-corner cup does not repair a failed resonance. If(GTB.9) holds, it is still insufficient: the actual corner chain and its marked Jones identities remain necessary. Nothing here infers such a chain from equality of two numerical traces.

Arbitrarily small physical mass loss is possible, but the support class stays whole-stage

Corollary GTB.3 — actual finite orthogonal refinement. For one as above, let . Inside the factor , choose mutually orthogonal projections of trace . Each is unitarily conjugate in to the actual . Conjugate the continuation separately for each , fixing the older prefix, and put . These are actual whole-stage cells with individual continuations, and

If is an integer, this refinement covers exactly. This assertion covers an already realized whole cell, not the original arbitrary residual.

Proof. Prescribe the projections successively in , using , and use finite-factor unitary comparison. If , , rotate all future factors and cups by this specified unitary. It fixes , , and the older tunnel factors, since commute with and belongs to those older factors. The new terminal factor is . GTB.2 applies literally to it and ; orthogonality is physical because the commute with . The residual trace is . Its vanishing in the integer case gives exact coverage by faithfulness.

For a finite old family , these refinements may discard total additional trace less than any prescribed , by selecting finite with . If its old finite algebra has residual , , let , . All commute with . The retained candidate lies in the enlarged full supported relative-commutant cells, and

Indeed the difference from is exactly , with . Both expectation orders hold for the refined square with its displayed residual summand, by53.1 and trace pairing. Its supported pieces reconstruct . This is a proved fixed-operator estimate with actual finite cells, but has not acquired a full finite origin. Nor have the new good cells acquired tail-factor membership. Thus(GTB.11) does not settle(GTB.0)–(GTB.1).

The exact finite operator/tower criterion for a tail reclassification

For a physical projection , let be finite dimensional with unit , and set . No factoriality of is inferred.

Theorem GTB.4 — exact tail-retention equivalence at a finite length. For an integer , the following two actual constructions are equivalent:

  1. An ordinary finite whole tunnel , with and .
  2. An actual finite corner tunnel , with every ordinary Jones projection, expectation and generation identity, such that .

At , these mean . In direction2→1 the lifted supported algebra contains the same physical operators of . Equal indices or an abstract isomorphism of standard invariants alone are not the input in2.

Proof. For1→2, compress the actual whole chain by its common smaller-factor projection . GTB.1 proves all the corner Jones identities and gives

Thus is the required actual chain and commutes with .

For2→1 with , choose any ordinary whole tunnel to length . Its terminal factor is II₁, so prescribe a projection there of trace . A unitary in sends that projection to the physical ; conjugating this reference tunnel makes belong to every factor of the finite chain. GTB.1 compresses it to an actual corner tunnel of the fixed physical inclusion .

The finite uniqueness4.5, iterated as in57.3, supplies one unitary aligning that compressed chain with the specified chain in2, including its marked Jones projections. This is a comparison of two already constructed actual tunnels of the same physical inclusion, not a comparison inferred from their index. Extend to and conjugate the reference whole tunnel. Denote its terminal factor by . It still contains , and satisfies exactly. Apply(GTB.12), proved by the explicit common-corner map, to conclude

The comparison is the identity on the physical operators in(GTB.13): the tunnel was changed and the candidates were kept fixed. The placement unitary need not be close to1. The case is immediate.

Corollary GTB.5 — one concrete sufficient missing input. Suppose the actual finite nonempty near-cover of76.4 at zero prefix has , and has its displayed residual and candidates with , . For each good cell , let be the finite algebra with unit generated by its blocks and their adjoints. If actual corner tunnels as in GTB.4(2) are supplied in every , then the original full finite conclusion(GTB.0)–(GTB.1) follows.

Proof. Lift each of these finitely many chains by GTB.4. The physical supports now belong to individual actual tail factors. Their full supported relative-commutant algebras contain all the retained blocks , while the residual retains . Thus the new tail-supported square has the same candidates , so its expectation errors are below . Its is retained: every commutes with , and hence belongs to the lifted supported algebra by(GTB.12); commutes with all physical support projections. The inherited expectation onto maps each good algebra onto , by bimodularity and finite-stage trace pairing; it maps onto . Taking adjoints proves the other order. This checks the entire actual tail-family input of OT.1. Apply that established construction, with its unchanged strict error constants, to cut only controlled physical mass, place its finite cup-certified residual, and obtain the exact finite full partition. The physical have never been conjugated.

A sufficient stronger version of this input would give the actual corner chains inside , since that factor commutes with the whole old supported algebra. GTB.2 shows that simply padding that factor by skipped cups does not furnish such a chain: it preserves its actual local index . More generally GTB.4 allows another actual terminal factor inside , and therefore does not declare the numerical resonance necessary for every conceivable construction of the original theorem.

A genuine Jones calculation where padding preserves a nonresonant index

This example tests the proposed padding mechanism, not the unrestricted theorem. Let be any II₁ factor, take , and label four matrix legs . Set

For each adjacent pair of legs define its actual marked cup

Each is the rank-one Bell projection. Matrix multiplication gives , middle expectation , and the Jones compression identity. For the generic triple , the spanning identity is

Thus the three consecutive triples in(GTB.14), with cups , are actual basic constructions, with . This supplies their marked projections, expectations and generation; it is not a numerical index assignment.

Take , , and . The actual supported factors are

The indices4 and9 can also be checked by restricting the standard modules: has dimension4 over its scalar base, and the removed leg contributes9. On the original standard -module, left has normalized rank , so . On the standard -module, left has normalized rank , so . Consequently

The old physical supported pair is retained exactly:

These equalities follow from the rank-one -corner, not a conjectural transfer. Yet4 is not for any integer (the value is1 at , and at least9 thereafter), so neither nor can be the stipulated terminal factor of an actual ordinary tunnel of its physical corner inclusion. They are nevertheless perfectly valid whole-stage cells of the displayed original tunnel. This is an actual example of the failure of that particular tail reclassification, not a Jones counterexample to(GTB.0)–(GTB.1), not a claim that every possible fails, and not an extra general amenability assumption.

Exact retention can fail at every finite depth in the same Jones example

Theorem GTB.6 — the finite matrix divisibility obstruction. In the actual example (GTB.14)–(GTB.19), choose to be the tracial von Neumann closure of . Retain the same rank-two projection , and let

There is no actual finite tunnel of , of any length , whose terminal factor commutes with all of the same physical . Equivalently, GTB.4's exact input fails for this at every finite length. This strengthens the analysis of the same marked Jones example; it is not a second counterexample, nor a refutation of the original global approximation theorem.

Proof. The finite tensor expectations of converge in . A central element has scalar expectation at every finite tensor stage, hence is scalar. The unbounded matrix sizes exclude a finite-dimensional factor. Thus is an actual II₁ factor. Removing its first tensor leg identifies it as , with the product trace and an explicitly specified remaining tail. The same holds after any finite number of legs. No abstract isomorphism is used to move a fixed target.

For the fixed corner inclusion , choose the reference downward tunnel by successively removing the actual legs of , leaving the leg in its terminal factor. The Bell cups (GTB.15), at each successive pair of removed legs, satisfy compression, scalar expectation and generation by (GTB.16). Hence this is an actual marked tunnel of index nine. If is its terminal factor at length , its smaller relative commutant is

with the normalized matrix trace. The identification sends matrix units to the actual first removed legs; it is a unital trace-preserving *-isomorphism. Here .

Every other actual tunnel of this fixed physical inclusion through length is carried to this reference tunnel by a unitary in , by the complete finite uniqueness proof 4.5/57.3. Taking commutants transfers (GTB.21) to its terminal factor . If , then its physical unital is contained in . This would give a unital *-embedding

The images of the two diagonal matrix units are orthogonal equal-rank projections summing to the identity: their ranks agree because the off-diagonal matrix unit is a partial isometry between them. Therefore would be even. It is odd for every , a contradiction. The argument covers too.

The tensor-strip core has a compatible relative hypertrace, but that one-core calculation alone does not prove Popa's full amenability hypothesis, which quantifies every smooth representation. The full hypothesis for this example is established by the explicit smooth-representation construction below. The obstruction refutes only the additional universal exact-retention input for arbitrary already selected whole cells, and does not refute the original global theorem.

Full amenability of this explicit tensor model

Lemma GTB.6a — every smooth representation has the required hypertrace. Let be a II₁ factor with an increasing sequence of unital finite matrix factors whose union is -dense. Let , , with its normalized product trace and smaller inclusion . Then satisfies full amenability as defined in Popa3.1.1, not only amenability relative to its tensor-strip core.

Proof. Fix an arbitrary smooth representation of this physical inclusion, with conditional expectation . Thus , , , the weak span of equals , and smoothness at the first level gives

The higher smoothness conditions need not be weakened or omitted: they are assumed, while these first-level consequences already suffice for the construction. Denote the actual matrix units of this commuting by .

The multiplication map

is a normal unital *-isomorphism. Here finite matrices over use their ordinary von Neumann matrix-algebra topology. Products and adjoints are preserved because the matrix units commute with . Its actual inverse coefficients are

For , matrix multiplication proves that (GTB.34) recovers exactly . The coefficient maps are ultraweakly continuous. Since has weakly dense span, the coefficients lie in the ultraweakly closed for every ; the finite recombination identity then passes to that weak closure. This proves surjectivity, injectivity and normality of both maps without an abstract invariant identification. Bimodularity and give the actual expectation

Construct a -central state on the arbitrary . First extend to a state on . Explicitly extend its norm-one real functional on to by Hahn–Banach, keeping value one at the identity. For , the extension's value is , since . Scaling gives positivity, and complexification gives a unital positive linear state. Positivity's elementary Cauchy–Schwarz inequality proves boundedness and norm one.

Write . In its actual matrix units choose the clock and cyclic shift unitaries , with , . Define states

The sum is finite. Conjugation by or permutes its terms, with scalar phases cancelling. Hence is invariant under those conjugations, and central for their powers and products. The Weyl matrices span : diagonal clock powers separate the diagonal coordinates by the finite Fourier sum, and shift powers then give every off-diagonal matrix unit. Thus for all . Also , because is invariant under these unitaries.

The state extension uses the full Hahn–Banach proofs HB2.1–HB2.3. Compactness uses the complete ultrafilter/Tychonoff and Banach–Alaoglu arguments WT2.1–WT3.1. The earlier finite-algebra reading identifies these programme prerequisites and their full proofs. The states lie in the weak-star compact state space in , by Banach–Alaoglu and closed positivity/unitality. Take a cluster subnet of the sequence, with indices tending to infinity. Its state restricts to and is central for every . For arbitrary , put . Increasing orthogonal expectation ranges give . Cauchy–Schwarz for this possibly nonnormal state, using its exact restriction to , gives

Indeed bound each term involving by ; traciality of equates the two possible squared trace norms. This extends centrality to all of , without passing an ultraweak limit through or asserting its normality.

Finally define a state on the original smooth representation by

A positive matrix has positive diagonal entries, so the formula is positive and unital. It restricts to . For , matrix multiplication and prove . Every element of the physical is a finite sum of these matrix entries, so is -central. Equation (GTB.35) gives on every . This is the required compatible hypertrace for the arbitrary smooth representation. Therefore the full definition holds.

For (GTB.14), has the concrete increasing matrix factors . Its rank-two corner has . Apply this proof directly, with , to both physical inclusions. The exact all-depth rank obstruction of GTB.6 thus satisfies the original full amenability hypothesis.

Compatibility in one generating core does not by itself establish full amenability. Equations (GTB.32)–(GTB.38) give the universal representation argument. No converse from one-core amenability in Popa's Theorem4.1.1 is used.

A controlled approximation in that actual corner

Lemma GTB.7 — odd matrix stages can approximate the retained block. Keep the fixed inclusion (GTB.20) and its normalized corner trace . For every , put , . There is an actual finite tunnel of whose full stage pair has

for every , , with the identity on all unlisted factors. The physical targets remain fixed. No exact embedding (GTB.22) is asserted.

Proof. In the diffuse factor , choose of trace . Split it into equivalent projections of trace , and complete matrix units with unit . Then , indexed by , are actual matrix units in , each diagonal of normalized trace , with sum . The residual also has trace . Factor comparison supplies partial isometries connecting it to these diagonal projections. Explicitly, label them , choose , realizing the existing units, and choose . The units extend the existing units and generate a unital in the same physical .

The candidates belong to . Their differences from the fixed have squared -norm

The physical matrix unit has squared norm , giving (GTB.23)'s . In the original inherited -norm the squared error is , because .

Both and the reference smaller stage of (GTB.21) are unital matrix factors of size in . An actual unitary in sends the reference matrix units to those just constructed: compare their first diagonal projections, use a partial isometry between them, and sum the resulting matrix-unit transports over their diagonal supports. Conjugate the reference tunnel, including its Bell cups, by this unitary. Its full smaller stage becomes . Its full larger stage is exactly , since the unitary belongs to and commutes with the physical first matrix leg. This proves actual tunnel origin, not merely an abstract matrix-algebra fit. The inherited expectation onto removes that first leg and maps onto ; trace pairing and adjoints give both displayed orders.

This realizes a controlled return for this explicit amenable corner. The whole-corner lifting of GTB.4 applies to these approximating candidates, not to all of the exact . It gives a tail-supported near-cover when combined with the other selected cells and their error budgets. No universal construction for a general centered standard invariant follows from this tensor calculation.

Quantitative return to the original full partition

Proposition GTB.8 — approximate corner-chain input is sufficient. Take an actual finite nonempty near-cover supplied by 76.4 at zero prefix. Such a nonempty finite selection can always be taken from its nonempty maximal orthogonal family. When the target set is empty, adjoin the target1 for the construction; its conclusion also answers the original empty target request. Write its orthogonal good supports as , residual as , and its norm-contracting candidates as , . Put . Suppose

For each good support, suppose an actual finite tunnel of the fixed corner inclusion is constructed, with terminal factor . Let

The corner expectations have these finite-dimensional ranges. Assume actual physical error bounds

Then the original finite full conclusion (GTB.0)–(GTB.1) follows. The norms in (GTB.25)–(GTB.27) are the inherited physical -norms, not normalized corner norms. A normalized corner bound gives .

Proof. Each commutes with its actual terminal factor . Use GTB.4 with : it lifts this already constructed corner tunnel to a whole tunnel retaining the physical in its terminal factor . The explicit common-corner comparison gives equalities of the same finite algebras

The equality follows from and GTB.1's typed commutant map; no trace-product or abstract invariant fit is used in place of the actual chain.

Define the tail-family algebras and candidates

Omit a zero residual summand. The supports remain the original orthogonal physical projections, and the candidates have norm at most by positivity and unitality in each block. On , the normalized corner expectation onto is . Its bimodularity over makes its image on exactly . Multiplying normalized corner traces by identifies these expectations with the inherited-trace block restrictions. The residual expectation maps onto . Trace pairing and self-adjointness of the projections therefore give

Every physical commutes with all of , hence with , and belongs to . Since commutes with all the projections in , the good pieces and sum to each element of . Thus , as required by OT.1.

The old is block diagonal for these same supports. Its residual block is unchanged. Orthogonality of the good block differences proves

The first identity concerns only mutually orthogonal block supports. It does not incorrectly assert that the old expectation error is orthogonal to the new finite algebras. Best approximation bounds the new expectation error by the candidate error. Equations (GTB.25), (GTB.28)–(GTB.31) supply every actual tail-family hypothesis of OT.1. Apply its already proved finite cup-budget cutting and residual placement to obtain an exact finite whole-cell partition of one with both expectation orders and strict final target error. The physical were kept fixed throughout.

GTB.6 refutes the universal exact version of the input for arbitrary selected blocks. GTB.7 verifies the approximate version in one explicit amenable tensor model. Deriving (GTB.26)–(GTB.27) from unrestricted amenability for the general selected near-cover, or selecting another construction that proves (GTB.0)–(GTB.1), remains substantive unfinished mathematics. The sufficient input is not substituted for the original theorem.

Two checks with complete solutions

Exercise GTB.1 — padding and physical error. Suppose actual whole-stage cells have , , , residual trace , and old target error below for targets of norm at most two. Refine both cells by GTB.3 using . Determine the extra discarded mass and prove a strict target-error bound. Does this make the supports tail-factor projections?

Solution. There are equal-trace full-corner projections in each relevant tail factor. Their sum is exactly one there, so each realized cell is covered exactly and no extra mass is discarded. Thus GTB.11 gives . The original residual remains . The projections are still whole-stage supports, with the original compressed indices. No tail membership or exact finite origin for that residual has been produced. The traces describe a conditional test of already realized cells, not an existence claim for an arbitrary proposed numerical family.

Exercise GTB.2 — exact versus controlled retention. In (GTB.20), can a length-three actual corner tunnel retain all of exactly? At that length, give the errors from (GTB.23)–(GTB.24), and prove that every one of the 36 displayed physical matrix-unit targets is approximated strictly within .

Solution. Its smaller full stage is , for any actual tunnel by finite marked uniqueness. A unital in it would split 27 into two equal integer ranks, so exact retention is impossible. For , choose , split it into 13 projections of trace , and complete the 26 old corner units with the residual of trace . The two-leg target has error in . Each complete target has error , since . The specified unitary rotates the tunnel, while these 36 targets are kept fixed. Approximation does not create an exact unital inside .

The remaining general implication

The general whole-stage near-cover and its fixed operators are established inputs. GTB.2 constructs the correct larger-depth full corner and both trace identifications. GTB.3 makes arbitrarily cheap actual whole-cell refinements, retaining physical operators. GTB.4 proves the exact return map from an actual constructed corner tunnel to a whole tail-supported cell. GTB.5 then invokes the already proved OT.1 conversion to obtain a full finite partition if those actual corner chains are supplied.

GTB.6 proves that unrestricted amenability cannot supply those exact corner chains for every already selected finite block: the same rank-two example prevents them at every length. What remains is an unrestricted amenability-derived approximate candidate/corner-chain construction with an explicit physical error budget, a selection of different cells, or another construction proving the original finite full partition with its original residual. Index equality, physical factoriality, core passage, common-corner stability and cup padding do not supply that implication. The stronger sufficient input in GTB.5 is not substituted for the original theorem. The small-, singular-state, canonical-cost-zero, above-four expectation and general ergodicity implications remain separate mathematical questions.

Human sources: Sorin Popa, Classification of amenable subfactors of type II, Acta Mathematica 172 (1994), 163–255, source paper: §1.3.2, printed p.178; Definitions3.1.1–3.1.2, printed pp.203–204; Theorems4.1.1–4.1.2, printed pp.209–210; §4.4 and Theorem4.4.1, printed pp.220–222. Jan van Neerven, Functional Analysis, arXiv:2112.11166v7, Theorems4.7–4.9 and4.50, supplies the human context for Hahn–Banach and dual compactness. The complete programme proofs and independently expressed constructions above retain their stated hypotheses.

Actual common-corner maps and both support traces; the all-depth odd-rank obstruction; and the equal-trace matrix completion with exact target errors

Figure GTB.1. The upper panels show the actual full-corner and skipped-cup maps, both support traces, and the conditional finite return. The lower panels show the same rank-two index-nine example at every depth and the controlled matrix completion at length three. Areas are schematic; the labels state exact traces and ranks. Proofs: GTB.1–GTB.8, including the full smooth-representation argument GTB.6a; Exercises GTB.1–GTB.2. Human context: Popa's §§1.3 and4.4, cited above. On a narrow screen, scroll the figure horizontally or open the full-size figure. Editable figure source.

Original independently written programme text and SVG: public domain, CC0 1.0.