Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Hilbert exterior powers and induced operators

Definition

Let H be a complex Hilbert space and let n≥0. Set Λ0H:=C. For n≥1, the algebraic n-fold tensor product H⊗algn is the complex vector space generated by symbols x1⊗⋯⊗xn subject to complex linearity in each slot. Equivalently, it is the quotient of the free complex vector space on Hn by the span of the coordinate-wise additivity and scalar-linearity relations. Give it the sesquilinear form determined on elementary tensors by

⟨x1⊗⋯⊗xn,y1⊗⋯⊗yn⟩=∏i=1n⟨xi,yi⟩,

which is well defined because the product is linear in each first-slot vector and conjugate-linear in each second-slot vector. Apply the choice-free sequential Hilbert completion constructed in proof steps 1.1–7.1 below to H⊗algn in the induced norm to obtain the Hilbert tensor power H⊗n. Use the action convention Uπ(x1⊗⋯⊗xn)=xπ−1(1)⊗⋯⊗xπ−1(n) for π∈Sn. The Hilbert exterior power ΛnH is the range of the orthogonal projection

An:=1n!∑π∈Snsgn⁡(π)Uπ.

For x1,…,xn∈H, write x1∧⋯∧xn:=n! An(x1⊗⋯⊗xn). Its inner product is

⟨x1∧⋯∧xn,y1∧⋯∧yn⟩=det⁡[⟨xi,yj⟩]i,j=1n.

If T:H→H is bounded, its induced operator ΛnT is the restriction of T⊗n to ΛnH; equivalently (ΛnT)(x1∧⋯∧xn)=Tx1∧⋯∧Txn. Set Λ0T=IC. For every bound C of T, Cn is a bound for ΛnT, and Λn(ST)=ΛnS ΛnT for bounded S,T.

Facts & Assumptions

Given: A complex Hilbert space H (Hilbert space), an integer n≥0, and, when an induced operator is considered, a bounded linear operator T:H→H.

[A1]

The complex inner product is linear in its first argument and conjugate-linear in its second (Real and complex inner-product spaces and their induced length).

[A2]

The determinant of a square matrix is given by its finite signed permutation sum (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[A3]

For bounded T there is C≥0 such that ∥Tx∥≤C∥x∥ for every x (A bounded linear operator between normed spaces).

[A4]

Every finite-dimensional real or complex inner-product space has a finite orthonormal basis, including the empty basis in dimension zero (Every finite-dimensional real or complex inner product space has an orthonormal basis).

[A5]

A supplied orthonormal basis is a complete orthonormal family, so its finite linear span is dense in H (Orthonormal families, complete orthonormal systems and Hilbert bases). For the increasing-index enumeration of basis wedges in step 11.1, a linear order on its index set is supplied as additional data; no order on an arbitrary set is asserted to exist.

[L1]

The bounded operator space B(X,C) has the unit-ball operator norm and is Banach because C is complete (Spaces of bounded linear operators, The operator norm as the least bound and as the unit-sphere or unit-ball supremum, Bounded operators into a Banach space form a Banach space, The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts). The proof uses uniquely determined pointwise limits, not a family of arbitrary choices.

[L2]

Cauchy–Schwarz gives ∣⟨x,y⟩∣≤∥x∥∥y∥; the original norm satisfies the parallelogram law. A complex norm satisfying that law determines a unique first-variable-linear inner product by polarization (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, The parallelogram law, Jordan–von Neumann: a norm is induced by an inner product exactly when it satisfies the parallelogram law, Real and complex inner-product spaces and their induced length).

[L3]

Hartogs' theorem gives, for each set A, an ordinal h(A) that does not inject into A. Transfinite recursion and induction hold in ZF without Choice (Hartogs: an ordinal that does not inject into a given set, Transfinite recursion, Transfinite induction).

[L4]

Replacement collects a family of uniquely specified values into a function (The Axiom Schema of Replacement: for each formula φ, if φ defines a class function on A then its image on A is a set). Power Set, Separation and Union are available as in the ZF hypotheses of [L3].

[L5]

A norm completion is a Banach space with a dense linear isometric embedding, and Hilbert completeness here means convergence of Cauchy sequences (Completion of a normed space, Hilbert space).

Proof

technique · direct

In steps 1.1–7.1, let X be an arbitrary complex inner-product space; for bounded extension let Y be any complex Banach space and T:X→Y any linear map with bound C≥0. Then return to the given H and its operator in steps 8.1–11.1.

1.1L1L2givenconstructalgebra

Let D=B(X,C) and give its conjugate vector space D‾ the same addition and norm, with scalar action λ⋅D‾φ=λ‾φ. It is Banach by [L1]. Define j(x)(y)=⟨y,x⟩. This is a bounded linear functional of y by [L2]. Since j(λx)=λ‾j(x)=λ⋅D‾j(x), the map j:X→D‾ is complex-linear. Cauchy–Schwarz gives ∥j(x)∥≤∥x∥; if x≠0, evaluation at y=x/∥x∥ gives ∣j(x)(y)∣=∥x∥, so equality holds; it also holds at zero. Thus j is an isometry.

2.1L1L2step 1.1constructalgebra

Put S=jX‾ in D‾. It is a vector subspace: approximating two points within an arbitrary positive tolerance gives approximants for their sum, and approximating one point does the same for each scalar multiple. These are finite choices for fixed points and tolerance. It is complete because a Cauchy sequence has a limit in D‾ by [L1], and that limit lies in the closed set S. The norm of S satisfies the parallelogram law without selecting approximants for a whole sequence of tolerances. Indeed, for u,v∈S and each 0<δ≤1, take x,y∈X with ∥u−jx∥,∥v−jy∥<δ. The reverse triangle inequality and ∣a2−b2∣=∣a−b∣(a+b) show that the absolute value of the parallelogram defect at (u,v) is at most 12δ(∥u∥+∥v∥+1), since the defect at (jx,jy) is zero by [L2]. This bound for every δ forces the defect to vanish. Polarization [L2] therefore equips S with its unique compatible inner product. Since j is linear and isometric, polarization shows this pairing restricts to the original pairing on X. Thus S is an ambient Hilbert space and jX is dense in S.

3.1L3L4step 2.1constructinductioncontradiction

For A⊆S, define L(A) to be the set of limits in S of all Cauchy sequences with terms in A. The set of sequences is a subset of AN, and each has a unique limit because S is complete, so [L4] makes L(A) a well-defined subset of S. Constant sequences give A⊆L(A). Let κ=h(P(S)), and use [L3] to define, through stage κ, A0=jX,Aα+1=L(Aα),Aλ=⋃α<λAα(λ a nonzero limit ordinal). The chain is increasing. If Aα+1≠Aα for every α<κ, then for α<β<κ one has Aα⊊Aα+1⊆Aβ, so α↦Aα injects κ into P(S), contradicting the choice of κ. Let θ<κ be the least stage with Aθ+1=Aθ. This uses Hartogs of the power set, not a selection of one new point at each stage.

4.1L3L5step 2.1step 3.1inductionalgebra

Each Aα is a vector subspace. At a successor, for two points choose two witnessing sequences in Aα; their sum and scalar multiples converge to the corresponding sum and scalar multiple in S, so these belong to L(Aα). Only two witnesses for a fixed pair are used, not a family indexed by all points. At a limit, any two points occur in two earlier stages, whose larger ordinal stage contains both; the union is therefore a vector subspace. Transfinite induction proves the assertion. Set Xseq=Aθ with the restricted pairing. Every Cauchy sequence in it converges in S, and the fixed-point equality puts that limit back in Aθ. Hence it is Hilbert. Since jX is dense in S and jX⊆Aθ, it is dense in Aθ in the subspace norm. Thus (Xseq,j) is a norm completion. Any sequentially closed subset of S containing jX contains every Aα by induction, so this hull is the least such subset.

4.2L4givenstep 3.1constructalgebra

Start with T0(jx)=Tx on A0. Suppose Tα:Aα→Y is linear with bound C. For u∈Aα+1, there is a Cauchy sequence (un) in Aα converging to u in S. The sequence Tαun is Cauchy by its bound and has a limit in Y. If (vn) is another witness for u, then ∥Tαun−Tαvn∥≤C∥un−vn∥→0, so the two limits agree. Therefore the relation “y is the limit of the image of a witnessing sequence for u” has exactly one value y for each u. Replacement [L4] defines a function Tα+1 with these values, without choosing one witnessing sequence for every u. Constant sequences show Tα+1∣Aα=Tα. Taking limits in ∥Tαun∥≤C∥un∥ gives the same bound on Aα+1.

5.1L3L4step 4.1step 4.2constructinductionalgebra

For u,v∈Aα+1, choose two witnesses (un),(vn) in Aα. The witnesses (un+vn) and (λun) and uniqueness of limits give Tα+1(u+v)=Tα+1u+Tα+1v and Tα+1(λu)=λTα+1u. At a limit ordinal take the union of the compatible preceding functions. This union is a function, and its linearity and bound follow in one common earlier stage for every fixed pair of arguments. Transfinite recursion [L3] therefore produces the compatible bounded linear maps through stage θ, giving T~=Tθ.

6.1step 4.1step 5.1algebra

If U,V:Xseq→Y are bounded linear extensions of T with respective bounds CU,CV, then for each u and each δ>0, density supplies one x∈X with ∥u−jx∥<δ. Since Ujx=Vjx, one has ∥Uu−Vu∥≤(CU+CV)δ. Hence Uu=Vu for every u. No simultaneous family of approximants is used. This proves uniqueness, including uniqueness among extensions with a different bound.

7.1L4L5step 1.1step 3.1step 4.1step 5.1step 6.1algebra

If X is already Cauchy complete, jX is sequentially closed in S: any Cauchy sequence in jX has the unique inverse sequence in X under j, and the latter converges in X; its image is the unique ambient limit. Thus L(jX)=jX, θ=0, and Xseq=jX. In particular completing a Hilbert space by this construction changes nothing. Together with steps 4.1–6.1 this proves the completion and bounded-extension assertions for arbitrary X without a choice axiom.

8.1A1A4step 7.1construct

Fix n≥1. In any finite tensor sum, all factor vectors lie in a finite-dimensional subspace E⊆H. Choose a finite orthonormal basis (fj) of E by [A4]. Multilinearity expands the sum in the elementary tensors fj1⊗⋯⊗fjn; the product form makes these tensors orthonormal. Their linear independence follows by applying the multilinear coordinate functionals (x1,…,xn)↦∏r=1n⟨xr,fjr⟩, which descend to the quotient and extract their coefficients. Thus the form is positive definite on every finite tensor span. It defines an inner-product space, and step 7.1 supplies its choice-free sequential Hilbert completion H⊗n. When n=1, this construction identifies the tensor power with the already complete space H by the onto assertion in step 7.1.

9.1step 7.1step 8.1algebra

Each algebraic permutation preserves the product pairing, so step 7.1 extends it uniquely and isometrically to Uπ on the Hilbert tensor power. The inverse permutation extends to its inverse; hence each Uπ is unitary and UπUτ=Uπτ. Replacing π by π−1 in the adjoint sum gives An∗=An; grouping the n! pairs with product ρ gives An2=An. Thus An is an orthogonal projection and is bounded with norm at most 1 by the orthogonal decomposition into its range and kernel. Its range is closed. It is exactly the alternating subspace because the signed average is alternating and fixes every alternating tensor.

9.2A3A4step 7.1step 8.1

Let C be any bound for T from [A3]. After permuting tensor factors, a finite tensor sum can be written ∑j=1mxj⊗yj with (yj) an orthonormal basis of the finite-dimensional span of its remaining-factor tensors. Its squared norm is ∑j∥xj∥2, while applying T in that factor gives squared norm ∑j∥Txj∥2≤C2∑j∥xj∥2. Since factor permutations are unitary, this proves the bound C for applying T in any one slot. Composing over the n slots bounds the algebraic T⊗n by Cn; step 7.1 extends it uniquely to the Hilbert completion with the same bound.

10.1A1A2step 9.1

By step 9.1 the normalized wedges are vectors in the alternating range. For pure tensors, self-adjointness and idempotence give ⟨n!Anx,n!Any⟩=n!⟨x,Any⟩. Expanding the signed average yields ∑π∈Snsgn⁡(π)∏i⟨xi,yπ(i)⟩, which is the determinant in [A2]. This proves the stated Gram formula and its positivity from the Hilbert-space norm.

10.2A3step 9.1step 9.2

On elementary tensors T⊗n commutes with every permutation, hence preserves ran⁡An and restricts to a bounded ΛnT with bound Cn. Its action on wedges is the displayed formula. Applying that formula twice proves Λn(ST)=ΛnS ΛnT on a dense span and therefore everywhere. For n=0 the space is C and the induced map is its identity; for n=1, A1=I and Λ1T=T. If T=0 and n≥1, its induced map is zero.

11.1A5step 9.1step 10.1construct∎

If (ej)j∈I is a supplied orthonormal basis of H and I is supplied with a linear order, its finite span is dense by [A5]. Approximate the factors of each elementary tensor by finite linear combinations of the ej. The telescoping tensor identity and ∥x1⊗⋯⊗xn∥=∏r∥xr∥ show that elementary tensors in those finite spans are dense in H⊗n. Since An is bounded, their images are dense in ran⁡An. Applying An to a basis tensor gives zero if indices repeat and otherwise a signed multiple of the wedge with increasing indices. These wedges are orthonormal by step 10.1 and span a dense subspace, so they form an orthonormal basis of ΛnH. If H is finite-dimensional with n>dim⁡H, there are no increasing n-tuples and ΛnH={0}.

Remarks

No choice principle or orthonormal basis of an arbitrary H is assumed. The completion here is the specified transfinite sequential-hull construction, whose bounded-extension property is proved in steps 1.1–7.1 above; it is not an unsupported appeal to completeness of the one-stage Cauchy-sequence quotient. The increasing-index basis enumeration in step 11.1 is conditional on a supplied linearly ordered orthonormal basis. The tensor and exterior constructions themselves require no basis or order on H.

Depends on

Used by

Dependency tree · two levels

63 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources