Search NASA⌕ Search

SEARCH · Search NASA

Results for “Proof Theory and Constructive Mathematics”

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.

7 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Improving modular bootstrap bounds with integrality

We propose methods that efficiently impose integrality — i.e., the condition that the coefficients of characters in the partition function must be integers — into numerical modular bootstrap. We demonstrate the method with a number of examples where it can be used to strengthen modular bootstrap results. First, we show that, with a mild extra assumption, imposing integrality improves the bound on the maximal allowed gap in dimensions of operators in theories with a U(1) c symmetry at c = 3, and reduces it to the value saturated by the SU(4) 1 WZW model point of c = 3 Narain lattices moduli space. Second, we show that our method can be used to eliminate all but a discrete set of points saturating the bound from previous Virasoro modular bootstrap results. Finally, when central charge is close to 1, we can slightly improve the upper bound on the scaling dimension gap.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1998

Cooperation Among Theorem Provers

This is a final report, which supports NASA's PECSEE (Persistent Cognizant Software Engineering Environment) effort and complements the Kestrel Institute project "Inference System Integration via Logic Morphism". The ultimate purpose of the project is to develop a superior logical inference mechanism by combining the diverse abilities of multiple cooperating theorem provers. In many years of research, a number of powerful theorem-proving systems have arisen with differing capabilities and strengths. Resolution theorem provers (such as Kestrel's KITP or SRI's, SNARK) deal with first-order logic with equality but not the principle of mathematical induction. The Boyer-Moore theorem prover excels at proof by induction but cannot deal with full first-order logic. Both are highly automated but cannot accept user guidance easily. The PVS system (from SRI) in only automatic within decidable theories, but it has well-designed interactive capabilities: furthermore, it includes higher-order logic, not just first-order logic. The NuPRL system from Cornell University and the STeP system from Stanford University have facilities for constructive logic and temporal logic, respectively - both are interactive. It is often suggested - for example, in the anonymous "QED Manifesto"-that we should pool the resources of all these theorem provers into a single system, so that the strengths of one can compensate for the weaknesses of others, and so that effort will not be duplicated. However, there is no straightforward way of doing this, because each system relies on its own language and logic for its success. Thus. SNARK uses ordinary first-order logic with equality, PVS uses higher-order logic. and NuPRL uses constructive logic. The purpose of this project, and the companion project at Kestrel, has been to use the category-theoretic notion of logic morphism to combine systems with different logics and languages. Kestrel's SPECWARE system has been the vehicle for the implementation.

Waldinger, Richard J.↗
NASA NTRS2009

Testing First-Order Logic Axioms in AutoCert

AutoCert [2] is a formal verification tool for machine generated code in safety critical domains, such as aerospace control code generated from MathWorks Real-Time Workshop. AutoCert uses Automated Theorem Provers (ATPs) [5] based on First-Order Logic (FOL) to formally verify safety and functional correctness properties of the code. These ATPs try to build proofs based on user provided domain-specific axioms, which can be arbitrary First-Order Formulas (FOFs). These axioms are the most crucial part of the trusted base, since proofs can be submitted to a proof checker removing the need to trust the prover and AutoCert itself plays the part of checking the code generator. However, formulating axioms correctly (i.e. precisely as the user had really intended) is non-trivial in practice. The challenge of axiomatization arise from several dimensions. First, the domain knowledge has its own complexity. AutoCert has been used to verify mathematical requirements on navigation software that carries out various geometric coordinate transformations involving matrices and quaternions. Axiomatic theories for such constructs are complex enough that mistakes are not uncommon. Second, adjusting axioms for ATPs can add even more complexity. The axioms frequently need to be modified in order to have them in a form suitable for use with ATPs. Such modifications tend to obscure the axioms further. Thirdly, speculating validity of the axioms from the output of existing ATPs is very hard since theorem provers typically do not give any examples or counterexamples.

Ahn, Ki Yung↗
NASA NTRS1996

The Effect of Gravity Axis Orientation on the Growth of Phthalocyanine Thin Films

Experimentally, many of the functions of electrical circuits have been demonstrated using optical circuits and, in theory, all of these functions may be accomplished using optical devices made of nonlinear optical materials. Actual construction of nonlinear optical devices is one of the most active areas in all optical research being done at this time. Physical vapor transport (PVT) is a promising technique for production of thin films of a variety of organic and inorganic materials. Film optical quality, orientation of microcrystals, and thickness depends critically on type of material, pressure of buffer gas and temperature of deposition. An important but understudied influence on film characteristics is the effect of gravity-driven buoyancy. Frazier, Hung, Paley, Penn and Long have recently reported mathematical modelling of the vapor deposition process and tested the predictions of the model on the thickness of films grown by PVT of 6-(2-methyl-4-nitroanilino)-2,4-hexadiyn-l-ol (DAMNA). In an historic experiment, Debe, et. al. offered definitive proof that copper phthalocyanine films grown in a low gravity environment are denser and more ordered than those grown at 1 g. This work seeks to determine the influence on film quality of gravity driven buoyancy in the low pressure PVT film growth of metal-free phthalocyanine.

Pearson, Earl F.↗
DOE OSTI2024

A retrospective review of von Neumann’s analysis of hidden variables in quantum mechanics

This article reviews the history of J. von Neumann’s analysis of hidden variables in quantum mechanics and the subsequent analysis by others. In his book The Mathematical Foundations of Quantum Mechanics , published in 1932, von Neumann performed an analysis of the consequences of introducing hidden parameters (hidden variables) into quantum mechanics. He arrived at two principal conclusions: first, hidden variables cannot be incorporated into the existing theory of quantum mechanics without major modifications, and second, if they did exist, the theory would have already failed in situations where it has been successfully applied. This analysis has been taken as an “incorrect proof” against the existence of hidden variables, possibly due to a mistranslation of the German word prufen . von Neumann’s so-called proof isn’t even wrong as such a proof does not exist, but it is an examination of the limitations imposed by internal consistency of the Hilbert space formulation of the theory. One of the earliest attempts to eliminate uncertainty, by D. Bohm, requires a major modification of quantum mechanics (observables are not represented by Hermitian operators), which supports von Neumann’s first principal conclusion. However, testing the Bohm theory requires constructing a physically impossible initial state. As such, the theory has no experimental consequences, so W. Pauli referred to it as an “uncashable check”. As there are no observable consequences, the Bohm theory is possibly a counterexample to von Neumann’s second conclusion that hidden variables in particular would have already led to a failure of the theory.

density matrix↗
DOE OSTI2026

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗