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 complex coordinate map preserves real scalar multiplication
Statement
Let be the coordinate bijection . Here a map is real-linear when it preserves addition and multiplication by real scalars embedded in via The complex numbers as , with the real embedding and imaginary unit . Then is real-linear: for all and ,
Facts & Assumptions
Given: The complex field and the coordinate map .
is the real coordinate plane, with coordinate arithmetic: Each complex number has a unique form ; is bijective and preserves addition, and .
The complex numbers as , with the real embedding and imaginary unit : The canonical real embedding is the constant-class map; the imaginary unit is the class of , so an embedded real has coordinate form .
Proof
Write . The embedded scalar has coordinates by [F2], so the coordinate multiplication formula in [F1] gives for every , including .
Additivity and bijectivity are [F1]; step 1.1 supplies real homogeneity. These are exactly the stated real-linearity conditions, so is a real-linear bijection.
Depends on
Used by
- A finite coordinate path and a bounded nonrectifiable path Example
- Complex differentiability is equivalent to real total differentiability together with a complex-linear derivative, with ∂_z̄f=0, or with the Cauchy–Riemann equations Theorem
- Real total derivatives transport through the complex coordinate isometry Theorem
- The complex coordinate isometry transports topology and affine segments Theorem
Dependency tree · two levels
6 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
- J. Lebl, Guide to Cultivating Complex Analysis, Section 1.1.1 (standard reference, not scraped)
- E. Stein and R. Shakarchi, Complex Analysis, Princeton Lectures in Analysis II, Chapter 1, Section 1.1 (standard reference, not scraped)