mark2142 said:
We cannot multiply by or divide by ##(x-1)=0##.
Well I think the way they are treating x is wrong. It’s not like there are two quantities equal to x and so both will also be equal namely 1=0. Instead if we assume it’s not a trick, x=1 is our original equation. x=1 and x=0 are solutions to the original equation. But we cannot say two numbers are equal to each other.
Apart from the "backwards" problem,
@PeroK delivered an apt summary in
#20. Let me repair that problem...
PeroK said:
In fact, you can characterise what's happening as:
Start with x=1. It follows that x=0 or x=1. Sneakily get rid of the case x=1. You are left with x=0.
Let us take the original sequence of statements one at a time and explore them in [painful] detail.
1: ##x=1##
In some contexts we would write this as "Let ##x = 1##". This in turn is mathematical shorthand for "Let x be a variable such that the predicate ##x=1## is true".
Before we are allowed to make such a statement, we must have a guarantee of existence. We do indeed have such a guarantee. We are implicitly using a number system that is rich enough to support the notation used in the argument. This could be the ring of integers or the field of real numbers. It matters little to the argument. What matters is that both algebras include a guarantee of existence and uniqueness for an element denoted by "1".
In any case, we end up with a predicate in one free variable ("##x=1##") which is true for the variable "##x##" that we have created.
If we look at the solution set for that predicate, ##\{x : x = 1\}##, that solution set is ##\{1\}##. Obviously.
2. ##x^2 = x##
This is a new predicate that we can get from the previous one by squaring both sides, using the mathematical fact that ##1 \times 1 = 1## and substituting equal values ##x## for ##1##.
This new predicate has an enlarged solution set, ##\{x : x^2 = x\}##. That solution set is ##\{0, 1\}##.
The new solution set is a superset of the old solution set. But that is fine. The new predicate holds whenever the old predicate does. It "follows" from the first predicate, even though it is a strictly weaker predicate.
3. ##x^2 - x = 0##
Again, we derive a new predicate from the old. We have subtracted ##x## from both sides of an equality and we've used the property that ##x - x = 0##. That is a valid manipulation. And a reversible one. We could add ##x## to both sides to recover the previous predicate. So the two predicates are equivalent. The new solution set is the same as the old.
The solution set is still ##\{0, 1\}##.
4. ##x(x-1) = 0##
Again, we derive a new predicate from the old. This is an application of the distributive law. The manipulation is reversible. We could apply the distributive law to reverse the manipulation.
The solution set is still ##\{0, 1\}##.
5. ##\frac {x(x-1)}{(x-1)}=\frac 0{(x-1)}##
Now we've divided both sides of the equation by ##x-1##. This is a valid manipulation, provided that ##x-1 \neq 0##.
If, contrariwise, ##x-1 = 0## then the manipulation is invalid.
If we were obeying the proper rules of mathematical discourse, we would have to split the analysis at this point into two cases:
Case 1: ##x - 1 \neq 0##
And the rest of the proof goes through as written. Without running through that, we properly conclude that ##x=0## and we eventually end up with a solution set under this case of ##\{x : x = 0\}##. i.e. ##\{0\}##.
Case 2: ##x - 1 = 0##
The rest of the proof does not go through. We properly conclude that ##x = 1##. The solution set under this case is ##\{x : x = 1\}##. i.e. ##\{1\}##.
The solution set we end up after considering both cases is the union of the solution set under case 1: ##\{0\}## and the solution set under case 2: ##\{1\}##. That union is, of course, ##\{0,1\}##.
[So proper case management for this step has neither erroneously strengthened nor accidentally weakened anything. We got to the same solution set]
What we
can conclude from the completed and corrected manipulation sequence is that "if ##x = 1## then either ##x = 1## or ##x = 0##". This is true but pointless.
What we
cannot conclude from the completed and corrected manipulation sequence is that "if ##x = 1## then ##x = 0##"
The version of events in #20 from
@PeroK is far more pithy: "Start with x=1. It follows that x=0 or x=1. Sneakily get rid of the case x=1. You are left with x=0."
I like that description a lot.