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 vertex Hilbert space in the article convention

Definition

Let V be a finite set. The complex vector space CV consists of all functions f:V→C, with addition and scalar multiplication defined pointwise. Its vertex inner product, linear in the second argument, and its induced norm are

⟨f,g⟩=∑x∈Vf(x)‾g(x),∥f∥2=⟨f,f⟩.

Thus f and g are orthogonal when ⟨f,g⟩=0. This is a complex Hilbert space: its induced norm metric is complete, meaning that every Cauchy sequence converges in CV.

A complex V×V matrix is an array A=(Axy)x,y∈V. It acts on CV by (Af)(x)=∑y∈VAxyf(y). Its conjugate transpose is the matrix A∗ with (A∗)xy=Ayx‾. An adjoint of this action is a linear map T satisfying ⟨Af,g⟩=⟨f,Tg⟩ for all f,g; here it is the action of A∗. The matrix is self-adjoint, or Hermitian, when A=A∗; in particular every real symmetric matrix, one satisfying Axy=Ayx∈R, is self-adjoint.

For comparison with the library's linear-first convention, put (f,g)lib=∑x∈Vf(x)g(x)‾=⟨f,g⟩‾. The two conventions have the same norm and orthogonality. The adjoint and self-adjoint matrices are also the same in both conventions. For self-adjoint A, the quadratic values ⟨f,Af⟩ and (f,Af)lib coincide and are real. Consequently a linear-first Cauchy–Schwarz bound transfers by taking absolute values, and a linear-first self-adjoint spectral statement transfers with the same operator, eigenvectors and real eigenvalues, subject to the hypotheses of the statement used.

Definition references

Justification

The finite sums are independent of enumeration and include the empty sum (A finite sum in a commutative monoid indexed by an arbitrary finite set). Pointwise operations make CV a complex vector space in the sense of Vector space over a field. Direct expansion using Real and imaginary parts, complex conjugation, and modulus and Conjugation is an involutive real-field automorphism, zz̄=|z|², and modulus is definite, multiplicative, and subadditive shows that (f,g)lib is linear in f, conjugate symmetric and has diagonal ∑x∣f(x)∣2, which is nonnegative and vanishes only when f=0; it is therefore an inner product in the library convention (Real and complex inner product spaces, with the inner product linear in the first argument). Its conjugate is the displayed second-linear pairing. Both have the same diagonal and hence the same induced norm (The norm ‖ v‖=√⟨ v,v⟩ induced by a real or complex inner product), which is a norm by The induced length is a norm.

Choose an enumeration of the finite set V. The indicator functions of its singletons form an ordered basis in the sense of Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis: they span each function by its finite coordinate expansion, and evaluating a linear combination at each vertex proves independence. This includes the empty basis when V=∅. Thus Every finite-dimensional normed space is Banach makes the induced norm complete, and Hilbert space gives the Hilbert-space designation.

An enumeration identifies the array with a finite square matrix as in Finite rectangular matrices over a commutative ring, their entries, rows and columns; the displayed action is linear by distributivity, in the sense of Linear map between vector spaces over the same field. Interchanging the two finite sums gives ⟨Af,g⟩=∑yf(y)‾∑xAxy‾g(x)=⟨f,A∗g⟩. The action of A∗ is linear, so it is an adjoint under the stated convention; it is unique because pairing the difference of two candidates with every f, including the difference itself, forces that difference to vanish. Conjugating the adjoint identity gives the defining linear-first identity of The adjoint T^*:W→ V is characterised by ⟨ Tv,w⟩_W=⟨ v,T^*w⟩_V, so the same adjoint works there.

Conjugation preserves zero and absolute value (Conjugation is an involutive real-field automorphism, zz̄=|z|², and modulus is definite, multiplicative, and subadditive), proving the orthogonality and Cauchy–Schwarz transfers. If A=A∗, the adjoint identity and conjugate symmetry give ⟨f,Af⟩=⟨f,Af⟩‾; the value is real and hence equals its conjugate, the library-convention value. The eigenvector equation Af=λf with f≠0, as in Eigenvalues, eigenvectors, eigenspaces E_λ(T)=ker(T-λ I), and the spectrum σ_F(T) of an endomorphism, does not involve a pairing, and self-adjointness is unchanged, so a spectral theorem in the library convention applies to the same operator and vectors whenever its own hypotheses hold.

Depends on

Used by · 26

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.