src/HOL/Limits.thy
author huffman
Tue, 04 May 2010 13:08:56 -0700
changeset 36662 621122eeb138
parent 36656 fec55067ae9b
child 36822 38a480e0346f
permissions -rw-r--r--
generalize types of LIMSEQ and LIM; generalize many lemmas
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     1
(*  Title       : Limits.thy
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     2
    Author      : Brian Huffman
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     3
*)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     4
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     5
header {* Filters and Limits *}
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     6
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     7
theory Limits
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     8
imports RealVector RComplete
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
     9
begin
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    10
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    11
subsection {* Nets *}
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    12
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    13
text {*
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
    14
  A net is now defined simply as a filter on a set.
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    15
  The definition also allows non-proper filters.
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    16
*}
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    17
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    18
locale is_filter =
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    19
  fixes net :: "('a \<Rightarrow> bool) \<Rightarrow> bool"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    20
  assumes True: "net (\<lambda>x. True)"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    21
  assumes conj: "net (\<lambda>x. P x) \<Longrightarrow> net (\<lambda>x. Q x) \<Longrightarrow> net (\<lambda>x. P x \<and> Q x)"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    22
  assumes mono: "\<forall>x. P x \<longrightarrow> Q x \<Longrightarrow> net (\<lambda>x. P x) \<Longrightarrow> net (\<lambda>x. Q x)"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    23
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    24
typedef (open) 'a net =
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    25
  "{net :: ('a \<Rightarrow> bool) \<Rightarrow> bool. is_filter net}"
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    26
proof
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    27
  show "(\<lambda>x. True) \<in> ?net" by (auto intro: is_filter.intro)
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    28
qed
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    29
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    30
lemma is_filter_Rep_net: "is_filter (Rep_net net)"
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    31
using Rep_net [of net] by simp
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    32
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    33
lemma Abs_net_inverse':
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    34
  assumes "is_filter net" shows "Rep_net (Abs_net net) = net"
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    35
using assms by (simp add: Abs_net_inverse)
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    36
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    37
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    38
subsection {* Eventually *}
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    39
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    40
definition
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    41
  eventually :: "('a \<Rightarrow> bool) \<Rightarrow> 'a net \<Rightarrow> bool" where
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    42
  [code del]: "eventually P net \<longleftrightarrow> Rep_net net P"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    43
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    44
lemma eventually_Abs_net:
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    45
  assumes "is_filter net" shows "eventually P (Abs_net net) = net P"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    46
unfolding eventually_def using assms by (simp add: Abs_net_inverse)
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    47
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
    48
lemma expand_net_eq:
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
    49
  shows "net = net' \<longleftrightarrow> (\<forall>P. eventually P net = eventually P net')"
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
    50
unfolding Rep_net_inject [symmetric] expand_fun_eq eventually_def ..
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
    51
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    52
lemma eventually_True [simp]: "eventually (\<lambda>x. True) net"
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    53
unfolding eventually_def
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    54
by (rule is_filter.True [OF is_filter_Rep_net])
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    55
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
    56
lemma always_eventually: "\<forall>x. P x \<Longrightarrow> eventually P net"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
    57
proof -
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
    58
  assume "\<forall>x. P x" hence "P = (\<lambda>x. True)" by (simp add: ext)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
    59
  thus "eventually P net" by simp
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
    60
qed
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
    61
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    62
lemma eventually_mono:
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    63
  "(\<forall>x. P x \<longrightarrow> Q x) \<Longrightarrow> eventually P net \<Longrightarrow> eventually Q net"
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    64
unfolding eventually_def
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    65
by (rule is_filter.mono [OF is_filter_Rep_net])
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    66
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    67
lemma eventually_conj:
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    68
  assumes P: "eventually (\<lambda>x. P x) net"
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    69
  assumes Q: "eventually (\<lambda>x. Q x) net"
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    70
  shows "eventually (\<lambda>x. P x \<and> Q x) net"
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    71
using assms unfolding eventually_def
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
    72
by (rule is_filter.conj [OF is_filter_Rep_net])
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    73
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    74
lemma eventually_mp:
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    75
  assumes "eventually (\<lambda>x. P x \<longrightarrow> Q x) net"
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    76
  assumes "eventually (\<lambda>x. P x) net"
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    77
  shows "eventually (\<lambda>x. Q x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    78
proof (rule eventually_mono)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    79
  show "\<forall>x. (P x \<longrightarrow> Q x) \<and> P x \<longrightarrow> Q x" by simp
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    80
  show "eventually (\<lambda>x. (P x \<longrightarrow> Q x) \<and> P x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    81
    using assms by (rule eventually_conj)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    82
qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    83
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    84
lemma eventually_rev_mp:
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    85
  assumes "eventually (\<lambda>x. P x) net"
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    86
  assumes "eventually (\<lambda>x. P x \<longrightarrow> Q x) net"
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    87
  shows "eventually (\<lambda>x. Q x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    88
using assms(2) assms(1) by (rule eventually_mp)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    89
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    90
lemma eventually_conj_iff:
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    91
  "eventually (\<lambda>x. P x \<and> Q x) net \<longleftrightarrow> eventually P net \<and> eventually Q net"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    92
by (auto intro: eventually_conj elim: eventually_rev_mp)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    93
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    94
lemma eventually_elim1:
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    95
  assumes "eventually (\<lambda>i. P i) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    96
  assumes "\<And>i. P i \<Longrightarrow> Q i"
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
    97
  shows "eventually (\<lambda>i. Q i) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    98
using assms by (auto elim!: eventually_rev_mp)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
    99
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   100
lemma eventually_elim2:
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   101
  assumes "eventually (\<lambda>i. P i) net"
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   102
  assumes "eventually (\<lambda>i. Q i) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   103
  assumes "\<And>i. P i \<Longrightarrow> Q i \<Longrightarrow> R i"
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   104
  shows "eventually (\<lambda>i. R i) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   105
using assms by (auto elim!: eventually_rev_mp)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   106
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   107
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   108
subsection {* Finer-than relation *}
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   109
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   110
text {* @{term "net \<le> net'"} means that @{term net} is finer than
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   111
@{term net'}. *}
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   112
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   113
instantiation net :: (type) complete_lattice
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   114
begin
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   115
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   116
definition
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   117
  le_net_def [code del]:
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   118
    "net \<le> net' \<longleftrightarrow> (\<forall>P. eventually P net' \<longrightarrow> eventually P net)"
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   119
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   120
definition
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   121
  less_net_def [code del]:
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   122
    "(net :: 'a net) < net' \<longleftrightarrow> net \<le> net' \<and> \<not> net' \<le> net"
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   123
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   124
definition
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   125
  top_net_def [code del]:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   126
    "top = Abs_net (\<lambda>P. \<forall>x. P x)"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   127
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   128
definition
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   129
  bot_net_def [code del]:
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   130
    "bot = Abs_net (\<lambda>P. True)"
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   131
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   132
definition
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   133
  sup_net_def [code del]:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   134
    "sup net net' = Abs_net (\<lambda>P. eventually P net \<and> eventually P net')"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   135
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   136
definition
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   137
  inf_net_def [code del]:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   138
    "inf a b = Abs_net
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   139
      (\<lambda>P. \<exists>Q R. eventually Q a \<and> eventually R b \<and> (\<forall>x. Q x \<and> R x \<longrightarrow> P x))"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   140
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   141
definition
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   142
  Sup_net_def [code del]:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   143
    "Sup A = Abs_net (\<lambda>P. \<forall>net\<in>A. eventually P net)"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   144
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   145
definition
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   146
  Inf_net_def [code del]:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   147
    "Inf A = Sup {x::'a net. \<forall>y\<in>A. x \<le> y}"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   148
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   149
lemma eventually_top [simp]: "eventually P top \<longleftrightarrow> (\<forall>x. P x)"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   150
unfolding top_net_def
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   151
by (rule eventually_Abs_net, rule is_filter.intro, auto)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   152
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   153
lemma eventually_bot [simp]: "eventually P bot"
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   154
unfolding bot_net_def
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   155
by (subst eventually_Abs_net, rule is_filter.intro, auto)
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   156
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   157
lemma eventually_sup:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   158
  "eventually P (sup net net') \<longleftrightarrow> eventually P net \<and> eventually P net'"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   159
unfolding sup_net_def
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   160
by (rule eventually_Abs_net, rule is_filter.intro)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   161
   (auto elim!: eventually_rev_mp)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   162
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   163
lemma eventually_inf:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   164
  "eventually P (inf a b) \<longleftrightarrow>
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   165
   (\<exists>Q R. eventually Q a \<and> eventually R b \<and> (\<forall>x. Q x \<and> R x \<longrightarrow> P x))"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   166
unfolding inf_net_def
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   167
apply (rule eventually_Abs_net, rule is_filter.intro)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   168
apply (fast intro: eventually_True)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   169
apply clarify
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   170
apply (intro exI conjI)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   171
apply (erule (1) eventually_conj)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   172
apply (erule (1) eventually_conj)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   173
apply simp
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   174
apply auto
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   175
done
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   176
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   177
lemma eventually_Sup:
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   178
  "eventually P (Sup A) \<longleftrightarrow> (\<forall>net\<in>A. eventually P net)"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   179
unfolding Sup_net_def
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   180
apply (rule eventually_Abs_net, rule is_filter.intro)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   181
apply (auto intro: eventually_conj elim!: eventually_rev_mp)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   182
done
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   183
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   184
instance proof
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   185
  fix x y :: "'a net" show "x < y \<longleftrightarrow> x \<le> y \<and> \<not> y \<le> x"
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   186
    by (rule less_net_def)
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   187
next
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   188
  fix x :: "'a net" show "x \<le> x"
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   189
    unfolding le_net_def by simp
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   190
next
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   191
  fix x y z :: "'a net" assume "x \<le> y" and "y \<le> z" thus "x \<le> z"
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   192
    unfolding le_net_def by simp
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   193
next
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   194
  fix x y :: "'a net" assume "x \<le> y" and "y \<le> x" thus "x = y"
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   195
    unfolding le_net_def expand_net_eq by fast
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   196
next
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   197
  fix x :: "'a net" show "x \<le> top"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   198
    unfolding le_net_def eventually_top by (simp add: always_eventually)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   199
next
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   200
  fix x :: "'a net" show "bot \<le> x"
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   201
    unfolding le_net_def by simp
36630
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   202
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   203
  fix x y :: "'a net" show "x \<le> sup x y" and "y \<le> sup x y"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   204
    unfolding le_net_def eventually_sup by simp_all
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   205
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   206
  fix x y z :: "'a net" assume "x \<le> z" and "y \<le> z" thus "sup x y \<le> z"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   207
    unfolding le_net_def eventually_sup by simp
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   208
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   209
  fix x y :: "'a net" show "inf x y \<le> x" and "inf x y \<le> y"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   210
    unfolding le_net_def eventually_inf by (auto intro: eventually_True)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   211
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   212
  fix x y z :: "'a net" assume "x \<le> y" and "x \<le> z" thus "x \<le> inf y z"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   213
    unfolding le_net_def eventually_inf
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   214
    by (auto elim!: eventually_mono intro: eventually_conj)
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   215
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   216
  fix x :: "'a net" and A assume "x \<in> A" thus "x \<le> Sup A"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   217
    unfolding le_net_def eventually_Sup by simp
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   218
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   219
  fix A and y :: "'a net" assume "\<And>x. x \<in> A \<Longrightarrow> x \<le> y" thus "Sup A \<le> y"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   220
    unfolding le_net_def eventually_Sup by simp
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   221
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   222
  fix z :: "'a net" and A assume "z \<in> A" thus "Inf A \<le> z"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   223
    unfolding le_net_def Inf_net_def eventually_Sup Ball_def by simp
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   224
next
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   225
  fix A and x :: "'a net" assume "\<And>y. y \<in> A \<Longrightarrow> x \<le> y" thus "x \<le> Inf A"
aa1f8acdcc1c complete_lattice instance for net type
huffman
parents: 36629
diff changeset
   226
    unfolding le_net_def Inf_net_def eventually_Sup Ball_def by simp
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   227
qed
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   228
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   229
end
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   230
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   231
lemma net_leD:
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   232
  "net \<le> net' \<Longrightarrow> eventually P net' \<Longrightarrow> eventually P net"
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   233
unfolding le_net_def by simp
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   234
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   235
lemma net_leI:
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   236
  "(\<And>P. eventually P net' \<Longrightarrow> eventually P net) \<Longrightarrow> net \<le> net'"
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   237
unfolding le_net_def by simp
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   238
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   239
lemma eventually_False:
36629
de62713aec6e swap ordering on nets, so x <= y means 'x is finer than y'
huffman
parents: 36360
diff changeset
   240
  "eventually (\<lambda>x. False) net \<longleftrightarrow> net = bot"
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   241
unfolding expand_net_eq by (auto elim: eventually_rev_mp)
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   242
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   243
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   244
subsection {* Map function for nets *}
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   245
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   246
definition
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   247
  netmap :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a net \<Rightarrow> 'b net"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   248
where [code del]:
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   249
  "netmap f net = Abs_net (\<lambda>P. eventually (\<lambda>x. P (f x)) net)"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   250
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   251
lemma eventually_netmap:
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   252
  "eventually P (netmap f net) = eventually (\<lambda>x. P (f x)) net"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   253
unfolding netmap_def
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   254
apply (rule eventually_Abs_net)
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   255
apply (rule is_filter.intro)
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   256
apply (auto elim!: eventually_rev_mp)
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   257
done
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   258
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   259
lemma netmap_ident: "netmap (\<lambda>x. x) net = net"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   260
by (simp add: expand_net_eq eventually_netmap)
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   261
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   262
lemma netmap_netmap: "netmap f (netmap g net) = netmap (\<lambda>x. f (g x)) net"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   263
by (simp add: expand_net_eq eventually_netmap)
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   264
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   265
lemma netmap_mono: "net \<le> net' \<Longrightarrow> netmap f net \<le> netmap f net'"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   266
unfolding le_net_def eventually_netmap by simp
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   267
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   268
lemma netmap_bot [simp]: "netmap f bot = bot"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   269
by (simp add: expand_net_eq eventually_netmap)
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   270
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   271
36662
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   272
subsection {* Sequentially *}
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   273
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   274
definition
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   275
  sequentially :: "nat net"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   276
where [code del]:
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   277
  "sequentially = Abs_net (\<lambda>P. \<exists>k. \<forall>n\<ge>k. P n)"
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   278
36662
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   279
lemma eventually_sequentially:
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   280
  "eventually P sequentially \<longleftrightarrow> (\<exists>N. \<forall>n\<ge>N. P n)"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   281
unfolding sequentially_def
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   282
proof (rule eventually_Abs_net, rule is_filter.intro)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   283
  fix P Q :: "nat \<Rightarrow> bool"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   284
  assume "\<exists>i. \<forall>n\<ge>i. P n" and "\<exists>j. \<forall>n\<ge>j. Q n"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   285
  then obtain i j where "\<forall>n\<ge>i. P n" and "\<forall>n\<ge>j. Q n" by auto
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   286
  then have "\<forall>n\<ge>max i j. P n \<and> Q n" by simp
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   287
  then show "\<exists>k. \<forall>n\<ge>k. P n \<and> Q n" ..
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   288
qed auto
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   289
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   290
lemma sequentially_bot [simp]: "sequentially \<noteq> bot"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   291
unfolding expand_net_eq eventually_sequentially by auto
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   292
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   293
lemma eventually_False_sequentially [simp]:
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   294
  "\<not> eventually (\<lambda>n. False) sequentially"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   295
by (simp add: eventually_False)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   296
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   297
lemma le_sequentially:
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   298
  "net \<le> sequentially \<longleftrightarrow> (\<forall>N. eventually (\<lambda>n. N \<le> n) net)"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   299
unfolding le_net_def eventually_sequentially
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   300
by (safe, fast, drule_tac x=N in spec, auto elim: eventually_rev_mp)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   301
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   302
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   303
subsection {* Standard Nets *}
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   304
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   305
definition
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   306
  within :: "'a net \<Rightarrow> 'a set \<Rightarrow> 'a net" (infixr "within" 70)
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   307
where [code del]:
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   308
  "net within S = Abs_net (\<lambda>P. eventually (\<lambda>x. x \<in> S \<longrightarrow> P x) net)"
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   309
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   310
definition
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   311
  nhds :: "'a::topological_space \<Rightarrow> 'a net"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   312
where [code del]:
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   313
  "nhds a = Abs_net (\<lambda>P. \<exists>S. open S \<and> a \<in> S \<and> (\<forall>x\<in>S. P x))"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   314
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   315
definition
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   316
  at :: "'a::topological_space \<Rightarrow> 'a net"
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   317
where [code del]:
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   318
  "at a = nhds a within - {a}"
31447
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   319
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   320
lemma eventually_within:
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   321
  "eventually P (net within S) = eventually (\<lambda>x. x \<in> S \<longrightarrow> P x) net"
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   322
unfolding within_def
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   323
by (rule eventually_Abs_net, rule is_filter.intro)
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   324
   (auto elim!: eventually_rev_mp)
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   325
36360
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   326
lemma within_UNIV: "net within UNIV = net"
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   327
  unfolding expand_net_eq eventually_within by simp
9d8f7efd9289 define finer-than ordering on net type; move some theorems into Limits.thy
huffman
parents: 36358
diff changeset
   328
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   329
lemma eventually_nhds:
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   330
  "eventually P (nhds a) \<longleftrightarrow> (\<exists>S. open S \<and> a \<in> S \<and> (\<forall>x\<in>S. P x))"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   331
unfolding nhds_def
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   332
proof (rule eventually_Abs_net, rule is_filter.intro)
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   333
  have "open UNIV \<and> a \<in> UNIV \<and> (\<forall>x\<in>UNIV. True)" by simp
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   334
  thus "\<exists>S. open S \<and> a \<in> S \<and> (\<forall>x\<in>S. True)" by - rule
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   335
next
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   336
  fix P Q
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   337
  assume "\<exists>S. open S \<and> a \<in> S \<and> (\<forall>x\<in>S. P x)"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   338
     and "\<exists>T. open T \<and> a \<in> T \<and> (\<forall>x\<in>T. Q x)"
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   339
  then obtain S T where
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   340
    "open S \<and> a \<in> S \<and> (\<forall>x\<in>S. P x)"
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   341
    "open T \<and> a \<in> T \<and> (\<forall>x\<in>T. Q x)" by auto
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   342
  hence "open (S \<inter> T) \<and> a \<in> S \<inter> T \<and> (\<forall>x\<in>(S \<inter> T). P x \<and> Q x)"
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   343
    by (simp add: open_Int)
36654
7c8eb32724ce add constants netmap and nhds
huffman
parents: 36630
diff changeset
   344
  thus "\<exists>S. open S \<and> a \<in> S \<and> (\<forall>x\<in>S. P x \<and> Q x)" by - rule
36358
246493d61204 define nets directly as filters, instead of as filter bases
huffman
parents: 31902
diff changeset
   345
qed auto
31447
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   346
36656
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   347
lemma eventually_nhds_metric:
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   348
  "eventually P (nhds a) \<longleftrightarrow> (\<exists>d>0. \<forall>x. dist x a < d \<longrightarrow> P x)"
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   349
unfolding eventually_nhds open_dist
31447
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   350
apply safe
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   351
apply fast
31492
5400beeddb55 replace 'topo' with 'open'; add extra type constraint for 'open'
huffman
parents: 31488
diff changeset
   352
apply (rule_tac x="{x. dist x a < d}" in exI, simp)
31447
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   353
apply clarsimp
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   354
apply (rule_tac x="d - dist x a" in exI, clarsimp)
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   355
apply (simp only: less_diff_eq)
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   356
apply (erule le_less_trans [OF dist_triangle])
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   357
done
97bab1ac463e generalize type of 'at' to topological_space; generalize some lemmas
huffman
parents: 31392
diff changeset
   358
36656
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   359
lemma eventually_at_topological:
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   360
  "eventually P (at a) \<longleftrightarrow> (\<exists>S. open S \<and> a \<in> S \<and> (\<forall>x\<in>S. x \<noteq> a \<longrightarrow> P x))"
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   361
unfolding at_def eventually_within eventually_nhds by simp
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   362
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   363
lemma eventually_at:
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   364
  fixes a :: "'a::metric_space"
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   365
  shows "eventually P (at a) \<longleftrightarrow> (\<exists>d>0. \<forall>x. x \<noteq> a \<and> dist x a < d \<longrightarrow> P x)"
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   366
unfolding at_def eventually_within eventually_nhds_metric by auto
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   367
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   368
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   369
subsection {* Boundedness *}
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   370
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   371
definition
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   372
  Bfun :: "('a \<Rightarrow> 'b::real_normed_vector) \<Rightarrow> 'a net \<Rightarrow> bool" where
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   373
  [code del]: "Bfun f net = (\<exists>K>0. eventually (\<lambda>x. norm (f x) \<le> K) net)"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   374
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   375
lemma BfunI:
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   376
  assumes K: "eventually (\<lambda>x. norm (f x) \<le> K) net" shows "Bfun f net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   377
unfolding Bfun_def
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   378
proof (intro exI conjI allI)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   379
  show "0 < max K 1" by simp
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   380
next
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   381
  show "eventually (\<lambda>x. norm (f x) \<le> max K 1) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   382
    using K by (rule eventually_elim1, simp)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   383
qed
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   384
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   385
lemma BfunE:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   386
  assumes "Bfun f net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   387
  obtains B where "0 < B" and "eventually (\<lambda>x. norm (f x) \<le> B) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   388
using assms unfolding Bfun_def by fast
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   389
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   390
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   391
subsection {* Convergence to Zero *}
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   392
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   393
definition
31392
69570155ddf8 replace filters with filter bases
huffman
parents: 31357
diff changeset
   394
  Zfun :: "('a \<Rightarrow> 'b::real_normed_vector) \<Rightarrow> 'a net \<Rightarrow> bool" where
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   395
  [code del]: "Zfun f net = (\<forall>r>0. eventually (\<lambda>x. norm (f x) < r) net)"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   396
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   397
lemma ZfunI:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   398
  "(\<And>r. 0 < r \<Longrightarrow> eventually (\<lambda>x. norm (f x) < r) net) \<Longrightarrow> Zfun f net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   399
unfolding Zfun_def by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   400
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   401
lemma ZfunD:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   402
  "\<lbrakk>Zfun f net; 0 < r\<rbrakk> \<Longrightarrow> eventually (\<lambda>x. norm (f x) < r) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   403
unfolding Zfun_def by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   404
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   405
lemma Zfun_ssubst:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   406
  "eventually (\<lambda>x. f x = g x) net \<Longrightarrow> Zfun g net \<Longrightarrow> Zfun f net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   407
unfolding Zfun_def by (auto elim!: eventually_rev_mp)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   408
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   409
lemma Zfun_zero: "Zfun (\<lambda>x. 0) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   410
unfolding Zfun_def by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   411
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   412
lemma Zfun_norm_iff: "Zfun (\<lambda>x. norm (f x)) net = Zfun (\<lambda>x. f x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   413
unfolding Zfun_def by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   414
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   415
lemma Zfun_imp_Zfun:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   416
  assumes f: "Zfun f net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   417
  assumes g: "eventually (\<lambda>x. norm (g x) \<le> norm (f x) * K) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   418
  shows "Zfun (\<lambda>x. g x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   419
proof (cases)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   420
  assume K: "0 < K"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   421
  show ?thesis
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   422
  proof (rule ZfunI)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   423
    fix r::real assume "0 < r"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   424
    hence "0 < r / K"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   425
      using K by (rule divide_pos_pos)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   426
    then have "eventually (\<lambda>x. norm (f x) < r / K) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   427
      using ZfunD [OF f] by fast
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   428
    with g show "eventually (\<lambda>x. norm (g x) < r) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   429
    proof (rule eventually_elim2)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   430
      fix x
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   431
      assume *: "norm (g x) \<le> norm (f x) * K"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   432
      assume "norm (f x) < r / K"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   433
      hence "norm (f x) * K < r"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   434
        by (simp add: pos_less_divide_eq K)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   435
      thus "norm (g x) < r"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   436
        by (simp add: order_le_less_trans [OF *])
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   437
    qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   438
  qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   439
next
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   440
  assume "\<not> 0 < K"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   441
  hence K: "K \<le> 0" by (simp only: not_less)
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   442
  show ?thesis
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   443
  proof (rule ZfunI)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   444
    fix r :: real
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   445
    assume "0 < r"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   446
    from g show "eventually (\<lambda>x. norm (g x) < r) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   447
    proof (rule eventually_elim1)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   448
      fix x
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   449
      assume "norm (g x) \<le> norm (f x) * K"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   450
      also have "\<dots> \<le> norm (f x) * 0"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   451
        using K norm_ge_zero by (rule mult_left_mono)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   452
      finally show "norm (g x) < r"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   453
        using `0 < r` by simp
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   454
    qed
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   455
  qed
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   456
qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   457
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   458
lemma Zfun_le: "\<lbrakk>Zfun g net; \<forall>x. norm (f x) \<le> norm (g x)\<rbrakk> \<Longrightarrow> Zfun f net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   459
by (erule_tac K="1" in Zfun_imp_Zfun, simp)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   460
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   461
lemma Zfun_add:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   462
  assumes f: "Zfun f net" and g: "Zfun g net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   463
  shows "Zfun (\<lambda>x. f x + g x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   464
proof (rule ZfunI)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   465
  fix r::real assume "0 < r"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   466
  hence r: "0 < r / 2" by simp
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   467
  have "eventually (\<lambda>x. norm (f x) < r/2) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   468
    using f r by (rule ZfunD)
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   469
  moreover
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   470
  have "eventually (\<lambda>x. norm (g x) < r/2) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   471
    using g r by (rule ZfunD)
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   472
  ultimately
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   473
  show "eventually (\<lambda>x. norm (f x + g x) < r) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   474
  proof (rule eventually_elim2)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   475
    fix x
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   476
    assume *: "norm (f x) < r/2" "norm (g x) < r/2"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   477
    have "norm (f x + g x) \<le> norm (f x) + norm (g x)"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   478
      by (rule norm_triangle_ineq)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   479
    also have "\<dots> < r/2 + r/2"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   480
      using * by (rule add_strict_mono)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   481
    finally show "norm (f x + g x) < r"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   482
      by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   483
  qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   484
qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   485
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   486
lemma Zfun_minus: "Zfun f net \<Longrightarrow> Zfun (\<lambda>x. - f x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   487
unfolding Zfun_def by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   488
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   489
lemma Zfun_diff: "\<lbrakk>Zfun f net; Zfun g net\<rbrakk> \<Longrightarrow> Zfun (\<lambda>x. f x - g x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   490
by (simp only: diff_minus Zfun_add Zfun_minus)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   491
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   492
lemma (in bounded_linear) Zfun:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   493
  assumes g: "Zfun g net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   494
  shows "Zfun (\<lambda>x. f (g x)) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   495
proof -
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   496
  obtain K where "\<And>x. norm (f x) \<le> norm x * K"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   497
    using bounded by fast
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   498
  then have "eventually (\<lambda>x. norm (f (g x)) \<le> norm (g x) * K) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   499
    by simp
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   500
  with g show ?thesis
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   501
    by (rule Zfun_imp_Zfun)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   502
qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   503
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   504
lemma (in bounded_bilinear) Zfun:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   505
  assumes f: "Zfun f net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   506
  assumes g: "Zfun g net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   507
  shows "Zfun (\<lambda>x. f x ** g x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   508
proof (rule ZfunI)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   509
  fix r::real assume r: "0 < r"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   510
  obtain K where K: "0 < K"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   511
    and norm_le: "\<And>x y. norm (x ** y) \<le> norm x * norm y * K"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   512
    using pos_bounded by fast
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   513
  from K have K': "0 < inverse K"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   514
    by (rule positive_imp_inverse_positive)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   515
  have "eventually (\<lambda>x. norm (f x) < r) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   516
    using f r by (rule ZfunD)
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   517
  moreover
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   518
  have "eventually (\<lambda>x. norm (g x) < inverse K) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   519
    using g K' by (rule ZfunD)
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   520
  ultimately
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   521
  show "eventually (\<lambda>x. norm (f x ** g x) < r) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   522
  proof (rule eventually_elim2)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   523
    fix x
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   524
    assume *: "norm (f x) < r" "norm (g x) < inverse K"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   525
    have "norm (f x ** g x) \<le> norm (f x) * norm (g x) * K"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   526
      by (rule norm_le)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   527
    also have "norm (f x) * norm (g x) * K < r * inverse K * K"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   528
      by (intro mult_strict_right_mono mult_strict_mono' norm_ge_zero * K)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   529
    also from K have "r * inverse K * K = r"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   530
      by simp
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   531
    finally show "norm (f x ** g x) < r" .
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   532
  qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   533
qed
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   534
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   535
lemma (in bounded_bilinear) Zfun_left:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   536
  "Zfun f net \<Longrightarrow> Zfun (\<lambda>x. f x ** a) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   537
by (rule bounded_linear_left [THEN bounded_linear.Zfun])
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   538
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   539
lemma (in bounded_bilinear) Zfun_right:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   540
  "Zfun f net \<Longrightarrow> Zfun (\<lambda>x. a ** f x) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   541
by (rule bounded_linear_right [THEN bounded_linear.Zfun])
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   542
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   543
lemmas Zfun_mult = mult.Zfun
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   544
lemmas Zfun_mult_right = mult.Zfun_right
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   545
lemmas Zfun_mult_left = mult.Zfun_left
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   546
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   547
31902
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   548
subsection {* Limits *}
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   549
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   550
definition
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   551
  tendsto :: "('a \<Rightarrow> 'b::topological_space) \<Rightarrow> 'b \<Rightarrow> 'a net \<Rightarrow> bool"
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   552
    (infixr "--->" 55)
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   553
where [code del]:
31492
5400beeddb55 replace 'topo' with 'open'; add extra type constraint for 'open'
huffman
parents: 31488
diff changeset
   554
  "(f ---> l) net \<longleftrightarrow> (\<forall>S. open S \<longrightarrow> l \<in> S \<longrightarrow> eventually (\<lambda>x. f x \<in> S) net)"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   555
31902
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   556
ML {*
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   557
structure Tendsto_Intros = Named_Thms
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   558
(
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   559
  val name = "tendsto_intros"
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   560
  val description = "introduction rules for tendsto"
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   561
)
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   562
*}
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   563
31902
862ae16a799d renamed NamedThmsFun to Named_Thms;
wenzelm
parents: 31588
diff changeset
   564
setup Tendsto_Intros.setup
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   565
36656
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   566
lemma tendsto_mono: "net \<le> net' \<Longrightarrow> (f ---> l) net' \<Longrightarrow> (f ---> l) net"
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   567
unfolding tendsto_def le_net_def by fast
fec55067ae9b add lemmas eventually_nhds_metric and tendsto_mono
huffman
parents: 36655
diff changeset
   568
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   569
lemma topological_tendstoI:
31492
5400beeddb55 replace 'topo' with 'open'; add extra type constraint for 'open'
huffman
parents: 31488
diff changeset
   570
  "(\<And>S. open S \<Longrightarrow> l \<in> S \<Longrightarrow> eventually (\<lambda>x. f x \<in> S) net)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   571
    \<Longrightarrow> (f ---> l) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   572
  unfolding tendsto_def by auto
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   573
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   574
lemma topological_tendstoD:
31492
5400beeddb55 replace 'topo' with 'open'; add extra type constraint for 'open'
huffman
parents: 31488
diff changeset
   575
  "(f ---> l) net \<Longrightarrow> open S \<Longrightarrow> l \<in> S \<Longrightarrow> eventually (\<lambda>x. f x \<in> S) net"
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   576
  unfolding tendsto_def by auto
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   577
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   578
lemma tendstoI:
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   579
  assumes "\<And>e. 0 < e \<Longrightarrow> eventually (\<lambda>x. dist (f x) l < e) net"
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   580
  shows "(f ---> l) net"
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   581
apply (rule topological_tendstoI)
31492
5400beeddb55 replace 'topo' with 'open'; add extra type constraint for 'open'
huffman
parents: 31488
diff changeset
   582
apply (simp add: open_dist)
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   583
apply (drule (1) bspec, clarify)
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   584
apply (drule assms)
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   585
apply (erule eventually_elim1, simp)
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   586
done
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   587
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   588
lemma tendstoD:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   589
  "(f ---> l) net \<Longrightarrow> 0 < e \<Longrightarrow> eventually (\<lambda>x. dist (f x) l < e) net"
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   590
apply (drule_tac S="{x. dist x l < e}" in topological_tendstoD)
31492
5400beeddb55 replace 'topo' with 'open'; add extra type constraint for 'open'
huffman
parents: 31488
diff changeset
   591
apply (clarsimp simp add: open_dist)
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   592
apply (rule_tac x="e - dist x l" in exI, clarsimp)
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   593
apply (simp only: less_diff_eq)
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   594
apply (erule le_less_trans [OF dist_triangle])
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   595
apply simp
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   596
apply simp
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   597
done
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   598
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   599
lemma tendsto_iff:
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   600
  "(f ---> l) net \<longleftrightarrow> (\<forall>e>0. eventually (\<lambda>x. dist (f x) l < e) net)"
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   601
using tendstoI tendstoD by fast
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   602
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   603
lemma tendsto_Zfun_iff: "(f ---> a) net = Zfun (\<lambda>x. f x - a) net"
31488
5691ccb8d6b5 generalize tendsto to class topological_space
huffman
parents: 31487
diff changeset
   604
by (simp only: tendsto_iff Zfun_def dist_norm)
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   605
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   606
lemma tendsto_ident_at [tendsto_intros]: "((\<lambda>x. x) ---> a) (at a)"
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   607
unfolding tendsto_def eventually_at_topological by auto
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   608
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   609
lemma tendsto_ident_at_within [tendsto_intros]:
36655
88f0125c3bd2 remove unneeded premise
huffman
parents: 36654
diff changeset
   610
  "((\<lambda>x. x) ---> a) (at a within S)"
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   611
unfolding tendsto_def eventually_within eventually_at_topological by auto
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   612
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   613
lemma tendsto_const [tendsto_intros]: "((\<lambda>x. k) ---> k) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   614
by (simp add: tendsto_def)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   615
36662
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   616
lemma tendsto_const_iff:
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   617
  fixes k l :: "'a::metric_space"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   618
  assumes "net \<noteq> bot" shows "((\<lambda>n. k) ---> l) net \<longleftrightarrow> k = l"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   619
apply (safe intro!: tendsto_const)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   620
apply (rule ccontr)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   621
apply (drule_tac e="dist k l" in tendstoD)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   622
apply (simp add: zero_less_dist_iff)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   623
apply (simp add: eventually_False assms)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   624
done
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   625
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   626
lemma tendsto_dist [tendsto_intros]:
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   627
  assumes f: "(f ---> l) net" and g: "(g ---> m) net"
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   628
  shows "((\<lambda>x. dist (f x) (g x)) ---> dist l m) net"
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   629
proof (rule tendstoI)
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   630
  fix e :: real assume "0 < e"
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   631
  hence e2: "0 < e/2" by simp
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   632
  from tendstoD [OF f e2] tendstoD [OF g e2]
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   633
  show "eventually (\<lambda>x. dist (dist (f x) (g x)) (dist l m) < e) net"
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   634
  proof (rule eventually_elim2)
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   635
    fix x assume "dist (f x) l < e/2" "dist (g x) m < e/2"
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   636
    then show "dist (dist (f x) (g x)) (dist l m) < e"
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   637
      unfolding dist_real_def
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   638
      using dist_triangle2 [of "f x" "g x" "l"]
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   639
      using dist_triangle2 [of "g x" "l" "m"]
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   640
      using dist_triangle3 [of "l" "m" "f x"]
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   641
      using dist_triangle [of "f x" "m" "g x"]
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   642
      by arith
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   643
  qed
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   644
qed
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   645
36662
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   646
lemma norm_conv_dist: "norm x = dist x 0"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   647
unfolding dist_norm by simp
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   648
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   649
lemma tendsto_norm [tendsto_intros]:
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   650
  "(f ---> a) net \<Longrightarrow> ((\<lambda>x. norm (f x)) ---> norm a) net"
36662
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   651
unfolding norm_conv_dist by (intro tendsto_intros)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   652
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   653
lemma tendsto_norm_zero:
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   654
  "(f ---> 0) net \<Longrightarrow> ((\<lambda>x. norm (f x)) ---> 0) net"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   655
by (drule tendsto_norm, simp)
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   656
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   657
lemma tendsto_norm_zero_cancel:
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   658
  "((\<lambda>x. norm (f x)) ---> 0) net \<Longrightarrow> (f ---> 0) net"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   659
unfolding tendsto_iff dist_norm by simp
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   660
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   661
lemma tendsto_norm_zero_iff:
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   662
  "((\<lambda>x. norm (f x)) ---> 0) net \<longleftrightarrow> (f ---> 0) net"
621122eeb138 generalize types of LIMSEQ and LIM; generalize many lemmas
huffman
parents: 36656
diff changeset
   663
unfolding tendsto_iff dist_norm by simp
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   664
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   665
lemma add_diff_add:
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   666
  fixes a b c d :: "'a::ab_group_add"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   667
  shows "(a + c) - (b + d) = (a - b) + (c - d)"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   668
by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   669
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   670
lemma minus_diff_minus:
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   671
  fixes a b :: "'a::ab_group_add"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   672
  shows "(- a) - (- b) = - (a - b)"
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   673
by simp
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   674
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   675
lemma tendsto_add [tendsto_intros]:
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   676
  fixes a b :: "'a::real_normed_vector"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   677
  shows "\<lbrakk>(f ---> a) net; (g ---> b) net\<rbrakk> \<Longrightarrow> ((\<lambda>x. f x + g x) ---> a + b) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   678
by (simp only: tendsto_Zfun_iff add_diff_add Zfun_add)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   679
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   680
lemma tendsto_minus [tendsto_intros]:
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   681
  fixes a :: "'a::real_normed_vector"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   682
  shows "(f ---> a) net \<Longrightarrow> ((\<lambda>x. - f x) ---> - a) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   683
by (simp only: tendsto_Zfun_iff minus_diff_minus Zfun_minus)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   684
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   685
lemma tendsto_minus_cancel:
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   686
  fixes a :: "'a::real_normed_vector"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   687
  shows "((\<lambda>x. - f x) ---> - a) net \<Longrightarrow> (f ---> a) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   688
by (drule tendsto_minus, simp)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   689
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   690
lemma tendsto_diff [tendsto_intros]:
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   691
  fixes a b :: "'a::real_normed_vector"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   692
  shows "\<lbrakk>(f ---> a) net; (g ---> b) net\<rbrakk> \<Longrightarrow> ((\<lambda>x. f x - g x) ---> a - b) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   693
by (simp add: diff_minus tendsto_add tendsto_minus)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   694
31588
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   695
lemma tendsto_setsum [tendsto_intros]:
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   696
  fixes f :: "'a \<Rightarrow> 'b \<Rightarrow> 'c::real_normed_vector"
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   697
  assumes "\<And>i. i \<in> S \<Longrightarrow> (f i ---> a i) net"
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   698
  shows "((\<lambda>x. \<Sum>i\<in>S. f i x) ---> (\<Sum>i\<in>S. a i)) net"
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   699
proof (cases "finite S")
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   700
  assume "finite S" thus ?thesis using assms
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   701
  proof (induct set: finite)
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   702
    case empty show ?case
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   703
      by (simp add: tendsto_const)
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   704
  next
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   705
    case (insert i F) thus ?case
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   706
      by (simp add: tendsto_add)
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   707
  qed
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   708
next
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   709
  assume "\<not> finite S" thus ?thesis
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   710
    by (simp add: tendsto_const)
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   711
qed
2651f172c38b add lemma tendsto_setsum
huffman
parents: 31565
diff changeset
   712
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   713
lemma (in bounded_linear) tendsto [tendsto_intros]:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   714
  "(g ---> a) net \<Longrightarrow> ((\<lambda>x. f (g x)) ---> f a) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   715
by (simp only: tendsto_Zfun_iff diff [symmetric] Zfun)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   716
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   717
lemma (in bounded_bilinear) tendsto [tendsto_intros]:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   718
  "\<lbrakk>(f ---> a) net; (g ---> b) net\<rbrakk> \<Longrightarrow> ((\<lambda>x. f x ** g x) ---> a ** b) net"
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   719
by (simp only: tendsto_Zfun_iff prod_diff_prod
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   720
               Zfun_add Zfun Zfun_left Zfun_right)
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   721
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   722
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   723
subsection {* Continuity of Inverse *}
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   724
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   725
lemma (in bounded_bilinear) Zfun_prod_Bfun:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   726
  assumes f: "Zfun f net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   727
  assumes g: "Bfun g net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   728
  shows "Zfun (\<lambda>x. f x ** g x) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   729
proof -
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   730
  obtain K where K: "0 \<le> K"
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   731
    and norm_le: "\<And>x y. norm (x ** y) \<le> norm x * norm y * K"
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   732
    using nonneg_bounded by fast
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   733
  obtain B where B: "0 < B"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   734
    and norm_g: "eventually (\<lambda>x. norm (g x) \<le> B) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   735
    using g by (rule BfunE)
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   736
  have "eventually (\<lambda>x. norm (f x ** g x) \<le> norm (f x) * (B * K)) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   737
  using norm_g proof (rule eventually_elim1)
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   738
    fix x
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   739
    assume *: "norm (g x) \<le> B"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   740
    have "norm (f x ** g x) \<le> norm (f x) * norm (g x) * K"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   741
      by (rule norm_le)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   742
    also have "\<dots> \<le> norm (f x) * B * K"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   743
      by (intro mult_mono' order_refl norm_g norm_ge_zero
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   744
                mult_nonneg_nonneg K *)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   745
    also have "\<dots> = norm (f x) * (B * K)"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   746
      by (rule mult_assoc)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   747
    finally show "norm (f x ** g x) \<le> norm (f x) * (B * K)" .
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   748
  qed
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   749
  with f show ?thesis
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   750
    by (rule Zfun_imp_Zfun)
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   751
qed
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   752
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   753
lemma (in bounded_bilinear) flip:
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   754
  "bounded_bilinear (\<lambda>x y. y ** x)"
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   755
apply default
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   756
apply (rule add_right)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   757
apply (rule add_left)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   758
apply (rule scaleR_right)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   759
apply (rule scaleR_left)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   760
apply (subst mult_commute)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   761
using bounded by fast
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   762
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   763
lemma (in bounded_bilinear) Bfun_prod_Zfun:
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   764
  assumes f: "Bfun f net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   765
  assumes g: "Zfun g net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   766
  shows "Zfun (\<lambda>x. f x ** g x) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   767
using flip g f by (rule bounded_bilinear.Zfun_prod_Bfun)
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   768
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   769
lemma inverse_diff_inverse:
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   770
  "\<lbrakk>(a::'a::division_ring) \<noteq> 0; b \<noteq> 0\<rbrakk>
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   771
   \<Longrightarrow> inverse a - inverse b = - (inverse a * (a - b) * inverse b)"
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   772
by (simp add: algebra_simps)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   773
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   774
lemma Bfun_inverse_lemma:
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   775
  fixes x :: "'a::real_normed_div_algebra"
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   776
  shows "\<lbrakk>r \<le> norm x; 0 < r\<rbrakk> \<Longrightarrow> norm (inverse x) \<le> inverse r"
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   777
apply (subst nonzero_norm_inverse, clarsimp)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   778
apply (erule (1) le_imp_inverse_le)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   779
done
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   780
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   781
lemma Bfun_inverse:
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   782
  fixes a :: "'a::real_normed_div_algebra"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   783
  assumes f: "(f ---> a) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   784
  assumes a: "a \<noteq> 0"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   785
  shows "Bfun (\<lambda>x. inverse (f x)) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   786
proof -
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   787
  from a have "0 < norm a" by simp
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   788
  hence "\<exists>r>0. r < norm a" by (rule dense)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   789
  then obtain r where r1: "0 < r" and r2: "r < norm a" by fast
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   790
  have "eventually (\<lambda>x. dist (f x) a < r) net"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   791
    using tendstoD [OF f r1] by fast
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   792
  hence "eventually (\<lambda>x. norm (inverse (f x)) \<le> inverse (norm a - r)) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   793
  proof (rule eventually_elim1)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   794
    fix x
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   795
    assume "dist (f x) a < r"
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   796
    hence 1: "norm (f x - a) < r"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   797
      by (simp add: dist_norm)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   798
    hence 2: "f x \<noteq> 0" using r2 by auto
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   799
    hence "norm (inverse (f x)) = inverse (norm (f x))"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   800
      by (rule nonzero_norm_inverse)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   801
    also have "\<dots> \<le> inverse (norm a - r)"
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   802
    proof (rule le_imp_inverse_le)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   803
      show "0 < norm a - r" using r2 by simp
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   804
    next
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   805
      have "norm a - norm (f x) \<le> norm (a - f x)"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   806
        by (rule norm_triangle_ineq2)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   807
      also have "\<dots> = norm (f x - a)"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   808
        by (rule norm_minus_commute)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   809
      also have "\<dots> < r" using 1 .
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   810
      finally show "norm a - r \<le> norm (f x)" by simp
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   811
    qed
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   812
    finally show "norm (inverse (f x)) \<le> inverse (norm a - r)" .
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   813
  qed
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   814
  thus ?thesis by (rule BfunI)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   815
qed
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   816
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   817
lemma tendsto_inverse_lemma:
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   818
  fixes a :: "'a::real_normed_div_algebra"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   819
  shows "\<lbrakk>(f ---> a) net; a \<noteq> 0; eventually (\<lambda>x. f x \<noteq> 0) net\<rbrakk>
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   820
         \<Longrightarrow> ((\<lambda>x. inverse (f x)) ---> inverse a) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   821
apply (subst tendsto_Zfun_iff)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   822
apply (rule Zfun_ssubst)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   823
apply (erule eventually_elim1)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   824
apply (erule (1) inverse_diff_inverse)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   825
apply (rule Zfun_minus)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   826
apply (rule Zfun_mult_left)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   827
apply (rule mult.Bfun_prod_Zfun)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   828
apply (erule (1) Bfun_inverse)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   829
apply (simp add: tendsto_Zfun_iff)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   830
done
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   831
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   832
lemma tendsto_inverse [tendsto_intros]:
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   833
  fixes a :: "'a::real_normed_div_algebra"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   834
  assumes f: "(f ---> a) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   835
  assumes a: "a \<noteq> 0"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   836
  shows "((\<lambda>x. inverse (f x)) ---> inverse a) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   837
proof -
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   838
  from a have "0 < norm a" by simp
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   839
  with f have "eventually (\<lambda>x. dist (f x) a < norm a) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   840
    by (rule tendstoD)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   841
  then have "eventually (\<lambda>x. f x \<noteq> 0) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   842
    unfolding dist_norm by (auto elim!: eventually_elim1)
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   843
  with f a show ?thesis
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   844
    by (rule tendsto_inverse_lemma)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   845
qed
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   846
31565
da5a5589418e theorem attribute [tendsto_intros]
huffman
parents: 31492
diff changeset
   847
lemma tendsto_divide [tendsto_intros]:
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   848
  fixes a b :: "'a::real_normed_field"
31487
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   849
  shows "\<lbrakk>(f ---> a) net; (g ---> b) net; b \<noteq> 0\<rbrakk>
93938cafc0e6 put syntax for tendsto in Limits.thy; rename variables
huffman
parents: 31447
diff changeset
   850
    \<Longrightarrow> ((\<lambda>x. f x / g x) ---> a / b) net"
31355
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   851
by (simp add: mult.tendsto tendsto_inverse divide_inverse)
3d18766ddc4b limits of inverse using filters
huffman
parents: 31353
diff changeset
   852
31349
2261c8781f73 new theory of filters and limits; prove LIMSEQ and LIM lemmas using filters
huffman
parents:
diff changeset
   853
end