Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29
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.

Complexification is a functor on real vector spaces and real-linear maps

Statement

For real vector spaces V,W,U and real-linear maps T:V→W and S:W→U, the complexification of Complexification of a real-linear map satisfies

(id⁡V)C=id⁡VC,(S∘T)C=SC∘TC.

Thus V↦VC, T↦TC is a functor from real vector spaces to complex vector spaces.

Facts & Assumptions

Given: Real-linear maps T:V→W and S:W→U.

[L1]

The complexification of a real-linear map is TC=id⁡C⊗T, with TC(z⊗v)=z⊗T(v) (Complexification of a real-linear map).

[L2]

For homomorphisms of right and left modules, id⁡⊗id⁡=id⁡ and (f′∘f)⊗(g′∘g)=(f′⊗g′)∘(f⊗g) (Module homomorphisms induce tensor-product homomorphisms functorially).

Proof

technique · direct
1.1L1L2

By [L2] applied with f=f′=id⁡C and g=id⁡V, one has (id⁡V)C=id⁡C⊗id⁡V=id⁡VC by [L1].

1.2L1L2algebra

By [L2] applied with f=f′=id⁡C, g=T and g′=S, one has (S∘T)C=id⁡C⊗(S∘T)=(id⁡C∘id⁡C)⊗(S∘T)=(id⁡C⊗S)∘(id⁡C⊗T)=SC∘TC by [L1].

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 are exactly the identity and composition laws of a functor.

Depends on

Used by

Dependency tree · two levels

9 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