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.
is a vector-space isomorphism
Statement
Let be finite-dimensional vector spaces over , with ordered bases and . The map
is a vector-space isomorphism.
Facts & Assumptions
Given: The finite-dimensional spaces and ordered bases in the Statement.
is a vector space under pointwise operations ( is a vector space over the common scalar field).
An ordered basis gives every vector a unique coordinate list (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis).
A linear isomorphism is a linear map with a two-sided linear inverse (Invertible linear maps, linear isomorphisms, and inverse linear maps).
Proof
For every basis vector , coordinate uniqueness in [L2] gives and , so is linear column by column.
If , then [L2] gives for every ; linearity and the unique expansion of every vector in give , so is injective.
Given , prescribe and, for the unique expansion from [L2], define . This is well defined and linear, and the -th matrix column is the -th column of ; hence . Together with steps 1.1 and 2.1, is a linear bijection. Its set-theoretic inverse is linear: if and , then injectivity and linearity give and . Thus is a linear isomorphism by [L3].
If , then is the zero space and both sides contain only their zero element; if , then and are zero spaces and the only map is the zero map. Thus the construction also proves the isomorphism in every zero-dimensional case.
Depends on
- $\mathcal L(V,W)$ is a vector space over the common scalar field
- Invertible linear maps, linear isomorphisms, and inverse linear maps
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
- A finite list $v : n \to V$ is an ordered basis if and only if every $x \in V$ equals $\sum_{i<n} \lambda_i v_i$ for exactly one $\lambda : n \to F$; those scalars are the coordinates of $x$ in that ordered basis
- The vector space $M_{m \times n}(F) := F^{\,m \times n}$ of $m$ by $n$ matrices over a field, with entrywise operations
Used by
- dim_F M_m× n(F)=mn and dim_F mathcal L(V,W)=(dim_FV)(dim_FW) for finite-dimensional V,W Corollary
- End_F(V) is a ring and matrix representation is a ring isomorphism End_F(V)≅ Mₙ(F) Corollary
- Chosen bases exhibit Mat_F as equivalent to finite-dimensional vector spaces Example
- [S∘ T]_mathcal B^mathcal D=[S]_mathcal C^mathcal D[T]_mathcal B^mathcal C Theorem
- A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 57 results over 19 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
- S. Schiavone, MIT 18.700 Day 9, Proposition 26 (standard reference, not scraped)