Are all the socks green?

A short and slightly stupid guide to why
“but maybe one of them isn’t” is not an argument.

Six drawers. Roughly four minutes. There is a man named Kevin.

1

Small bag. Easy day.

This bag has six socks in it. Six. That is all of them. There are no secret socks. Poke each one.

Poke a sock.

When you have poked all six, you are done. Not “done for now.” Done. There is a last sock, and you met it.

the boring grown-up version
For a genuinely finite class, exhaustive enumeration is a legitimate closure method. The size may be annoying, but there is a last member.
If |C| = N < ∞, then C = {x₁,…,xN}, and the finite conjunction P(x₁) ∧ … ∧ P(xN) is equivalent to ∀x∈C P(x).
This does not claim enumeration is the only possible proof. It shows only that finite exhaustion exists in principle for a finite class.
2

The drawer does not end.

Now the socks live in a drawer. The drawer is infinite. You know this already, because you own a sock drawer.

0 socks pulled out
∞socks still in there
0%of the drawer done
ALL OF THEM. DONE.

Pulling socks out faster does not make the drawer smaller. A theorem is a different move: it covers every sock at once, including the ones you will never touch.

the boring grown-up version
“I checked more points” and “I proved every point satisfies the property” are different operations, at different logical levels.
For a finite tested subset Fn ⊂ C, the statement ∀x∈Fn P(x) does not imply ∀x∈C P(x) without an additional bridge theorem. If C is uncountable, no finite or countably infinite enumeration exhausts C.
This does not preclude finite proof. It requires structural quantification rather than state-by-state exhaustion.
3

One purple sock ruins everything.

Breaking “all socks are green” is much easier than proving it. You need exactly one purple sock. But it has to be an actual sock.

Claim: every sock in the drawer is green.
CLAIM: DEAD

Saying “there might be a purple sock” is a sentence. Sentences are free. A sock is a sock.

the boring grown-up version
Universal claims and counterexamples have different certificate shapes.
¬(∀x∈C P(x)) ⇔ ∃x∈C ¬P(x)
A counterexample certificate consists of an admissible x* ∈ C together with a valid derivation of ¬P(x*). Merely asserting that such an x* might exist supplies no certificate.
4

This is Kevin.

Kevin has two opinions. He alternates between them. Press the button and watch Kevin work.

“All the socks are green.”
0times Kevin flipped
0new facts from Kevin

Kevin is not lying. Kevin is not even wrong. Kevin is just going back and forth between the same two states, and the second flip already told you everything the ten-thousandth one will.

the boring grown-up version
Freeze the class and the predicate, and define D(Q) = ¬Q on the frozen pair {Q, ¬Q}. Then D² = id.
D2n(Q) = Q and D2n+1(Q) = ¬Q for n ≥ 0.
If repeated transitions Q ↔ ¬Q add no proof, counterexample, proof defect, structural obstruction, or registry change, then after the first reversal they add no mathematical information. This is the Frame-Dual Non-Progress Theorem; “frame-dual” is organizational vocabulary, and the formal content is the involution D² = id.
5

The judge who cannot be pleased.

A judge is deciding whether all the socks are green. She has rules. The rules are the problem. Try to win.

Try to satisfy the judge.

Notice what happened. The case can never end in “yes.” Not because of the socks. Because of the rules. “We never finished arguing” is a fact about the argument, not about the drawer.

the boring grown-up version
Self-Sealing Openness Theorem. Let C be infinite. If (1) one counterexample may establish ¬Q, (2) no finite unsuccessful search establishes Q, (3) after every finite unsuccessful search an untested counterexample may be invoked to continue, and (4) structural class-level proof of Q is not accepted as terminal closure, then the procedure cannot terminate in Q by construction.
Procedural non-acceptance of Q ≠ proof of ¬Q.
Perpetual openness is then a property of the procedure, not a derivation of ¬Q.
6

A wheel made of sticks.

Different toy, same lesson. Build a wheel out of straight sticks. Add more sticks. Keep going. Ask yourself if it is a circle.

You can get very round. You cannot get to circle. And no amount of extra sticks is the same kind of move as proving something about every possible stick count at once.

the boring grown-up version
On a unit circle the perimeter of a regular inscribed n-gon is Pn = 2n·sin(π/n), with Pn < 2π for every finite n ≥ 3 while Pn → 2π. The visual illustrates approximation versus identity; it is not itself a transcendence theorem. The stronger exemplar:
Qα := ∀p ∈ ℚ[x]\{0}, p(α) ≠ 0.
Testing finitely many polynomials establishes only a finite conjunction. A transcendence theorem closes the whole polynomial class at once. Lindemann established the transcendence of π and Hermite that of e. These are established exemplars, cited here, not claimed here.
7

Fine. Now do it with water.

Swap two words and you have a famous unsolved problem.

“socks”→ every possible way water can slosh
“green”→ never blows up
the drawer→ still infinite
a purple sock→ nobody has held one up
Kevin→ present, flipping

The paper this page belongs to does not claim water is safe, and does not claim water explodes. It makes a smaller and much more annoying point: if you set the rules up so that no class-level proof is ever allowed to count as finished, then “still open” stops being news about water. It becomes news about your rules.

There are exactly three doors out of the room:

1
Prove it for the whole class at once. Every sock, one argument.
2
Hold up an actual purple sock. A real one. In your hand.
3
Change the rules on purpose — and say out loud that that is what you did.

Kevin is not a door.

the boring grown-up version
The demonstrator is not the proof. It is a user interface over the proof. If an analogy is disputed, the disagreement should be pushed down to the exact proposition it represents: lay analogy → exact claim → proof, counterexample, or defect → closed.
Nothing here asserts a theorem about Navier–Stokes. The argument is about the closure structure of the question as posed.
Lab-note standing. This demonstrator records and communicates a formal argument developed in ongoing laboratory notes. It makes no ownership, priority, or discovery claim over established mathematics, classical logic, transcendence theory, Navier–Stokes, gauge theory, or other established objects.