Search NASA⌕ Search

SEARCH · Search NASA

Results for “Theorem Proving”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

A new spin on the Weak Gravity Conjecture

The mild form of the Weak Gravity Conjecture states that quantum or higher-derivative corrections should decrease the mass of large extremal charged black holes at fixed charge. This allows extremal black holes to decay, unless protected by a symmetry (such as supersymmetry). We reformulate this conjecture as an integrated condition on the effective stress tensor capturing the effect of quantum or higher-derivative corrections. In addition to charged black holes, we also consider rotating BTZ black holes and show that this condition is satisfied as a consequence of the $\textit{c}$-theorem, proving a spinning version of the Weak Gravity Conjecture. We also apply our results to a five-dimensional boosted black string with higher-derivative corrections. The boosted black string has a BTZ×$S^2$ near-horizon geometry and, after Kaluza-Klein reduction, describes a four-dimensional charged black hole. Combining the spinning and charged Weak Gravity Conjecture we obtain positivity bounds on the five-dimensional Wilson coefficients that are stronger than those obtained from charged black holes alone.

79 ASTRONOMY AND ASTROPHYSICS↗

Geometric Aspects of Analytic Functions

We study a pair of surfaces associated with a function analytic in a domain G, establish relations between the coefficients of the first (second) fundamental quadratic forms of these surfaces and prove theorems on their invariance under conformal transformations.

97 MATHEMATICS AND COMPUTING↗

Formal verification and validation of run-to-completion style state charts using Event-B

State chart notations with ‘run to completion’ semantics are popular with engineers for designing controllers that react to environment events with a sequence of state transitions but lack formal refinement and rigorous verification methods. State chart models are typically used to design complex control systems that respond to environmental triggers with a sequential process. The model is usually constructed at a concrete level and verified and validated using animation techniques relying on human judgement. Event-B, on the other hand, is based on refinement from an initial abstraction and is designed to make formal verification by automatic theorem provers feasible. Abstraction and formal verification provide greater assurance that critical (e.g. safety or security) properties are not violated by the control system. In this paper, we introduce a notion of refinement into a ‘run to completion’ state chart modelling notation and leverage Event-B’s tool support for theorem proving. We describe the difficulties in translating ‘run to completion’ semantics into Event-B refinements and suggest a solution. We illustrate our approach and show how models can be validated at different refinement levels using our scenario checker animation tools. We show how critical invariant properties can be verified by proof despite the reactive nature of the system and how behavioural aspects of the system can be verified by testing the expected reactions using a temporal logic, model checking approach. To verify liveness, we outline a proof that the run to completion is deadlock-free and converges to complete the run.

97 MATHEMATICS AND COMPUTING↗

Triangular set functions and the Nikodym, Brooks-Jewett, and Vitali-Hahn-Saks theorems on convergent sequences of measures

We consider triangular set functions which have no escaping load and are defined on classes of sets which are closed with respect to the union of at most countably many disjoint sets in the given class. We refine and generalize the Nikodym, Brooks-Jewett, and Vitali-Hahn-Saks theorems to these classes of set functions in a nontrivial manner; these include quasi-Lipschitz and finitely additive set functions, vector-valued measures, semimeasures, and outer measures. As immediate consequences of the theorems proved here we obtain a series of statements concerning the extension of properties of set functions, such as convergence, compactness, uniform absolute continuity and absolute continuity, from a ring of sets to the {sigma}-ring generated by the ring. Bibliography: 18 titles.

97 MATHEMATICS AND COMPUTING↗

The geometry of electron wave functions

To each wave function we assign a codimension-two submanifold in Euclidean space. We study the case of the wave function of a single electron in the hydrogen atom or other hydrogen-type atoms with quantum numbers n, l, m in detail. We prove theorems describing the behaviour of the scalar and sectional curvature of the constructed submanifold, depending on the quantum numbers. We also consider the external geometry of the submanifold. Bibliography: 9 titles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The distribution of the zeros of the Hermite-Padé polynomials for a pair of functions forming a Nikishin system

The distribution of the zeros of the Hermite-Padé polynomials of the first kind for a pair of functions with an arbitrary even number of common branch points lying on the real axis is investigated under the assumption that this pair of functions forms a generalized complex Nikishin system. It is proved (Theorem 1) that the zeros have a limiting distribution, which coincides with the equilibrium measure of a certain compact set having the S-property in a harmonic external field. The existence problem for S-compact sets is solved in Theorem 2. The main idea of the proof of Theorem 1 consists in replacing a vector equilibrium problem in potential theory by a scalar problem with an external field and then using the general Gonchar-Rakhmanov method, which was worked out in the solution of the '1/9'-conjecture. The relation of the result obtained here to some results and conjectures due to Nuttall is discussed. Bibliography: 51 titles.

97 MATHEMATICS AND COMPUTING↗

Multiparameter Estimation in Networked Quantum Sensors

We introduce a general model for a network of quantum sensors, and we use this model to consider the question: When can entanglement between the sensors, and/or global measurements, enhance the precision with which the network can measure a set of unknown parameters? We rigorously answer this question by presenting precise theorems proving that for a broad class of problems there is, at most, a very limited intrinsic advantage to using entangled states or global measurements. Moreover, for many estimation problems separable states and local measurements are optimal, and can achieve the ultimate quantum limit on the estimation uncertainty. This immediately implies that there are broad conditions under which simultaneous estimation of multiple parameters cannot outperform individual, independent estimations. Our results apply to any situation in which spatially localized sensors are unitarily encoded with independent parameters, such as when estimating multiple linear or non-linear optical phase shifts in quantum imaging, or when mapping out the spatial profile of an unknown magnetic field. We conclude by showing that entangling the sensors can enhance the estimation precision when the parameters of interest are global properties of the entire network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evolution of a minimal parallel programming model

Here, we take a historical approach to our presentation of self-scheduled task parallelism, a programming model with its origins in early irregular and nondeterministic computations encountered in automated theorem proving and logic programming. We show how an extremely simple task model has evolved into a system, asynchronous dynamic load balancing (ADLB), and a scalable implementation capable of supporting sophisticated applications on today’s (and tomorrow’s) largest supercomputers; and we illustrate the use of ADLB with a Green’s function Monte Carlo application, a modern, mature nuclear physics code in production use. Our lesson is that by surrendering a certain amount of generality and thus applicability, a minimal programming model (in terms of its basic concepts and the size of its application programmer interface) can achieve extreme scalability without introducing complexity.

97 MATHEMATICS AND COMPUTING↗

Investigations of Beam Dynamics Issues at Current and Future Hadron Accelerators (Final Report)

There is a synergy between the fields of Beam Dynamics (BD) in modern particle accelerators and Applied Mathematics (AMa). We have formulated significant problems in BD and have developed and applied tools within the contexts of dynamical systems, topological methods, numerical analysis and scientific computing, probability and stochastic processes, and mathematical statistics. We summarize the three main areas of our AMa work since 2011. First, we continued our study of Vlasov-Maxwell systems. Previously, we developed a state of the art algorithm and code (VM3@A) to calculate coherent synchrotron radiation in single pass systems. In this cycle we carefully analyzed the major expense, namely the integral-over-history (IOH), and developed two approaches to speed up integration. The first strategy uses a representation of the Bessel function J0 in terms of exponentials. The second relies on “local sequences” developed recently for radiation boundary conditions, which are used to reduce computational domains. Although motivated by practicality, both strategies involve interesting and rather deep analysis and approximation theory. As an alternative to VM3@A, we are integrating Maxwell’s equations by a time-stepping method, bypass- ing the IOH, using a Discontinuous Galerkin (DG) method. DG is a generalization of Finite Element and Finite Volume methods. It is spectrally convergent, unlike the commonly used Finite Difference methods, and can handle complicated vacuum chamber geometries. We have applied this in several contexts and have obtained very nice results including an explanation of an experiment at the Canadian Light Source, where the geometry is quite complex. Second, we continued our study of spin dynamics in storage rings. There is much current and proposed activity where spin polarized beams are being used in testing the Standard Model and its modifications. Our work has focused on invariant spin fields (ISFs) and amplitude dependent spin tunes (ADSTs), which are essential for estimating beam polarization. Several algorithms have been developed since the 1980s for computing the ISF, among them the Heinemann- Hoffstaetter method of stroboscopic averaging (SA) which is implemented in the code SPRINT. SA, which computes the ISF by using spin tracking data, can find the ISF to computer precision if it exists and thus can give evidence for existence of the ISF. Central to our work is resolving the ISF conjecture, which says that, off orbital resonance, an ISF exists. Thus Heinemann developed, in his 2010 PhD thesis, a new framework which unifies and generalizes the notions of ISF and ADST by using bundle theory. This lead to a long paper which was a major collaborative effort during the recent cycle. In a nutshell, our bundle approach elegantly unifies the dynamics of spin-1/2 and spin-1 particles, e.g., protons and deuterons. In fact it is well known that these two kinds of dynamics are driven by the same spin transfer matrix and in our approach one sees the deeper reason for this: the spin transfer matrix carries the natural dynamics of a principal bundle whereas the difference between the spin-1/2 and spin-1 dynamics lies in their different geometrical situation, i.e., different underlying associated bundles. Thus one arrives at new results for polarized beams, among them the Invariant Reduction Theorem (IRT) and the Cross Section Theorem (CST). The IRT gives a necessary and sufficient condition for the ISF to exist. The SA technique revealed, 20 years ago, that each ISF can be viewed as a complex agglomerate of spin tracking data. The bundle approach goes one step further by using the IRT and the CST to glue spin tracking data into agglomerates which are candidates for ISFs. We gain insight because the “good” agglomerates, in the presence of an ISF, are very different from the “bad” ones. Finally we mention that the bundle approach has analogies to the approach used in geometrical Yang-Mills theory. Third, we studied X-Ray Free Electron Lasers (FELs), which are electron accelerators producing coherent undulator radiation over a wide range of frequencies from microwaves to x-rays. The photon beams produced in FEL undulators are used to study material samples in biology, material science etc. We developed a mathematical analysis, based on the 6D Lorentz system, of energetic electrons moving through a planar undulator excited by a Maxwell traveling wave field of wavelength λ. Our Method of Averaging perturbation analysis yields non-resonant and near-to-resonant normal form approximations as a function of λ, which we present in two averaging theorems. We prove the theorems in detail, error bounds and giving a tutorial on mathematically rigorous perturbation theory in a context where proofs are easily understood. To our knowledge the planar problem has not been analyzed with the generality here nor has the standard FEL pendulum system, which appears on resonance, been derived with error bounds. In addition to the domains of validity of the normal forms we obtain new insights that require further study, including a more general low gain theory. With a firm foundation in the non-collective case above we are studying the 3D collective case from start up from noise to high gain and saturation. We have formulated the noise start up as a problem of going from the microscopic Klimontovich-Maxwell to the macroscopic Vlasov-Maxwell with a Vlasov correction term. In the 1D setting, we seek an alternative to the phenomenological Vlasov approach which models shot noise by a perturbation on an initial “smooth” density. The 1D wave equation with a Klimontovich source is often the starting point for the 1D FEL high gain theory. We have a new representation of solutions which may lead to new insights.

43 PARTICLE ACCELERATORS↗

COGENT programming manual

COGENT /COmpiler and GENeralized Translator/ programming system is a compiler whose input language enables a description of symbolic and linguistic manipulation algorithms. Primarily for use as a compiler-compiler, it is also applicable to algebraic manipulation, mechanical theorem proving, and heuristic programming.

Reynolds, J. C.↗

Computation of group table alphanumeric display

Computer program, using only group elements as input data, provides machine computation of group tables used for proving theorems and algorithms of finite groups. Program is written for second generation computers.

Allen, G. P.↗

Toward automatic program synthesis

Automatic computer program synthesis based on theorem proving approach for construction of recursive and iterative programs operating on natural numbers, lists and trees

Manna, Z.↗

Research and applications: Artificial intelligence

A program of research in the field of artificial intelligence is presented. The research areas discussed include automatic theorem proving, representations of real-world environments, problem-solving methods, the design of a programming system for problem-solving research, techniques for general scene analysis based upon television data, and the problems of assembling an integrated robot system. Major accomplishments include the development of a new problem-solving system that uses both formal logical inference and informal heuristic methods, the development of a method of automatic learning by generalization, and the design of the overall structure of a new complete robot system. Eight appendices to the report contain extensive technical details of the work described.

Raphael, B.↗

Properties of heuristic search strategies

A directed graph is used to model the search space of a state space representation with single input operators, an AND/OR is used for problem reduction representations, and a theorem proving graph is used for state space representations with multiple input operators. These three graph models and heuristic strategies for searching them are surveyed. The completeness, admissibility, and optimality properties of search strategies which use the evaluation function f = (1 - omega)g = omega(h) are presented and interpreted using a representation of the search process in the plane. The use of multiple output operators to imply dependent successors, and thus obtain a formalism which includes all three types of representations, is discussed.

Vanderbrug, G. J.↗

QA4, a language for artificial intelligence.

Introduction of a language for problem solving and specifically robot planning, program verification, and synthesis and theorem proving. This language, called question-answerer 4 (QA4), embodies many features that have been found useful for constructing problem solvers but have to be programmed explicitly by the user of a conventional language. The most important features of QA4 are described, and examples are provided for most of the material introduced. Language features include backtracking, parallel processing, pattern matching, set manipulation, and pattern-triggered function activation. The language is most convenient for use in an interactive way and has extensive trace and edit facilities.

Derksen, J. A. C.↗

Global parallel unification for large question-answering systems

An efficient means of storing data in a first-order predicate calculus theorem-proving system is described. The data structure is oriented for large scale question-answering (QA) systems. An algorithm is outlined which uses the data structure to unify a given literal in parallel against all literals in all clauses in the data base. The data structure permits a compact representation of data within a QA system. Some suggestions are made for heuristics which can be used to speed-up the unification algorithm in systems.

Auguston, J. G.↗