Alphabeta Math
Pipeline-generated
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.

11 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Complexification, Realification and Real Structures: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These examples run the complexification and realification machinery on concrete spaces: the standard embedding RnCn as the canonical complexification map, bounded real polynomial spaces, the doubled real basis of (Cn)R, the quarter-turn diagonalised only after complexification, the invariant real plane reconstructed from one nonreal eigenvector, and two distinct conjugations on C2 with different fixed real forms.

The counterexample and false statements isolate exactly where the A-page theorems have hypotheses: a complex-linear map need not preserve a chosen real form, complexification does not double finite dimension (realification does), no preferred real form is attached to a complex vector space, descent to a real form requires commutation with the chosen conjugation, and complexification can create complex eigenvectors without creating real ones.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

The standard embedding RnCn is the canonical complexification map

Example

Take V=Rn with its standard real basis e1,,en. The identification

CRRnCn,zejzej,

carries the canonical embedding ιx=1x of Complexification as CRV with its canonical real-linear embedding to the standard inclusion RnCn that views a real coordinate vector as a complex one. For n=0 both sides are the zero space.

Facts & Assumptions

Given: The standard real basis (e1,,en) of Rn and the canonical embedding ι.

[L1]

The complexification VC=CRV carries the scalar action z(wv)=(zw)v and the real-linear embedding ιv=1v (Complexification as CRV with its canonical real-linear embedding).

[L2]

The map Φ:CRVViV, Φ(zv)=z(v,0), is a complex-linear isomorphism with inverse Ψ(v+iw)=1v+iw (The tensor and direct-sum models of complexification are canonically complex-linearly isomorphic).

[L3]

A real ordered basis becomes a complex ordered basis after complexification (A real basis becomes a complex basis after complexification, so dimC(CRV)=dimRV).

Verification

technique · direct
1.1

The list (e1,,en) is a real basis of Rn by definition of the standard basis.

given
1.2

By [L2], CRRnRniRn through Φ, and the assignment (x,y)x+iy, taken coordinatewise, is a complex-linear isomorphism RniRnCn: complex scalar multiplication (a+bi)(x,y)=(axby,ay+bx) is sent to (axby)+i(ay+bx)=(a+bi)(x+iy).

L2algebra
2.1

Composing, the element zej maps to z(ej,0) and then to the jth standard complex vector scaled by z; additivity extends this to every tensor.

step 1.2algebra
3.1

For x=(x1,,xn) one has ιx=1x=jxj(1ej), which step 2.1 sends to jxjej=x; this is exactly the standard inclusion of Rn into Cn, and by [L3] the images ιej=ej form the complex basis of the complexification.

L1L3step 2.1
4.1

Steps 1.2 and 3.1 identify the complexification with Cn and the canonical embedding with the standard inclusion.

step 1.2step 3.1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

Complexifying a real polynomial space gives the same degree bound with complex coefficients

Example

Let R[x]d be the real vector space of real polynomials of degree at most d and C[x]d the complex vector space of complex polynomials of degree at most d, for a fixed d0. Then

CRR[x]dC[x]d,zpzp,

and the canonical embedding ιp=1p becomes the inclusion R[x]dC[x]d. Complexification does not raise the degree bound; it only replaces real coefficients by complex ones.

Facts & Assumptions

Given: The real vector space V=R[x]d and the complex vector space W=C[x]d.

[L1]

The complexification VC=CRV carries the scalar action z(wv)=(zw)v and the real-linear embedding ιv=1v (Complexification as CRV with its canonical real-linear embedding).

[L2]

The map Φ:CRVViV, Φ(zv)=z(v,0), is a complex-linear isomorphism with inverse Ψ(v+iw)=1v+iw (The tensor and direct-sum models of complexification are canonically complex-linearly isomorphic).

[L3]

A real-linear map f:VW into a complex vector space extends to a unique complex-linear map F:VCW with F(zv)=zf(v) (Complexification is initial for real-linear maps into complex vector spaces, and is unique up to unique isomorphism).

Verification

technique · direct
1.1

The monomials 1,x,,xd form a real basis of R[x]d and a complex basis of C[x]d.

given
1.2

The real-linear inclusion f:R[x]dC[x]d extends by [L3] to a unique complex-linear map F with F(zp)=zp; by the scalar action of [L1] this is the map z(1p)zf(p) on the tensor model.

L1L3
2.1

By [L2], every element of CRR[x]d is 1p+iq with p,qR[x]d, and F sends it to p+iqC[x]d; the monomial images F(1xj)=xj are the complex basis of step 1.1, so F is a complex-linear isomorphism.

L2step 1.1step 1.2
3.1

Degree bound: p+iq has degree at most d because p and q do, so no degree bound is lost; the embedding ιp=1p maps to p itself, the inclusion of the real polynomials.

step 1.2step 2.1
4.1

Steps 1.2 through 3.1 identify the complexification with C[x]d and the canonical embedding with the inclusion.

step 2.1step 3.1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

Realifying Cn gives R2n with basis e1,ie1,,en,ien

Example

The realification (Cn)R of the complex coordinate space has real dimension 2n. Writing the standard complex basis vectors as e1,,en, an explicit real basis is

e1, ie1, e2, ie2, , en, ien,

so (Cn)RR2n by sending ej to e2j1 and iej to e2j of R2n.

Facts & Assumptions

Given: The complex vector space Cn with standard basis e1,,en.

[L1]

The realification WR is the real vector space with the same underlying set and addition as W, and scalar multiplication restricted to RC (Realification of a complex vector space by restriction of scalars).

[L2]

If W is finite-dimensional over C with dimCW=n, then dimRWR=2n (Realification doubles finite dimension).

Verification

technique · direct
1.1

The standard basis has n elements, so dimCCn=n.

given
1.2

The displayed list spans (Cn)R: every w=jzjej writes zj=aj+ibj with real aj,bj, and by [L1] scalar multiplication by the real parts is real scalar multiplication, giving w=jajej+jbj(iej).

L1algebra
2.1

By [L2], dimR(Cn)R=2n.

L2step 1.1
2.2

The list is real-linearly independent: jajej+jbj(iej)=0 means j(aj+ibj)ej=0 in Cn, so complex independence of (e1,,en) forces every aj=bj=0.

step 1.2algebra
3.1

Steps 1.2 and 2.2 exhibit the displayed list as a real basis with 2n entries, matching the dimension of step 2.1; the coordinate map identifies it with R2n.

step 1.2step 2.1step 2.2
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

The real quarter-turn diagonalises after complexification but has no real eigenvector

Example

Let T:R2R2 be the quarter-turn with matrix

A=(0110)

in the standard basis. Its complexification TC acts on C2 by the same matrix, has eigenvalues i and i with eigenvectors (1,i) and (1,i), and is therefore diagonalised over C by that eigenbasis. Nevertheless T itself has no real eigenvector.

Facts & Assumptions

Given: The quarter-turn T with the displayed matrix A.

[L1]

Complexification preserves the characteristic and minimal polynomials of a finite-dimensional real operator (Complexification preserves the characteristic and minimal polynomials of a finite-dimensional real operator).

[L2]

The canonical conjugation interchanges the generalised eigenspaces of λ and λ (For a real operator, nonreal generalised eigenspaces of the complexification occur in conjugate pairs).

Verification

technique · direct
1.1

The characteristic polynomial is χT(x)=det(xIA)=x2+1, and by [L1] the complexified operator has the same polynomial, which factors as (xi)(x+i) over C.

L1algebra
1.2

For λ=i, the equation (AiI)w=0 is ixy=0 and xiy=0, so y=ix and wi=(1,i) is an eigenvector; symmetrically wi=(1,i) is an eigenvector for λ=i.

algebra
2.1

The vectors wi and wi are complex-linearly independent, so they form a complex basis of C2 in which TC has the diagonal matrix diag(i,i).

step 1.2algebra
2.2

Conjugation satisfies σ(wi)=(1,i)=wi, the conjugate-pair behaviour recorded in [L2] with exponent 1.

L2step 1.2
2.3

A real eigenvector v0 would carry a real eigenvalue λ with Av=λv; taking a nonzero coordinate of v shows λ is real, and then step 1.1 gives λ2+1=0, which has no real solution.

step 1.1algebra
3.1

Steps 2.1 and 2.3 together prove the example: diagonalisation after complexification with no real eigenvector beforehand.

step 2.1step 2.3
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

One nonreal eigenvector reconstructs the invariant real plane of a rotation-scaling block

Example

Let T:R2R2 have matrix

A=(1111).

The eigenvalue λ=1+i has the eigenvector w=(1,i)=u+iv with u=(1,0) and v=(0,1). The corollary reconstructs from w alone the T-invariant real plane spanR{u,v}=R2 and the rotation-scaling block: in the ordered basis (u,v)=(e1,e2) the matrix of T is the displayed A itself, which has the standard form (abba) with a=b=1.

Facts & Assumptions

Given: The operator T with the displayed matrix A and the vector w=(1,i).

[L1]

A nonreal eigenvector u+iv with eigenvalue a+bi, b0, yields independent u,v, an invariant real plane, and the matrix (abba) in the ordered basis (u,v) (A nonreal eigenvector yields an invariant real two-plane and the standard rotation-scaling block).

Verification

technique · direct
1.1

The characteristic polynomial is det(xIA)=(x1)2+1=x22x+2, whose roots are 1±i, both nonreal.

algebra
1.2

For λ=1+i, the equation (AλI)w=0 is ixy=0 and xiy=0, so y=ix; the choice x=1 gives w=(1,i)=u+iv with u=(1,0) and v=(0,1).

algebra
2.1

Applying [L1] with a=b=1: u and v are R-linearly independent, spanR{u,v}=R2 is T-invariant, and in the ordered basis (u,v)=(e1,e2) the matrix of T is (abba)=(1111)=A.

L1step 1.2
2.2

The conjugate vector σ(w)=(1,i) is an eigenvector with eigenvalue 1i, as recorded in [L1].

L1step 1.2
3.1

Steps 2.1 and 2.2 reconstruct the invariant plane and the block from the single nonreal eigenvector.

step 2.1step 2.2
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

Different conjugations on C2 can have different fixed real forms

Example

On W=C2 define the coordinatewise conjugation

σ0(z1,z2)=(z1,z2)

and the transposed conjugation

σ(z1,z2)=(z2,z1).

Their fixed real forms are Wσ0=R2 and Wσ={(w,w):wC}, a different real two-plane of (C2)R. One complex vector space therefore carries two different real forms, attached to two different choices of conjugation.

Facts & Assumptions

Given: The complex vector space W=C2 and the two displayed maps σ0,σ.

[L1]

The fixed points of a conjugation form a real subspace whose complexification recovers the ambient complex space (The fixed points of a conjugation form a real vector space whose complexification recovers the ambient complex space).

[L2]

Real forms of a complex vector space correspond exactly to conjugations (Real forms of a complex vector space correspond exactly to conjugations).

Verification

technique · direct
1.1

The map σ0 is a conjugation: it is additive, σ0(λz)=(λz1,λz2)=λσ0(z), and applying it twice is the identity.

algebra
1.2

The map σ is also a conjugation: additivity is clear, σ(λz)=(λz2,λz1)=λσ(z), and σσ(z)=(z1,z2).

algebra
2.1

The fixed set of σ0 is {(z1,z2):z1=z1, z2=z2}=R2, the real coordinate plane inside (C2)R.

step 1.1algebra
2.2

The fixed set of σ is {(z1,z2):z1=z2}={(w,w):wC}={(a+bi,abi):a,bR}, a real two-plane.

step 1.2algebra
3.1

The two fixed sets are different real subspaces: (1,0) is fixed by σ0 but σ(1,0)=(0,1)(1,0). By [L1] each is a real form whose complexification recovers C2, and by [L2] the distinct conjugations give distinct real forms.

step 2.1step 2.2L1L2
4.1

Steps 1.1 through 3.1 exhibit two different conjugations and two different fixed real forms on one complex vector space.

step 2.1step 2.2step 3.1
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

A complex-linear map need not preserve a chosen real form

Statement refuted

Every complex-linear operator on a complex vector space preserves every chosen real form; equivalently, a complex-linear operator always descends to the fixed real form of a given conjugation.

Facts & Assumptions

Given: The conjugation σ0 on C2, its fixed real form V=R2, and the displayed operator T.

[L1]

The fixed real form of a conjugation is the real subspace of its fixed points (The fixed real form of a conjugation).

[L2]

A complex-linear operator comes from a real operator on the fixed real form exactly when it commutes with the chosen conjugation (A complex-linear operator comes from a real operator exactly when it commutes with the chosen conjugation).

Counterexample

Take W=C2 with the coordinatewise conjugation σ0(z1,z2)=(z1,z2), whose fixed real form is R2. The complex-linear operator

T(z1,z2)=(iz1,z2)

does not commute with σ0: at w=(1,0) one has Tσ0(w)=(i,0) while σ0T(w)=(i,0). Consequently T does not come from a real operator on R2, and T does not even carry R2 into itself, since T(1,0)=(i,0)R2.

Proof technique: direct.

1.1

The map σ0 is a conjugation, and by [L1] its fixed real form is {(z1,z2):z1=z1, z2=z2}=R2.

L1algebra
1.2

The map T is complex-linear: T(λz1,λz2)=(iλz1,λz2)=λT(z1,z2).

algebra
1.3

The two maps do not commute: Tσ0(1,0)=T(1,0)=(i,0), while σ0T(1,0)=σ0(i,0)=(i,0).

algebra
2.1

By [L2], T does not come from any real operator on R2; concretely T(1,0)=(i,0)R2, so T does not even preserve the chosen real form as a set.

L2step 1.3
3.1

Steps 1.2, 1.3 and 2.1 refute the claimed universality: a complex-linear map can fail to preserve a chosen real form.

step 1.2step 1.3step 2.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-29Open item page →

FALSE: complexification doubles finite dimension

Statement

Complexification doubles finite dimension: for every finite-dimensional real vector space V,

dimC(CRV)=2dimRV.

Facts & Assumptions

Given: A finite-dimensional real vector space V and its complexification VC.

[L1]

The complexification of Rn is canonically Cn through the standard inclusion (The standard embedding RnCn is the canonical complexification map).

[L2]

A real basis becomes a complex basis after complexification, so dimC(CRV)=dimRV (A real basis becomes a complex basis after complexification, so dimC(CRV)=dimRV).

Refutation

technique · direct
1.1

By [L2], dimCVC=dimRV for every finite-dimensional real V: the embedded image of a real basis is already a complex basis of the complexification.

L2
1.2

The concrete witness V=R confirms the correct value: by [L1] with n=1, VCC, so dimCVC=1=dimRR, not 2.

L1L2
2.1

The doubling behaviour belongs to realification, the reverse construction, which replaces complex scalars by real ones; complexification keeps the numerical dimension unchanged.

step 1.1step 1.2
3.1

Steps 1.1 and 1.2 contradict the claimed factor of 2, so the displayed statement is false.

step 1.1step 1.2
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

FALSE: every complex vector space has a preferred real form

Statement

Every nonzero complex vector space carries a real form singled out by the complex structure alone, in the precise sense that the real form is invariant under every complex-linear automorphism.

Facts & Assumptions

Given: A nonzero complex vector space W and a real form W0W.

[L1]

A real form is the fixed space of a conjugation, and its complexification recovers W; in particular every wW has a unique expression w=u+iv with u,vW0 (Real forms of a complex vector space correspond exactly to conjugations, The fixed points of a conjugation form a real vector space whose complexification recovers the ambient complex space).

Refutation

technique · direct
1.1

Multiplication by i is a complex-linear automorphism of W. If it preserved W0, then iuW0 for every uW0.

givenalgebra
2.1

Choose 0uW0. Under the preservation assumption of step 1.1, iuW0, so iu=(iu)+i0=0+iu would be two decompositions of the same vector with real and imaginary parts in W0, contradicting uniqueness in [L1].

L1step 1.1contradiction
3.1

Thus no real form of a nonzero complex vector space is invariant under all complex-linear automorphisms. The complex structure alone therefore singles out no preferred real form, and the claim is false.

step 2.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

FALSE: every complex-linear operator descends to every chosen real form

Statement

Every complex-linear operator on a complex vector space descends to every chosen real form.

Facts & Assumptions

Given: The complex vector space C2, the coordinatewise conjugation σ0, the real form R2, and the operator T(z1,z2)=(iz1,z2).

[L1]

The complex-linear operator T(z1,z2)=(iz1,z2) fails to commute with σ0 and does not carry R2 into itself (A complex-linear map need not preserve a chosen real form).

[L2]

A complex-linear operator comes from a real operator on the fixed real form exactly when it commutes with the chosen conjugation (A complex-linear operator comes from a real operator exactly when it commutes with the chosen conjugation).

Refutation

technique · direct
1.1

By [L1], the operator T is complex-linear but satisfies Tσ0σ0T, with the concrete witness Tσ0(1,0)=(i,0)(i,0)=σ0T(1,0).

L1
2.1

By [L2], the failure of commutation means T is not of the form θSCθ1 for any real operator S on R2; hence T does not descend to this chosen real form.

L2step 1.1
3.1

Steps 1.1 and 2.1 exhibit one complex-linear operator and one chosen real form for which descent fails, refuting the claimed universal statement.

step 1.1step 2.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29Open item page →

FALSE: complexification creates a real eigenvector whenever it creates a complex one

Statement

If the complexification of a real operator acquires a complex eigenvector, then the original real operator acquires a real eigenvector.

Facts & Assumptions

Given: The quarter-turn T:R2R2 with matrix (0110) and its complexification TC.

[L1]

The complexification TC has the nonreal eigenvalues ±i with eigenvectors (1,i) and (1,i), while T itself has no real eigenvector (The real quarter-turn diagonalises after complexification but has no real eigenvector).

Refutation

technique · direct
1.1

By [L1], complexification creates a complex eigenvector: (1,i) is an eigenvector of TC with eigenvalue i.

L1
1.2

By [L1], T has no real eigenvector: any real eigenvector v0 would carry a real eigenvalue λ with λ2+1=0, which is impossible in R.

L1
2.1

Steps 1.1 and 1.2 provide a case where a complex eigenvector is created with no accompanying real eigenvector, contradicting the claimed implication.

step 1.1step 1.2

Sources