|
2 | 2 |
|
3 | 3 | .. index:: topology
|
4 | 4 |
|
5 |
| -Topology |
| 5 | +位相 |
6 | 6 | ========
|
7 | 7 |
|
8 |
| -Calculus is based on the concept of a function, which is used to model |
9 |
| -quantities that depend on one another. |
10 |
| -For example, it is common to study quantities that change over time. |
11 |
| -The notion of a *limit* is also fundamental. |
12 |
| -We may say that the limit of a function :math:`f(x)` is a value :math:`b` |
13 |
| -as :math:`x` approaches a value :math:`a`, |
14 |
| -or that :math:`f(x)` *converges to* :math:`b` as :math:`x` approaches :math:`a`. |
15 |
| -Equivalently, we may say that a :math:`f(x)` approaches :math:`a` as :math:`x` |
16 |
| -approaches a value :math:`b`, or that it *tends to* :math:`b` |
17 |
| -as :math:`x` tends to :math:`a`. |
18 |
| -We have already begun to consider such notions in :numref:`sequences_and_convergence`. |
| 8 | +.. Topology |
| 9 | +.. ======== |
19 | 10 |
|
20 |
| -*Topology* is the abstract study of limits and continuity. |
21 |
| -Having covered the essentials of formalization in Chapters :numref:`%s <basics>` |
22 |
| -to :numref:`%s <structures>`, |
23 |
| -in this chapter, we will explain how topological notions are formalized in Mathlib. |
24 |
| -Not only do topological abstractions apply in much greater generality, |
25 |
| -but that also, somewhat paradoxically, make it easier to reason about limits |
26 |
| -and continuity in concrete instances. |
| 11 | +.. Calculus is based on the concept of a function, which is used to model |
| 12 | +.. quantities that depend on one another. |
| 13 | +.. For example, it is common to study quantities that change over time. |
| 14 | +.. The notion of a *limit* is also fundamental. |
| 15 | +.. We may say that the limit of a function :math:`f(x)` is a value :math:`b` |
| 16 | +.. as :math:`x` approaches a value :math:`a`, |
| 17 | +.. or that :math:`f(x)` *converges to* :math:`b` as :math:`x` approaches :math:`a`. |
| 18 | +.. Equivalently, we may say that a :math:`f(x)` approaches :math:`a` as :math:`x` |
| 19 | +.. approaches a value :math:`b`, or that it *tends to* :math:`b` |
| 20 | +.. as :math:`x` tends to :math:`a`. |
| 21 | +.. We have already begun to consider such notions in :numref:`sequences_and_convergence`. |
27 | 22 |
|
28 |
| -Topological notions build on quite a few layers of mathematical structure. |
29 |
| -The first layer is naive set theory, |
30 |
| -as described in :numref:`Chapter %s <sets_and_functions>`. |
31 |
| -The next layer is the theory of *filters*, which we will describe in :numref:`filters`. |
32 |
| -On top of that, we layer |
33 |
| -the theories of *topological spaces*, *metric spaces*, and a slightly more exotic |
34 |
| -intermediate notion called a *uniform space*. |
| 23 | +微積分は関数の概念に基づいており,互いに依存しあう量をモデル化するのに用いられます.例えば,時間とともに変化する量についての研究は一般的です.また **極限** (limit)という概念も基本的なものです.関数 :math:`f(x)` の極限は :math:`x` の値が :math:`a` に近づくにつれて :math:`b` になる,あるいは :math:`f(x)` は :math:`x` が :math:`a` に近づくにつれて :math:`b` に **収束する** (converges to)と言うことができます.同様に, :math:`f(x)` は :math:`x` が :math:`a` に近づくにつれて :math:`b` に近づく,あるいは :math:`x` が :math:`a` に近づくにつれて :math:`b` に **限りなく近づく** (tends to)と言うこともできます.このような概念について :numref:`sequences_and_convergence` で既に考察しています. |
35 | 24 |
|
36 |
| -Whereas previous chapters relied on mathematical notions that were likely |
37 |
| -familiar to you, |
38 |
| -the notion of a filter less well known, |
39 |
| -even to many working mathematicians. |
40 |
| -The notion is essential, however, for formalizing mathematics effectively. |
41 |
| -Let us explain why. |
42 |
| -Let ``f : ℝ → ℝ`` be any function. We can consider |
43 |
| -the limit of ``f x`` as ``x`` approaches some value ``x₀``, |
44 |
| -but we can also consider the limit of ``f x`` as ``x`` approaches infinity |
45 |
| -or negative infinity. |
46 |
| -We can moreover consider the limit of ``f x`` as ``x`` approaches ``x₀`` from |
47 |
| -the right, conventionally written ``x₀⁺``, or from the left, |
48 |
| -written ``x₀⁻``. There are variations where ``x`` approaches ``x₀`` or ``x₀⁺`` |
49 |
| -or ``x₀⁻`` but |
50 |
| -is not allowed to take on the value ``x₀`` itself. |
51 |
| -This results in at least eight ways that ``x`` can approach something. |
52 |
| -We can also restrict to rational values of ``x`` |
53 |
| -or place other constraints on the domain, but let's stick to those 8 cases. |
| 25 | +.. *Topology* is the abstract study of limits and continuity. |
| 26 | +.. Having covered the essentials of formalization in Chapters :numref:`%s <basics>` |
| 27 | +.. to :numref:`%s <structures>`, |
| 28 | +.. in this chapter, we will explain how topological notions are formalized in Mathlib. |
| 29 | +.. Not only do topological abstractions apply in much greater generality, |
| 30 | +.. but that also, somewhat paradoxically, make it easier to reason about limits |
| 31 | +.. and continuity in concrete instances. |
54 | 32 |
|
55 |
| -We have a similar variety of options on the codomain: |
56 |
| -we can specify that ``f x`` approaches a value from the left or right, |
57 |
| -or that it approaches positive or negative infinity, and so on. |
58 |
| -For example, we may wish to say that ``f x`` tends to ``+∞`` |
59 |
| -when ``x`` tends to ``x₀`` from the right without |
60 |
| -being equal to ``x₀``. |
61 |
| -This results in 64 different kinds of limit statements, |
62 |
| -and we haven't even begun to deal with limits of sequences, |
63 |
| -as we did in :numref:`sequences_and_convergence`. |
| 33 | +**位相** (Topology)は極限と連続性についての抽象的な研究です. :numref:`%s <basics>` 章から :numref:`%s <structures>` 章までで形式化の要点を説明しましたが,この章ではMathlibで位相的な概念がそのように形式化されているかを説明します.位相的な抽象化は,より一般的に適用できるだけでなく,逆説的ではありますが,具体的な事例における極限や連続性についての推論を容易にします. |
64 | 34 |
|
65 |
| -The problem is compounded even further when it comes to the supporting lemmas. |
66 |
| -For instance, limits compose: if |
67 |
| -``f x`` tends to ``y₀`` when ``x`` tends to ``x₀`` and |
68 |
| -``g y`` tends to ``z₀`` when ``y`` tends to ``y₀`` then |
69 |
| -``g ∘ f x`` tends to ``z₀`` when ``x`` tends to ``x₀``. |
70 |
| -There are three notions of "tends to" at play here, |
71 |
| -each of which can be instantiated in any of the eight ways described |
72 |
| -in the previous paragraph. |
73 |
| -This results in 512 lemmas, a lot to have to add to a library! |
74 |
| -Informally, mathematicians generally prove two or three of these |
75 |
| -and simply note that the rest can be proved "in the same way." |
76 |
| -Formalizing mathematics requires making the relevant notion of "sameness" |
77 |
| -fully explicit, and that is exactly what Bourbaki's theory of filters |
78 |
| -manages to do. |
| 35 | +.. Topological notions build on quite a few layers of mathematical structure. |
| 36 | +.. The first layer is naive set theory, |
| 37 | +.. as described in :numref:`Chapter %s <sets_and_functions>`. |
| 38 | +.. The next layer is the theory of *filters*, which we will describe in :numref:`filters`. |
| 39 | +.. On top of that, we layer |
| 40 | +.. the theories of *topological spaces*, *metric spaces*, and a slightly more exotic |
| 41 | +.. intermediate notion called a *uniform space*. |
| 42 | +
|
| 43 | +位相的な概念は,数学的な構造のかなり多くのレイヤーの上に成り立っています.最初の層は素朴な集合論で, :numref:`Chapter %s <sets_and_functions>` で説明しています.次の層は :numref:`filters` で説明する **フィルタ** (filter)の理論です.その上に **位相空間** (topological spaces), **距離空間** (metric spaces),そして少し独特的な中間概念である **一様空間** (uniform space)の理論を重ねます. |
| 44 | + |
| 45 | +.. Whereas previous chapters relied on mathematical notions that were likely |
| 46 | +.. familiar to you, |
| 47 | +.. the notion of a filter less well known, |
| 48 | +.. even to many working mathematicians. |
| 49 | +.. The notion is essential, however, for formalizing mathematics effectively. |
| 50 | +.. Let us explain why. |
| 51 | +.. Let ``f : ℝ → ℝ`` be any function. We can consider |
| 52 | +.. the limit of ``f x`` as ``x`` approaches some value ``x₀``, |
| 53 | +.. but we can also consider the limit of ``f x`` as ``x`` approaches infinity |
| 54 | +.. or negative infinity. |
| 55 | +.. We can moreover consider the limit of ``f x`` as ``x`` approaches ``x₀`` from |
| 56 | +.. the right, conventionally written ``x₀⁺``, or from the left, |
| 57 | +.. written ``x₀⁻``. There are variations where ``x`` approaches ``x₀`` or ``x₀⁺`` |
| 58 | +.. or ``x₀⁻`` but |
| 59 | +.. is not allowed to take on the value ``x₀`` itself. |
| 60 | +.. This results in at least eight ways that ``x`` can approach something. |
| 61 | +.. We can also restrict to rational values of ``x`` |
| 62 | +.. or place other constraints on the domain, but let's stick to those 8 cases. |
| 63 | +
|
| 64 | +これまでの章では,読者にとってなじみ深い数学的概念に頼っていましたが,フィルタの概念は現役の数学者であってもあまり知られていません.しかし,この概念は数学を効果的に形式化するためには不可欠です.その理由を説明しましょう. ``f : ℝ → ℝ`` を任意の関数とします.ここで ``x`` がある値 ``x₀`` に近づいたときの ``f x`` の極限を考えることができますが, ``x`` が無限大や負の無限大に近づいたときの ``f x`` の極限を考えることもできます.さらに, ``x`` が右から ``x₀`` に近づいた時(これは慣習的に ``x₀⁺`` と書かれます),また左側から近づいたとき( ``x₀⁻`` と書かれます)の ``f x`` の極限を考えることもできます. ``x`` が ``x₀`` や ``x₀⁺`` , ``x₀⁻`` に近づく方法はさまざまである一方, ``x₀`` の値自体を取ることは許可されていないとします.この結果,少なくとも8つの方法で ``x`` が何らかの値に近づくことができます. ``x`` を有理数の値に制限したり,始域にほかの制約を加えることもできますが,この8つのケースに限定することにしましょう. |
| 65 | +
|
| 66 | +.. We have a similar variety of options on the codomain: |
| 67 | +.. we can specify that ``f x`` approaches a value from the left or right, |
| 68 | +.. or that it approaches positive or negative infinity, and so on. |
| 69 | +.. For example, we may wish to say that ``f x`` tends to ``+∞`` |
| 70 | +.. when ``x`` tends to ``x₀`` from the right without |
| 71 | +.. being equal to ``x₀``. |
| 72 | +.. This results in 64 different kinds of limit statements, |
| 73 | +.. and we haven't even begun to deal with limits of sequences, |
| 74 | +.. as we did in :numref:`sequences_and_convergence`. |
| 75 | +
|
| 76 | +また終域に同じようにいくつかのオプションを設けることができます: ``f x`` が左か右,もしくは正・負の無限などから近づくことを指定できます.例えば, ``x`` が右から ``x₀`` にならないように限りなく ``x₀`` に近づくとき, ``f x`` は ``+∞`` に限りなく近づくということができます.この結果, :numref:`sequences_and_convergence` で行った数列の極限を扱い始めてないにもかかわらず,もうすでに64種類の極限に関する文が存在することになります. |
| 77 | + |
| 78 | +.. The problem is compounded even further when it comes to the supporting lemmas. |
| 79 | +.. For instance, limits compose: if |
| 80 | +.. ``f x`` tends to ``y₀`` when ``x`` tends to ``x₀`` and |
| 81 | +.. ``g y`` tends to ``z₀`` when ``y`` tends to ``y₀`` then |
| 82 | +.. ``g ∘ f x`` tends to ``z₀`` when ``x`` tends to ``x₀``. |
| 83 | +.. There are three notions of "tends to" at play here, |
| 84 | +.. each of which can be instantiated in any of the eight ways described |
| 85 | +.. in the previous paragraph. |
| 86 | +.. This results in 512 lemmas, a lot to have to add to a library! |
| 87 | +.. Informally, mathematicians generally prove two or three of these |
| 88 | +.. and simply note that the rest can be proved "in the same way." |
| 89 | +.. Formalizing mathematics requires making the relevant notion of "sameness" |
| 90 | +.. fully explicit, and that is exactly what Bourbaki's theory of filters |
| 91 | +.. manages to do. |
| 92 | +
|
| 93 | +極限にかかわる補題となると問題はさらに複雑になります.例えば,極限は次のように合成されます: ``x`` が ``x₀`` に限りなく近づくときに ``f x`` が ``y₀`` に限りなく近づき,また ``y`` が ``y₀`` に限りなく近づくとき ``g y`` が ``z₀`` に限りなく近づくならば, ``g ∘ f x`` は ``x`` が ``x₀`` に限りなく近づくとき ``z₀`` に限りなく近づきます.ここでは3つの「限りなく近づく」概念が働いており,それぞれ前の段落で説明した8つの方法のいずれかでインスタンス化することができます.この結果,512の補題が生まれ,ライブラリに追加しなければならなくなります!非形式的には,数学者は一般的にこれらのうち2つか3つを証明し,残りは「同様の方法で」証明できることを示すだけです.数学を形式化するには,この「同じ」という概念を完全に明示する必要があり,これこそブルバキのフィルタ理論が取り扱うことです. |
0 commit comments