Alphabeta Math
DefinitionDefinition: AI-generatedProof: Not applicable
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.

Finite operator and ket conventions

Definition

A finite operator space in these conventions is a specified nonzero complex coordinate space H=Cd, d≥1, equipped with its standard inner product and a specified ordered orthonormal basis. An ordered basis is a finite ordered list of linearly independent vectors spanning the space. An orthonormal basis is a basis whose vectors have inner products 1 with themselves and 0 with each other. Coordinates and matrices below are taken in the specified bases. The root inner product is linear in its first argument; on standard coordinates it is ⟨x,y⟩root=∑ixiyi‾.

Below, H=Cd and K=Ce, with d,e≥1, are any two finite operator spaces with their specified ordered orthonormal bases (hi)i=1d and (kj)j=1e. For x=∑ixibi in a specified ordered basis (bi), its coordinate column is (xi)i; the same symbol x also denotes this column. For a linear map A:K→H, its matrix, also denoted A=(aij), is determined by Akj=∑iaijhi. Products denote rectangular matrix products, (BC)ij=∑kBikCkj, for compatible shapes. Transposition means (BT)ji=Bij, and B‾ denotes entrywise complex conjugation.

For vectors u∈H and v∈K, the ket ∣u⟩ denotes u, the bra ⟨v∣ denotes the linear functional x↦v†x=∑jvj‾xj on K, and the outer product ∣u⟩⟨v∣:K→H maps x to u(v†x). For a linear map A:K→H, A†:H→K denotes the adjoint, represented by the conjugate transpose A‾T. The bracket ⟨u∣A∣v⟩ means u†Av, equivalently ⟨Av,u⟩root.

An ordered tensor register consists of a finite ordered list of finite-dimensional complex inner-product spaces, each with a specified ordered orthonormal basis: its factors remain in the displayed order and its product basis is ordered lexicographically. The empty tensor product is C. No infinite tensor product or unspecified basis is implicit.

Justification

In an orthonormal basis, expanding the vectors in their coordinate columns and using linearity in the first argument and conjugate symmetry gives ⟨x,y⟩root=∑ixiyi‾ in those coordinates, consistent with the standard-coordinate inner product. These are the coordinate columns of Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases, in the ordered bases of Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, using Real and complex inner product spaces, with the inner product linear in the first argument and The standard formulas ⟨ x,y⟩=∑_k<nxₖ yₖ on ℝⁿ and ∑_k<nxₖyₖ on ℂⁿ are inner products.

Hence v†x=⟨x,v⟩root is linear in x, so the stated outer product preserves linear combinations and is a well-defined linear map in the sense of Linear map between vector spaces over the same field. The scalar product of the row and column uses Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes.

Expanding x=∑jxjkj and applying linearity to the defining matrix columns gives (Ax)i=∑jaijxj, the matrix action supplied by the coordinate-column convention and rectangular multiplication. This uses Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases, Linear map between vector spaces over the same field and Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes.

For x∈K and y∈H, the finite coordinate sums give ⟨Ax,y⟩root=∑i,jaijxjyi‾=⟨x,A‾Ty⟩root, where (A‾T)ji=aij‾ by The transpose A^T of a matrix. Thus the conjugate transpose satisfies the defining adjoint identity of The adjoint T^*:W→ V is characterised by ⟨ Tv,w⟩_W=⟨ v,T^*w⟩_V, with the inner product of Real and complex inner product spaces, with the inner product linear in the first argument and the matrix products of Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes. In particular u†Av=⟨Av,u⟩root.

The ordered tensor construction and its product basis are supplied by Ordered tensor registers, their inner product, and wire permutations.

Depends on

Used by · 48

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.