This paper introduces a generalized continuum with explicit nilpotent infinitesimals, exploring their properties, and applying these concepts to set theory, topology, and differential calculus, including singularity analysis.
Contribution
It presents a novel continuum incorporating nilpotent infinitesimals with a global-local monad structure, extending classical concepts without relying on limits.
Findings
01
Monads are infinite-dimensional but have zero length intervals.
02
The generalized continuum preserves set-theoretic and topological properties.
03
Applications include differential analysis of singularities.
Abstract
We introduce a generalization of the Cantor-Dedekind continuum with explicit infinitesimals. These infinitesimals are used as numbers obeying the same basic rules as the other elements of the generalized continuum, in accordance with Leibniz's original intuition, but with an important difference: their product is null, as the Dutch theologian Bernard Nieuwentijt sustained, against Leibniz's opinion. The starting-point is the concept of shadow, and from it we define indiscernibility (the central concept) and monad. Monads of points have a global-local nature, because in spite of being infinite-dimensional real affine spaces with the same cardinal as the whole generalized continuum, they are closed intervals with length 0. Monads and shadows (initially defined for points) are then extended to any subset of the new continuum, and their study reveals interesting results of preservation in…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · History and Theory of Mathematics · Rings, Modules, and Algebras
We introduce a generalization of the Cantor-Dedekind continuum with explicit
infinitesimals. These infinitesimals are used as numbers obeying the same
basic rules as the other elements of the generalized continuum, in
accordance with Leibniz’s original intuition, but with an important
difference: their product is null, as the Dutch theologian Bernard
Nieuwentijt sustained, against Leibniz’s opinion. The starting-point is the
concept of shadow, and from it we define indiscernibility (the central
concept) and monad. Monads of points have a global-local nature, because in
spite of being infinite-dimensional real affine spaces with the same
cardinal as the whole generalized continuum, they are closed intervals with
length 0. Monads and shadows (initially defined for points) are then
extended to any subset of the new continuum, and their study reveals
interesting results of preservation in the areas of set theory and topology.
All these concepts do not depend on a definition of limit in the new
continuum; yet using them we obtain the basic results of the differential
calculus. Finally, we give two examples illustrating how the global-local
nature of the monad of a real number can be applied to the differential
treatment of certain singularities.
keywords:
Infinitesimal methods, indiscernibility, differential calculus, topology, set theory
\givenname
JOSÉ \surnameROQUETTE
1 Introduction
Up to 1960, when Abraham Robinson created Non-standard Analysis,
actual infinitesi-mals, i.e. infinitesimals considered as numbers,
in the Leibniz’s tradition [6], were banished from
mathematical analysis by Weierstrass’ ε−δ definition of
limit (in the 1850s), except for a minority of mathematicians and
at least one great philosopher (Charles S. Peirce). But physicists and
engineers (and differential geometers such as Sophus Lie, Élie Cartan,
and Hermann Weyl) refused to deprive themselves of the immense heuristic
power of that notion (and rightly so!).
Today, there are two main rigorous theories of actual infinitesimals:
Non-standard Analysis (NSA) [4],[5],[8],[9],[10],[11], using nonexplicit invertible infinitesimals, and Smooth
Infinitesimal Analysis (SIA) (F.W. Lawvere, in the late 1960s) [1],[2],[7], with nilpotent infinitesimals (i.e. infinitesimals ε such that εn=0, for some positive integer n). But both theories are considered with suspicion by the immense majority of
the mathematical community, and physicists and engineers prefer their strong
intuitions.
The generalization (R) of the usual
Cantor-Dedekind continuum(R) we propose, and the ensuing
Calculus, have the following features:
I
– The elements of R, which we call generalized
real numbers, are the convergent (in the usual sense) sequences in R, and those sequences that converge to [math] are called infinitesimals (so infinitesimals are explicit). The shadow of a generalized real number is just its limit as a convergent
sequence in R, and from this concept we define a binary relation
on R that coincides with the identity of the shadows,
and which we call indiscernibility (≈). The monad
of a generalized real number x0 (m≈(x0)) is the set of
all elements of R that are indiscerniblefromx0. On the set R we define addition term by term, but multiplication and ordering are introduced in a different manner, using the concept of shadow. We obtain
an ordered ring extension of R (though it is important to take into account f2) below); moreover, the quotient of R by ≈ is an ordered
field isomorphic to R.
Although we can embed R in R (through the
mapping ξ↦(ξ), where (ξ) is the constant sequence
determined by the real number ξ), we must emphasize two features of R that are absent from R:
f1)The product of two nonnull generalizedreal
numbers or the square of a nonnull generalized real number may be null (if and only all the factors are infinitesimal).
f2)Strict ordering is defined onRexcept inside the monads (as it should be expected, since
the elements of the monad of a generalized real number are indiscernible).
So we have this version of the usual trichotomy property:
[TABLE]
II
– We work in two modes:
The mode of potentiality, i.e. the totality of
notions and concepts that can be defined within the structure R.
The mode of actuality, i.e. the totality of notions and
concepts that can be defined within the structure R,
with the exception of any definition of limit.
We use the mode of potentiality emphasizing the usual definition of
limit, but in the * mode* of actuality, in the
absence of such a definition, we must introduce the fundamental concepts of
generalized real number, and shadow, in the mode
of potentiality. Nevertheless, we must stress that this translation is only
made for the sake of definition: once defined, the two
fundamental concepts are used in the mode of actuality. Every
notion or concept in the mode of actuality could be translated into
the mode of potentiality, but then we would renounce the intuitive
and computational power of actual methods.
Our work in these two modes, sometimes simultaneously (as in the
definition of differentiability), reflects our conviction that a
concept of actual infinitesimal and a definition of limit
are both necessary to a Calculus fit, not only for mathematicians, but also
for experimental scientists.
III
– Each generalized real number x is indiscernible from exactly one
real number: its shadow, which we denote by σx. In fact,
each generalized real number x admits a unique decomposition as the
sum of a real number (its shadow) and an infinitesimal. We denote this
infinitesimal by dx, and we call it the differential of x. So we have, for each x∈R, the unique
decomposition, which we call the σ+ddecomposition:
[TABLE]
For each x∈R, and ξ∈R, we have, as
a direct consequence of the σ+ddecomposition (and we
stress its uniqueness!):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Although we do not use a definition of limit in R, we can easily derive the basic algebraic rules of differentiation, using the σ+ddecomposition.
IV
– For each subset A of R, we define its
monad (m≈(A)) and shadow (σ(A)), and we obtain interesting set-theoretic and topological results of preservation.
The intervals in R are simply the monads of
the corresponding intervals in R, and the length of
those that are bounded (i.e. those intervals in R that are monads of bounded intervals in R) is the same as the length of
their originals in R; for instance, the bounded open and
the bounded closed intervals in R are
[TABLE]
[TABLE]
respectively, where α,β∈R, and α≤β
(their length is β−α).
Intervals in R do not have pointlike
extremities, and this feature is reminiscent of Stoic philosophical
view about segments of Space or Time[12];
for instance, if α,β,γ∈R, and α≤β≤γ, then
[TABLE]
[TABLE]
[TABLE]
V
– The monad of each generalized real number x has a global-local nature since it is an infinite-dimensional real affine space
with the same cardinal as R (more precisely, ∣m≈(x)∣=R=2ℵ0), yet it is also a closed interval of length 0 (it is
easy to prove that m≈(x)=m≈(σx),
so m≈(x)=[σx,σx] ).
We use this dual nature in two examples of differential treatment
of singularities.
VI
– For each function ϕ:I→R, where I is an
open interval in R, its indiscernible extensions are the
functions f:m≈(I)→R
such that
[TABLE]
[TABLE]
If ξ0∈I, and f:m≈(I)→R
is an indiscernible extension of ϕ, then f is said to be *differentiable *at ξ0 iff there exists a real number α such
that
[TABLE]
with the proviso that α:=limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), when such limit exists
in R.
α (which is unique) is said to be the *derivative *of f at x, for each x∈m≈(ξ0), and we denote it by f′(x), as usual.
So we have, when f is differentiable at ξ0:
d1) If x∈m≈(ξ0), then f′(x)=f′(ξ0).
d2) For each x∈m≈(ξ0),
[TABLE]
This is the expression, in analytical terms, of the geometric idea
associated with the concept of differentiability, according to
Leibniz primeval conception:
If f is differentiable at ξ0, then the
graph of f coincides locally (i.e. for infinitesimal
increments of the argument around ξ0) with its tangent at
the point (ξ0,f(ξ0)).
Notice that if limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) exists in R (i.e. ϕ is
differentiable at ξ0, in the usual
sense) and f is differentiable at ξ0, then f′(ξ0) is identical
with this limit; however,
f′(ξ0) may exist in the absence of limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) ,
as it is the case for ξ0:=0, and ϕ:R→R, f:R→R defined by ϕ(ξ):=∣ξ∣,f(x):=\left\{\begin{array}[]{l}x,\text{ if \ }x>0\\
0,\text{ if \ }x\in m_{\approx}(0)\\
-x,\text{ if \ }x<0\end{array}\right. (clearly, f′(0)=0).
Keeping in mind that the derivatives are always associated with
indiscernible extensions, and using the definition, we obtain not
only the algebraic rules of derivation, but also fundamental
theorems like the Chain Rule, the Inverse Function Theorem, the Mean Value Theorem, and Taylor’s Theorem.
If limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) exists, for each ξ0∈I, then, among the
infinity of indiscernible
extensions of ϕ, there exists exactly one that is differentiable at
each ξ0∈I; we call
this function the natural indiscernible extension ofϕ, and we denote it by ϕ^.
So ϕ^:m≈(I)→R is the
function defined by
[TABLE]
where λϕ(ξ0) denotes limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0).
The concept of natural indiscernible extension provides a rule for
the definition of the analogues (and extensions) of the
usual functions of Real Analysis. For instance, the natural indiscernible
extensions of exp, log, sin, cos, are the functions (where R+ is the set of positive generalized real numbers):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
defined by
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We show that these functions have the same basic properties as the usual
ones, and we obtain, rigorously, some identities that physicists
and engineers often use intuitively. For example (since σ(dx)=0, and σ(1+dx)=1, as seen in III) :
[TABLE]
[TABLE]
[TABLE]
[TABLE]
2 The Generalized Real Numbers
Let (R,<,+,⋅,0,1) be a model of the usual real number system
axioms (in any of the equivalent formulations of most calculus textbooks),
and let R be the set of all sequences x=(ξn) in
R that are convergent for the usual absolute value in (R,<,+,⋅,0,1). We refer to (R,<,+,⋅,0,1) as the
Cantor-Dedekind continuum.
**Definition 2.1 **Let x,y∈R.
If limx is the usual limit of x in (R,<,+,⋅,0,1), then we call the constant sequence (limx), the shadow of
x, and we denote it by σx.
x is said to be indiscernible fromy, and we denote it by x≈y, iff x and y have the same shadow.
x is said to be an infinitesimal iff x is indiscernible from
the constant sequence (0).
The monad of x, denoted by m≈(x), is the set of all y∈R such that y is indiscernible from x.
So m≈((0)) is the set of all infinitesimals.
Clearly, the indiscernibility relation, ≈ , is an
equivalence relation on R, and if x is an
element of R, then its equivalence class for ≈
is m≈(x). Indiscernibility is the first and more
important binary relation defined on R.
The next definition introduces a ring structure for R
with a kind of linear ordering.
**Definition 2.2 **On the set R, we consider two
binary operations, denoted by +^ and ⋅^, and called
addition and multiplication, respectively. If x=(ξn) and y=(ηn) are elements of R, then
these operations are defined by
[TABLE]
[TABLE]
where at the right-hand of the previous identities we consider the obvious
operations on R (clearly, x+^y,x⋅^y∈R and lim(x+^y)=limx+limy,lim(x⋅^y)=limx⋅limy).
We say that x is less than y, and we denote it by x<^y, iff limx<limy, and reciprocally, we say that x is greater
than y, and we denote it by x>^y, iff y<^x, where
in limx<limy we consider the usual linear ordering on R.
The elements of R+:={x∈R∣x>^(0)} and R−:={x∈R∣x<^(0)} will be called positive and negative, respectively.
Proposition 2.3 a) (R,<,+,⋅^,(0),(1)) is a commutative ring with the constant sequences (0)
and (1) as zero element and identity element, respectively.
b) The shadow mappingσ:R→R, defined by σ(x):=σx, is an
idempotent ring endomorphism, i.e.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Furthermore,
[TABLE]
[TABLE]
c) m≈((0)) is a nonnull ideal, so the sum of
infinitesimals is an infinitesimal, the additive inverse of an infinitesimal
is also an infinitesimal, (0) is an infinitesimal, the product of an element
of R and an infinitesimal is still an infinitesimal,
and there is a nonnull infinitesimal.
d) The product of infinitesimals is always null, i.e.
[TABLE]
In particular, each infinitesimal is nilpotent, since x⋅^x=(0), for each x∈m≈((0)).
e) An element of R has a multiplicative inverse iff it is not an infinitesimal.
f) If x,y,z∈R, then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
So, if we adopt the version of the usual trichotomy property expressed by the third formula above, then (R,<^,+^,⋅^,(0),(1)) may be considered an ordered ring .
g) (R,<^,+^,⋅^,(0),(1)) is
archimedean, i.e.
[TABLE]
where mx abbreviates x1+^x2+^…+^xm, when x1=x2=…=xm=x (assuming 1x=x).
h) The mapping ∗:R→σ(R), defined by ∗(ξ):=(ξ), where (ξ) is the usual
constant sequence determined by ξ, is a ring isomorphism of (R,<,+,⋅,0,1) onto (σ(R),<^,+^,⋅^,(0),(1)), and
[TABLE]
So, using ∗, we can embed (R,<,+,⋅,0,1) in (R,<^,+^,⋅^,(0),(1)).
Proof a) Only the proofs of the associative property of multiplication and the distributive property of multiplication over addition offer some (slight) difficulty.
b) is an immediate consequence of the usual algebraic properties of limits, and c), d) follow easily from a), b).
e) If x=(ξn)∈R and x is not infinitesimal, then a direct calculation shows that
[TABLE]
so, since multiplication on R is associative, commutative, and (1) is its identity
element, (limx1−(limx)2ξn−limx) is the multiplicativeinverse of x=(ξn).
If x is infinitesimal, then we have (see a) and b)), for each y∈R:
[TABLE]
and we conclude that x is not invertible.
Finally, f), g), h) admit a quite straightforward proof.
■
**Remark 2.4 **In accordance with proposition 2.3 h), we
identify R with σ(R) and ξ with (ξ), for each ξ∈R. For instance, we identify 0 with the
infinite sequence (0) and, for each x∈R, ξ∈R, we identify limx with σx and ξ with σξ. Furthermore, from now on we shall use the symbols +, ⋅, <
not only for the usual addition, multiplication and linear ordering on R, but also for the corresponding binary operations and relation +^,⋅^,<^ on R, and we shall even
drop the symbol ⋅ in most formulas. For example, revisiting part of
definition 2.2, we have, for each x,y∈R:
[TABLE]
For the additive and multiplicative powers, we simply write mx and xm
instead of mx and xm (where xm
abbreviates x1⋅^x2⋅^…⋅^xm, when x1=x2=…=xm=x (assuming x1=x)), respectively.
In the spirit of these identifications and notational simplifications,
notice that if ξ∈R and x∈R, then ξx (previously denoted by (ξ)⋅^x) coincides with the
result of the scalar multiplication of the real number ξ by the
sequence x.
If x,y∈R and x is not an infinitesimal, then we denote the multiplicative
inverse of x by x−1 or x1; so x1=(limx1−(limx)2ξn−limx). We also denote yx−1
(the quotient of y by x) by xy, as
usual.
We maintain the general designation of real numbers for the elements of R and call the elements of Rgeneralized real numbers.
Let us see some explicit generalized real numbers (by explicit we mean unambiguously defined as a convergent sequence of real numbers):
Example 2.5 1) The eventually null sequences (1,0,0,0,…), (0,1,0,0,0,…),
(0,0,1,0,0,0,…), … are nonnull infinitesimal elements of R. So we can exhibit nonnull infinitesimals.
2) Let ξ0 be a nonnull real number. Then:
The sequences (0,ξ0,ξ0,ξ0,…),(0,0,ξ0,ξ0,ξ0,…), (0,0,0,ξ0,ξ0,ξ0,…),… are different elements of m≈(ξ0)\{ξ0}.
In the next proposition, which admits a simple proof, e) and
f) are particularly important.
Proposition 2.6 a)(∀x∈R)(x=σx⇔x∈R).
b) (∀ξ,η∈R)(ξ≈η⇔ξ=η).
c)R∩m≈(0)={0}.
d) Infinitesimals are not comparable with respect to the binary
relation < on R, i.e. if ε^ and δ^ are infinitesimals, then
[TABLE]
e)An infinitesimal is less than any positive generalized
real number and greater than any negative generalized real number, i.e. if ε^ is an infinitesimal, than
[TABLE]
[TABLE]
In particular:
[TABLE]
[TABLE]
where R+ and R− are the usual sets of
(strictly) positive and (strictly) negative real numbers, respectively
(notice that R+⊆R+ and R−⊆R−, by proposition 2.3 h)).
f)Each generalized real number is indiscernible from
exactly one real number: its shadow, i.e.
[TABLE]
3 The σ+d Decomposition
As a direct consequence of proposition 2.3 a), b), we have:
Proposition 3.1 If x is a generalized real number, then
there is a unique infinitesimal ε^(x) such that
[TABLE]
Definition 3.2 If x is a generalized real number, then
we denote ε^(x) by dx, and we call it the differential of x.
Proposition 3.3 If x is a generalized real number then x=σx+dx is the unique decomposition of x as the sum of a
real number and an infinitesimal.
Proof. We just have to use proposition 2.3 a), c), proposition 2.6 c), proposition 3.1, and, of course,
definition 3.2. ■
We call the decomposition stated by the previous proposition, the σ+ddecomposition. Notice that the differential of a
generalized real number x is already inlaid in x, and
since σx and dx are a constant sequence and a sequence converging
to 0, in R, we are entitled to express the following intuition: a
generalized real number has a unique decomposition as the sum of a static part (its shadow) and a dynamic part (its differential).
Clearly:
Corollary 3.4 a) (∀x∈R)(dx=0⇔x∈R).
b) (∀x∈R)(x=dx⇔x≈0).
c) (∀x∈R)d(dx)=dx.
The following lemma is the key to obtain the basic algebraic rules of
differentiation.
Lemma 3.5 a) If x,y∈R, then
[TABLE]
[TABLE]
b) If x,y∈R, then
[TABLE]
In particular, for each ξ∈R:
[TABLE]
c) If m∈N, and x∈R, then
(with x0=1)
[TABLE]
d) If x∈R, and x is not an infinitesimal,
then
[TABLE]
e) If x,y∈R, and x is not an
infinitesimal, then
[TABLE]
f) If x∈R+,m∈N and m>1,
then there is a unique y∈R+ such that
[TABLE]
Such y will be denoted by mx, and we have:
[TABLE]
where mσx and m(σx)m−1 are the usual
*positive mth roots *of σx and (σx)m−1,
respectively.
Proof Only the proof of f) has some difficulty.
If x,y∈R+, then σx> 0 and σy>0.
So, using c) and proposition 3.3, we have:
[TABLE]
But mσx>0, since σx> [math]; so
[TABLE]
We have proven the existence (and uniqueness) of mx and the identity
[TABLE]
In particular, if x∈R+, then
[TABLE]
Using c) and the result already proved (notice that xm−1>0,
since σ(xm−1)=
=(σx)m−1>0), we obtain:
[TABLE]
where ε^ is the infinitesimal defined by
[TABLE]
Then, using d),
[TABLE]
Since the product of infinitesimals is [math], we have:
[TABLE]
As an immediate consequence of the previous lemma, we obtain, using proposition 3.3, the basic algebraic rules of differentiation,
without using any notion of limit in R:
Proposition 3.6 a) If x,y∈R, then
[TABLE]
[TABLE]
b) If x,y∈R, then
[TABLE]
In particular, for each ξ∈R:
[TABLE]
c) If m∈N, and x∈R, then
[TABLE]
d) If x∈R, and x is not an
infinitesimal, then
[TABLE]
e) If x,y∈R, and x is not an
infinitesimal, then
[TABLE]
f) If x∈R+,m∈N and m>1,
then
[TABLE]
We close this section with a density theorem, and a theorem relating the
generalized real continuum,(R,<,+,⋅,0,1), to the Cantor-Dedekind continuum.
Theorem 3.7 (The Density Theorem)
a) If x and y are generalized real numbers such that x<y, then there exists ζ∈R such that x<ζ<y.
b) If ξ and η are real numbers such that ξ<η,
then there exists z∈R\R such that ξ<z<η.
Proof a) We may choose ς=2σx+σy.
b) If ε^ is an infinitesimal and ε^=0, then we may choose z=2ξ+η+ε^.■
We already mentioned the trivial facts that ≈ is an equivalence
relation on R, and the equivalence class of each x∈R is m≈(x)=x+m≈(0). On the *quotient *of R by ≈, i.e. the set R/≈:={m≈(x)∣x∈R},
we consider now two binary operations, denoted by ⊞ and ⊡, and called addition and multiplication, respectively,
and a binary relation denoted by ⊏. These operations and relation
are defined by:
[TABLE]
[TABLE]
[TABLE]
using, at the right-hand of the previous identities, the obvious binary
operations and relation on R.
It is a simple task to show that ⊞, ⊡, ⊏ are
well-defined, and to prove the next theorem.
Theorem 3.8 a)(R/≈,⊏,⊞,⊡,m≈(0),m≈(1)) is an
ordered field with m≈(0)
and m≈(1) as* zero and identity elements*,
respectively.
b) The mapping ϕ:R/≈→R, defined by ϕ(m≈(x)):=σx , is an ordered
field isomorphism of (R/≈,⊏,⊞,⊡,m≈(0),m≈(1)) onto the
Cantor-Dedekind continuum, (R,<,+,⋅,0,1); so if we denote these fields simply by R/≈ and R, we have:
[TABLE]
i.e. R/≈ is isomorphic to R.
As we have just seen:
If we take the monads in the structure R for points, as we do in the structure R/≈, then we obtain the Cantor-Dedekind continuum.
Otherwise, we have a richer continuum with indiscernibility and nilpotent
infinitesimals.
4 Monads and Shadows
The next two propositions show that {m≈(x)∣x∈R} is a partition of R into
infinite- -dimensional real affine spaces, each one with the same cardinal
as R, and this is also true for {m≈(ξ)∣ξ∈R} (since m≈(x)=m≈(σx), for each
x∈R).
Proposition 4.1 The monad of each generalized real number has the
same cardinal as R.
Proof Since m≈(x)=m≈(σx), for each x∈R, we may prove the proposition only for the monads of real numbers.
Let ξ∈R, and let Rξ be the set
of all generalized real numbers x=(ξn) such that ξn=ξ,
for n>1. Then (denoting by A the
cardinal of each subset A of R):
[TABLE]
where RN denotes the set of all sequences in R.
Obviously,
[TABLE]
and
[TABLE]
So
[TABLE]
Finally,
[TABLE]
Proposition 4.2a)m≈(0) is an
infinite-dimensional real vector space, if we consider addition and
multiplication defined on R×R,
as vector addition and scalarmultiplication
defined on m≈(0)×m≈(0) and R×m≈(0), respectively. Moreover, m≈(0) contains the real spaceslp, for each p∈[1,+∞[.
b) If we consider m≈(0) with the structure of real
vector space mentioned in a), then
[TABLE]
Proof a) It is trivial to prove that m≈(0) is a real
vector space, using proposition 2.3 a), c). Finally, if p∈[1,+∞[ and x=(ξn)∈lp, then ∑n=1+∞∣ξn∣p<+∞ and, consequently, x=(ξn)∈m≈(0).
b) follows from a), since m≈(x)=x+m≈(0), for each x∈R.■
The next definition generalizes the concepts of monad and shadow to any subset of R.
Definition 4.3 Let A⊆R.
The monad of A and the shadow of A, denoted by m≈(A) and σ(A), respectively, are defined
by:
[TABLE]
[TABLE]
So
[TABLE]
[TABLE]
Clearly, we have, for each x∈R and A⊆R,
[TABLE]
[TABLE]
[TABLE]
The next three propositions state some basic properties of monads
and shadows, and admit quite straightforward proofs.
Proposition 4.4 Let A,B⊆R. Then:
a)A⊆B⇒m≈(A)⊆m≈(B)∧σ(A)⊆σ(B).
b)A⊆R⇔σ(A)=A.
c)m≈(σ(A))=m≈(A)∧σ(m≈(A))=σ(A).
d)A,B⊆R⇒(m≈(A)=m≈(B)⇔A=B).
The monad and shadow operators on subsets of R preserve the Boolean operations on sets, with some looseness in
the case of intersection and complement (this is the core
information expressed in the next two propositions).
Proposition 4.5 a)m≈(∅)=∅, m≈(R)=m≈(R)=R.
Let A,B⊆R. Then:
b)m≈(m≈(A))=m≈(A),
c)m≈(A∪B)=m≈(A)∪m≈(B),
d)m≈(A∩B)⊆m≈(A)∩m≈(B),
m≈(A)\m≈(B)⊆m≈(A\B).
If A,B⊆R, then
[TABLE]
[TABLE]
Let A⊆P(R)(i.e. A is a collection of subsets of R). Then:
e)m≈(∪{A∣A∈A})=∪{m≈(A)∣A∈A},
f)m≈(∩{A∣A∈A})⊆∩{m≈(A)∣A∈A}.
If A⊆P(R)(i.e. A is a collection of subsets of R), then
[TABLE]
Proposition 4.6 a)σ(∅)=∅, σ(R)=σ(R)=R.
Let A,B⊆R. Then:
b)σ(σ(A))=σ(A),
c)σ(A∪B)=σ(A)∪σ(B),
d)σ(A∩B)⊆σ(A)∩σ(B),
\vspace−6ptσ(A)\σ(B)⊆σ(A\B).
If A and B are monads of subsets of R,
then
[TABLE]
Let A⊆P(R)(i.e.A is a collection of subsets of R). Then:
e)σ(∪{A∣A∈A})=∪{σ(A)∣A∈A},
f)σ(∩{A∣A∈A})⊆∩{σ(A)∣A∈A}.
If A is a collection of monads of subsets of R, then
[TABLE]
Using proposition 4.4, proposition 4.5, and proposition 4.6, we could prove that the *monad *and shadow
operators on subsets of R preserve the basic concepts
of topology, and the concept of σ-algebra, which is
fundamental in Measure Theory. This is clearly expressed in the
next two propositions.
Proposition 4.7 a) If X⊆R,B is a
base for a topology for X, and B:={m≈(A)∣A∈B}, then
[TABLE]
b) Let T be a topology for R.
If T:={m≈(A)∣A∈T}, then
[TABLE]
c) If T is a topology for R, T:={m≈(A)∣A∈T},
and X⊆R, then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where intT , intT , extT , extT , bdT , bdT , clT , clT are the
interior, exterior, boundary and closure operators for the
topologies T and T, respectively.
d) If T is a topology for R, T:={m≈(A)∣A∈T},X⊆R, and Y⊆X, then
[TABLE]
[TABLE]
where Tm≈(X), TX are the relativizations of T, T to m≈(X),X, respectively.
**e) **If T is a topology for R, T:={m≈(A)∣A∈T},
and X⊆R, then
[TABLE]
f) Let B be a σ-algebra of subsets of R.
If B:={m≈(A)∣A∈B}, then
[TABLE]
Proposition 4.8 a) If X⊆R, B is a base for a topology for X and a
collection of monads of subsets of R, and B:={σ(A)∣A∈B}, then
[TABLE]
b) Let T be a topology for R and a collection of monads of subsets of R.
If T:={σ(A)∣A∈T}, then
[TABLE]
c) If T is a topology for R and a collection of monads of subsets of R, X is
the monad of a subset of R, and T:={σ(A)∣A∈T}, then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where intT , intT , extT , extT , bdT , bdT , clT , clT are the
interior, exterior, boundary and closure operators for the
topologies T and T, respectively.
d) If T is
a topology for R
and a collection of monads of subsets of R, Y⊆X⊆R,\vspace−0.2cm
X and Y are monads of subsets of R, and T:={σ(A)∣A∈T}, then
[TABLE]
[TABLE]
where TX, Tσ(X) are the relativizations of T, T to X,σ(X), respectively.
**e) **If T is a topology for R and a collection of monads of subsets of R, X is
the monad of a subset of R, and T:={σ(A)∣A∈T}, then
[TABLE]
f) Let B be a σ-algebra of
subsets of R and a collection of monads of subsets of R.
If B:={σ(A)∣A∈B}, then
[TABLE]
5 The Derivative
Throughout this section, we shall not use any concept of limit in
the generalized real continuum (i.e. R), working instead, in an actual manner, with the concepts of
indiscernibility, shadow, differential, and monad. The
concept of limit is only used in the Cantor-Dedekind continuum(i.e. R).
The first important step is the introduction of the concept of *indiscernible extension *of a function ϕ:X→Y, where X,Y⊆R.
Definition 5.1 Let X,Y⊆R.
If ϕ:X→Y and f:m≈(X)→m≈(Y)
are functions, then f is said to be an *indiscernible
extension *of ϕ iff
[TABLE]
Clearly:
Proposition 5.2 Let X,Y⊆R.
If ϕ:X→Y, ψ:X→Y, f:m≈(X)→m≈(Y) are functions, and f is an indiscernible
extension of ϕ and ψ, then
[TABLE]
Before introducing the concept of interval in R, we must define the analogue on R of the usual linear
ordering ≤ on R.
Definition 5.3 Let x,y∈R.
We say that xis less than or indiscernible fromy, and we denote it by x≲y, iff σx≤σy (where in σx≤σy we consider the usual linear ordering ≤ on R), and we say that xis greater than or
indiscernible fromy, and we denote it by x≳y, iff y≲x .
R0+ and R0− denote the
subsets of R defined by
[TABLE]
[TABLE]
Clearly:
Proposition 5.4 a) If x,y∈R, then
[TABLE]
b) Let x,y,z∈R. Then:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
So if we adopt the version of the usual antisymmetry expressed by the second formula above, then we may consider ≲ a linear
ordering on R.
c) If ε^ and δ^ are infinitesimals,
then
[TABLE]
d)R0+ and R0−
are the sets of nonnegative and nonpositive generalized
real numbers, i.e.
[TABLE]
and
[TABLE]
Furthermore:
[TABLE]
The next definition introduce concepts that are adaptations to ≲ (and ≳), on R, of the usual notions
for ≤ (and ≥), on R.
Definition 5.5 Let A⊆R,
and L,l∈R. Then:
L is a ≲-upper bound of A iff
[TABLE]
l is a ≲-lower bound of A iff
[TABLE]
A is ≲-bounded above iff A has a ≲-upper bound, and A is ≲-bounded
below iff A has a ≲-lower bound.
A is ≲-bounded iff A is ≲-bounded above and ≲-bounded below.
A is ≲-unbounded iff A is not ≲-bounded.
L is a ≲-maximum of A iff L∈A and L is a ≲-upper bound of A.
l is a ≲-minimum of A iff l∈A and l is a ≲-lower bound of A.
L is a ≲-supremum of A iff L is a ≲-minimum of ≲-Up(A),
where ≲-Up(A) is the set of all ≲-upper bounds of A.
l is a ≲-infimum of A iff l is a ≲-maximum of ≲-Lo(A), where ≲-Lo(A) is the set of all ≲-lower bounds of A.
Proposition 5.6 Let A⊆R, and L,Lˊ,l,l′∈R.
a) If L≈L′ and l≈l′, then
L is a ≲-upper bound of A iff L′ is a ≲-upper bound of A,
and
l is a ≲-lower bound of A iff l′ is a ≲-lower bound of A.
b)≲-*Up(A)*and ≲-Lo(A) are monads of subsets of R.
c) If L is a ≲-maximum of A, then
L′ is a ≲-maximum of A⇒L′≈L.
Similarly, if l is a ≲-minimum of A, then
l′ is a ≲-minimum of A⇒l′≈l.
If L is a ≲-maximum of A, and A is the
monad of a subset of R, then
L′≈L⇒L′ is a ≲-maximum of
A.
Similarly, if l is a ≲-minimum of A, and A is the monad of a subset of R, then
l′≈l⇒l′ is a ≲-minimum of
A.
d) If L is a ≲-supremum of A, then
L′ is a ≲-supremum of A⇔L′≈L.
Similarly, if l is a ≲-infimum of A, then
l′ is a ≲-infimum of A⇔l′≈l.
Proofa) is trivial, since σL=σL′
and σl=σl′.
b) Using a), we have:
m≈(≲-Up(A))=≲-Up(A).
Then, using proposition 4.4 c):
≲-Up(A)=m≈(σ(≲-Up(A))).
Similarly, for ≲-Lo(A).
c) Let L be a ≲-maximum of A.
If L′ is a ≲-maximum of A, then, since L,L′∈A,
[TABLE]
So, by proposition 5.4 b),
[TABLE]
Let A be the monad of a subset of R.
If L′≈L, then, by a),
L′ is a ≲-upper bound of A.
On the other hand, since L∈A, L′≈L, and A is the monad of a subset of R, we have:
[TABLE]
So
L′ is a≲-maximum of A.
Similarly, for the concept of ≲-minimum.
d) follows directly from b) and c). ■
We have just seen that the concepts of ≲-upper bound and ≲-lower bound are invariant under indiscernibility, and so are the concepts of ≲-supremum and ≲-infimum.
Corollary 5.7 Let A⊆R,
and L,l∈R.
a) If L is a ≲-supremum of A, then σL is also a ≲-supremum of A, and each ≲-su-
premum of A has σL as its shadow.
When l is a ≲-infimum of A, σl is also a ≲-infimum of A, and each ≲-infimum of A has σl as its shadow.
b) If L is a ≲-maximum of A and σL∈A, then σL is a ≲-maximum of A, and each ≲-maximum of A has σL as its shadow.
When l is a ≲-minimum of A and σl∈A, then σl is a ≲-minimum of A, and each ≲-minimum of A has σl as its shadow.
Proofa) and b) follow immediately from proposition 5.6 d), and proposition 5.6a), c),
respectively. ■
Definition 5.8 Let A⊆R,
and L,l∈R.
If L is a ≲-supremum of A, then σL is called
the real supremum of A.
Similarly, if l is a ≲-infimum of A, then σl
is called the real infimum of A.
If L is a ≲-maximum of A and σL∈A, then σL is said to be the real maximum of A.
In a similar manner, if l is a ≲-minimum of A and σl∈A, then σl is said to be the real
minimum of A.
We denote the real supremum, the real infimum, the real maximum, and the real minimum of A by suprA, infrA, maxrA, and minrA, respectively.
Before presenting a Completeness Property for R, we need the following lemma:
Lemma 5.9 Let A⊆R, and L,l∈R.
a)** L is a ≲-upper bound of A iff σL is an upper bound of σ(A).
l is a ≲-lower bound of A iff σl is a lower
bound of σ(A).
**b) σ(≲-Up(A))=**Up(σ(A)), and σ(≲-Lo(A))=Lo(σ(A)); where Up(σ(A)) and
Lo(σ(A)) are the sets
of all upper bounds and lower bounds of σ(A), respectively, for the usual linear ordering ≤ on R.
c)L is a ≲-maximum of A⇒σL=maxσ(A).
l is a ≲-minimum of A⇒σl=minσ(A).
If A is the monad of a subset of R, then
[TABLE]
Similarly, if A is the monad of a subset of R, then
[TABLE]
d)L is a ≲-supremum of A⇔σL=supσ(A).
l is a ≲-infimum of A⇔σl=infσ(A).
Proofa) Clearly:
[TABLE]
[TABLE]
We may use a similar proof for the notion of ≲-lower bound.
b) For each x∈R, we have, using a), and proposition4.4 b), c):
[TABLE]
So
[TABLE]
Then, using proposition4.4 b), c),
[TABLE]
Similarly, for ≲-Lo(A).
c) If L is ≲-maximum of A, then
L is a ≲-upper bound of A,
and so, by a),
σL is an upper bound of σ(A).
On the other hand, we have, since L∈A:
[TABLE]
So
[TABLE]
Let A be the monad of a subset of R.
If σL=maxσ(A), then σL is an upper bound of σ(A), and so, by a), L is a ≲-upper bound of A.
On the other hand, since L≈σL and σL∈σ(A),
[TABLE]
But m≈(σ(A))=m≈(A) (by
proposition 4.4 c)), and m≈(A)=A (by proposition 4.5 b)).
So
[TABLE]
We have just proven that
L is a ≲-maximum of A.
Similarly, for the notion of ≲-minimum.
d) Using b), c), and proposition 5.6 b),
we have:
[TABLE]
[TABLE]
Similarly, for the notion of ≲-infimum. ■
Theorem 5.10 (The Completeness Property ofR)
Let A be a nonempty subset of R.
a) If A is ≲-bounded above, then there exists
suprA.
b) If A is ≲-bounded below, then there exists
infrA.
Proof a) If A is ≲-bounded above, then
[TABLE]
So
[TABLE]
Then, by lemma 5.9b),
[TABLE]
Since σ(A)=∅
(because A=∅), we infer, using the Completeness Property of R, that there exists supσ(A).
Denoting supσ(A) by L, we
have, using **lemma 5.9 d), **and the fact that L∈R:
[TABLE]
b) admits a similar proof. ■
Definition 5.11 Let α,α1,β,β1∈R; with α≤β.
The closed, open, and half-open intervals determined by
the ordered pair (α,β), de-
noted by [α,β],]α,β[,]α,β] and [α,β[,
respectively, are defined by:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The intervals just introduced are ≲-bounded sets.
We use the symbols −∞ and +∞ to introduce the intervals that
are ≲-unbounded sets:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The next proposition admits a quite straightforward proof (in
particular, e) follows easily from proposition 4.4 b),
c), proposition 4.7 e), proposition 5.12 a), and
the well-known fact that the connected subsets ofR,
for the usual topology, are the intervals).
Proposition 5.12a) The intervals in R are the monads of the correspondent intervals in R, and the
intervals in R are the shadows of the correspondent intervals in R; for example, if α,α1,β∈R, and α≤β, then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
b) Let α,β∈R, with α≤β.
Then:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
**c) **Let α,α′,α1,α1′,β,β′,β1,β1′∈R,
with α≤β and α′≤β′. Then:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Intervals of different kind are never identical, unless they are both the
empty set; for example (still with α,α1,β∈R, and α≤β),
[TABLE]
[TABLE]
[TABLE]
[TABLE]
d) If I is an interval in R, then
[TABLE]
[TABLE]
[TABLE]
e) Let T be the usual topology for R, and let
T:={m≈(A)∣A∈T}.
If X is the monad of a subset of R, then
[TABLE]
Now we may introduce the concept of *length * of a ≲-bounded interval in R (notice how proposition 5.12 b), **c) **is relevant to the
next definition).
**Definition 5.13 **Let α,β∈R, and α≤β. If I is one of the intervals [α,β],]α,β[,]α,β],[α,β[, then the *length *of I, denoted by l(I), is defined by:
[TABLE]
Clearly:
**Proposition 5.14 **If α∈R, then
[TABLE]
but
[TABLE]
and
[TABLE]
Remark 5.15 The intervals in R have no
clear-cut (i.e. pointlike) extremities.
For example, if α,β,γ∈R and α<β<γ, then [α,β],[β,γ] have m≈(α),m≈(β) and m≈(β),m≈(γ) as extremities, respectively, and
[TABLE]
The intervals in R are particularly fit to devise a
model for the flux of Time:
A stretch of Time is an interval [α,β](α,β∈R;α<β ) whose members will be
called instants.
Each now is the intersection of two adjacent stretches of Time,
such as
[TABLE]
So each now is the monad of an instant, and consequently, a set of
indiscernible instants with the power of the continuum
and length [math], since, for each β∈R ,
[TABLE]
Also, being the intersection of two adjacent intervals, each now
has a dual past-*future *nature.
This conception of Time is reminiscent of the ideas of the Stoic
philosophers (especially Chrysippos) [12].
We now present the concept of differentiability.
Definition 5.16 Let I be an open interval in R, let ξ0∈I, and let ϕ:I→R be a function.
If f:m≈(I)→R is an indiscernible
extension of ϕ, then f is said to be *differentiable *at ξ0 iff there exists a real number α such that
[TABLE]
with the proviso that α:=limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), when such limit exists
in R (considering the usual definition of limit).
If J is an open subinterval (in R) of I, then f is
said to be *differentiable *on m≈(J) iff f is
differentiable at each ξ0∈J.
Proposition 5.17 Let I be an open interval in R, let
ξ0∈I, and let ϕ:I→R be a
function.
If f:m≈(I)→R is an indiscernible
extension of ϕ, α and β are real numbers, and
[TABLE]
then
[TABLE]
**Proof **If we choose x∈m≈(ξ0) such that dx is the eventually null sequence (1,0,0,0,…), then the
conclusion follows at once from αdx=βdx, since
[TABLE]
**Definition 5.18 **With the notation and the conditions of definition 5.16, if f is differentiable at ξ0, then α is
called the derivative offatx,
for each x∈m≈(ξ0), and we denote it by f′(x).
**Remark 5.19 **Let I be an open interval in R, let ξ0∈I, and let f:m≈(I)→R
be an indiscernible extension of ϕ:I→R .
If f is differentiable at ξ0, then f′(x) exists (in R), for each x∈m≈(ξ0), and f′(x)=\nolinebreakf′(ξ0). But the differentiability of f at ξ0 does not entail the existence of limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) ,
although if this is the case, then f′(ξ0) coincides with
this limit, by the proviso of definition 5.16.
As an example, let us consider the functions ϕ:R→R and f:R→R,
defined by ϕ(ξ):=∣ξ∣ and f(x):=\left\{\begin{array}[]{c}x,\text{ if \ }x>0\\
0,\text{ if \ }x\in m_{\approx}(0)\\
-x,\text{ if \ }x<0\end{array}\right. , where ∣∣ denote the usual absolute value in R. Clearly, f is an indiscernible extension of ϕ,
differentiable at ξ0=0 with f′(ξ0)=0, but limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) does not exist in R.
**Proposition 5.20 **Let I be an open interval in R, let
ξ0∈I, and let ϕ:I→R be a function.
If f:m≈(I)→R is an
indiscernible extension of ϕ, and f is differentiable at ξ0, then
[TABLE]
(Notice that we could have written
[TABLE]
since σx=ξ0 and f′(x)=f′(ξ0), for
each x∈m≈(ξ0)).
**Proof **Just remember that f(ξ0)=ϕ(ξ0). ■
Proposition 5.20 expresses, in analytic terms, the geometric idea associated with the concept of differentiability.
This idea was clearly expressed by G. W. Leibniz and G. de L’Hôpital
(via Johann Bernoulli), and it is closely related to the use of nilpotent
infinitesimals, as the Dutch theologian and mathematician B. Nieuwentijt
first realized (around 1695):
[TABLE]
increments of the argument around\xi$${}_{0})\mathit{\ }with its tangent at the point(ξ0,f(ξ0)).
The next lemma is necessary to establish the basic algebraic rules of
derivation.
**Lemma 5.21 **Let I be an open interval in R, and let f:m≈(I)→R, g:m≈(I)→R be indiscernible extensions of ϕ:I→R, ψ:I→R, respectively.
a) For fixed α,β∈R, if ϕ(ξ):=αξ+β, then we may define f by
[TABLE]
b)f+g, fg are indiscernible extensions of ϕ+ψ, ϕψ, respectively.
c) If ψ(ξ)=0, for each ξ∈I, then
[TABLE]
d) For fixed m∈N:
[TABLE]
If ϕ(ξ)>0, for each ξ∈I, and m>1, then
[TABLE]
e) Let J be an open interval in R
such that ϕ(I)⊆J, and let h:m≈(J)→R be an indiscernible
extension of θ:J→R. Then:
[TABLE]
f) If f is injective and m≈(ϕ(I))⊆f(m≈(I)), then ϕ is also
injective and
[TABLE]
**Proof **Only the proof of e) and f) has some
difficulty.
e) First, we shall prove that h∘f makes sense.
Let z∈m≈(I).
Then, since σz∈I (by proposition 4.4 b), c))
and ϕ(I)⊆J, we have:
[TABLE]
So
[TABLE]
We have proven that
[TABLE]
Now let x∈m≈(I).
Then
[TABLE]
On the other hand, since ϕ(σx)=σf(x), we have:
[TABLE]
We have proven that
[TABLE]
f) If f is injective, then so is ϕ, since ϕ(ξ)=f(ξ), for each ξ∈I .
Let z∈m≈(I).
Then, since σf(z)∈f(m≈(I)) (because σz∈I, by proposition
4.4 b), c), I⊆m≈(I), and σf(z)=ϕ(σz)=f(σz)),
we have:
[TABLE]
[TABLE]
Since f is an indiscernible extension of ϕ, we have f(m≈(I))⊆\nolinebreakm≈(ϕ(I)). So, from m≈(ϕ(I))⊆f(m≈(I)), we infer
that
[TABLE]
We have proven that
[TABLE]
Let us state the basic algebraic properties of the
derivative:
Proposition 5.22 Let I be an open interval in R, let
f:m≈(I)→R, g:m≈(I)→R be indiscernible extensions of ϕ:I→R,ψ:I→R, respectively, and
let ξ0∈I.
a) If α and β are fixed real numbers, and f is
defined by f(x):=αx+β, then f is differentiable at ξ0, and
[TABLE]
b) Let f and g be differentiable at ξ0. Then:
If at least one of the limits limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0)
exists in R, then f+g is differentiable at ξ0, and for
each x∈m≈(ξ0):
[TABLE]
c) Let f and g be differentiable at ξ0.
If limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) and limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0) exist
in R, then fg is differentiable at ξ0, and we
have, for each x∈m≈(ξ0):
[TABLE]
If ϕ(ξ0)=0,limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), limξ→ξ0ψ(ξ) exist and limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0) does not
exist in R, then fg is differentiable at ξ0, and we
have, for each x∈m≈(ξ0):
[TABLE]
If ψ(ξ0)=0,limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0), limξ→ξ0ϕ(ξ) exist and limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) does not
exist in R, then fg is differentiable at ξ0, and we
have, for each x∈m≈(ξ0):
[TABLE]
d) Let f and g be differentiable at ξ0, and let ψ(ξ)=0, for each ξ∈I.
If limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) and limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0) exist in R, then gf is differentiable at ξ0,
and we have, for each x∈m≈(ξ0):
[TABLE]
If ϕ(ξ0)=0, limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), limξ→ξ0ψ(ξ)1 exist and limξ→ξ0ξ−ξ0ψ(ξ)1−ψ(ξ0)1 does not
exist in R, then gf is differentiable at ξ0, and we
have, for each x∈m≈(ξ0):
[TABLE]
If limξ→ξ0ξ−ξ0ψ(ξ)1−ψ(ξ0)1, limξ→ξ0ϕ(ξ) exist and limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) does not
exist in R, then gf is differentiable at ξ0, and for
each x∈m≈(ξ0):
[TABLE]
e) Let m∈N, and let f be differentiable at ξ0.\vspace−3pt
If limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) exists in R, then fm is
differentiable at ξ0, and for each x∈\nolinebreakm≈(ξ0):
[TABLE]
If ϕ is continuous at ξ0 (considering the usual definition of
*continuity *at a point), ϕ(ξ0)=0, and limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) does not exist in R, then fm is
differentiable at ξ0, and for each x∈m≈(ξ0):
[TABLE]
f) For fixed m∈N, let f be differentiable at ξ0, and let ϕ(ξ)>0, for each ξ∈I . Then
mf is differentiable at ξ0, and for each x∈m≈(ξ0):
[TABLE]
**Proof **This proposition is a
straightforward consequence of proposition 3.6 and lemma 5.21, except for the fact that we must be very careful with the proviso of
definition 5.16. To illustrate the last point, we shall prove
c).
c) Let f and g be differentiable at ξ0, and let x∈m≈(ξ0).
By lemma 5.21 b), fg is an indiscernible
extension of ϕψ; so we have, using proposition 3.6 b):
[TABLE]
Before concluding that fg is differentiable at ξ0 and
[TABLE]
we must be very careful with the proviso of definition 5.16.
If limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0),limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0) exist in R, then limξ→ξ0ξ−ξ0(ϕψ)(ξ)−(ϕψ)(ξ0) also exists in
R, and equals f(ξ0)g′(x)+g(ξ0)f′(x).
If ϕ(ξ0)=0, limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), limξ→ξ0ψ(ξ) exist and limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0) does not exist in R, then it is easy to prove that limξ→ξ0ξ−ξ0(ϕψ)(ξ)−(ϕψ)(ξ0) does not exist
in R, and therefore the proviso is not violated.
When ψ(ξ0)=0, limξ→ξ0ξ−ξ0ψ(ξ)−ψ(ξ0), limξ→ξ0ϕ(ξ) exist and limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) does not exist in R, we may use the previous argument
to obtain the same conclusion. ■
**Theorem 5.23 (Chain Rule) **Let f:m≈(I)→R, g:m≈(J)→R
be indiscernible extensions of ϕ:I→R,ψ:J→R, respectively, where I,J are open intervals in R such that ϕ(I)⊆J, and let ξ0∈I.
If f is differentiable at ξ0, g is differentiable at η0:=f$$\left(\xi_{0}\right), and both limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) and limη→η0η−η0ψ(η)−ψ(η0) exist in R, then g∘f is differentiable at ξ0, and for each x∈m≈(ξ0):
[TABLE]
**Proof **Let f be differentiable at ξ0, and let g be
differentiable at η0:=f(ξ0).
By lemma 5.21 e), g∘f is an indiscernible extension of ψ∘ϕ; so we have, for each x∈m≈(ξ0):
[TABLE]
[TABLE]
On the other hand, since f is differentiable at ξ0, and g is
differentiable at η0=\nolinebreakf(ξ0),
[TABLE]
By comparison with the previous result for (g∘f)(x), we infer that
[TABLE]
Since f(x)∈m≈(η0) (because f is differentiable at ξ0), and g is differentiable at η0,
we have:
[TABLE]
And the proviso of definition 5.16 is satisfied, since we obtain,
as an immediate consequence of the usual Chain Rule in R
(and the differentiability of f,g at ξ0,η0, respectively) :
[TABLE]
[TABLE]
We have proven that g∘f is differentiable at ξ0, and for each
x∈m≈(ξ0):
[TABLE]
Theorem 5.24 **(The Inverse Function Theorem) **Let I be
an open interval in R, let f:m≈(I)→R be an injective indiscernible extension of a continuous
function ϕ:I→R (we consider the usual topology for
R, and its relativization to I), and let ξ0∈I.
If m≈(ϕ(I))⊆f(m≈(I)),f is differentiable at ξ0, f′(ξ0)=0, and limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0) exists in R, then f−1 (considered as a function with codomain R) is differentiable at η0:=f(ξ0), and we have, for each y∈m≈(η0):
[TABLE]
**Proof **Let J:=ϕ(I), α:=limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), and η0:=f(ξ0).
Since ϕ is continuous and injective (because f is an injective
indiscernible extension of ϕ), ϕ−1 is also continuous
(considering the usual topology for R, and its relativization to J). So J=ϕ(I)=(ϕ−1)−1(I) is an open interval in R, and
the same is valid for m≈(J) in R (see
proposition 5.12 a)).
As α=f′(ξ0)=0, we know, by the usual Inverse Function Theorem in R, that β:=limη→η0η−η0ϕ−1(η)−ϕ−1(η0) exists in R, and
[TABLE]
Since m≈(J)=f(m≈(I)) (see the proof of lemma 5.21 f)), we may consider the
function g:m≈(J)→R defined by
[TABLE]
Since, by lemma 5.21 f), f−1 is an indiscernible extension of ϕ−1, to complete the prove we only need to show that g(y)=f−1(y), for each y∈m≈(η0).
If y∈m≈(η0), then g(y)∈m≈(ξ0)
(because ϕ−1(η0)=f−1(η0)=ξ0), and since f is differentiable at ξ0, we have:
[TABLE]
So
[TABLE]
Notation. Let I be a nonempty open interval in R, let ϕ:I→R be a function, and let
[TABLE]
The function ξ0∈Λϕ↦limξ→ξ0ξ−ξ0ϕ(ξ)−ϕ(ξ0), from Λϕ to R , will be denoted by λϕ
(notice that we do not exclude, at least here, the case Λϕ=∅).
Theorem 5.25(The Mean Value Theorem)
Let I be a nonempty open interval in R, let f:m≈(I)→R be an indiscernible
extension of ϕ:I→R, differentiable on m≈(I), and let Λϕ=I.
If a,b∈m≈(I) and a<b, then there exists γ∈I
such that a<γ<b, and
[TABLE]
In particular, if a,b∈I, then (1) assumes the familiar form:
[TABLE]
The previous identities stay valid when we replace γ
by any c∈m≈(γ).
**Proof **Let a,b∈m≈(I), and a<b.
Then
[TABLE]
So, by the usual Mean Value Theorem, there is γ∈I such
that σa<γ<σb, and
[TABLE]
Then, since f is an indiscernible extension of ϕ, differentiable on m≈(I), we have:
Finally, by definition 5.18, f′(γ)=f′(c), for each c∈m≈(γ). ■
**Corollary 5.26 **Let I be a nonempty open interval in R, let f:m≈(I)→R be an
indiscernible extension of ϕ:I→R, differentiable
on m≈(I), and let Λϕ=I .
a) If f′(x)=0, for each x∈m≈(I), then f is a constant function.
b) If f′(x)>0, for each x∈m≈(I), then f is a strictly increasing function.
b) If f′(x)<0, for each x∈m≈(I), then f is a strictly decreasing function.
**Proof a) **Let a,b∈m≈(I).
If a≈b, then, since f is differentiable on m≈(I) with null derivative,
[TABLE]
If a<b or b<a, then we obtain, as a direct consequence of identity (1) of theorem 5.25,
[TABLE]
**b) **and **c) **admit trivial proofs, since if a,b∈m≈(I) and a<b, then we easily obtain, using identity (1) of theorem 5.25:
[TABLE]
We close this section with the introduction and elementary study of the
concept of natural indiscernible extension of a
function ϕ:I→R, where I is a nonempty open
interval in R . Natural indiscernible extensions are the
\ognatural\fg versions, in R,
of the usual differentiable functions, in R.
The starting point is the next proposition, which follows immediately from
definition 5.16 and remark 5.19.
**Proposition 5.27 **Let I be a nonempty open interval in R, and let ϕ:I→R be a function such that Λϕ=I .
Then the function f:m≈(I)→R, defined by f(x):=ϕ(σx)+λϕ(σx)dx, is the unique indiscernible extension of ϕ differentiable on m≈(I).
**Definition 5.28 **With the notation and the hypothesis of proposition 5.27, we call f:m≈(I)→R, defined by f(x):=ϕ(σx)+λϕ(σx)dx, the
*natural indiscernible extension *of ϕ, and we denote it by ϕ^.
Natural indiscernible extensions preserve addition, scalar
multiplication by a real number, multiplication, division, composition, and
inversion, in a sense clearly expressed by a) to e), and
g), in the next proposition.
**Proposition 5.29 Let I be a nonempty open interval in R, and let ϕ:I→R,ψ:\nolinebreakI→\nolinebreakR be functions such that Λϕ=Λψ=I .
a)Λϕ+ψ=I, and ϕ+ψ=ϕ^+ψ^ .
b) If α∈R, then Λαϕ=I, and αϕ=αϕ^.
c)Λϕψ=I, and ϕψ=ϕ^ψ^ .
d) If ψ(ξ)=0, for each ξ∈I , then
Λψϕ=I, and
[TABLE]
e) If J is a nonempty open interval in R,θ:J→R is a function such that ϕ(I)⊆J, and
Λθ=J, then Λθ∘ϕ=I, and
[TABLE]
f) If A is a nonempty subset of I, then
[TABLE]
If λϕ(ξ)=0, for each ξ∈I, then
[TABLE]
If α,β∈I,α<β, λϕ(ξ)=0, for
each ξ∈]α,β[, and λϕ(α)=λϕ(β)=0, then
[TABLE]
g) If ϕ is continuous, injective, and λϕ(ξ)=0, for each ξ∈I, then ϕ^ is injective, Λϕ−1=ϕ(I), and
[TABLE]
considering ϕ−1,ϕ^−1 as functions with codomains R,R, respectively.
h) If I=R and ϕ is an even function, then ϕ^ is also an even function, i.e. ϕ^(−x)=\nolinebreakϕ^(x), for each x∈R .
Similarly, if I=R and ϕ is an odd function, then ϕ^ is also an odd function, i.e. ϕ^(−x)=−ϕ^(x), for each x∈R .
i) If I=R , λ0∈R+, and ϕ is a periodic function with period λ0, then ϕ^
is also periodic with the same real period, i.e.
[TABLE]
Proof a) and b) admit trivial proofs, using the
well-known identities (with different notation**) Λϕ+ψ=Λαϕ=I,** and λϕ+ψ=λϕ+λψ,λαϕ=αλϕ .
c) Clearly, Λϕψ=I, and
for each x∈m≈(I), we have, using the well–known identity
(with different notation**) λϕψ=λϕψ+λψϕ** :
f) If x∈m≈(A), then, since σx∈A (by
proposition 4.4 b), c)),
[TABLE]
We have proven that
[TABLE]
Let λϕ(ξ)=0, for each ξ∈I .
If ξ∈A and ε^≈0, then
[TABLE]
We have proven that
[TABLE]
Let α,β∈I, with α<β, let λϕ(ξ)=0, for each ξ∈]α,β[, and let λϕ(α)=\nolinebreakλϕ(β)=\nolinebreak0.
We have:
[TABLE]
Since λϕ(ξ)=0, for each ξ∈]α,β[, and λϕ(α)=λϕ(β)=0, we
obtain (using the result we have just proven, and definition 5.28):
[TABLE]
[TABLE]
[TABLE]
So
[TABLE]
g) Clearly, ϕ(I) is a nonempty open interval,
and by the usual Inverse Function Theorem, Λϕ−1=ϕ(I).\vspace−0.2cm
On the other hand, for each x1,x2∈m≈(I), we have (since
ϕ is injective and λϕ(ξ)=\nolinebreak0, for
each ξ∈I):
[TABLE]
[TABLE]
[TABLE]
So ϕ^ is also injective.
If x∈m≈(I), then we have, using **e) **and denoting by ιI the inclusion function of I into R:
[TABLE]
If y∈m≈(ϕ(I)), we have, using e)
and denoting by ιϕ(I) the inclusion function of ϕ(I) into R :
[TABLE]
Finally, since the domains of ϕ−1,ϕ^−1
are m≈(ϕ(I),ϕ^(m≈(I)), and these sets
are identical, by f), we may consider proven that
[TABLE]
viewing ϕ−1,ϕ^−1 as functions with codomains R,R, respectively.
h) admits a trivial proof, since
[TABLE]
[TABLE]
and d(−x)=−dx, for each x∈R .
i) Let λ0∈R+, let ϕ:R→R be a periodic function with period λ0,
and let
[TABLE]
For each x∈R , we have, using the well-known fact
that λϕ is also periodic with period λ0:
[TABLE]
Then, since R+⊆R+, we infer
that
[TABLE]
On the other hand, if l∈L^, we have, for each ξ∈R:
[TABLE]
Then, since σl∈R+,
[TABLE]
So
[TABLE]
Since λ0∈R, λ0∈L^, and λ0 is an ≲-lower bound of L^, we conclude that
[TABLE]
Frequently, physicists and engineers use identities like
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
and they work with the functions involved in these identities as if they had
the same basic properties as the usual ones. These procedures rely on
powerful intuitions, but they are not rigorous and lead to contradictions in
the framework of ordinary calculus. And yet they must be valid in a
satisfactory calculus, based on an adequate (both for mathematics and the
experimental sciences) generalization of the Cantor-Dedekind continuum. In
the next example, we shall see how the natural indiscernible
extensions give a positive answer to this aim, in the context of R .
**Example 5.30 **Let I be a nonempty open interval in R,
and let ϕ:I→R be a function such that Λϕ=I.
1) If ϕ is a constant function, i.e. ϕ(ξ):=α,
for each ξ∈I, where α is a fixed real number, then, clearly,
its natural indiscernible extension is also a constant function assuming the
same value, i.e. ϕ^:m≈(I)→R
is defined by
[TABLE]
2) If ϕ is the inclusion function of I into R,
i.e. ϕ(ξ):=ξ, for each ξ∈I, then, since λϕ(ξ)=1 and σx+dx=x, for each ξ∈R
and x∈m≈(I), its natural indiscernible extension is the
inclusion function of m≈(I) into R, i.e. ϕ^:m≈(I)→R is defined by
[TABLE]
3) If ϕ is a polynomial function, i.e. ϕ(ξ):=α0+α1ξ+…+αmξm, where α0,α1,…, αm are fixed real numbers, then, by the
previous examples, proposition 5.29 a), c), and
mathematical induction, its natural indiscernible extension is also a
polynomial function with the same coefficients, i.e. ϕ^:m≈(I)→R is defined by
[TABLE]
4) If ϕ is an algebraic function, i.e. ϕ(ξ):=θ(ξ)ψ(ξ), where ψ:I→R, θ:I→R are polynomial functions with
real coefficients, and θ(ξ)=0, for each ξ∈I, then, by
the last example and proposition 5.29 d), its natural indiscernible
extension is also an algebraic function, more precisely, ϕ^:m≈(I)→R is defined by
[TABLE]
where ψ^ and θ^ are the natural indiscernible
extensions of ψ and θ, respectively.
5) Let I:=R, and let ϕ be the usual exponential function, denoted by exp .
Since λexp(ξ)=exp(ξ), for each ξ∈R, and m≈(R)=R, the natural indiscernible extension of exp is the
function exp:R→R defined by
[TABLE]
exphas the same basic properties as exp. For instance:
Using proposition 5.29 f), we obtain:
[TABLE]
If x∈R, then
[TABLE]
If x1,x2∈R, then (since dx1dx2=dx2dx1=0)
[TABLE]
[TABLE]
exp is a strictly increasing function, by Corollary5.26 b), since exp′(x)=exp(σx)>\nolinebreak0, for each x∈R .
And, of course,
[TABLE]
exp is the adequate function for the afore mentioned
considerations of physicists and engineers (as it is the case for the next
examples of natural indiscernible extensions), since it has the basic
properties of exp and is defined not only for real numbers (where it assumes
the same value as exp), but also for arguments involving
infinitesimals. Moreover, exp(x) is always indiscernible from exp(σx).
Now we may infer, rigorously, that
[TABLE]
for each x∈R .
6) Let I:=R, and let ϕ be the usual naturallogarithm function, which we denote by log.
Since λlog(ξ)=ξ1, for each ξ∈R+, and m≈(R+)=R+, the natural indiscernible extension of log is the function log:R+→R
defined by
[TABLE]
By proposition 5.29 g), we have:
[TABLE]
This result, in conjunction with the considerations of the previous example,
suffices to assure that log has the same basic properties as log .
And since log=exp−1, and exp\mspace1.0mu(R)=R+, we have:
[TABLE]
Clearly,
[TABLE]
for each x∈R+.
Finally, we may infer, rigorously, that
[TABLE]
for each x∈R+.
7) Let I:=R, and let ϕ be the usual sine
function, denoted by sin .
Since λsin(ξ)=cos(ξ), for each ξ∈R, the natural indiscernible extension
of sin is the function sin:R→R defined by
[TABLE]
Now let I:=R, and let ϕ be the usual
cosine function, denoted by cos .
Since λcos(ξ)=−sin(ξ), for each ξ∈R, the natural indiscernible extension
of cos is the function cos:R→R defined by
[TABLE]
sin and cos have the same basic properties as
sin and cos, respectively. For instance:
sin and cos have real period 2π, as it is
clear from proposition 5.29 i).
Using the last result and proposition 5.29 f), we obtain:
[TABLE]
[TABLE]
Similarly,
[TABLE]
If x∈R, then (since the square of an infinitesimal
is always null)
[TABLE]
[TABLE]
So
[TABLE]
If x1,x2∈R, then
[TABLE]
[TABLE]
On the other hand (since the product of infinitesimals is always null),
[TABLE]
[TABLE]
[TABLE]
[TABLE]
So
[TABLE]
In a similar manner, we could have proven that
[TABLE]
And we clearly have, for each x∈R:
[TABLE]
[TABLE]
Finally, we may infer, rigorously, that
[TABLE]
for each x∈R.
Similarly,
[TABLE]
8) Let I:=R+, let α be a fixed real number,
and let ϕ be defined by ϕ(ξ):=ξα.
Since λϕ(ξ)=αξα−1, for each ξ∈R+, the natural
indiscernible extension of ϕ is
the function ϕ^:R+→R defined by
[TABLE]
Clearly, for each x∈R+:
[TABLE]
If we denote ϕ^(x) by xα,then
[TABLE]
[TABLE]
for each x∈R+.
Trivially, ϕ^(R+)={1}, when α=0. If α=0, then we
obtain, using proposition 5.29 f):
[TABLE]
As ϕ(ξ)=exp(αlog(ξ)), for each ξ∈R+, we obtain, using the examples 1), 5), 6),
and proposition 5.29 c), e) :
[TABLE]
Finally, we may infer, with complete rigour, that
[TABLE]
9) Let I:=R, let α be a fixed positive real
number, and let ϕ be defined by ϕ(ξ):=\nolinebreakαξ.
Since λϕ(ξ)=αξlog(α), for each ξ∈R, the natural
indiscernible extension of ϕ is the function ϕ:R→R defined by
[TABLE]
Clearly, for each x∈R:
[TABLE]
If we denote ϕ^(x) by αx,then we have, for each x∈R:
[TABLE]
[TABLE]
So, if e is Euler’s number, then
[TABLE]
for each x∈R.
Trivially, ϕ^(R)={1}, when α=1. If α=1, then we obtain, using proposition 5.29 f):
[TABLE]
The next definition introduces the concepts of mth natural
indiscernible extension and mth derivative function, for m∈N .
**Definition 5.31 **Let I be a nonempty open interval in R, and let ϕ:I→R be a function such that Λϕ=I.
The functions ϕ^:m≈(I)→R,ϕ^′:m≈(I)→R defined by
[TABLE]
[TABLE]
will be called the* first natural indiscernible
extension of ϕ, and the first derivative function *of ϕ^, respectively. So the *first natural indiscernible extension *of ϕ is, in fact, its natural indiscernible extension, and,
most conveniently, the value of the *first derivative function *of ϕ^ at ξ0∈I is its derivative at this point (see
**definition 5.28 **and definition 5.18, respectively).
If Λλϕ=I, then the functions
ϕ^[2]:m≈(I)→R,ϕ^′′:m≈(I)→R defined by
[TABLE]
[TABLE]
will be called the* second natural indiscernible
extension of ϕ, and the second derivative function *of ϕ^, respectively.
If Λλλϕ=I, then
the functions ϕ^[3]:m≈(I)→R,ϕ^′′′:m≈(I)→R defined by
[TABLE]
[TABLE]
will be called the* third natural indiscernible
extension of ϕ, and the third derivative function *of ϕ^, respectively.
For the sake of uniformity, we also denote ϕ^,ϕ^′,ϕ^′′,ϕ^′′′ by ϕ^[1],ϕ^(1),ϕ^(2),ϕ^(3), respectively.
We define in a similar manner the* fourth natural indiscernible
extension of ϕ and the fourth derivative function of ϕ^, denoted by ϕ^[4] and ϕ^(4),
respectively,…; and if m∈N, then we denote by ϕ^[m] and ϕ^(m) the mth natural indiscernible
extension of ϕ and the mth derivative function *of ϕ^, when such functions exist .
**Notation ** Let m∈N.
Under the conditions and with the notation of definition 5.31, λϕ(m) will indicate that the symbol λ appears m times. For example:
[TABLE]
[TABLE]
[TABLE]
And if we define λϕ(0):=ϕ, then we have, for each x∈m≈(I), and m∈N:
[TABLE]
Since λϕ(0):=ϕ, it is \ognatural\fg to introduce the function ϕ^(0):m≈(I)→R, defined by ϕ^(0)(x):=ϕ(σx)=ϕ^(σx).
Clearly:
**Proposition 5.32 **Let m∈N. Then:
a)ϕ^[m] is the (first) natural indiscernible
extension of λϕ(m−1), i.e. ϕ^[m]=λϕ(m−1).
b)ϕ^(m)=σ∘ϕ^[m+1] (where σ:R→R is the shadow function, i.e. σ(x):=σx, for each x∈R) .
**Remark 5.33 **Let m∈N.
If ϕ^[m+1] and ϕ^(m+1)exist, it is important to
notice that ϕ^(m+1) is the derivative function of ϕ^[m+1], and not the derivative function of ϕ^(m). This is
not surprising since ϕ^[m+1] is the (first) natural
indiscernible extension of λϕ(m), and λϕ(m) is, in fact, the usualmth derivative function ofϕ.
In blunt terms, the rule (valid for the* derivative at a point* or
the* derivative function*) is
[TABLE]
Finally, it is important to realize that the range of ϕ^(m) is
always a subset of R, although its codomain is R .
Example 5.34 1) Let ϕ:R→R be
the function defined by ϕ(ξ):=ξ2. Then Λλϕ(m)=R, for each m∈N0 (where
N0:=N∪{0}), and we have, for each ξ∈R :
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Then, for each x∈R, and m∈N:
[TABLE]
as it should be, according to example 5.30 3), and proposition 5.32 a).
For each x∈R, and m∈N, we have:
[TABLE]
as it should be, according to the results we obtained for ϕ^[m], and proposition 5.32 b).
We could have written the last identities more synthetically as
[TABLE]
[TABLE]
[TABLE]
2) Let ϕ:R→R be the function
defined by ϕ(ξ):=exp(ξ). Then Λλϕ(m)=R, for each m∈N0 , and we have:
[TABLE]
Then, for each x∈R, and m∈N:\vskip3.0ptplus1.0ptminus1.0pt
[TABLE]
[TABLE]
More synthetically:
[TABLE]
[TABLE]
for each x∈R, and m∈N.
3) Let ϕ:R→R be the function
defined by ϕ(ξ):=sin(ξ). Then Λλϕ(m)=R, for each m∈N0, and we have:
[TABLE]
Then, for each x∈R, and m∈N:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
For each x∈R, and m∈N, we have:
[TABLE]
[TABLE]
[TABLE]
More synthetically, we have, for each x∈R, and m∈N:
[TABLE]
[TABLE]
For the cosine function, we have Λλcos(m)=R, and λcos(m)=λλsin(m)=λsin(m+1), for each m∈N0. Then,
for each x∈R, and m∈N,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We close this section with Taylor’s Theorem.
**Theorem 5.35 (Taylor’s Theorem) **Let I be an open
interval in R, let ξ0∈I and m∈N0,
and let ϕ:I→R be a function such that Λλϕ(k)=I, for each 0≤k≤m.
Then for each x∈m≈(I\{ξ0})there exists a real number θ∈]0,1[
such that:
[TABLE]
**Proof **By the usual Taylor’s Theorem with the Lagrange
form of the remainder, for each x∈m≈(I\{ξ0}) there exists a real number θ∈]0,1[ such that we have:
[TABLE]
[TABLE]
6 The Differential Treatment of Singularities (two examples)
For each ξ0∈R,m≈(ξ0) has three
remarkable features:
(i) It has the same cardinality as R, since
(see proposition 4.1 and its proof)
[TABLE]
(ii) It is a closed interval in R
with length [math], since (see proposition 5.14)
[TABLE]
[TABLE]
In this sense, m≈(ξ0) may be
viewed as a tiny subset of R.
(iii) It has a geometric structure, since (see proposition
4.2 b))
[TABLE]
We may use (ii) to obtain immediately:
(ii′) If ξ0∈R, then
[TABLE]
(i) and (iii) express properties of m≈(ξ0) that are shared with the entire
generalized real continuum (the fact that R is an
infinite-dimensional real affine space may be easily derived from proposition 2.3 a) and (iii)). Nevertheless m≈(ξ0) is a tiny subset of R, by (ii). This global-local nature of m≈(ξ0) is the source of its usefulness for
the differential calculus. In the next two examples, we apply this
dual nature to the differential treatment of a singularity, using (ii′) and (iii).
Example 6.1 1) Consider, in R, the differential
equation:
[TABLE]
Equation (2) has no solution on any open interval I in R such
that 0∈I, since if such a solution ξ:I→R
existed, then ξ′ would not satisfy the intermediate
valueproperty on I[see Fig. 1],
violating Darboux’s Theorem.
1$$-1$$\tau$$\xi^{\prime}
Fig. 1: ξ′ would not satisfy the intermediate valueproperty on I, for any open interval I in R such
that 0∈I .
Now consider the corresponding differential equation in R:
[TABLE]
Equation (3) has an infinity of solutions on R; for
instance, one solution is [see Fig. 2]
[TABLE]
t$$x
Fig. 2: A solution x:R→R
of the differential equation (3)
Notice that x:R→R is an indiscernible extension of ξ:R→R
, defined by ξ(τ):=∣τ∣.
2) Consider, in R, the differential equation:
[TABLE]
By Darboux’s Theorem, equation (4) has no solution
on any open interval I in R such that 0∈I[see Fig. 3].
1$$\tau$$\xi^{\prime}
Fig. 3: ξ′ would not satisfy the intermediate valueproperty on I, for any open interval I in R such
that 0∈I .
Now consider the corresponding differential equation in R:
[TABLE]
Equation (5) has an infinity of solutions on R; for instance, one solution is [see Fig. 4]
[TABLE]
1$$t$$x
Fig. 4: A solution x:R→R
of the differential equation x^{\prime}(t)=\left\{\begin{array}[]{c}1,{\ }\text{{if \ }}t\in m_{\approx}(0)\\
0,{\ }\text{{if \ }}t\notin m_{\approx}(0)\end{array}\right..\vskip 3.0pt plus 1.0pt minus 1.0pt
Notice that x:R→R is an indiscernible extension of the well-known *Heaviside
function H:R→R*, defined by H\left(\tau\right):=\left\{\begin{array}[]{c}1,{\ }\text{{if \ }}\tau\geq 0\\
0,{\ }\text{{if \ }}\tau<0\end{array}\right..
7 Conclusion
The purpose of this work was not to provide a tool to use the concept of
actual infinitesimal as an alternative to the ε\mspace−3.0mu\textsl−δ definition of limit. In fact, we use the
concept of infinitesimal (and the concepts of shadow,
monad, indiscernibility) in the mode of actuality
(in loose terms, the mode ofR, without a
definition of limit), and the usual definition of limit in
the mode of potentiality (in loose terms, the mode ofR). It is our strong conviction that the modes of actuality and potentiality are both necessary (occasionally together, as in
the definition of differentiability) to a Calculus suitable not
only for mathematicians, but also for experimental scientists. We must keep
in mind that physicists and engineers need the concept of limit,
and accept the usual ε\mspace−3.0mu\textsl−δ definition (though they use it
as little as possible, as most mathematicians), but they also want to use
the heuristic and computational power of actual infinitesimal methods.
Five other features of this work are worth mentioning:
c1)The use of explicit actual
infinitesimals.
c2)The local coincidence of the graph of
a function f, differentiable atξ0∈R, with its tangent at(ξ0,f(ξ0)).
c3)The global-local nature of monads of
points.
c4)The set-theoretic and topological
properties of monads of subsets ofR.
c5)The sets we use are those ofZFC (Zermelo-Fraenkel Set Theory with the Axiom of Choice), without any distinction between internal and external sets.
c1) is a positive answer to the uneasiness caused
by the nonexplicit character of nonnull infinitesimals in
Non-standard Analysis (see, for example, Alain Connes’ criticism in
[3],§2, p. 211).
We believe that a generalization of c2) is
instrumental in differential geometry, especially for
the definition of the tangent space to a manifold at a certain
point.
c3) was already used in the differential
treatment of some singularities, but we are convinced of its
usefulness in the treatment of many others, in the area of differential equations. Moreover, the fact that m≈(0) contains the real Hilbert spacel2 is very interesting since this space is isomorphic and isometric to any separable real Hilbert space.
As to c4), the set-theoretic and topological properties of monads of subsets of R seem
to reveal a pattern extensible to other areas of mathematics.
c5) is a positive answer to one major difficulty
encountered by non-standard analysts (especially those who work within the
framework of Internal Set Theory): externalsets.
Although this article concerns the differential calculus, its
fundamental concepts can also be applied to the integral calculus
(the work already done and its developments will be published in a future
article).
References:
[1] J. Bell, A Primer of Infinitesimal Analysis, Cambridge University Press, Cambridge, 1998.
[2] J. Bell, The Continuous and the Infinitesimal in mathematics and philosophy, Polimetrica, Monza, 2006.
[3] A. Connes, Brisure de symétrie spontanée et géométrie du
point de vue spectral, Journal of Geometry and Physics, 23
(1997), 206–234.
[4] K. Hrbaček, Axiomatic foundations for nonstandard analysis, Fund. Math., 98 (1978), 1–19.
[5] K. Hrbaček, Nonstandard set theory, Amer. Math. Monthly,
86 (1979), 659–677.
[6] P. Mancuso, Philosophy of Mathematics & Mathematical Practice
in the Seventeenth Century, Oxford University Press, New York-Oxford, 1996.
[7] I. Moerdijk and G. E. Reyes, Models forSmooth
Infinitesimal Analysis, Springer-
-Verlag, Berlin-Heidelberg-New York-Tokyo, 1991.
[8] E. Nelson, Internal Set Theory: a new approach to Nonstandard Analysis,
Bulletin of the American Mathematical Society, 83 (1977),
1165-1198.
[9] E. Nelson, Radically Elementary Probability Theory, Annals of
Mathematics Studies, PUP, Princeton, New Jersey, 1987.
[10] A. Robinson, Non-standard Analysis, Proc. of the
Royal Academy of Sciences,Amsterdam, ser. A, 64 (1961),
432-440.
[11] A. Robinson, Non-standard Analysis, PUP, Princeton, New Jersey,
rev.ed. 1996.
[12] S. Sambursky, Physics of the Stoics, PUP, Princeton, New
Jersey, first paperback ed. 1987.