MathLabs
TheoremProved

The degenerate case a=0

Statement

If a=0a=0, the equation ax+b=0ax+b=0 reduces to b=0b=0: it has infinitely many solutions (every real x works) when b=0b=0 is a true statement, and no solution at all when b≠0b\neq0.

Why is it true?

This shows the label "linear equation" secretly depends on the coefficient of x being nonzero — drop that, and the whole notion of "one unique answer" collapses into either every answer or no answer.

Proof sketch

Substitute a=0a=0 directly into ax+b=0ax+b=0: the term axax becomes 0⋅x=00\cdot x=0 for every real number xx, since any number times zero is zero. So the equation literally becomes b=0b=0, a statement about bb alone that no longer mentions xx at all.

Now there are exactly two possibilities for the fixed number bb. If b=0b=0, the leftover statement "0=00=0" is true regardless of which xx we substituted — so every real number xx satisfies the original equation, giving infinitely many solutions. If instead b≠0b\neq0, the leftover statement "b=0b=0" is simply false — no value of xx can make a false numerical statement true, so the equation has no solution whatsoever, no matter what xx we try.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.