Does this really require knowing abstract algebra? Seems obvious to anyone doing any sort of multiplication that if the output is 0 then one of variables/functions has to be 0, if it is nonzero then the variable/function can be anything but 0.
Does this really require knowing abstract algebra? Seems obvious to anyone doing any sort of multiplication that if the output is 0 then one of variables/functions has to be 0, if it is nonzero then the variable/function can be anything but 0.
No, this is only true when you are doing multiplication in an integral domain.
https://en.wikipedia.org/wiki/Integral_domain
There are many rings where this is not true, like Z/nZ where n is not prime.
2*2 = 0 (mod 4)
2 /= 0 (mod 4)It is "obvious" in the real numbers that if you multiply two numbers and get 0 then one of them must be zero. I doubt you could prove this. It's obvious simply because you are used to it being true. But it is not true for all algebraic systems. The algebraic structure of all 2x2 matrices can be viewed as an extension of the real number system and in the set of 2x2 matrices you can multiply two matrices to get 0 in which neither matrix is 0.
One of the goals of abstract algebra is to understand under what conditions certain properties hold in an algebraic system. To truly understand these things requires the oft mentioned mathematical maturity. But to get to the point of gaining this maturity requires just accepting what you've been told is true is indeed true.
We tell students in Calculus I that the function 1/x is discontinuous at 0. There's a break in the graph there. But, in reality, it is meaningless to talk about a function being continuous (or not being continuous) at a number not in the domain of the function. Indeed, in the standard subspace topology the function 1/x from R-{0} to R is continuous. But this nuance is way too complicated to get across to students in Calculus I so we fudge things a bit. This happens a lot at lower levels of math.
EDIT: So my point is that if your goal is to truly understand things then yes, Abstract Algebra is necessary. If your goal is to be operationally functional in working with polynomials over the real numbers then it isn't.
On a more serious note, you can understand most, if not all, of Calculus by saying that dx=0.0001, and that A ~= B if they don't differ by more than, say, 0.01 (say, that's the instrument error).
Then you get your limits, FTC, and so on, and verify the results with a four-function calculator.
Example: f=x^2, f' = ?
(f(x+dx) - f(x))/dx = (x^2 + 2x*dx + dx^2 - x^2)/dx = 2x + dx = 2x + 0.0001 ~= 2x
The mental effort you have to make here is that things on the LHS of ~= are "actual" values, and on the RHS are "measured" values, and that ~= is not an equivalence relation.
On a yet more serious note, learning about differential forms will help justify some of that high-school notation.
On a philosophical note, Weierstrass is not the end-all of Calculus. Neither Newton nor Leibniz did it that way. By adding rigor, some argue that the essence has been obscured (hence the non-standard analysis above).
On the other hand, very brute numerics work for an awful lot of scenarios - that's why epsilon-delta came centuries after Calculus was invented.
For instance, "first-order optics" and "third-order optics" rise from chopping off the Taylor series after the 1st and 3rd term, resp. And it works! In many places, 1st order approximations are just good enough. A lot of scenarios are inherently stable.
So I don't think the intuition you build up is wrong - it just has a scope. There's nearly always a place for counter-examples where "things work the way you think they should" wouldn't apply, however you think about things :)
On a philosophical note, the continuity is a human construct - down there, things seem to be discrete, just with a very small step size. Continuity models these pretty well, until it doesn't - but that doesn't mean the intuition you build up is wrong. Just limited in scope.
Theorem: If x & y are reals and xy=0, then at least one of x and y is zero.
To see this, assume x and y are both nonzero. Divide both sides of xy=0 by x (this is valid because x is nonzero). Then y=0; contradiction. Therefore, at least one of x and y is zero.
(Eg if memory serves right, you might use the property you are trying to prove to justify why you can even divide by non-zero x on both sides.)
Yes, at least to the extent that "fundamental-ness" can be defined. It is a well, and probably universally, established convention that the field axioms allowing division by non-0 elements (that is to say, allowing multiplication by arbitrary elements, and multiplicative inversion of non-0 elements) is taken as part of the definition of a field, and the fact that the set of non-0 elements in a field is closed under multiplication as a theorem about fields.
Yes, that's what I said. My point was that, between
(A) making an axiom the right to divide in a field by non-0 numbers, and proving the closure of non-0 numbers in a field under multiplication,
and
(B) just making an axiom the closure of non-0 numbers in a field under multiplication,
it is only convention (rooted in the deeper convention of not making an additional axiom out of something we could prove from existing ones) that we choose (A) instead of (B). (Also notice that I was talking about the closure under multiplication of the set of non-0 numbers, which is (usually) not part of the definition, rather than of the entire set, which is indeed always part of the definition.)
https://proofwiki.org/wiki/Ring_of_Integers_has_no_Zero_Divi...
Since you mention them specifically, it's not true for functions: multiply the function that is 1 for positive numbers and 0 elsewhere, by the function that is 1 for negative numbers and 0 elsewhere. (One can even produce continuous, or even smooth, examples with only a little more work.) A more traditional example is that it's not true for matrices: multiply the matrix ( ( 0 1 ) ( 0 0 ) ) by itself. (I just noticed sedeki https://news.ycombinator.com/item?id=15860883 pointed this out a few minutes earlier, noting that, for example, neither 2 nor 3 is congruent to 0 modulo 6, but their product is.) What I mean to say is: it often doesn't require knowing abstract algebra to think that things are obvious, but it may sometimes require knowing abstract algebra to figure out whether obvious things are true.
(Also, the last sentence you quote:
> Yet it is not the case that if f(x) * g(x) = 4, then either f(x) = 2 or g(x) = 2.
is, I would say, the important operational point. My students, especially in calculus, love to use this style of reasoning, even when specifically told that it doesn't work—although sometimes they change it (usually to conclude that f(x) = 4 or g(x) = 4). As Twain might have approximately said, it's not what's obvious that you don't know that gets you; it's what's obvious that ain't so.)
x*y can be 0 (mod 6) but I don't think it takes knowing abstract algebra and a deep knowledge of modulo and axioms to figure that out. I hope math teachers that don't know abstract algebra know that!
There is no fundamental difference when changing your starting assumptions other than one set of assumptions might prove more things than the other. From the perspective of single proof, either is equally as good. We axiomatically know basic arithmetic to be true, just as we axiomatically know first order logic to be true.
No, just the ability to distinguish between what one knows and what one does not actually know yet (self-awareness).