How Do Proofs for Vector Spaces Over Finite Fields Work?

[jOc3]

It's hard to find the proofs of these theorems. Please help me... Thanks!

Theorem 1: Let V be a vector space over GF(q). If dim(V)=k, then V has \frac{1}{k!} \prod^{k-1}_{i=0} (q^{k}-q^{i}) different bases.

Theorem 2: Let S be a subset of F^{n}_{q}, then we have dim(<S>)+dim(S^{\bot})=n.

 

[mathwonk]

think about the steps involved in choosing a basis. then the numbet of bases is the number of ways to carry out these steps.

first choose any non zero vector. how many ways?

then afterwrads chooise avector that is not on the line through that one - hiw many ways?...

 

[morphism]

What is F^{n}_{q}? An n-dimensional innerproduct space over GF(q)? And is <S> the span of S?

My thoughts: get an orthonormal basis for <S>, and extend this to one for F^{n}_{q}. The new vectors you add will probably be an o.n. basis for S^{\perp}.

 

[mathwonk]

thm 2 is true in any vector space of finite dimn. over any field.

 

[matt grime]

My thoughts: get an orthonormal basis for <S>

This doesn't make sense over a finite field (or any field of positive characteristic).

 

[morphism]

This doesn't make sense over a finite field (or any field of positive characteristic).

I was wondering about this also. What is S^\perp over a finite field?

 

[matt grime]

Just pick any complementary subspace, or take the quotient space.

 

[mathwonk]

Sperp is the subspace of the dual space that annihilates S. equivalently, it is the dual space of the quotient by <S>, which is why matt's hint gives the right dimension.

 

[morphism]

Ah, my bad. I wasn't familiar with that notation for the annihilator of S. I thought it was the space of vectors orthogonal to S.

 

[happytarot]

I need the proof for theorem2,too.

I know that theorem2 is an important property in coding theory.

(Fq)^n is the direct product over (Fq)^n (similar with R^n over R)


the S-perp in (Fq)^n have the same definition.

But the defition of inner space (over finite field) may not need <x,x> > 0.
I think the most important point is that the intersecton of C and C-perp may not be zero.
(i.e. it is possible that <x,x>=0 for some x =/= 0 in (Fq)^n)

Actually, in the language of coding. If C is a subspace of (Fq)^n with dim(C)=k,
C-perp = {x in C| x(G)' = 0 in (Fq)^k} where G is the generator matrix,(G)' : transpose of G
but I don't which is useful or not!:)