Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Distinct exponential characters are linearly independent on a nonempty open set, and the real-part grouping rule

Statement

Let n≥1, let U⊆Rn be a nonempty open set, let λ1,…,λm∈Cn (m≥1) be pairwise distinct, and let c1,…,cm∈Cq for some q≥1 (the scalar case q=1 included; all statements below are componentwise). Write λj⋅z for the componentwise bilinear extension of the Euclidean inner product of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn; the variable z remains real and eiw for the complex exponential of The complex exponential by its power series at iw, and consider the Cq-valued map F(z):=∑j=1mcj eiλj⋅z on U. Then:

(a) [Complex independence] if F(z)=0 for every z∈U, then c1=⋯=cm=0.

(b) [Real-part grouping rule] if Re⁡F(z)=0 for every z∈U, then for every ν∈Cn the grouped coefficient Cν:=∑λj=νcj+∑λj=−ν‾cj‾ vanishes; in particular cj=0 whenever λj≠−λj‾ and λj∉{λk,−λk‾:k≠j}. At a self-paired frequency ν=−ν‾ the coefficient is 2Re⁡∑λj=νcj; in particular at ν=0 only the real part is constrained, and a purely imaginary coefficient is allowed.

(c) [Scope] no hypothesis beyond pairwise distinctness of the λj and nonemptiness and openness of U is used; λj=0 is allowed and the λj need not be nonzero, ordered or normalized. The statement concerns the open set U and asserts nothing on sets with empty interior, where distinct characters can agree.

Facts & Assumptions

Given: An integer n≥1, a nonempty open U⊆Rn, pairwise distinct λ1,…,λm∈Cn with m≥1, and coefficients c1,…,cm∈Cq with q≥1; the map F(z)=∑j=1mcjeiλj⋅z on U, with the inner product of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

[F1]

The complex exponential is the everywhere convergent series exp⁡w=∑n≥0wn/n!, with exp⁡0=1, and it is entire with exp⁡′=exp⁡ (The complex exponential by its power series, The complex exponential is entire and its complex derivative is itself). Also exp⁡(z+w)=exp⁡zexp⁡w (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential), hence exp⁡wexp⁡(−w)=1 and exp⁡w≠0 for every complex w.

[F2]

Conjugation and modulus: a+bi‾=a−bi and ∣a+bi∣=a2+b2, so w+w‾=2Re⁡w by the coordinate formulas (Real and imaginary parts, complex conjugation, and modulus); conjugation is an involutive real-field automorphism satisfying z+w‾=z‾+w‾, zw‾=z‾ w‾, z‾‾=z, and zz‾=∣z∣2 (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F3]

C is a field containing the embedded copy of R, every complex number has the unique form a+bi with a,b∈R and i2=−1, and a product in a field vanishes only if one of its factors vanishes (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2), The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i).

[F4]

In The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, vectors are functions on {0,…,n−1} and ⟨x,y⟩=∑r=0n−1x(r)y(r). For the one-based coordinate notation used here, define xk:=x(k−1) for 1≤k≤n, for real or complex vectors alike. Thus the componentwise bilinear extension is ξ⋅ζ:=∑r=0n−1ξ(r)ζ(r)=∑k=1nξkζk. For n≥2 define the tail x′:{0,…,n−2}→C by x′(r):=x(r+1) (with real values when x is real); then λ⋅z=λ1z1+λ′⋅z′ under z=(z1,z′), λ=(λ1,λ′). In dimension one identify a vector x with its sole value x(0)=x1, so the product is ordinary scalar multiplication. These are reindexings of the same finite sum, with no coordinate outside its domain.

[F5]

Real-variable calculus: partial derivatives of maps on open subsets of Rm are derivatives of line maps (Directional derivatives and partial derivatives of a map U⊆Rm→Rn); sums, real scalar multiples and products of differentiable functions are differentiable with the sum, scalar-multiple and product rules, and quotients are differentiable where the denominator is nonzero (Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0); the chain rule holds for total derivatives (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

technique · direct; reduce to the scalar case, conjugate the exponential by its series, prove (a) by induction on the dimension using the one-dimensional annihilating operator $\prod_{j\ne j_0}(d/dt-i\lambda_j)$, then obtain (b) by applying (a) to $F+\overline F$ grouped by frequency
1.1givenF3algebra

Reduction to the scalar case. Both assertions are componentwise in Cq: F(z)=0 holds if and only if every component Fk(z)=∑j(cj)keiλj⋅z vanishes, and Re⁡F(z)=0 if and only if Re⁡Fk(z)=0 for every k, while the vector Cν of clause (b) vanishes if and only if each of its components ∑λj=ν(cj)k+∑λj=−ν‾(cj)k‾ vanishes. Applying the scalar assertions q=1 to each component function therefore yields the general assertions, so we may and do assume c1,…,cm∈C in the rest of the proof.

1.2F1F2algebra

Conjugation of the exponential. For every w∈C, exp⁡w‾=exp⁡w‾. By [F1] the complex numbers exp⁡w and exp⁡w‾ are the sums of the everywhere convergent series ∑nwn/n! and ∑nw‾n/n!, with partial sums SN(w)=∑n≤Nwn/n! and SN(w‾)=∑n≤Nw‾n/n!; by [F2] conjugation fixes each real number n! and satisfies zw‾=z‾ w‾ and z+w‾=z‾+w‾, so SN(w)‾=SN(w‾) for every N. Also by [F2], u‾−v‾=u−v‾ and, by the coordinate formula, ∣u‾∣=(Re⁡u)2+(−Im⁡u)2=∣u∣, whence ∣u‾−v‾∣=∣u−v∣. Writing d=exp⁡w‾−exp⁡w‾, for every N we have d=(exp⁡w‾−SN(w‾))+(SN(w‾)−exp⁡w‾)=(exp⁡w‾−SN(w)‾)+(SN(w‾)−exp⁡w‾), so ∣d∣≤∣exp⁡w−SN(w)∣+∣SN(w‾)−exp⁡w‾∣; given ε>0, the definition of convergence of the two series supplies N with both summands below ε/2, so ∣d∣<ε, and since ε>0 was arbitrary ∣d∣=0, which forces d=0 by the definiteness of the modulus in [F2].

1.3F1F3F5algebra

Characters and the annihilating operator. For μ∈C let φμ(t):=exp⁡(iμt) for t∈R, the one-variable restriction of the complex exponential along the real-linear map t↦iμt. By [F5], the chain rule applied to that map and the entire exponential of [F1] gives φμ′(t)=iμexp⁡(iμt)=iμ φμ(t), and the sum, scalar-multiple and product rules of [F5] give, for any finite combination ∑μaμφμ with complex coefficients, derivative ∑μaμiμ φμ, hence (d/dt−iμ)φμ=0 and (d/dt−iμ)φν=i(ν−μ)φν for all ν∈C. Consequently, for pairwise distinct μ1,…,μm and a fixed j0, the composed operator Lj0:=∏j≠j0(d/dt−iμj) is complex-linear on finite combinations and acts on φμk as multiplication by 0 if k≠j0 and by the constant ∏j≠j0i(μj0−μj) if k=j0; that constant is nonzero because i≠0 and μj0−μj≠0 for j≠j0 by pairwise distinctness, and a product of nonzero field elements is nonzero by [F3].

1.4givenF1F4algebra

Induction step: reduction to a product box. Let n≥2 and assume assertion (a) established in dimension n−1 for every number of frequencies and every nonempty open subset of Rn−1. Let U⊆Rn be nonempty and open, fix z∗∈U and, by openness, ε>0 with the open product box B:=∏k=1n(zk∗−ε,zk∗+ε)⊆U; put B′:=∏k=2n(zk∗−ε,zk∗+ε)⊆Rn−1. Write z=(z1,z′) with z′∈Rn−1 and λj=(λj1,λj′). For each value μ in the finite set {λ11,…,λm1} put Iμ:={j:λj1=μ} and Pμ(z′):=∑j∈Iμcjeiλj′⋅z′; then, by the splitting identity of [F4], the exponential addition law of [F1] and the distributivity of the finite sum, F(z1,z′)=∑μeiμz1Pμ(z′) for every (z1,z′)∈B, the outer sum running over the pairwise distinct values μ.

2.1givenstep 1.3F1F3

Base case, dimension one. Let U⊆R be nonempty and open, so that it contains a nonempty open interval J; suppose F=∑j=1mcjφλj≡0 on U. Fix j0; then Lj0F≡0 on J, and by step 1.3 and the linearity of Lj0 we have Lj0F=cj0(∏j≠j0i(λj0−λj))φλj0 on J. Choose t0∈J. Evaluating there gives cj0(∏j≠j0i(λj0−λj))exp⁡(iλj0t0)=0; cancelling the nonzero exponential by [F1] gives cj0∏j≠j0i(λj0−λj)=0; the second factor is a product of nonzero complex numbers, hence nonzero by [F3], so cj0=0 by the field property in [F3]. As j0 was arbitrary, c1=⋯=cm=0; this proves (a) for n=1.

2.2givenstep 1.2F2

The conjugate sum. Suppose now that Re⁡F≡0 on U, and define F~(z):=∑j=1mcj‾ e−iλj‾⋅z on U. For real z and every j, step 1.2 applied to w=iλj⋅z gives eiλj⋅z‾=exp⁡(iλj⋅z‾), and by [F2] and the reality of z we have iλj⋅z‾=i‾ λj⋅z‾=(−i)(λj‾⋅z)=−iλj‾⋅z; therefore F(z)‾=∑jcj‾ e−iλj‾⋅z=F~(z) on U by [F2]. Since w+w‾=2Re⁡w by [F2], the hypothesis 2Re⁡F≡0 reads F+F~≡0 on U.

3.1step 2.1step 1.4

One-dimensional slices. Suppose F≡0 on U, fix z′∈B′ and define G(t):=∑μeiμtPμ(z′) for t in the interval J:=(z1∗−ε,z1∗+ε). By step 1.4, G(t)=F(t,z′)=0 for every t∈J, and G is a finite combination of the pairwise distinct characters φμ with complex coefficients Pμ(z′); the base case of step 2.1 applied on the nonempty open interval J therefore gives Pμ(z′)=0 for every μ. As z′∈B′ was arbitrary, each Pμ vanishes identically on the nonempty open set B′.

4.1step 3.1step 1.4induction

Induction hypothesis on each group. Fix a value μ. The vectors λj′, j∈Iμ, are pairwise distinct: if λj′=λk′ and λj1=λk1=μ, then λj=λk, hence j=k by pairwise distinctness of the λj. The function Pμ=∑j∈Iμcjeiλj′⋅z′ vanishes identically on the nonempty open set B′⊆Rn−1, so assertion (a) in dimension n−1 gives cj=0 for every j∈Iμ. Every index lies in Iλj1, so c1=⋯=cm=0; this completes the induction and proves (a) in every dimension n≥1.

5.1givenstep 2.2step 4.1F4algebra

Frequency grouping and application of part (a). Let Φ⊆Cn be the finite set of distinct values among λ1,…,λm,−λ1‾,…,−λm‾, and for ν∈Φ put Cν:=∑j:λj=νcj+∑j:−λj‾=νcj‾=∑λj=νcj+∑λj=−ν‾cj‾. Regrouping the finite sum of step 2.2 over the distinct frequencies and using the bilinearity of the extended inner product in [F4] gives F+F~=∑ν∈ΦCνeiν⋅z on U; the frequencies ν∈Φ are pairwise distinct by construction, so assertion (a) as proved in steps 2.1 and 4.1 applied to this finite combination gives Cν=0 for every ν∈Φ. For ν∉Φ both defining sums are empty, so Cν=0 trivially; hence Cν=0 for every ν∈Cn.

6.1step 5.1step 2.2F1F2F3algebra∎

Consequences and scope. (i) If ν=−ν‾ is self-paired, the condition −λj‾=ν is equivalent to λj=ν, so both sums of Cν run over the same index set and Cν=∑λj=ν(cj+cj‾)=2Re⁡∑λj=νcj by [F2]; at ν=0 this constrains only the real part, and the constraint is genuinely not stronger: for m=1, λ1=0, q=1 and c1=i one has F≡i, so Re⁡F≡0 and C0=c1+c1‾=2Re⁡i=0, a nonzero purely imaginary coefficient at frequency 0. (ii) If λj≠−λj‾ and λj∉{λk,−λk‾:k≠j}, then {k:λk=λj}={j} and {k:λk=−λj‾}=∅ (a member k=j would give λj=−λj‾, and k≠j is excluded by hypothesis), so Cλj=cj+0=cj=0 by step 5.1, which is the stated consequence. (iii) The scope (c) holds: steps 2.1, 1.4 and 4.1 used only pairwise distinctness of the λj and the nonemptiness and openness of U, through the interval J and the product box B; the frequencies were never assumed nonzero, ordered or normalized; the proof is a finite construction using complex arithmetic, the series for the exponential and its derivative, and no choice principle. No assertion is made for sets of empty interior: the openness of U is used when a nonempty open interval and a product box are extracted from it, and the statement (c) records that distinct characters can agree on such smaller sets.

Depends on

Dependency tree · 2 levels

Sources