1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 set "baseuri" "cic:/matita/metric_lattice/".
17 include "metric_space.ma".
20 record mlattice_ (R : ogroup) : Type ≝ {
21 ml_mspace_: metric_space R;
23 ml_with_: ms_carr ? ml_mspace_ = ap_carr (l_carr ml_lattice)
26 lemma ml_mspace: ∀R.mlattice_ R → metric_space R.
27 intros (R ml); apply (mk_metric_space R ml); unfold Type_OF_mlattice_;
28 cases (ml_with_ ? ml); simplify;
29 [apply (metric ? (ml_mspace_ ? ml));|apply (mpositive ? (ml_mspace_ ? ml));
30 |apply (mreflexive ? (ml_mspace_ ? ml));|apply (msymmetric ? (ml_mspace_ ? ml));
31 |apply (mtineq ? (ml_mspace_ ? ml))]
34 coercion cic:/matita/metric_lattice/ml_mspace.con.
36 record is_mlattice (R : ogroup) (ml: mlattice_ R) : Type ≝ {
37 ml_prop1: ∀a,b:ml. 0 < δ a b → a # b;
38 ml_prop2: ∀a,b,c:ml. δ (a∨b) (a∨c) + δ (a∧b) (a∧c) ≤ δ b c
41 record mlattice (R : ogroup) : Type ≝ {
42 ml_carr :> mlattice_ R;
43 ml_props:> is_mlattice R ml_carr
46 lemma eq_to_ndlt0: ∀R.∀ml:mlattice R.∀a,b:ml. a ≈ b → ¬ 0 < δ a b.
47 intros (R ml a b E); intro H; apply E; apply (ml_prop1 ?? ml);
51 lemma eq_to_dzero: ∀R.∀ml:mlattice R.∀x,y:ml.x ≈ y → δ x y ≈ 0.
52 intros (R ml x y H); intro H1; apply H; clear H;
53 apply (ml_prop1 ?? ml); split [apply mpositive] apply ap_symmetric;
57 lemma meq_l: ∀R.∀ml:mlattice R.∀x,y,z:ml. x≈z → δx y ≈ δz y.
58 intros (R ml x y z); apply le_le_eq;
59 [ apply (le_transitive ???? (mtineq ???y z));
60 apply (le_rewl ??? (0+δz y) (eq_to_dzero ???? H));
61 apply (le_rewl ??? (δz y) (zero_neutral ??)); apply le_reflexive;
62 | apply (le_transitive ???? (mtineq ???y x));
63 apply (le_rewl ??? (0+δx y) (eq_to_dzero ??z x H));
64 apply (le_rewl ??? (δx y) (zero_neutral ??)); apply le_reflexive;]
68 lemma meq_r: ∀R.∀ml:mlattice R.∀x,y,z:ml. x≈z → δy x ≈ δy z.
69 intros; apply (eq_trans ???? (msymmetric ??y x));
70 apply (eq_trans ????? (msymmetric ??z y)); apply meq_l; assumption;
74 lemma dap_to_lt: ∀R.∀ml:mlattice R.∀x,y:ml. δ x y # 0 → 0 < δ x y.
75 intros; split [apply mpositive] apply ap_symmetric; assumption;
78 lemma dap_to_ap: ∀R.∀ml:mlattice R.∀x,y:ml. δ x y # 0 → x # y.
79 intros (R ml x y H); apply (ml_prop1 ?? ml); split; [apply mpositive;]
80 apply ap_symmetric; assumption;
85 ∀R.∀ml:mlattice R.∀x,y,z:ml. x ≤ y → y ≤ z → δ x z ≈ δ x y + δ y z.
86 intros (R ml x y z Lxy Lyz); apply le_le_eq; [apply mtineq]
87 apply (le_transitive ????? (ml_prop2 ?? ml (y) ??));
88 cut ( δx y+ δy z ≈ δ(y∨x) (y∨z)+ δ(y∧x) (y∧z)); [
89 apply (le_rewr ??? (δx y+ δy z)); [assumption] apply le_reflexive]
90 lapply (le_to_eqm ??? Lxy) as Dxm; lapply (le_to_eqm ??? Lyz) as Dym;
91 lapply (le_to_eqj ??? Lxy) as Dxj; lapply (le_to_eqj ??? Lyz) as Dyj; clear Lxy Lyz;
92 apply (Eq≈ (δ(x∧y) y + δy z)); [apply feq_plusr; apply (meq_l ????? Dxm);]
93 apply (Eq≈ (δ(x∧y) (y∧z) + δy z)); [apply feq_plusr; apply (meq_r ????? Dym);]
94 apply (Eq≈ (δ(x∧y) (y∧z) + δ(x∨y) z)); [apply feq_plusl; apply (meq_l ????? Dxj);]
95 apply (Eq≈ (δ(x∧y) (y∧z) + δ(x∨y) (y∨z))); [apply feq_plusl; apply (meq_r ????? Dyj);]
96 apply (Eq≈ ? (plus_comm ???));
97 apply (Eq≈ (δ(y∨x) (y∨z)+ δ(x∧y) (y∧z))); [apply feq_plusr; apply (meq_l ????? (join_comm ???));]
99 apply (Eq≈ (δ(y∧x) (y∧z))); [apply (meq_l ????? (meet_comm ???));]
103 include "sequence.ma".
104 include "nat/plus.ma".
107 λR.λml:mlattice R.λs:sequence (pordered_set_of_excedence ml).λk.λn. δ (s n) k.
109 notation "s ⇝ 'Zero'" non associative with precedence 50 for @{'tends0 $s }.
111 interpretation "tends to" 'tends s x =
112 (cic:/matita/sequence/tends0.con _ s).
115 alias symbol "leq" = "ordered sets less or equal than".
116 alias symbol "and" = "constructive and".
117 alias symbol "exists" = "constructive exists (Type)".
118 lemma carabinieri: (* non trova la coercion .... *)
119 ∀R.∀ml:mlattice R.∀an,bn,xn:sequence (pordered_set_of_excedence ml).
120 (∀n. (an n ≤ xn n) ∧ (xn n ≤ bn n)) →
121 ∀x:ml. tends0 ? (d2s ? ml an x) → tends0 ? (d2s ? ml bn x) →
122 tends0 ? (d2s ? ml xn x).
123 intros (R ml an bn xn H x Ha Hb); unfold tends0 in Ha Hb ⊢ %. unfold d2s in Ha Hb ⊢ %.
125 elim (Ha ? He) (n1 H1); clear Ha; elim (Hb e He) (n2 H2); clear Hb;
126 constructor 1; [apply (n1 + n2);] intros (n3 Hn3);
128 generalize in match Hn3; elim n2; [rewrite > sym_plus in H3; assumption]
129 apply H3; rewrite > sym_plus in H4; simplify in H4; apply lt_S_to_lt;
130 rewrite > sym_plus in H4; assumption;]
131 elim (H1 ? Hcut) (H3 H4); clear Hcut;
133 generalize in match Hn3; elim n1; [assumption]
134 apply H5; simplify in H6; apply lt_S_to_lt; assumption]
135 elim (H2 ? Hcut) (H5 H6); clear Hcut;
136 elim (H n3) (H7 H8); clear H H1 H2;
137 lapply (le_to_eqm ??? H7) as Dxm; lapply (le_to_eqj ??? H7) as Dym;
138 cut (δ (xn n3) x ≤ δ (bn n3) x + δ (an n3) x + δ (an n3) x); [2:
139 apply (le_transitive ???? (mtineq ???? (an n3)));
140 lapply (le_mtri ????? H7 H8);
141 lapply (feq_plusr ? (- δ(xn n3) (bn n3)) ?? Hletin);
142 cut ( δ(an n3) (bn n3)+- δ(xn n3) (bn n3)≈( δ(an n3) (xn n3))); [2:
143 apply (Eq≈ (0 + δ(an n3) (xn n3)) ? (zero_neutral ??));
144 apply (Eq≈ (δ(an n3) (xn n3) + 0) ? (plus_comm ???));
145 apply (Eq≈ (δ(an n3) (xn n3) + (-δ(xn n3) (bn n3) + δ(xn n3) (bn n3))) ? (opp_inverse ??));
146 apply (Eq≈ (δ(an n3) (xn n3) + (δ(xn n3) (bn n3) + -δ(xn n3) (bn n3))) ? (plus_comm ?? (δ(xn n3) (bn n3))));
147 apply (Eq≈ ? ? (eq_sym ??? (plus_assoc ????))); assumption;] clear Hletin1;
148 apply (le_rewl ??? ( δ(an n3) (xn n3)+ δ(an n3) x));[
149 apply feq_plusr; apply msymmetric;]
150 apply (le_rewl ??? (δ(an n3) (bn n3)+- δ(xn n3) (bn n3)+ δ(an n3) x));[
151 apply feq_plusr; assumption;]
154 apply (lt_le_transitive ????? (mpositive ????));
155 split; elim He; [apply le_zero_x_to_le_opp_x_zero|
157 [left; apply exc_zero_opp_x_to_exc_x_zero;
158 apply (Ex≫ ? (eq_opp_opp_x_x ??));
159 |right; apply exc_opp_x_zero_to_exc_zero_x;
160 apply (Ex≪ ? (eq_opp_opp_x_x ??));]] assumption;]
161 clear Dxm Dym H7 H8 Hn3 H5 H3 n1 n2;
164 (* 3.17 conclusione: δ x y ≈ 0 *)
165 (* 3.20 conclusione: δ x y ≈ 0 *)
167 strong_sup x ≝ ∀n. s n ≤ x ∧ ∀y x ≰ y → ∃n. s n ≰ y
168 strong_sup_zoli x ≝ ∀n. s n ≤ x ∧ ∄y. y#x ∧ y ≤ x
170 (* 3.22 sup debole (più piccolo dei maggioranti) *)
171 (* 3.23 conclusion: δ x sup(...) ≈ 0 *)
172 (* 3.25 vero nel reticolo e basta (niente δ) *)
173 (* 3.36 conclusion: δ x y ≈ 0 *)