The Setting
Let be a -algebra with a faithful tracial state and two decreasing sequences of projections and . Their reduced Higman-Neumann-Neumann (HNN) extension adjoins to a unitary with for every . One computes in with products in which each letter or is followed by a coefficient from , such as . Which of them are reduced is decided at the coefficients standing between two different letters.
The library defines words over , whose evaluations are these products, and reducedness for any condition imposed on such a coefficient; the two sequences supply the condition through two expectations of onto the algebra of convergent sequences.
Peaking Sequences and Bridge Data
A state of is a bounded linear functional on of norm one that is real and nonnegative on every .✦ A positive functional on is tracial when for all .✦
A sequence in peaks to a bounded functional on when the are decreasing projections, is a state with for every , and every state with for every equals .✦ The peak atom of index of is the element (1)✦ of .
Bridge data on consist of a positive functional on that is tracial, normalized by and faithful, with only for , and of two sequences , in peaking to states , , such that, with the peak atoms of , for and every (2)✦
Atomic trace data on , with atoms indexed by a set , consist of a positive functional on that is tracial, normalized and faithful, and of pairwise orthogonal projections , , with and .✦ Let be a positive functional on that is tracial, normalized and faithful, and let be a sequence in peaking to a state, with , and . The peak atomic trace data of for are the atomic trace data on with trace and atoms the peak atoms .✦
Diagonals and Expectations
The algebra of convergent sequences is the -algebra of continuous functions on the one-point compactification of ; an element of has terms and limit .✦ For a sequence in , a complex number and a complex sequence , the peak diagonal element of is (3)✦ and the sequence diagonal map sends to (3) with and .✦ Let peak to a state, with its peak atoms the atoms of atomic trace data on . The sequence diagonal embedding of is the map defined above, a unital -homomorphism.
The corner functional of a bounded functional on at is the functional ✦, and the corner state of at is the corner functional divided by .✦ Let peak to , and let be a state with for every . The peaking coefficient function of is the convergent sequence of the corner states of at the peak atoms, evaluated at , with limit : (4)✦ The peaking coefficient map of for is , a linear map of norm at most one.✦ For bridge data, is the sequence diagonal embedding of and its peaking coefficient map for .
The Two Factors
Let be a -algebra and a map sending each to a complex function on a set . A matrix diagonal input on over a finite index set , with coordinates , consists of a positive functional on that is tracial, normalized and faithful and, for each , of atomic trace data on with trace and atoms , a unital -homomorphism , its diagonal, and a bounded linear map , its expectation, such that for all , and (5)✦ and whenever .
Let be a positive functional on that is tracial, normalized and faithful, and let , , be finitely many sequences in peaking to states, with , and . The peaking matrix input of the for is the matrix diagonal input on over and , with coordinates , whose th atomic trace data, diagonal and expectation are the peak atomic trace data, the sequence diagonal embedding and the peaking coefficient map for of .✦
Let be an injective unital -homomorphism, let atomic trace data on have trace and atoms , , and let with . The pullback of these atomic trace data along is the atomic trace data on with trace , a positive functional on , and atoms .✦ Let peak to and let be a state with for every . The sequence atom of index is . The sequence atomic trace data on are the pullback, along the sequence diagonal embedding and with the sequence atoms as the , of the atomic trace data on whose atoms are the peak atoms.✦ For a nonempty finite index set , the sequence matrix input over is the matrix diagonal input on over whose trace and atomic trace data are those of the sequence atomic trace data and whose diagonals and expectations are the identity.✦
The HNN factors over are , of index , and , of index .✦ The HNN matrix input of bridge data on , also called their pair matrix input, gives each factor a matrix diagonal input over the index set with and coordinates : on the peaking matrix input of and , on the sequence matrix input for the peak atomic trace data of .✦
The Definition
Definition 1. A word over is a finite nonempty sequence of pairs with and , read as the letter , one of two letters , , followed by the coefficient : (6)✦ For a map of into an algebra and a pair of elements of , the evaluation of is (7)✦ For a condition on pairs with and , the word is reduced for when (8)✦ For bridge data on , a turn after the letter , where is followed by a coefficient and then by the other letter, is centered when (9)✦ A word over is reduced for the bridge data when is reduced for the condition (9) on pairs .
In the paper, the result reads: a word is with each , and it is reduced when at each turn and at each turn , where and are the page’s letters and .
The library’s words begin with a letter: they are the paper’s words with .
What Is Checked
Words and their evaluation are stated over any set of coefficients, any map of into an algebra and any two of its elements , , and reducedness over any condition on pairs ; the centered turns of (9) are stated over bridge data on a -algebra and the expectations , of their pair matrix input on the factor .
The library proves that the peak atoms of a peaking sequence are pairwise orthogonal projections. A positive functional on is bounded, with ✦, and is a state when .✦ The sequence diagonal embedding is injective✦, and the atoms of the sequence atomic trace data satisfy for every .✦