scholarly journals A monadic, functional implementation of real numbers

2007 ◽  
Vol 17 (1) ◽  
pp. 129-159 ◽  
Author(s):  
RUSSELL ÓCONNOR
Keyword(s):  
Real Number ◽  
Large Scale ◽  
Metric Spaces ◽  
Continuous Functions ◽  
Proof Assistants ◽  
Elementary Functions ◽  
Real Numbers ◽  
Mathematical Proofs ◽  
Regular Functions ◽  
Regular Sequences

Large scale real number computation is an essential ingredient in several modern mathematical proofs. Because such lengthy computations cannot be verified by hand, some mathematicians want to use software proof assistants to verify the correctness of these proofs. This paper develops a new implementation of the constructive real numbers and elementary functions for such proofs by using the monad properties of the completion operation on metric spaces. Bishop and Bridges's notion (Bishop and Bridges 1985) of regular sequences is generalised to what I call regular functions, which form the completion of any metric space. Using the monad operations, continuous functions on length spaces (which are a common subclass of metric spaces) are created by lifting continuous functions on the original space. A prototype Haskell implementation has been created. I believe that this approach yields a real number library that is reasonably efficient for computation, and still simple enough to verify its correctness easily.

scholarly journals Regular variation for measures on metric spaces

2006 ◽  
Vol 80 (94) ◽  
pp. 121-140 ◽  
Author(s):  
Henrik Hult ◽  
Filip Lindskog
Keyword(s):  
Regular Variation ◽  
Metric Spaces ◽  
General Setting ◽  
Continuous Functions ◽  
Separable Space ◽  
Real Numbers ◽  
Space Of Continuous Functions ◽  
Relative Compactness ◽  
Borel Measures

The foundations of regular variation for Borel measures on a complete separable space S, that is closed under multiplication by nonnegative real numbers, is reviewed. For such measures an appropriate notion of convergence is presented and the basic results such as a Portmanteau theorem, a mapping theorem and a characterization of relative compactness are derived. Regular variation is defined in this general setting and several statements that are equivalent to this definition are presented. This extends the notion of regular variation for Borel measures on the Euclidean space Rd to more general metric spaces. Some examples, including regular variation for Borel measures on Rd, the space of continuous functions C and the Skorohod space D, are provided.

On existence result of a class of nonlinear integral equation

Filomat ◽  
2017 ◽  
Vol 31 (11) ◽  
pp. 3593-3597
Author(s):  
Ravindra Bisht
Keyword(s):  
Integral Equation ◽  
Fixed Point ◽  
Existence And Uniqueness ◽  
Existence Result ◽  
Nonlinear Integral Equation ◽  
Continuous Functions ◽  
Concave Functions ◽  
Real Numbers ◽  
Fixed Point Techniques ◽  
Uniqueness Of A Solution

Combining the approaches of functionals associated with h-concave functions and fixed point techniques, we study the existence and uniqueness of a solution for a class of nonlinear integral equation: x(t) = g1(t)-g2(t) + ? ?t,0 V1(t,s)h1(s,x(s))ds + ? ?T,0 V2(t,s)h2(s,x(s))ds; where C([0,T];R) denotes the space of all continuous functions on [0,T] equipped with the uniform metric and t?[0,T], ?,? are real numbers, g1, g2 ? C([0, T],R) and V1(t,s), V2(t,s), h1(t,s), h2(t,s) are continuous real-valued functions in [0,T]xR.

scholarly journals A Generalization of Strassen’s Theorem on Preordered Semirings

Order ◽  
2021 ◽  
Author(s):  
Péter Vrana
Keyword(s):  
Compact Hausdorff Space ◽  
Polynomial Growth ◽  
Hausdorff Space ◽  
Continuous Functions ◽  
Equivalent Condition ◽  
Real Numbers ◽  
Asymptotic Spectrum ◽  
Ring Of Continuous Functions ◽  
Archimedean Property ◽  
Locally Compact Hausdorff Space

AbstractGiven a commutative semiring with a compatible preorder satisfying a version of the Archimedean property, the asymptotic spectrum, as introduced by Strassen (J. reine angew. Math. 1988), is an essentially unique compact Hausdorff space together with a map from the semiring to the ring of continuous functions. Strassen’s theorem characterizes an asymptotic relaxation of the preorder that asymptotically compares large powers of the elements up to a subexponential factor as the pointwise partial order of the corresponding functions, realizing the asymptotic spectrum as the space of monotone semiring homomorphisms to the nonnegative real numbers. Such preordered semirings have found applications in complexity theory and information theory. We prove a generalization of this theorem to preordered semirings that satisfy a weaker polynomial growth condition. This weaker hypothesis does not ensure in itself that nonnegative real-valued monotone homomorphisms characterize the (appropriate modification of the) asymptotic preorder. We find a sufficient condition as well as an equivalent condition for this to hold. Under these conditions the asymptotic spectrum is a locally compact Hausdorff space satisfying a similar universal property as in Strassen’s work.

scholarly journals Fixed Point of Interpolative Rus–Reich–Ćirić Contraction Mapping on Rectangular Quasi-Partial b-Metric Space

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 32
Author(s):  
Pragati Gautam ◽  
Luis Manuel Sánchez Ruiz ◽  
Swapnil Verma
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Real Number ◽  
Metric Space ◽  
Contraction Mapping ◽  
Metric Spaces ◽  
Rectangular Metric Space ◽  
New Type ◽  
Symmetry Requirement ◽  
Definition Of

The purpose of this study is to introduce a new type of extended metric space, i.e., the rectangular quasi-partial b-metric space, which means a relaxation of the symmetry requirement of metric spaces, by including a real number s in the definition of the rectangular metric space defined by Branciari. Here, we obtain a fixed point theorem for interpolative Rus–Reich–Ćirić contraction mappings in the realm of rectangular quasi-partial b-metric spaces. Furthermore, an example is also illustrated to present the applicability of our result.

scholarly journals Finding of principle square root of a real number by using interpolation method

2018 ◽  
Vol 7 (1) ◽  
pp. 77-83
Author(s):  
Rajendra Prasad Regmi
Keyword(s):  
Real Number ◽  
Positive Real Number ◽  
Interpolation Method ◽  
Square Root ◽  
Real Numbers ◽  
Positive Real ◽  
Unknown Quantity ◽  
Square Roots

There are various methods of finding the square roots of positive real number. This paper deals with finding the principle square root of positive real numbers by using Lagrange’s and Newton’s interpolation method. The interpolation method is the process of finding the values of unknown quantity (y) between two known quantities.

Ultradiversities and their spherical completeness

2020 ◽  
Vol 26 (2) ◽  
pp. 231-240
Author(s):  
Gholamreza H. Mehrabani ◽  
Kourosh Nourouzi
Keyword(s):  
Real Number ◽  
Finite Subset ◽  
Positive Real Number ◽  
Metric Spaces ◽  
Nonexpansive Mappings ◽  
Ultrametric Spaces ◽  
Positive Real

AbstractDiversities are a generalization of metric spaces which associate a positive real number to every finite subset of the space. In this paper, we introduce ultradiversities which are themselves simultaneously diversities and a sort of generalization of ultrametric spaces. We also give the notion of spherical completeness for ultradiversities based on the balls defined in such spaces. In particular, with the help of nonexpansive mappings defined between ultradiversities, we show that an ultradiversity is spherically complete if and only if it is injective.

scholarly journals ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS

2009 ◽  
Vol 51 (2) ◽  
pp. 243-252
Author(s):  
ARTŪRAS DUBICKAS
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Real Number ◽  
Constant Independent ◽  
Integer Sequences ◽  
Real Numbers ◽  
Complexity Function ◽  
Linear Maps ◽  
Coprime Integers ◽  
Positive Integers

AbstractLetx0<x1<x2< ⋅⋅⋅ be an increasing sequence of positive integers given by the formulaxn=⌊βxn−1+ γ⌋ forn=1, 2, 3, . . ., where β > 1 and γ are real numbers andx0is a positive integer. We describe the conditions on integersbd, . . .,b0, not all zero, and on a real number β > 1 under which the sequence of integerswn=bdxn+d+ ⋅⋅⋅ +b0xn,n=0, 1, 2, . . ., is bounded by a constant independent ofn. The conditions under which this sequence can be ultimately periodic are also described. Finally, we prove a lower bound on the complexity function of the sequenceqxn+1−pxn∈ {0, 1, . . .,q−1},n=0, 1, 2, . . ., wherex0is a positive integer,p>q> 1 are coprime integers andxn=⌈pxn−1/q⌉ forn=1, 2, 3, . . . A similar speculative result concerning the complexity of the sequence of alternatives (F:x↦x/2 orS:x↦(3x+1)/2) in the 3x+1 problem is also given.

Cooperative Coevolution with Formula-Based Variable Grouping for Large-Scale Global Optimization

2018 ◽  
Vol 26 (4) ◽  
pp. 569-596 ◽  
Author(s):  
Yuping Wang ◽  
Haiyan Liu ◽  
Fei Wei ◽  
Tingting Zong ◽  
Xiaodong Li
Keyword(s):  
Global Optimization ◽  
Objective Function ◽  
Real World ◽  
Large Scale ◽  
Divide And Conquer ◽  
Group Method ◽  
Objective Functions ◽  
Elementary Functions ◽  
Cooperative Coevolution ◽  
Solution Quality

For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered an effective strategy to decompose the problem into smaller subproblems, each of which can then be solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem. In such cases, these variable grouping methods do not make a direct use of the formula of the objective function. However, it can be argued that many real-world problems are white-box problems, that is, the formulas of objective functions are often known a priori. These formulas of the objective functions provide rich information which can then be used to design an effective variable group method. In this article, a formula-based grouping strategy (FBG) for white-box problems is first proposed. It groups variables directly via the formula of an objective function which usually consists of a finite number of operations (i.e., four arithmetic operations “[Formula: see text]”, “[Formula: see text]”, “[Formula: see text]”, “[Formula: see text]” and composite operations of basic elementary functions). In FBG, the operations are classified into two classes: one resulting in nonseparable variables, and the other resulting in separable variables. In FBG, variables can be automatically grouped into a suitable number of non-interacting subcomponents, with variables in each subcomponent being interdependent. FBG can easily be applied to any white-box problem and can be integrated into a cooperative coevolution framework. Based on FBG, a novel cooperative coevolution algorithm with formula-based variable grouping (so-called CCF) is proposed in this article for decomposing a large-scale white-box problem into several smaller subproblems and optimizing them respectively. To further enhance the efficiency of CCF, a new local search scheme is designed to improve the solution quality. To verify the efficiency of CCF, experiments are conducted on the standard LSGO benchmark suites of CEC'2008, CEC'2010, CEC'2013, and a real-world problem. Our results suggest that the performance of CCF is very competitive when compared with those of the state-of-the-art LSGO algorithms.

Sign in / Sign up

Export Citation Format

Share Document