[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.11039457 [View]
File: 114 KB, 631x371, field axioms.png [View same] [iqdb] [saucenao] [google]
11039457

>>11039395
a field is a set that has some specific rules
the real numbers, the complex numbers, and the rationals are all examples of fields.
there are also some weird ones like Z_5, the integers mod 5, which is {0, 1, 2, 3, 4}.

What does a field need to satisfy?
There needs to be a way to add two elements of a field to get something back in the field, and there needs to be a way to multiply two elements of the field to get something back in the field.
There needs to be an additive identity (which we call 0) and a multiplicative identity (which we call 1) and these cannot be the same element.
Addition and multiplication also need to be associative and commutative.
We also need additive and multiplicative inverses, so for every x in the field there is an element which we call -x such that -x + x = 0. Similarly, for every NONZERO y in the field there is an element y^{-1} such that y^{-1}y = 1.
Finally, multiplication needs to distribute over addition, so x(y + z) = xy + xz.
Most of these are obviously true for R, C, and Q. A lot of them are also easy to show for Z_5. Think about why it's true that every element of Z_5 besides zero has a multiplicative inverse.

Turns out, for any prime p, Z_p is a field, and for any composite number c, Z_c is not a field. Can you find a number with no multiplicative inverse in Z_4?

Why is this important? We can do linear algebra if the elements of our vectors/matrices are in a field. Otherwise, we often can't invert matrices and solve equations. If we remove the condition that every element of a field has to have a multiplicative inverse (and some other conditions as well, like commutativity of multiplication) we get a ring. There are a lot more rings than fields, and just like how you can define a vector space over a field, you can define a module over a ring. So module theory is like linear algebra for rings. It's a lot harder though, since we can't usually take inverses.

>> No.9549208 [View]
File: 114 KB, 631x371, DLUQp.png [View same] [iqdb] [saucenao] [google]
9549208

In Spivak's Calculus, chapter 1 problem 4 (v-viii), perhaps even more, how does the author expect you to prove inequalities such as:

>(v)[math] x^2-2x+2 > 0 [/math]
>(vi) [math] x^2+x+1 > 2 [/math]
>(vii) [math] x^2 -x + 10 >16 [/math]

I understand these are "completing the square" and quadratic equation problems, but how am I supposed to derives this myself given only the properties in pic related?

The only solutions I've seen involve so much creativity it seems infeasible:
>https://math.stackexchange.com/questions/1878298/spivak-calculus-chapter-1-question-4-6

Here is the top answer from said link, regarding question vi (I'm praying to god the tex works out):
[math]
x^2+x+1&>2 & \text{Given}\\
x^2+x+1+0&>2+0 & \text{By Addition}\\
x^2+x+1+0&>2 & \text{By P2}\\
x^2+x+0+1&>2 & \text{By P4}\\
x^2+x+\left( \frac{1}{2} \right)^2+(-1)\left( \frac{1}{2} \right)^2+1 &>2 & \text{By P3}\\
\left(x+\frac{1}{2}\right)\left(x+\frac{1}{2}\right)+(-1)\left( \frac{1}{2} \right)^2+1 &>2 & \text{By P9}\\
\left(x+\frac{1}{2}\right)\left(x+\frac{1}{2}\right)+ (-1)\left( \frac{1}{4} \right) + 1 &> 2 & \text{By Multiplication}\\
\left(x+\frac{1}{2}\right)\left(x+\frac{1}{2}\right) &> \left( \frac{5}{4} \right) & \text{By Addition, P3, and P2}\\
[/math]

In this example, it seems infeasible to be expected to see the possibility of [math]-1(\frac{1}{2})^2 + \frac{1}{2}[/math]

I understand these questions are intended to be difficult, but I'd like to leave no stone unturned throughout this book.

Navigation
View posts[+24][+48][+96]