|
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
|
|
1111
|
65 sbp : (P : HOD) {x : Ordinal } → Subbase P x → Ordinal
|
|
|
66 sbp P {x} (gi {y} px) = x
|
|
|
67 sbp P {.(& (* _ ∩ * _))} (g∩ sb sb₁) = sbp P sb
|
|
1107
|
68
|
|
1111
|
69 is-sbp : (P : HOD) {x y : Ordinal } → (px : Subbase P x) → odef (* x) y → odef P (sbp P px ) ∧ odef (* (sbp P px)) y
|
|
|
70 is-sbp P {x} (gi px) xy = ⟪ px , xy ⟫
|
|
|
71 is-sbp P {.(& (* _ ∩ * _))} (g∩ {x} {y} px px₁) xy = is-sbp P px (proj1 (subst (λ k → odef k _ ) *iso xy))
|
|
1107
|
72
|
|
1111
|
73 record IsSubBase (L P : HOD) : Set (suc n) where
|
|
1110
|
74 field
|
|
1111
|
75 P⊆PL : P ⊆ Power L
|
|
|
76 p : {x : HOD} → L ∋ x → HOD
|
|
|
77 in-P : {x : HOD} → {lx : L ∋ x } → P ∋ p lx
|
|
|
78 px : {x : HOD} → {lx : L ∋ x } → p lx ∋ x
|
|
1110
|
79
|
|
1111
|
80 GeneratedTopogy : (L P : HOD) → IsSubBase L P → Topology L
|
|
|
81 GeneratedTopogy L P isb = record { OS = Subbases P ; OS⊆PL = OS⊆PL0 ; o∪ = tp01 ; o∩ = ? } where
|
|
|
82 OS⊆PL0 : Subbases P ⊆ Power L
|
|
|
83 OS⊆PL0 (gi px) z xz = IsSubBase.P⊆PL isb px _ xz
|
|
|
84 OS⊆PL0 (g∩ {x} {y} px py) z xz = IsSubBase.P⊆PL isb (proj1 (is-sbp P px (proj1 (subst (λ k → odef k z) *iso xz )) )) _
|
|
|
85 (proj2 (is-sbp P px (proj1 (subst (λ k → odef k z) *iso xz )) ))
|
|
|
86 tp01 : {Q : HOD} → Q ⊆ Subbases P → Subbases P ∋ Union Q
|
|
|
87 tp01 {q} qp = ε-induction0 { λ x → x ⊆ Subbases P → Subbases P ∋ Union x } tp02 q qp where
|
|
|
88 tp02 : {x : HOD} → ({y : HOD} → x ∋ y → y ⊆ Subbases P → Subbases P ∋ Union y) → x ⊆ Subbases P → Subbases P ∋ Union x
|
|
|
89 tp02 {x} prev xp = gi ?
|
|
|
90
|
|
1110
|
91
|
|
1107
|
92 -- covers
|
|
1101
|
93
|
|
431
|
94 record _covers_ ( P q : HOD ) : Set (suc n) where
|
|
|
95 field
|
|
|
96 cover : {x : HOD} → q ∋ x → HOD
|
|
|
97 P∋cover : {x : HOD} → {lt : q ∋ x} → P ∋ cover lt
|
|
|
98 isCover : {x : HOD} → {lt : q ∋ x} → cover lt ∋ x
|
|
|
99
|
|
|
100 -- Finite Intersection Property
|
|
|
101
|
|
|
102 data Finite-∩ (S : HOD) : HOD → Set (suc n) where
|
|
1101
|
103 fin-e : {x : HOD} → S ∋ x → Finite-∩ S x
|
|
|
104 fin-∩ : {x y : HOD} → Finite-∩ S x → Finite-∩ S y → Finite-∩ S (x ∩ y)
|
|
431
|
105
|
|
1102
|
106 record FIP {L : HOD} (top : Topology L) : Set (suc n) where
|
|
431
|
107 field
|
|
1102
|
108 fipS⊆PL : L ⊆ CS top
|
|
|
109 fip≠φ : { x : HOD } → Finite-∩ L x → ¬ ( x ≡ od∅ )
|
|
431
|
110
|
|
|
111 -- Compact
|
|
|
112
|
|
|
113 data Finite-∪ (S : HOD) : HOD → Set (suc n) where
|
|
1101
|
114 fin-e : {x : HOD} → S ∋ x → Finite-∪ S x
|
|
431
|
115 fin-∪ : {x y : HOD} → Finite-∪ S x → Finite-∪ S y → Finite-∪ S (x ∪ y)
|
|
|
116
|
|
1102
|
117 record Compact {L : HOD} (top : Topology L) : Set (suc n) where
|
|
431
|
118 field
|
|
1102
|
119 finCover : {X : HOD} → X ⊆ OS top → X covers L → HOD
|
|
|
120 isCover : {X : HOD} → (xo : X ⊆ OS top) → (xcp : X covers L ) → (finCover xo xcp ) covers L
|
|
|
121 isFinite : {X : HOD} → (xo : X ⊆ OS top) → (xcp : X covers L ) → Finite-∪ X (finCover xo xcp )
|
|
431
|
122
|
|
|
123 -- FIP is Compact
|
|
|
124
|
|
1102
|
125 FIP→Compact : {L : HOD} → (top : Topology L ) → FIP top → Compact top
|
|
|
126 FIP→Compact {L} TL fip = record { finCover = ? ; isCover = ? ; isFinite = ? }
|
|
431
|
127
|
|
1102
|
128 Compact→FIP : {L : HOD} → (top : Topology L ) → Compact top → FIP top
|
|
482
|
129 Compact→FIP = {!!}
|
|
431
|
130
|
|
|
131 -- Product Topology
|
|
|
132
|
|
1101
|
133 open ZFProduct
|
|
|
134
|
|
1102
|
135 record BaseP {P : HOD} (TP : Topology P ) (Q : HOD) (x : Ordinal) : Set n where
|
|
|
136 field
|
|
1106
|
137 p q : Ordinal
|
|
1102
|
138 op : odef (OS TP) p
|
|
1106
|
139 prod : x ≡ & (ZFP (* p) Q )
|
|
1102
|
140
|
|
|
141 record BaseQ (P : HOD) {Q : HOD} (TQ : Topology Q ) (x : Ordinal) : Set n where
|
|
|
142 field
|
|
1106
|
143 p q : Ordinal
|
|
1102
|
144 oq : odef (OS TQ) q
|
|
1106
|
145 prod : x ≡ & (ZFP P (* q ))
|
|
|
146
|
|
1107
|
147 -- box : HOD
|
|
|
148 -- box = ZFP (OS TP) (OS TQ)
|
|
|
149
|
|
1106
|
150 base : {P Q : HOD} → Topology P → Topology Q → HOD
|
|
|
151 base {P} {Q} TP TQ = record { od = record { def = λ x → BaseP TP Q x ∨ BaseQ P TQ x } ; odmax = & (ZFP P Q) ; <odmax = ? }
|
|
|
152
|
|
1101
|
153 _Top⊗_ : {P Q : HOD} → Topology P → Topology Q → Topology (ZFP P Q)
|
|
1111
|
154 _Top⊗_ {P} {Q} TP TQ = GeneratedTopogy (ZFP P Q) (base TP TQ) ?
|
|
431
|
155
|
|
|
156 -- existence of Ultra Filter
|
|
|
157
|
|
1102
|
158 open Filter
|
|
|
159
|
|
431
|
160 -- Ultra Filter has limit point
|
|
|
161
|
|
1102
|
162 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
|
|
|
163 field
|
|
|
164 limit : Ordinal
|
|
|
165 P∋limit : odef P limit
|
|
|
166 is-limit : {o : Ordinal} → odef (OS TP) o → odef (* o) limit → (* o) ⊆ filter F
|
|
|
167
|
|
431
|
168 -- FIP is UFL
|
|
|
169
|
|
1102
|
170 FIP→UFLP : {P : HOD} (TP : Topology P) → FIP TP
|
|
|
171 → {L : HOD} (LP : L ⊆ Power P ) (F : Filter LP ) (uf : ultra-filter {L} {P} {LP} F) → UFLP TP LP F uf
|
|
|
172 FIP→UFLP {P} TP fip {L} LP F uf = record { limit = ? ; P∋limit = ? ; is-limit = ? }
|
|
|
173
|
|
|
174 UFLP→FIP : {P : HOD} (TP : Topology P) →
|
|
|
175 ( {L : HOD} (LP : L ⊆ Power P ) (F : Filter LP ) (uf : ultra-filter {L} {P} {LP} F) → UFLP TP LP F uf ) → FIP TP
|
|
|
176 UFLP→FIP {P} TP uflp = record { fipS⊆PL = ? ; fip≠φ = ? }
|
|
|
177
|
|
431
|
178 -- Product of UFL has limit point (Tychonoff)
|
|
|
179
|
|
1102
|
180 Tychonoff : {P Q : HOD } → (TP : Topology P) → (TQ : Topology Q) → Compact TP → Compact TQ → Compact (TP Top⊗ TQ)
|
|
|
181 Tychonoff {P} {Q} TP TQ CP CQ = FIP→Compact (TP Top⊗ TQ) (UFLP→FIP (TP Top⊗ TQ) uflp ) where
|
|
1104
|
182 uflp : {L : HOD} (LPQ : L ⊆ Power (ZFP P Q)) (F : Filter LPQ)
|
|
|
183 (uf : ultra-filter {L} {_} {LPQ} F) → UFLP (TP Top⊗ TQ) LPQ F uf
|
|
1106
|
184 uflp {L} LPQ F uf = record { limit = & < * ( UFLP.limit uflpp) , ? > ; P∋limit = ? ; is-limit = ? } where
|
|
|
185 LP : (L : HOD ) (LPQ : L ⊆ Power (ZFP P Q)) → HOD
|
|
|
186 LP L LPQ = Replace' L ( λ x lx → Replace' x ( λ z xz → * ( zπ1 (LPQ lx (& z) (subst (λ k → odef k (& z)) (sym *iso) xz )))) )
|
|
|
187 LPP : (L : HOD) (LPQ : L ⊆ Power (ZFP P Q)) → LP L LPQ ⊆ Power P
|
|
|
188 LPP L LPQ record { z = z ; az = az ; x=ψz = x=ψz } w xw = tp02 (subst (λ k → odef k w)
|
|
1105
|
189 (subst₂ (λ j k → j ≡ k) refl *iso (cong (*) x=ψz) ) xw) where
|
|
|
190 tp02 : Replace' (* z) (λ z₁ xz → * (zπ1 (LPQ (subst (odef L) (sym &iso) az) (& z₁) (subst (λ k → odef k (& z₁)) (sym *iso) xz)))) ⊆ P
|
|
|
191 tp02 record { z = z1 ; az = az1 ; x=ψz = x=ψz1 } = subst (λ k → odef P k ) (trans (sym &iso) (sym x=ψz1) )
|
|
|
192 (zp1 (LPQ (subst (λ k → odef L k) (sym &iso) az) _ (tp03 az1 ))) where
|
|
|
193 tp03 : odef (* z) z1 → odef (* (& (* z))) (& (* z1))
|
|
|
194 tp03 lt = subst (λ k → odef k (& (* z1))) (sym *iso) (subst (odef (* z)) (sym &iso) lt)
|
|
1106
|
195 FP : Filter (LPP L LPQ)
|
|
|
196 FP = record { filter = LP (filter F) (λ x → LPQ (f⊆L F x )) ; f⊆L = tp04 ; filter1 = ? ; filter2 = ? } where
|
|
|
197 tp04 : LP (filter F) (λ x → LPQ (f⊆L F x )) ⊆ LP L LPQ
|
|
|
198 tp04 record { z = z ; az = az ; x=ψz = x=ψz } = record { z = z ; az = f⊆L F az ; x=ψz = ? }
|
|
1104
|
199 uFP : ultra-filter FP
|
|
|
200 uFP = record { proper = ? ; ultra = ? }
|
|
1106
|
201 uflpp : UFLP {P} TP {LP L LPQ} (LPP L LPQ) FP uFP
|
|
|
202 uflpp = FIP→UFLP TP (Compact→FIP TP CP) (LPP L LPQ) FP uFP
|
|
1104
|
203 LQ : HOD
|
|
1105
|
204 LQ = Replace' L ( λ x lx → Replace' x ( λ z xz → * ( zπ2 (LPQ lx (& z) (subst (λ k → odef k (& z)) (sym *iso) xz )))) )
|
|
1104
|
205 LQQ : LQ ⊆ Power Q
|
|
|
206 LQQ = ?
|
|
1102
|
207
|
