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.
Adjoints satisfy , , , and
Statement
For compatible linear maps between finite-dimensional real or complex inner product spaces,
Also and .
Facts & Assumptions
Given: Compatible finite-dimensional linear maps and a scalar .
An adjoint is characterised by (The adjoint is characterised by ).
Finite-dimensional adjoints exist and are unique (Every linear map between finite-dimensional inner product spaces has a unique adjoint).
Equality of pairings with every vector forces equality of the paired vectors (Inner products separate vectors, and the induced norm is homogeneous: ).
Proof
For all , linearity in the first argument and [L1] give . Uniqueness in [L2] proves the sum formula. The same calculation gives and .
Likewise , because the second argument is conjugate-linear. Thus .
For a composite, , so uniqueness gives .
Conjugate symmetry rewrites [L1] as , so is an adjoint of . By [L2], .
Depends on
Used by
- Orthogonal and unitary operators form groups, and their determinants have modulus one Corollary
- FALSE: On a complex inner product space, (λ T)^*=λ T^* for every scalar False statement
- For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T^*T=I are equivalent Theorem
- ker T^*=(imT)^⊥ and imT^*=(ker T)^⊥ in finite dimension Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 36 results over 12 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 7.5 (standard reference, not scraped)
- Sergei Treil, Linear Algebra Done Wrong, §5.5.1, useful formulas for adjoints (standard reference, not scraped)