The Setting
Four bounded operators between complex Hilbert spaces, , , and , form a rectangle when they satisfy the first and the second rectangle identities (1) A random rectangle is a rectangle whose four sides are families of operators indexed by a probability space, , , and , such that the identities hold for almost every choice of the parameters. Each side has a source square and a target square , and the question is when each of them is almost surely equal to a fixed injective operator.
The library answers it for families with independent parameters, gives such families measurable polar parts, and relates the polar parts of the four sides of a rectangle. The rectangle it is built for, the grouped square defined below, has as sides the joining operators of conditional couplings between families of cells of a random array.
Operator Families
Let be a measure space and a family of bounded operators from a complex Hilbert space to a complex Hilbert space , with adjoint family . A family of bounded operators from to is strongly measurable if, for every , the vector-valued map is strongly measurable.✦ The essential kernel of is the subspace of the vectors with for -almost every ✦, and the essential range of is the orthogonal complement in of the essential kernel of : (2)✦ The family has essential total range if every closed subspace of that contains the range of for -almost every is itself.✦
A family has fixed injective squares with respect to if there are injective bounded operators on and on such that (3)✦
The absolute value of a bounded operator is the positive square root , an operator on , and a polar part of is a unitary operator with .✦ For closed subspaces of and of , the compression of to and is the operator from to , where is the orthogonal projection of onto .✦
The rectangle spaces of four families , , , with the domains and targets of (1), over measure spaces , , and , are the closed subspaces (4) each essential range taken with respect to the law of its family’s parameter. The restricted families of the four families , , , are the compressions , , and of , , and to the rectangle spaces.
The Grouped Square
Let be a measurable automorphism of a standard Borel space and a finite index set. An array of order over a space is a function from the index tuples to , a point of ✦; fixing one axis of an array of order at a slot of gives a plane of it, an array of order .✦ Initial array laws are probability measures on , one for each order , that are invariant under applied entrywise, consistent, in that every plane of an array of law has law , and proper, in that for every proper subset of the planes fixing the last axis at the slots of are independent.✦
An array object over is a standard Borel space of states with an automorphism , an equivariant measurable map to and an equivariant measurable parameter map to a standard Borel space with an automorphism, together with consistent and proper probability measures on , the laws of , which are invariant under applied entrywise and carried to by the map to .✦ Two further conditions tie the laws to the parameters: given the parameter array of an array drawn from , obtained by applying entrywise, the planes fixing the last axis at the slots of a proper subset of remain independent, each with the conditional law of an array given its own parameter array; and at order zero the map to and are independent. For each order , denotes the conditional law under of an array given .✦
An extension of is an array object over with measurable maps from its states and its parameters to those of that commute with the automorphisms, the maps to and the parameter maps, and whose state map, applied entrywise, carries each law to .✦ The pullback of an extension of at order is the linear isometry from to given by composition with the entrywise state map of .✦ At order an array object carries the data -algebras on : the parameter -algebra and, for each , the outside -algebra and the enlarged -algebra . An array object is saturated if, for every extension of it, every order , every data -algebra of order and every , the conditional expectation onto the data -algebra of of the pullback of is the pullback of the conditional expectation of onto the data -algebra of .✦
In an array of order the first axis indexes rows and the last axis columns. The row and the column are the planes fixing the first axis at and the last axis at , arrays of order ; the cell is the array of order obtained by fixing both✦, and for sets of rows and of columns the cells of in form the family .✦ For a parameter array of order over , the law of cells is the law of when the rows , , are drawn independently from .✦
The joining operator of a coupling of two random points, with laws and , is the operator from to that sends a function of the second point to its conditional expectation given the first.✦ For a set of rows and sets , , of columns, the row joining operator at and at cells in is the joining operator from to of the conditional law, under , of the pair given and .✦ For sets , , of rows and a set of columns, the column joining operator at and at cells in is the joining operator from to of the law of the pair when the columns , , are drawn independently, each from conditioned on its cells in the rows of being those of .✦
A triple partition of is a partition into three nonempty disjoint sets.✦ Fix triple partitions of the rows and of the columns, an order and a parameter array of order . The grouped square at consists of four families of operators between the spaces (5) The sides and of the grouped square at are the row joining operators of the rows in and in from the columns to the columns , at cells in and in ; its sides and are the column joining operators from the rows to the rows , in the columns and , at cells in and in . The parameters , , , have the laws , , and , and the restricted families of the grouped square are written , , and .
The Claim
Theorem 1 (Fixed squares). If bounded operators , , , satisfy the rectangle identities (1), then (6)✦
Let , , , be families of bounded operators , , and over probability spaces , , and , such that each of the eight families , , , , , , , has essential total range. If each identity of (6), with , , , in place of , , , , holds for almost every triple of the parameters it involves under the product of their laws, then (7)✦ The same holds when , , , are separable, the four families are strongly measurable and there are random parameters , , , on a probability space , with laws , , , and any three of them independent, such that almost surely and : (8)✦
Let be a strongly measurable family of bounded operators from to , both separable, over a probability space , with fixed injective squares. Then there is a measurable family of unitary operators such that, for -almost every , the operator is injective with dense range and (9)✦
If bounded operators , , , satisfy the rectangle identities (1), and are injective, and , , , are polar parts of , , , , then (10)✦
Let be a saturated array object, and triple partitions of , and . Then, for almost every parameter array of order under the law of for drawn from , (11)✦
In the paper, the result reads: for the four restricted families of the grouped square, each source square and each target square is almost surely independent of its parameter and injective on its space , and the four polar parts are measurable families of unitaries between the spaces that satisfy the first rectangle identity.
What Is Checked
The claim is stated over bounded operators between complex Hilbert spaces with their adjoints, absolute values and polar parts, over families of them indexed by probability spaces with the essential ranges, essential total range, strong measurability, fixed injective squares, rectangle spaces and compressions defined above, and, for the grouped square, over saturated array objects, triple partitions, laws of cells and the row and column joining operators built from the conditional laws of a random array.
Of these constructions the library proves that the state map of an extension, applied entrywise, is measure preserving from each law of the extension to the law of the same order of the array object.✦