TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-11

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.

$[v]_{C} = P_{C \leftarrow B} [v]_{B}$ and $P_{B \leftarrow C} = P_{C \leftarrow B}^{- 1}$

Statement

For ordered bases $B, C$ of a finite-dimensional vector space $V$ and every $v \in V$ ,

$[v]_{C} = P_{C \leftarrow B} [v]_{B} .$

Moreover,

$P_{B \leftarrow C} = P_{C \leftarrow B}^{- 1} .$

Facts & Assumptions

Given: Ordered bases $B, C$ of $V$ and a vector $v \in V$ .

[L1]

$P_{C \leftarrow B}$ is the matrix of ${id}_{V}$ from $B$ -coordinates to $C$ -coordinates (The change-of-basis matrix $P_{C \leftarrow B} = [{id}_{V}]_{B}^{C}$ ).

[L2]

Coordinate action converts a vector's coordinate column by the matrix of the map, and matrix representation sends composites to products ( $[T (v)]_{C} = [T]_{B}^{C} [v]_{B}$ , $[S \circ T]_{B}^{D} = [S]_{C}^{D} [T]_{B}^{C}$ ).

Proof

technique · direct

1.1

Applying coordinate action from [L2] to ${id}_{V}$ and using [L1] gives $[v]_{C} = P_{C \leftarrow B} [v]_{B}$ .

givenL1L2

2.1

Represent the identity composition ${id}_{V} \circ {id}_{V}$ first from $B$ through $C$ back to $B$ , and then from $C$ through $B$ back to $C$ .

step 1.1L1L2

3.1

The composite-matrix formula in [L2] gives $P_{B \leftarrow C} P_{C \leftarrow B} = I$ and $P_{C \leftarrow B} P_{B \leftarrow C} = I$ , so the two matrices are inverses. Empty ordered bases give the same two equations in $M_{0} (F)$ .

step 2.1L1L2∎

Depends on

Used by

The same operator has two different matrices in two ordered bases Example
Local frames and local trivializations are equivalent data Proposition
[T]_B'^C'=P_C'leftarrowC[T]_B^CP_B leftarrowB' Theorem

Dependency tree · two levels

11 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

S. Axler, Linear Algebra Done Right, 4th ed., §3D, result 3.82 (standard reference, not scraped)
S. Schiavone, MIT 18.700 Day 9, Corollary 36 (standard reference, not scraped)

[v]C=PC←B[v]B[v]C​=PC←B​[v]B​ and PB←C=PC←B−1PB←C​=PC←B−1​