Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-03
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.

The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial

Statement

For a linear map T:V→W, the sets ker⁡T and im⁡T are linear subspaces. Moreover, T is injective if and only if ker⁡T={0V}.

Facts & Assumptions

Given: A linear map T:V→W of vector spaces over a field F.

[L1]

The kernel and image have the displayed set descriptions (Kernel and image of a linear map).

[L3]

A linear map carries au+v to aT(u)+T(v), preserves zero, and preserves subtraction (Linear map between vector spaces over the same field, A linear map preserves zero, negatives, and subtraction).

[L4]

A function is injective when equal outputs have equal inputs (Injection, surjection, bijection).

Proof

technique · direct
1.1

The kernel contains 0V by [L3]. If u,v∈ker⁡T and a∈F, then T(au+v)=aT(u)+T(v)=0W, so au+v∈ker⁡T.

L1L2L3given
1.2

The image contains 0W=T(0V). If T(u),T(v)∈im⁡T and a∈F, then aT(u)+T(v)=T(au+v) lies in the image.

L1L2L3given
1.3

If T is injective and v∈ker⁡T, then T(v)=0W=T(0V), so v=0V and the kernel is trivial.

L1L3L4given
1.4

Conversely, suppose ker⁡T={0V} and T(u)=T(v). Then T(u−v)=0W by [L3], so u−v=0V and u=v.

L1L3L4given
2.1

The subspace criterion proves that both ker⁡T and im⁡T are linear subspaces.

step 1.1step 1.2L2
3.1

Thus T is injective exactly when its kernel is trivial.

step 1.3step 1.4∎

Depends on

Used by

Cited to discharge well-definedness by Kernel and image of a linear map.

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