Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck pass
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=PC←B[v]B and PB←C=PC←B−1

Statement

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

[v]C=PC←B[v]B.

Moreover,

PB←C=PC←B−1.

Facts & Assumptions

Given: Ordered bases B,C of V and a vector v∈V.

[L1]

PC←B is the matrix of id⁡V from B-coordinates to C-coordinates (The change-of-basis matrix PC←B=[id⁡V]BC).

[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]BC[v]B, [S∘T]BD=[S]CD[T]BC).

Proof

technique · direct
1.1givenL1L2

Applying coordinate action from [L2] to id⁡V and using [L1] gives [v]C=PC←B[v]B.

2.1step 1.1L1L2

Represent the identity composition id⁡V∘id⁡V first from B through C back to B, and then from C through B back to C.

3.1step 2.1L1L2∎

The composite-matrix formula in [L2] gives PB←CPC←B=I and PC←BPB←C=I, so the two matrices are inverses. Empty ordered bases give the same two equations in M0(F).

Remarks

Let n=dim⁡V, and write κB:V→Fn for v↦[v]B, with κC defined similarly. Here Fn is identified with the coordinate-column space Mn×1(F). The coordinate-change identity in step 1.1 is the commutativity of this square; the bottom arrow denotes multiplication by the displayed matrix.

VVFnFnidV∙B∙CPCÃB

The reverse coordinate conversion is multiplication by PB←C. Step 3.1 gives both compositions:

PB←CPC←B=In,PC←BPB←C=In.

Thus the two bottom coordinate spaces are inverse identifications of the same vector space, including when n=0. The proof above is independent of the figure.

Depends on

Used by

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