Let K=Q(α1,α2,...αn), where the αi are the roots of some irreducible polynomial (and hence they are pairwaise distinct since the polynomial is separable). Then K/Q is a finite extension. By the primitive element theorem there exists a α such that Q(α)=K. Galois ("Sur les conditions de resolubilite des equations par radicaux", Lemme II; see here) was able (without proof) to choose α=u1α1+⋯+unαn with ui∈Q such that all the elements σ(α):=u1ασ(1)+⋯+unασ(n) are distinct for every permutation σ of the symmetric group. Distinct in this sense means that σ(α)≠τ(α) for different σ,τ∈Sn. Is this always true and if so, does somebody have a reference for this?
Answer
Yes, it is true. The following more general fact is true:
Theorem 1. Let k be an infinite field. Let V be a
k-vector space. Let v1,v2,…,vn be finitely many
distinct elements of V. Then, there exists some (a1,a2,…,an)∈kn such that the n! elements
aσ(1)v1+aσ(2)v2+⋯+aσ(n)vn, for σ ranging over the
symmetric group Sn, are pairwise distinct.
[Notice that my notations are different from yours. My k, V,
vi and ai correspond to your Q, K, αi and
ui, respectively (but of course, my setting is more general).]
The main tool for proving Theorem 1 is the following theorem, which doubles as
a well-known exercise:
Theorem 2. Let k be an infinite field. Let V be a
finite-dimensional k-vector space. Then, V cannot be written as a
union of finitely many proper subspaces of V. (A proper subspace of V
means a k-vector subspace of V distinct from V.)
Theorem 2 is proven in many places; for example, see
A finite-dimensional vector space cannot be covered by finitely many proper subspaces? or (for a stronger statement)
If a field F is such that |F|>n−1 why is V a vector space over F not equal to the union of n proper subspaces of V or (also for a stronger statement)
A vector space over R is not a countable union of proper subspaces or https://mathoverflow.net/q/26/ .
Proof of Theorem 1. Let G be the set {(σ,τ)∈Sn×Sn ∣ σ≠τ}. Clearly, the set G
is finite (since Sn is finite).
The k-vector space kn is finite-dimensional.
Hence, Theorem 2 (applied to kn instead of V)
shows that kn cannot be written
as a union of finitely many proper subspaces of kn.
In other words, any union of finitely many proper subspaces of
kn must be a proper subset of kn.
For every σ∈Sn, we define a map vσ:kn→V as follows: For any (a1,a2,…,an)∈kn, we set vσ(a1,a2,…,an)=n∑i=1aσ(i)vi. This map vσ is k-linear.
Now, let (σ,τ)∈G. We shall show that
Ker(vσ−vτ) is a proper subspace
of kn.
Indeed, the map vσ−vτ is k-linear (since
vσ and vτ are k-linear), and thus
Ker(vσ−vτ) is a k-vector subspace of kn.
Moreover, σ≠τ (since (σ,τ)∈G). Assume
(for the sake of contradiction) that Ker(vσ−vτ)=kn. Thus, vσ−vτ=0, so that
vσ=vτ.
Let g∈{1,2,…,n}.
We shall use the notation δu,v for the element {1,if u=v;0,if u≠v∈k whenever u and v are two objects. For every permutation
π∈Sn, we have
vπ(δ1,g,δ2,g,…,δn,g)=n∑i=1δπ(i),g⏟=δi,π−1(g)vi (by the definition of vπ)
(1) =n∑i=1δi,π−1(g)vi=vπ−1(g).
Applying (1) to π=σ, we obtain
(2) vσ(δ1,g,δ2,g,…,δn,g)=vσ−1(g).
Applying (1) to π=τ, we obtain vτ(δ1,g,δ2,g,…,δn,g)=vτ−1(g).
Since vσ=vτ, this rewrites as vσ(δ1,g,δ2,g,…,δn,g)=vτ−1(g). Comparing this with (2), we obtain vσ−1(g)=vτ−1(g). Since v1,v2,…,vn are
distinct, this shows that σ−1(g)=τ−1(g).
Now, let us forget that we fixed g. We thus have shown that σ−1(g)=τ−1(g) for every g∈{1,2,…,n}. In other words, σ−1=τ−1. In other
words, σ=τ. This contradicts σ≠τ. This contradiction
proves that our assumption (that Ker(vσ−vτ)=kn) was wrong. Hence, Ker(vσ−vτ)≠kn. Since
Ker(vσ−vτ) is a k-vector subspace of kn, this yields that Ker(vσ−vτ) is a proper subspace of kn.
Now, let us forget that we fixed (σ,τ). Thus, for
every (σ,τ)∈G, the set Ker(vσ−vτ) is a proper subspace of kn. Hence,
⋃(σ,τ)∈GKer(vσ−vτ) is a union of finitely many proper subspaces of
kn (since G is finite).
Therefore, ⋃(σ,τ)∈GKer(vσ−vτ) must be a
proper subset of kn (since any union of finitely many proper
subspaces of kn must be a proper subset of kn).
In other words, there exists some a∈kn such that
a∉⋃(σ,τ)∈GKer(vσ−vτ). Consider this a.
We have a∉⋃(σ,τ)∈GKer(vσ−vτ). In other words,
(3) a∉Ker(vσ−vτ) for
every (σ,τ)∈G.
Now, let σ and τ be two distinct elements of Sn. Thus,
(σ,τ)∈Sn×Sn and σ≠τ. In
other words, (σ,τ)∈G. Hence, (3) shows that
a∉Ker(vσ−vτ). In other
words, (vσ−vτ)(a)≠0. Hence,
0≠(vσ−vτ)(a)=vσ(a)−vτ(a), so that vσ(a)≠vτ(a).
Let us forget that we fixed σ and τ. We thus have shown that
vσ(a)≠vτ(a) for any two
distinct elements σ and τ of Sn. In other words,
(4) the n! elements vσ(a), for σ ranging
over the symmetric group Sn, are pairwise distinct.
Now, let us write a in the form (a1,a2,…,an).
Then, for every σ∈Sn, we have
vσ(a)=vσ(a1,a2,…,an)=n∑i=1aσ(i)vi=aσ(1)v1+aσ(2)v2+⋯+aσ(n)vn.
Hence, the statement (4) rewrites as follows: The n! elements
aσ(1)v1+aσ(2)v2+⋯+aσ(n)vn, for σ ranging over the
symmetric group Sn, are pairwise distinct. This proves Theorem 1.
◼
No comments:
Post a Comment