proof-board / stable theorem

∀ interface:

mujun.dev

contradiction is a system that remains consistentinteresting after it invalidates itself.

}{
모순

02 counterexample / documentation layer

The proof says yes.

A tidy interface claims the premise is stable, aligned, and ready to compile.

lemma 02.a if (logic.ok) return true; compile success?
<<<<<<< accepted branch

02 counterexample / rebuttal layer

No, the proof says no.

The same surface writes over itself and insists the correct answer was never present.

반례 02.b if (logic.ok) throw premise; premise missing
======= rejected branch
two coordinate systems occupy one viewport

03 compiler of doubt

Compiler of Doubt

warning MUJUN:041 theorem resolved to its opposite

error 반례:110 expected proof, received beautiful failure

note 不一致 line 0 contradicts line ∞

merge <<<<<<< calm / ======= rupture / >>>>>>> calm

assert stable === unstable // both passed

type note Interactions are designed to “disagree” rather than lift; Technical annotation type: pseudo-code under Space Grotesk** bold semi-bold weights for large contradiction statements.

const answer = undefined ?? exact;
모순.compile({ success: false, success: true })
λ → branch → } → λ

04 unresolved merge

} λ {

Both conclusions remain visible.

The contradiction is resolved.

The contradiction refuses resolution.

>>>>>>> no final branch
불일치
premise missing