I was curious if there were any such proofs which state that a thing is true always EXCEPT for exactly one instance. As in, for some reason, there is only one instance where the proof is false, but it is true for all other objects. I understand that if it is not true in that one case that it is not necessarily a proof, I was just wondering if there were any "proof-like things" of this form.
|
Here's a famous one: $\mathbb{R}^n$ has a single differentiable structure (up to diffeo) except for $n=4$, in which case it has uncountably many. These posts may be of interest: http://mathoverflow.net/questions/16035/a-reference-for-smooth-structures-on-rn http://mathoverflow.net/questions/24930/differentiable-structures-on-r3 |
|||||
|
|
For all positive integers $n$, the symmetric group $S_n$ has a trivial outer automorphism group, except for $S_6$, which has $2$ elements. Related: Outer Automorphisms of $S_n$ |
|||
|
|
|
For each prime $p\neq 2$ the following holds: The multiplicative group of $\mathbb Z_{p^s}$ is cyclic for all $s\geq 1$ |
|||
|
|
|
The Heawood conjecture as it applies to the Euler characteristic, is an example of a theorem that is true except in exactly one case. In the case where $\chi = 0$ for the Klein bottle, the minimum number of colors needed to color all graphs drawn on this surface is $6$, not $7$ as indicated by the formula $$\gamma(\chi) = \left\lfloor \frac{7 + \sqrt{49 - 24\chi}}{2} \right\rfloor.$$ |
|||
|
|
|
$\varphi(n)$ is always even , for all $n\in N $ except n=2. |
|||
|
|
|
All primes are odd except for 2. |
|||
|
|
|
Thank you all! I am currently looking these things up and I am fascinated. |
|||||
|

except for exactly one case. Any theorem or proof that assumesp an odd prime(of which there are many) could technically be restated as assumingp prime, with the exception of 2. – dxiv 1 hour ago