scratch

§ Diaconescu's Theorem

created 2022-09-07 · last edited 2023-04-02
  • Choice implies LEM
  • Let PPP be a proposition. Build the sets T,FT, FT,F as:
  • T≡x∈{0,1}:(x=1)∨PT \equiv {x \in \{0, 1\} : (x = 1) \lor P}T≡x∈{0,1}:(x=1)∨P, and F≡x∈{0,1}:(x=0)∨P}F \equiv x \in \{ 0, 1 \} : (x = 0) \lor P \}F≡x∈{0,1}:(x=0)∨P}.
  • Note that if we had LEM, we could case split on PPP via LEM and show that x≡{1}x \equiv \{ 1 \}x≡{1} if PPP, and x≡{0,1}x \equiv \{ 0, 1\}x≡{0,1} if P̸\not PP.
  • However, we don't have LEM. So let's invoke Choice on the set B≡{T,F}B \equiv \{T, F \}B≡{T,F}. This means we get a choice function c:B→∪cBc: B \to \cup c Bc:B→∪cB such that c(T)∈Tc(T) \in Tc(T)∈T and c(F)∈Fc(F) \in Fc(F)∈F.
  • By the definition of the two sets, this means that (c(T)=1∨P)(c(T) = 1 \lor P)(c(T)=1∨P), and (c(F)=0∨P)(c(F) = 0 \lor P)(c(F)=0∨P).
  • This can be written as the logical formula (c(T)=1∨P)∧(c(F)=0∨P)(c(T) = 1 \lor P) \land (c(F) = 0 \lor P)(c(T)=1∨P)∧(c(F)=0∨P).
  • This is the same as (c(T)≠c(F))∨P(c(T) \neq c(F)) \lor P(c(T)=c(F))∨P.
  • Now see that since P  ⟹  (U=V)P \implies (U = V)P⟹(U=V) (by extensionality), we have that P  ⟹  (f(U)=f(V))P \implies (f(U) = f(V))P⟹(f(U)=f(V)).
  • See that contraposition is available purely intuitionistically: ( (p -> q) -> (q -> false) -> p -> false).
  • Therefore, by contraposition (f(U)≠f(V))  ⟹  ¬P(f(U) \neq f(V)) \implies \lnot P(f(U)=f(V))⟹¬P.
  • This means we have P∨¬PP \lor \lnot PP∨¬P!
❦
Newer ৪ Blog ৪ Older