Alphabeta Math
PropositionStatement: AI-generatedProof: AI-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.

Annihilators, relative hyperplanes and complexification

Statement

Let V be a real vector space with finite basis (es)s∈S, let J⊆S, and let E={f∈V∗:f(ej)=0 for every j∈J}. For α∈V, write rα:E→R for the restricted evaluation rα(f)=f(α). Then rα is zero exactly when α∈span⁡{ej:j∈J}; otherwise its kernel is a linear hyperplane of E, meaning that its quotient in E has dimension one. Two nonzero restricted evaluations have the same kernel exactly when one is a nonzero real scalar multiple of the other.

Identify the complexification E⊗RC with E⊕iE by f⊗(a+bi)↦af+ibf. For a real hyperplane H⊆E, its complexification, understood as the image of H⊗RC under the inclusion into E⊗RC, is H⊕iH.

For subsets of E, relative interior and closure mean interior and closure computed in E with the metric induced by the coordinate Euclidean metric on V∗ associated to the basis (es). Thus balls used in these operations are balls in E.

Statement references

Facts & Assumptions

[F1]

The coordinate functional es∗ has es∗(et)=δst; a functional is determined by its values on the basis, and V∗ has pointwise linear operations (The dual family (b^)_b∈ B associated to a Hamel basis B, defined by b^(c)=δ_bc, Linear functionals and the algebraic dual V^*=L(V,F)).

[F2]

The kernel of a linear map is its zero fibre. A linear hyperplane is a subspace whose quotient has dimension one (Kernel and image of a linear map, Linear hyperplane).

[F3]

For a real vector space X, the tensor and direct-sum models of complexification are canonically isomorphic by ΦX:C⊗RX→X⊕iX, with z⊗x corresponding to z(x+i0) (The tensor and direct-sum models of complexification are canonically complex-linearly isomorphic).

[F4]

In a metric space, the interior consists of points having a ball contained in the set, and the closure consists of points whose every ball meets the set (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

[F5]

Over the commutative ring R, tensor symmetry is an isomorphism σX,Y:X⊗RY→Y⊗RX sending x⊗y to y⊗x (Symmetry and associativity isomorphisms for tensor products over a commutative ring). Real-linear maps u:X→X′ and v:Y→Y′ induce u⊗v, sending x⊗y to u(x)⊗v(y) (Module homomorphisms induce tensor-product homomorphisms functorially).

[F6]

If (X,dX) is a metric space and A⊆X, then dA=dX∣A×A is a metric on A and BA(a,r)=BX(a,r)∩A for a∈A and r>0 (Isometry, isometric embedding, and the subspace metric on a subset).

[F7]

For every integer n≥1, the function d2(x,y)=(∑k<n(xk−yk)2)1/2 is a metric on Rn (ℝⁿ as the set of functions n → ℝ, and d₁, d₂, d_∞ are metrics on it).

[F8]

A basis is a linearly independent spanning subset; the empty basis is a basis exactly of the zero space (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). The span is the smallest linear subspace containing the given subset, and consists exactly of its finite linear combinations, including the empty combination (Linear combination of a finite list, and the span span(S) as the smallest linear subspace containing S, span(S) is exactly the set of linear combinations of finite lists of elements of S, and span(∅) = {0_V}).

[F9]

For a vector space X and a linear subspace K, the quotient X/K has classes x+K and operations (x+K)+(y+K)=(x+y)+K and a(x+K)=ax+K (The quotient vector space V/W and its canonical projection). These operations are well-defined and make X/K a vector space; the projection x↦x+K is linear and surjective with kernel K (Coset equality, well-defined quotient operations, and the canonical projection with kernel W).

[F10]

A vector space with a finite basis has dimension equal to the number of elements of that basis (Finite-dimensional vector space, and its dimension dim_F V; infinite-dimensional means having no finite basis).

[F11]

A linear subspace contains zero and is closed under addition and scalar multiplication; with the restricted operations it is a vector space (Linear subspace of a vector space). A map between vector spaces over the same field is linear when T(au+bv)=aT(u)+bT(v) for all vectors u,v and scalars a,b (Linear map between vector spaces over the same field).

Proof

Given: The finite real basis, subset J, set E, and restricted evaluations in the statement. Define d(f,g)=(∑s∈S∣f(es)−g(es)∣2)1/2 on V∗.

Goal: Prove the assertions about restricted evaluations, their kernels, and complexification, and specify the relative operations.

1.1givenF1F2F11algebra

The zero functional belongs to E. For f,g∈E and a,b∈R, pointwise operations give (af+bg)(ej)=af(ej)+bg(ej)=0 for every j∈J. Thus E is a real linear subspace of V∗ and inherits its vector-space operations. For every α∈V, those same operations give rα(af+bg)=arα(f)+brα(g), so rα is real-linear and rα(0)=0. Put Kα=ker⁡rα. It contains zero, and if f,g∈Kα then rα(af+bg)=0 for all a,b∈R. Hence Kα is a real linear subspace of E. These checks apply also when J is empty or E={0}.

1.2givenF1F8algebra

Write α=∑s∈Sases. For f∈E, linearity gives rα(f)=∑s∉Jasf(es). If α is in the indicated span this is zero for all f∈E. Conversely, if rα=0, then es∗∈E for each s∉J, so evaluation at es∗ gives as=0 for every such s. This proves the equivalence.

1.3givenF1F7F8choosealgebra

Put n=∣S∣. If n≥1, enumerate S={s0,…,sn−1} and define C:V∗→Rn by C(f)k=f(esk). By [F1], C is injective because a functional is determined by its basis values, and it is surjective because x∈Rn is the image of ∑k<nxkesk∗. The coordinate formula gives d(f,g)=d2(C(f),C(g)). By [F7], d is nonnegative, symmetric and satisfies the triangle inequality; also d(f,g)=0 exactly when C(f)=C(g), which by injectivity is exactly when f=g. If n=0, then V={0} and V∗={0}, and the empty-sum formula gives the unique distance d(0,0)=0; separation and symmetry hold, and the only triangle inequality is 0≤0+0. Thus d is a metric in every case.

2.1givenF2F8F9F10step 1.1choosealgebra

Suppose rα is nonzero. Choose u∈E with rα(u)=1, by rescaling a vector on which it is nonzero. Every f∈E has the unique decomposition f=(f−rα(f)u)+rα(f)u, with the first term in ker⁡rα. Hence the quotient E/ker⁡rα is spanned by the nonzero class of u and has dimension one; its kernel is therefore a hyperplane.

2.2givenF2F3F5F11step 1.1algebra

A real hyperplane H⊆E is a linear subspace by [F2], hence a real vector space by [F11]. For X=E and X=H, compose the tensor symmetry in [F5] with ΦX in [F3] to obtain the isomorphism TX=ΦX∘σX,C:X⊗RC→X⊕iX. It sends x⊗(a+bi) to ax+ibx and has inverse x+iy↦x⊗1+y⊗i. Thus TE gives the stated identification.

3.1step 2.1step 1.1F2choosealgebra

Let r and q be nonzero restricted evaluations with the same kernel, and choose u with r(u)=1. The decomposition in step 2.1 gives q(f)=r(f)q(u) for every f∈E. Since q is nonzero, q(u)≠0, so q is a nonzero scalar multiple of r. Conversely, multiplying a functional by a nonzero scalar does not change its zero fibre.

3.2givenF5F11step 2.2algebra

Let j:H→E be the inclusion. Since H has the restricted operations, j(ah+bk)=aj(h)+bj(k) for h,k∈H and a,b∈R, so j is real-linear; the identity on C is real-linear by the same criterion. By [F5] it induces jC=j⊗id⁡C:H⊗RC→E⊗RC. For h,k∈H, the inverse formula in step 2.2 gives TE(jC(TH−1(h+ik)))=TE(j(h)⊗1+j(k)⊗i)=j(h)+ij(k). Hence, under these isomorphisms, jC is the componentwise inclusion H⊕iH→E⊕iE. This inclusion is injective because its value is zero only when both h=0 and k=0, and its image is exactly H⊕iH. This proves the complexification assertion.

4.1givenF4F6step 1.3step 1.2step 2.1step 3.1step 2.2step 3.2∎

Apply [F6] with X=V∗, its coordinate Euclidean metric d established in step 1.3, and A=E. The restriction dE=d∣E×E is a metric on E, and its balls are BE(f,r)=BV∗(f,r)∩E for f∈E and r>0. Applying [F4] to (E,dE) gives exactly the stated relative interior and closure, with all balls taken in E. Together with steps 1.2, 2.1, 3.1, 2.2 and 3.2, this proves every assertion.

Depends on

Used by · 9

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.