Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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. Complete 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).

Proof

technique · direct
1.1A1A4construct

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. Its completion is the Hilbert tensor power H⊗n.

2.1step 1.1algebra

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.

2.2A3A4step 1.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 extends T⊗n to the completion with bound Cn.

3.1A1A2step 2.1

By step 2.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.

3.2A3step 2.1step 2.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.

4.1A5step 2.1step 3.1construct∎

If (ej) is a supplied orthonormal basis of H, 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 3.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}.

Depends on

Used by

Dependency tree · two levels

28 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