Differentiation in logical form

We introduce a logical theory of differentiation for a real-valued function on a finite dimensional real Euclidean space. A real-valued continuous function is represented by a localic approximable mapping between two semi-strong proximity lattices, representing the two stably locally compact Euclidean spaces for the domain and the range of the function. Similarly, the Clarke subgradient, equivalently the L-derivative, of a locally Lipschitz map, which is non-empty, compact and convex valued, is represented by an approximable mapping. Approximable mappings of the latter type form a bounded complete domain isomorphic with the function space of Scott continuous functions of a real variable into the domain of non-empty compact and convex subsets of the finite dimensional Euclidean space partially ordered with reverse inclusion. Corresponding to the notion of a single-tie of a locally Lipschitz function, used to derive the domain-theoretic L-derivative of the function, we introduce the dual notion of a single-knot of approximable mappings which gives rise to Lipschitzian approximable mappings. We then develop the notion of a strong single-tie and that of a strong knot leading to a Stone duality result for locally Lipschitz maps and Lipschitzian approximable mappings. The strong single-knots, in which a Lipschitzian approximable mapping belongs, are employed to define the Lipschitzian derivative of the approximable mapping. The latter is dual to the Clarke subgradient of the corresponding locally Lipschitz map defined domain-theoretically using strong single-ties. A stricter notion of strong single-knots is subsequently developed which captures approximable mappings of continuously differentiable maps providing a gradient Stone duality for these maps. Finally, we derive a calculus for Lipschitzian derivative of approximable mapping for some basic constructors and show that it is dual to the calculus satisfied by the Clarke subgradient.

[1]  Abbas Edalat,et al.  A Language for Differentiable Functions , 2013, FoSSaCS.

[2]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[3]  Klaus Keimel,et al.  The way-below relation of function spaces over semantic domains , 1998 .

[4]  Abbas Edalat,et al.  Domain theory and differential calculus (functions of one variable) , 2004, Math. Struct. Comput. Sci..

[5]  Steven J. Vickers,et al.  Geometric Logic in Computer Science , 1993, Theory and Formal Methods.

[6]  Michael B. Smyth,et al.  Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.

[7]  Abbas Edalat A Continuous Derivative for Real-Valued Functions , 2007, CiE.

[8]  Thomas Ehrhard,et al.  A convenient differential category , 2010, ArXiv.

[9]  Laurent Regnier,et al.  The differential lambda-calculus , 2003, Theor. Comput. Sci..

[10]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[11]  Achim Jung,et al.  Continuous Domain Theory in Logical Form , 2013, Computation, Logic, Games, and Quantum Foundations.

[12]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[13]  Abbas Edalat,et al.  A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations , 2015, Theor. Comput. Sci..

[14]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[15]  Steven J. Vickers Information Systems for Continuous Posets , 1993, Theor. Comput. Sci..

[16]  S. Vickers Topology via Logic , 1989 .

[17]  Abbas Edalat,et al.  A Computational Model for Multi-variable Differential Calculus , 2005, FoSSaCS.

[18]  Timothy A. Davis,et al.  MATLAB Primer , 1994 .

[19]  Andreas Griewank,et al.  Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition , 2000, Frontiers in applied mathematics.

[20]  Michael B. Smyth,et al.  Effectively given Domains , 1977, Theor. Comput. Sci..

[21]  M. Stone The theory of representations for Boolean algebras , 1936 .

[22]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[23]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[24]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[25]  Yu. S. Ledyaev,et al.  Nonsmooth analysis and control theory , 1998 .

[26]  Philipp Sünderhauf,et al.  On the Duality of Compact vs. Open , 1996 .

[27]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[28]  Robert W. Floyd,et al.  Assigning Meanings to Programs , 1993 .

[29]  K. Ball CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .