Compactness of Propositional Logic
Let V be the set of propositional variables. V may be finite, countable, or of any cardinality. Let us denote by 2V={0,1}V the space of all truth assignments. 2V is given the product topology. 2V is compact by Tychonoff’s theorem.
Let us examine the equivalence between compactness of propositional logic and compactness of 2V.
Compactness of Propositional Logic. Let F be a collection of formulas. If F is unsatisfiable, then there exists a finite unsatisfiable subset of F.
For every formula F, denote the collection of unsatisfying assignments by U(F). U(F) forms a clopen set in 2V. On the other hand, for every clopen set V∈2V, there exists a formula F such that U(F)=V. Moreover, F is unsatisfiable if and only if ⋃F∈FU(F)=2V. Look at the following proposition and observe the equivalence.
Compactness of 2V. Let U be a collection of clopen sets in 2V. If U covers 2V, then there exists a finite subset of U that covers 2V.
Topological Aspects of Cantor space and Baire space
Observation. Let U be a subset of Cantor space. U is clopen if and only if U can be expressed as a finite union of basis elements if and only if U is decidable.
The observation above is proved using compactness. Baire space is not compact, which is why the same property does not hold for Baire space.
Observation. Let U be a subset of Cantor space or Baire space. U is open if and only if U is semidecidable with an oracle.
Proof. If U is open, then U is a countable union of basis elements. Encode those information into an oracle and then we can semidecide U. On the other hand, if U is semidecidable by an oracle Turing machine M, then
U=i⋃Ui
where
Ui={p∣M(p) halts in i or less steps }
with each Ui being open.
Arzela-Ascoli Theorem
Arzela-Ascoli Theorem.
- Let X be a compact space.
- Let Y be a compact metric space.
- Let (fn:X→Y) be an equicontinuous sequence of maps, that is, for every x∈X and ϵ>0, there exists an open neighborhood U(x,ϵ)⊆X such that fn[U(x,ϵ)]⊆B(fn(x),ϵ) for all n∈N. (U depends on x and ϵ, but not n)
Then, there exists a uniformly Cauchy subsequence of (fn).
Proof.
For every ϵ>0, the covering {U(x,ϵ)∣x∈X} has a subcovering {U(x,ϵ)∣x∈Sϵ} for a finite set Sϵ⊆X. Let
S=n∈N⋃S1/n
and (sn) be an enumeration of countable set S⊆X.
Let us define a two-dimensional sequence (gi,n:X→Y)i,n inductively on i, so that (gi+1,n)n be a subsquence of (gi,n)n.
Base Case) g0,n=fn
Inductive Case) Let us define (gi+1,n)n from (gi,n)n. Since Y is compact, there exists a convergent subsequence (gi,α(n)(si))n of (gi,n(si))n, for a strinctly increasing α:N→N. Define
gi+1,n=gi,α(n).
Consider the diagonal sequence (hn:X→Y) given by
hn=gn,n.
By construction, (hn(s))n converges for every s∈S. Now it is left to show that (hn) is uniformly Cauchy.
Fix ϵ>0. Pick m∈N satisfying 1/m≤ϵ. Choose N so that
∀s∈S1/m∀n,m≥Nd(hn(s),hm(s))≤ϵ.
This is possible since S1/m is finite. Note that N depends on ϵ, but not on any particular x∈X.
Fix x∈X. There exists s∈S1/m such that x∈U(s,1/m). Let n,m≥N. Observer that
d(hn(x),hn(s))≤1/m≤ϵ
d(hn(s),hm(s))≤ϵ
d(hm(s),hm(x))≤1/m≤ϵ
together yielding
d(hn(x),hm(x))≤3ϵ.