How does the characteristic of a field affect symmetric bilinear forms?

  • Thread starter Thread starter DUET
  • Start date Start date
  • Tags Tags
    Forms Symmetric
DUET
Messages
55
Reaction score
0
When I start to read the the article called "symmetric bi-linear forms", I face the following sentence. But I don't understand what does the following sentence suggest. Could someone please help me here?

We will now assume that the characteristic of our field is not 2 (so 1 + 1 is not = to 0)
 
Physics news on Phys.org
A field is a very general object. It is a set ##F## together with two functions ##+:F\times F\rightarrow F## and ##\cdot:F\times F\rightarrow F## satisfying:

  • ##a+(b+c) = (a+b)+c##
  • ##a+b=b+a##
  • There exists a ##0\in F## such that ##a+0 = 0+a = a##
  • For each ##a\in F##, there is an element ##b\in F## such that ##a+b=b+a=0##
  • ##a\cdot(b\cdot c) = (a\cdot b)\cdot c##
  • ##a\cdot b = b\cdot a##
  • There exists an ##1\in F## such that ##1\neq 0## and ##a\cdot 1 = 1\cdot a = a##
  • If ##a\neq 0##, then there exists a ##b\in F## such that ##a\cdot b =b\cdot a = 1##

The usual suspects, such as ##\mathbb{Q}##, ##\mathbb{R}## and ##\mathbb{C}## are fields. All of these fields satisfy that ##1+1+1+1+1+...+1## (n times) is nonzero. But this is not a general property of a field. Fields that have the property are said to be of characteristic 0.

For example, consider ##F=\{0,1\}## and define

1+0 = 0+1 = 1~\text{and}~1+1=0+0=0

and

1\cdot 0 = 0\cdot 0 = 0\cdot 1 = 0~\text{and}~1\cdot 1 = 1

This satisfies all the field axioms, but it has ##1+1=0##. We say that this field has characteristic 2.

In general, if a field satisfies ##1+1+1+...+1=0## (n times). Then the field is said to have characteristic ##n##. We can always show that ##n## is a prime number.

The main advantage of assuming that the field is not of characteristic ##0##, is that we can divide by ##1+1##. If we use the nice notation ##2=1+1##, then ##1/2## exists.
 
micromass said:
A field is a very general object. It is a set ##F## together with two functions ##+:F\times F\rightarrow F## and ##\cdot:F\times F\rightarrow F##
Could you please explain it a bit more?Specially the following.

micromass said:
##+:F\times F\rightarrow F## and ##\cdot:F\times F\rightarrow F##
What do you mean by "+" and "."?
 
The cartesian product ##F\times F## just means the set of all ordered pairs. Thus

F\times F = \{(a,b)~\vert~a,b\in F\}

For example ##(0,0)\in \mathbb{R}\times\mathbb{R}## and ##(-1,2)\in \mathbb{R}\times \mathbb{R}##.

That ##f## is a function from ##F\times F## to ##F## just means that we associate with each element in ##F\times F##, an element in ##F##.

So given ##(a,b)## with ##a,b\in F##, we associate an element ##f(a,b)\in F##. Specifically, if ##f## is ##+##, then to each ordered pair ##(a,b)## with ##a,b\in F##, we associate ##+(a,b)## in ##F##. We write this as ##a+b##.

So to each two elements in ##F##, we just associate a new element in ##F##.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top