431
|
1 open import Level
|
|
2 open import Ordinals
|
|
3 module Topology {n : Level } (O : Ordinals {n}) where
|
|
4
|
|
5 open import zf
|
|
6 open import logic
|
|
7 open _∧_
|
|
8 open _∨_
|
|
9 open Bool
|
|
10
|
|
11 import OD
|
|
12 open import Relation.Nullary
|
|
13 open import Data.Empty
|
|
14 open import Relation.Binary.Core
|
|
15 open import Relation.Binary.PropositionalEquality
|
|
16 import BAlgbra
|
|
17 open BAlgbra O
|
|
18 open inOrdinal O
|
|
19 open OD O
|
|
20 open OD.OD
|
|
21 open ODAxiom odAxiom
|
|
22 import OrdUtil
|
|
23 import ODUtil
|
|
24 open Ordinals.Ordinals O
|
|
25 open Ordinals.IsOrdinals isOrdinal
|
|
26 open Ordinals.IsNext isNext
|
|
27 open OrdUtil O
|
|
28 open ODUtil O
|
|
29
|
|
30 import ODC
|
|
31 open ODC O
|
|
32
|
1102
|
33 open import filter O
|
1101
|
34 open import OPair O
|
|
35
|
431
|
36
|
482
|
37 record Topology ( L : HOD ) : Set (suc n) where
|
431
|
38 field
|
|
39 OS : HOD
|
|
40 OS⊆PL : OS ⊆ Power L
|
|
41 o∪ : { P : HOD } → P ⊆ OS → OS ∋ Union P
|
|
42 o∩ : { p q : HOD } → OS ∋ p → OS ∋ q → OS ∋ (p ∩ q)
|
1101
|
43 -- closed Set
|
|
44 CS : HOD
|
|
45 CS = record { od = record { def = λ x → odef OS (& ( L \ (* x ))) } ; odmax = & L ; <odmax = tp02 } where
|
|
46 tp02 : {y : Ordinal } → odef OS (& (L \ * y)) → y o< & L
|
|
47 tp02 {y} nop = ?
|
1108
|
48 os⊆L : {x : HOD} → OS ∋ x → x ⊆ L
|
|
49 os⊆L {x} Ox {y} xy = ( OS⊆PL Ox ) _ (subst (λ k → odef k y) (sym *iso) xy )
|
1101
|
50 -- ∈∅< ( proj1 nop )
|
431
|
51
|
482
|
52 open Topology
|
431
|
53
|
1107
|
54 -- Base
|
|
55 -- The elements of B cover X ; For any U , V ∈ B and any point x ∈ U ∩ V there is a W ∈ B such that
|
|
56 -- W ⊆ U ∩ V and x ∈ W .
|
|
57
|
|
58 data Subbase (P : HOD) : Ordinal → Set n where
|
|
59 gi : {x : Ordinal } → odef P x → Subbase P x
|
|
60 g∩ : {x y : Ordinal } → Subbase P x → Subbase P y → Subbase P (& (* x ∩ * y))
|
|
61
|
1108
|
62 Subbases : (P : HOD) → HOD
|
|
63 Subbases P = record { od = record { def = λ x → Subbase P x } ; odmax = ? ; <odmax = ? }
|
1107
|
64
|
|
65 record Base (P : HOD) (x : Ordinal) : Set n where
|
|
66 field
|
|
67 b : Ordinal
|
1108
|
68 pb : odef (Power (Subbases P) ) b
|
|
69 bx : odef (* b) x
|
1107
|
70
|
|
71 GeneratedTop : (P : HOD) → HOD
|
|
72 GeneratedTop P = record { od = record { def = λ x → Base P x } ; odmax = & P ; <odmax = ? }
|
|
73
|
|
74 -- covers
|
1101
|
75
|
431
|
76 record _covers_ ( P q : HOD ) : Set (suc n) where
|
|
77 field
|
|
78 cover : {x : HOD} → q ∋ x → HOD
|
|
79 P∋cover : {x : HOD} → {lt : q ∋ x} → P ∋ cover lt
|
|
80 isCover : {x : HOD} → {lt : q ∋ x} → cover lt ∋ x
|
|
81
|
|
82 -- Finite Intersection Property
|
|
83
|
|
84 data Finite-∩ (S : HOD) : HOD → Set (suc n) where
|
1101
|
85 fin-e : {x : HOD} → S ∋ x → Finite-∩ S x
|
|
86 fin-∩ : {x y : HOD} → Finite-∩ S x → Finite-∩ S y → Finite-∩ S (x ∩ y)
|
431
|
87
|
1102
|
88 record FIP {L : HOD} (top : Topology L) : Set (suc n) where
|
431
|
89 field
|
1102
|
90 fipS⊆PL : L ⊆ CS top
|
|
91 fip≠φ : { x : HOD } → Finite-∩ L x → ¬ ( x ≡ od∅ )
|
431
|
92
|
|
93 -- Compact
|
|
94
|
|
95 data Finite-∪ (S : HOD) : HOD → Set (suc n) where
|
1101
|
96 fin-e : {x : HOD} → S ∋ x → Finite-∪ S x
|
431
|
97 fin-∪ : {x y : HOD} → Finite-∪ S x → Finite-∪ S y → Finite-∪ S (x ∪ y)
|
|
98
|
1102
|
99 record Compact {L : HOD} (top : Topology L) : Set (suc n) where
|
431
|
100 field
|
1102
|
101 finCover : {X : HOD} → X ⊆ OS top → X covers L → HOD
|
|
102 isCover : {X : HOD} → (xo : X ⊆ OS top) → (xcp : X covers L ) → (finCover xo xcp ) covers L
|
|
103 isFinite : {X : HOD} → (xo : X ⊆ OS top) → (xcp : X covers L ) → Finite-∪ X (finCover xo xcp )
|
431
|
104
|
|
105 -- FIP is Compact
|
|
106
|
1102
|
107 FIP→Compact : {L : HOD} → (top : Topology L ) → FIP top → Compact top
|
|
108 FIP→Compact {L} TL fip = record { finCover = ? ; isCover = ? ; isFinite = ? }
|
431
|
109
|
1102
|
110 Compact→FIP : {L : HOD} → (top : Topology L ) → Compact top → FIP top
|
482
|
111 Compact→FIP = {!!}
|
431
|
112
|
|
113 -- Product Topology
|
|
114
|
1101
|
115 open ZFProduct
|
|
116
|
1102
|
117 record BaseP {P : HOD} (TP : Topology P ) (Q : HOD) (x : Ordinal) : Set n where
|
|
118 field
|
1106
|
119 p q : Ordinal
|
1102
|
120 op : odef (OS TP) p
|
1106
|
121 prod : x ≡ & (ZFP (* p) Q )
|
1102
|
122
|
|
123 record BaseQ (P : HOD) {Q : HOD} (TQ : Topology Q ) (x : Ordinal) : Set n where
|
|
124 field
|
1106
|
125 p q : Ordinal
|
1102
|
126 oq : odef (OS TQ) q
|
1106
|
127 prod : x ≡ & (ZFP P (* q ))
|
|
128
|
1107
|
129 -- box : HOD
|
|
130 -- box = ZFP (OS TP) (OS TQ)
|
|
131
|
1106
|
132 base : {P Q : HOD} → Topology P → Topology Q → HOD
|
|
133 base {P} {Q} TP TQ = record { od = record { def = λ x → BaseP TP Q x ∨ BaseQ P TQ x } ; odmax = & (ZFP P Q) ; <odmax = ? }
|
|
134
|
|
135 POS : {P Q : HOD} → Topology P → Topology Q → HOD
|
1107
|
136 POS {P} {Q} TP TQ = GeneratedTop (base TP TQ)
|
1102
|
137
|
1108
|
138
|
1101
|
139 _Top⊗_ : {P Q : HOD} → Topology P → Topology Q → Topology (ZFP P Q)
|
|
140 _Top⊗_ {P} {Q} TP TQ = record {
|
1106
|
141 OS = POS TP TQ
|
|
142 ; OS⊆PL = tp10
|
1108
|
143 ; o∪ = tp13
|
1109
|
144 ; o∩ = tp14
|
1101
|
145 } where
|
1102
|
146 -- B : (OS P ∋ x → proj⁻¹ x ) ∨ (OS Q ∋ y → proj⁻¹ y )
|
|
147 -- U ⊂ ZFP P Q ∧ ( U ∋ ∀ x → B ∋ ∃ b → b ∋ x ∧ b ⊂ U )
|
1108
|
148 tp11 : {x z : Ordinal } → Subbase (base TP TQ) z → odef (* z) x → ZFProduct P Q x
|
|
149 tp11 {x} {z} (gi (case1 record { p = p ; q = q ; op = op ; prod = z=zfp })) zx = tp12 where
|
|
150 tp12 : ZFProduct P Q x
|
|
151 tp12 with subst (λ k → odef k x) (trans (cong (*) z=zfp) *iso) zx
|
|
152 ... | ab-pair pa qb = ZFP→
|
|
153 (os⊆L TP (subst (λ k → odef (OS TP) k) (sym &iso) op ) (subst (λ k → odef (* p) k) (sym &iso) pa) )
|
|
154 (subst (λ k → odef Q k ) (sym &iso) qb )
|
|
155 tp11 {x} {z} (gi (case2 record { p = p ; q = q ; oq = oq ; prod = z=zfp })) zx = tp12 where
|
|
156 tp12 : ZFProduct P Q x
|
|
157 tp12 with subst (λ k → odef k x) (trans (cong (*) z=zfp) *iso) zx
|
|
158 ... | ab-pair pa qb = ZFP→
|
|
159 (subst (λ k → odef P k ) (sym &iso) pa )
|
|
160 ((os⊆L TQ (subst (λ k → odef (OS TQ) k) (sym &iso) oq )) (subst (λ k → odef (* q) k) (sym &iso) qb) )
|
|
161 tp11 {x} (g∩ {a} {b} sb sb₁) zx = tp11 sb (proj1 (subst (λ k → odef k x) *iso zx ))
|
1106
|
162 tp10 : POS TP TQ ⊆ Power (ZFP P Q)
|
1108
|
163 tp10 {x} record { b = b ; pb = pb ; bx = bx } z xz = tp11 (pb _ bx) xz
|
|
164 tp13 : {U : HOD} → U ⊆ POS TP TQ → POS TP TQ ∋ Union U
|
1109
|
165 tp13 {U} U⊆O = tp20 U U⊆O where
|
|
166 ind : {x : HOD} → ({y : HOD} → x ∋ y → y ⊆ POS TP TQ → POS TP TQ ∋ Union y) → x ⊆ POS TP TQ → POS TP TQ ∋ Union x
|
|
167 ind {x} prev x⊆O = record { b = ? ; pb = ? ; bx = ? }
|
|
168 tp20 : (U : HOD ) → U ⊆ POS TP TQ → POS TP TQ ∋ Union U
|
|
169 tp20 U U⊆O = ε-induction0 { λ U → U ⊆ POS TP TQ → POS TP TQ ∋ Union U } ind U U⊆O
|
|
170 tp14 : {p q : HOD} → POS TP TQ ∋ p → POS TP TQ ∋ q → POS TP TQ ∋ (p ∩ q)
|
|
171 tp14 {p} {q} op oq = record { b = & tp15 ; pb = ? ; bx = ? } where
|
|
172 tp15 : HOD
|
|
173 tp15 = ?
|
431
|
174
|
|
175 -- existence of Ultra Filter
|
|
176
|
1102
|
177 open Filter
|
|
178
|
431
|
179 -- Ultra Filter has limit point
|
|
180
|
1102
|
181 record UFLP {P : HOD} (TP : Topology P) {L : HOD} (LP : L ⊆ Power P ) (F : Filter LP ) (uf : ultra-filter {L} {P} {LP} F) : Set (suc (suc n)) where
|
|
182 field
|
|
183 limit : Ordinal
|
|
184 P∋limit : odef P limit
|
|
185 is-limit : {o : Ordinal} → odef (OS TP) o → odef (* o) limit → (* o) ⊆ filter F
|
|
186
|
431
|
187 -- FIP is UFL
|
|
188
|
1102
|
189 FIP→UFLP : {P : HOD} (TP : Topology P) → FIP TP
|
|
190 → {L : HOD} (LP : L ⊆ Power P ) (F : Filter LP ) (uf : ultra-filter {L} {P} {LP} F) → UFLP TP LP F uf
|
|
191 FIP→UFLP {P} TP fip {L} LP F uf = record { limit = ? ; P∋limit = ? ; is-limit = ? }
|
|
192
|
|
193 UFLP→FIP : {P : HOD} (TP : Topology P) →
|
|
194 ( {L : HOD} (LP : L ⊆ Power P ) (F : Filter LP ) (uf : ultra-filter {L} {P} {LP} F) → UFLP TP LP F uf ) → FIP TP
|
|
195 UFLP→FIP {P} TP uflp = record { fipS⊆PL = ? ; fip≠φ = ? }
|
|
196
|
431
|
197 -- Product of UFL has limit point (Tychonoff)
|
|
198
|
1102
|
199 Tychonoff : {P Q : HOD } → (TP : Topology P) → (TQ : Topology Q) → Compact TP → Compact TQ → Compact (TP Top⊗ TQ)
|
|
200 Tychonoff {P} {Q} TP TQ CP CQ = FIP→Compact (TP Top⊗ TQ) (UFLP→FIP (TP Top⊗ TQ) uflp ) where
|
1104
|
201 uflp : {L : HOD} (LPQ : L ⊆ Power (ZFP P Q)) (F : Filter LPQ)
|
|
202 (uf : ultra-filter {L} {_} {LPQ} F) → UFLP (TP Top⊗ TQ) LPQ F uf
|
1106
|
203 uflp {L} LPQ F uf = record { limit = & < * ( UFLP.limit uflpp) , ? > ; P∋limit = ? ; is-limit = ? } where
|
|
204 LP : (L : HOD ) (LPQ : L ⊆ Power (ZFP P Q)) → HOD
|
|
205 LP L LPQ = Replace' L ( λ x lx → Replace' x ( λ z xz → * ( zπ1 (LPQ lx (& z) (subst (λ k → odef k (& z)) (sym *iso) xz )))) )
|
|
206 LPP : (L : HOD) (LPQ : L ⊆ Power (ZFP P Q)) → LP L LPQ ⊆ Power P
|
|
207 LPP L LPQ record { z = z ; az = az ; x=ψz = x=ψz } w xw = tp02 (subst (λ k → odef k w)
|
1105
|
208 (subst₂ (λ j k → j ≡ k) refl *iso (cong (*) x=ψz) ) xw) where
|
|
209 tp02 : Replace' (* z) (λ z₁ xz → * (zπ1 (LPQ (subst (odef L) (sym &iso) az) (& z₁) (subst (λ k → odef k (& z₁)) (sym *iso) xz)))) ⊆ P
|
|
210 tp02 record { z = z1 ; az = az1 ; x=ψz = x=ψz1 } = subst (λ k → odef P k ) (trans (sym &iso) (sym x=ψz1) )
|
|
211 (zp1 (LPQ (subst (λ k → odef L k) (sym &iso) az) _ (tp03 az1 ))) where
|
|
212 tp03 : odef (* z) z1 → odef (* (& (* z))) (& (* z1))
|
|
213 tp03 lt = subst (λ k → odef k (& (* z1))) (sym *iso) (subst (odef (* z)) (sym &iso) lt)
|
1106
|
214 FP : Filter (LPP L LPQ)
|
|
215 FP = record { filter = LP (filter F) (λ x → LPQ (f⊆L F x )) ; f⊆L = tp04 ; filter1 = ? ; filter2 = ? } where
|
|
216 tp04 : LP (filter F) (λ x → LPQ (f⊆L F x )) ⊆ LP L LPQ
|
|
217 tp04 record { z = z ; az = az ; x=ψz = x=ψz } = record { z = z ; az = f⊆L F az ; x=ψz = ? }
|
1104
|
218 uFP : ultra-filter FP
|
|
219 uFP = record { proper = ? ; ultra = ? }
|
1106
|
220 uflpp : UFLP {P} TP {LP L LPQ} (LPP L LPQ) FP uFP
|
|
221 uflpp = FIP→UFLP TP (Compact→FIP TP CP) (LPP L LPQ) FP uFP
|
1104
|
222 LQ : HOD
|
1105
|
223 LQ = Replace' L ( λ x lx → Replace' x ( λ z xz → * ( zπ2 (LPQ lx (& z) (subst (λ k → odef k (& z)) (sym *iso) xz )))) )
|
1104
|
224 LQQ : LQ ⊆ Power Q
|
|
225 LQQ = ?
|
1102
|
226
|