请输入您要查询的字词:

 

单词 1131ConstructionOfCauchyReals
释义

11.3.1 Construction of Cauchy reals


The construction of the Cauchy reals 𝖼 as a higher inductive type is a bit more subtle than that of the free algebraic structuresPlanetmathPlanetmath considered in \\autorefsec:free-algebras.We intend to include a “take the limit” constructor whose input is a Cauchy sequenceMathworldPlanetmathPlanetmath of reals, but the notion of “Cauchy sequence of reals” depends on having some way to measure the “distance” between real numbers.In general, of course, the distance between two real numbers will be another real number, leading to a potentially problematic circularity.

However, what we actually need for the notion of Cauchy sequence of reals is not the general notion of “distance”, but a way to say that “the distance between two real numbers is less than ϵ” for any ϵ:+.This can be represented by a family of binary relationsMathworldPlanetmath, which we will denote ϵ:𝖼𝖼𝖯𝗋𝗈𝗉.The intended meaning of xϵy is |x-y|<ϵ, but since we do not have notions of subtraction, absolute valueMathworldPlanetmathPlanetmathPlanetmathPlanetmath, or inequality available yet (we are only just defining 𝖼, after all), we will have to define these relations ϵ at the same time as we define 𝖼 itself.And since ϵ is a type family indexed by two copies of 𝖼, we cannot do this with an ordinary mutual (higher) inductive definition; instead we have to use a higher inductive-inductive definition.

Recall from \\autorefsec:generalizationsPlanetmathPlanetmath that the ordinary notion of inductive-inductive definition allows us to define a type and a type family indexed by it by simultaneous inductionMathworldPlanetmath.Of course, the “higher” version of this allows both the type and the family to have path constructors as well as point constructors.We will not attempt to formulate any general theory of higher inductive-inductive definitions, but hopefully the description we will give of 𝖼 and ϵ will make the idea transparent.

Remark 11.3.1.

We might also consider a higher inductive-recursive definition, in which ϵ is defined using the recursion principle of Rc, simultaneously with the inductive definition of Rc.We choose the inductive-inductive route instead for two reasons.Firstly, higher inductive-recursive definitions seem to be more difficult to justify in homotopical semantics.Secondly, and more importantly, the inductive-inductive definition yields a more powerful induction principle, which we will need in order to develop even the basic theory of Cauchy reals.

Finally, as we did for the discussion of Cauchy completeness of the Dedekind reals in \\autorefsec:RD-cauchy-complete, we will work with Cauchy approximations (\\autorefdefn:cauchy-approximation) instead of Cauchy sequences.Of course, our Cauchy approximations will now consist of Cauchy reals, rather than Dedekind reals or rational numbers.

Definition 11.3.2.

Let Rc and the relation :Q+×Rc×RcU be the following higher inductive-inductive type family.The type Rc of Cauchy realsis generated by the following constructors:

  • rational points:for any q: there is a real 𝗋𝖺𝗍(q).

  • limit pointsPlanetmathPlanetmath:for any x:+𝖼 such that

    (δ,ϵ:+).xδδ+ϵxϵ(11.3.2)

    there is a point 𝗅𝗂𝗆(x):𝖼. We call x a Cauchy approximation.

  • paths:for u,v:𝖼 such that

    (ϵ:+).uϵv(11.3.3)

    then there is a path 𝖾𝗊𝖼(u,v):u=𝖼v.

Simultaneously, the type family :RcRcQ+U is generated by the following constructors.Here q and r denote rational numbers; δ, ϵ, and η denote positive rationals; u and v denote Cauchy reals; and x and y denote Cauchy approximations:

  • for any q,r,ϵ, if -ϵ<q-r<ϵ, then 𝗋𝖺𝗍(q)ϵ𝗋𝖺𝗍(r),

  • for any q,y,ϵ,δ, if 𝗋𝖺𝗍(q)ϵ-δyδ, then 𝗋𝖺𝗍(q)ϵ𝗅𝗂𝗆(y),

  • for any x,r,ϵ,δ, if xδϵ-δ𝗋𝖺𝗍(r), then 𝗅𝗂𝗆(x)ϵ𝗋𝖺𝗍(r),

  • for any x,y,ϵ,δ,η, if xδϵ-δ-ηyη, then 𝗅𝗂𝗆(x)ϵ𝗅𝗂𝗆(y),

  • for any u,v,ϵ, if ξ,ζ:uϵv, then ξ=ζ (propositional truncation).

The first constructor of 𝖼 says that any rational number can be regarded as a real number.The second says that from any Cauchy approximation to a real number, we can obtain a new real number called its “limit”.And the third expresses the idea that if two Cauchy approximations coincide, then their limits are equal.

The first four constructors of specify when two rational numbers are close, when a rational is close to a limit, and when two limits are close.In the case of two rational numbers, this is just the usual notion of ϵ-closeness for rational numbers, whereas the other cases can be derived by noting that each approximant xδ is supposed to be within δ of the limit 𝗅𝗂𝗆(x).

We remind ourselves of proof-relevance: a real number obtained from 𝗅𝗂𝗆 is represented notjust by a Cauchy approximation x, but also a proof p of (11.3.2), so weshould technically have written 𝗅𝗂𝗆(x,p) instead of just 𝗅𝗂𝗆(x).A similar observation also applies to 𝖾𝗊𝖼 and (11.3.3), but we shall write just𝖾𝗊𝖼:u=v instead of 𝖾𝗊𝖼(u,v,p):u=v. These abuses of notation aremitigated by the fact that we are omitting mere propositions and information that isreadily guessed.Likewise, the last constructor of ϵ justifies our leaving the other four nameless.

We are immediately able to populate 𝖼 with many real numbers. For suppose x: is a traditional Cauchy sequence of rational numbers, and let M:+ be itsmodulus of convergence. Then 𝗋𝖺𝗍xM:+𝖼 is a Cauchyapproximation, using the first constructor of to produce the necessary witnessMathworldPlanetmath.Thus, 𝗅𝗂𝗆(𝗋𝖺𝗍xm) is a real number. Various famousreal numbers 2, π, e, … are all limits of such Cauchy sequences ofrationals.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/5 2:38:46