A Theorem

The following identity [4-6,20,21], which indicates the invariance of a Slater determinantal wavefunction to a unitary transformation of a pair of occupied Ms = +1/2 spin or Ms = -1/2 spin orbitals, will be used on numerous occasions in subsequent sections of this Chapter. 

---

Moser J 1976 Periodic orbits near an equilibrium and a theorem by Alan Weinstein Comm. Pure Appl. Math. 29 727... 

Mathematically equation (A2.1.25) is the direct result of the statement that U is homogeneous and of first degree in the extensive properties S, V and n.. It follows, from a theorem of Euler, that... 

Fixman M 1974 Classical statistical mechanics of constraints a theorem and application to polymers Proc. Natl Acad. Sc/. 71 3050-3... 

The premise behind DFT is that the energy of a molecule can be determined from the electron density instead of a wave function. This theory originated with a theorem by Hoenburg and Kohn that stated this was possible. The original theorem applied only to finding the ground-state electronic energy of a molecule. A practical application of this theory was developed by Kohn and Sham who formulated a method similar in structure to the Hartree-Fock method. 

Strictly, shear occurs not just on the shear planes we have drawn, but on a myriad of 45° planes near the indenter. If our assumed geometry for slip is wrong it can be shown rigorously by a theorem called the upper-bound theorem that the value we get for F at yield - the so-called limit load - is always on the high side.)... 

In standard quantum-mechanical molecular structure calculations, we normally work with a set of nuclear-centred atomic orbitals Xi< Xi CTOs are a good choice for the if only because of the ease of integral evaluation. Procedures such as HF-LCAO then express the molecular electronic wavefunction in terms of these basis functions and at first sight the resulting HF-LCAO orbitals are delocalized over regions of molecules. It is often thought desirable to have a simple ab initio method that can correlate with chemical concepts such as bonds, lone pairs and inner shells. A theorem due to Fock (1930) enables one to transform the HF-LCAOs into localized orbitals that often have the desired spatial properties. 

That these are the only two possible fates of voting-rule systems is due to a theorem by Goles [goles85] it is discussed in chapter 5. 

A theorem which, at first sight, does not seem to be very closely related to Polya s Theorem, but which in fact has much affinity with it, is the superposition theorem that appeared in my doctoral thesis [ReaR58] and later in [ReaR59,60]. The general problem to which it applies is the following. Consider an ordered set of k permutation groups of degree , say G. G. . and the set of all A -ads... 

CayA89 Cayley, A. A theorem on trees. Quar. J. Pure Appl. Math. 23 (1889) 376-378. 

ReaR68a Read, R. C. Some applications of a theorem of de Bruijn. 

The fact that an exact density functional exists is known from a theorem proved by Hohenberg and Sham and Kohn. However, this is a non-constructive proof since it does not actually give the form of the exact functional. DFT theorists must try to approximate this functional as well as they can. 

It is difficult to point to the basic reason why the average-potential model is not better applicable to metallic solutions. Shimoji60 believes that a Lennard-Jones 6-12 potential is not adequate for metals and that a Morse potential would give better results when incorporated in the same kind of model. On the other hand, it is possible that the main trouble is that metal solutions do not obey a theorem of corresponding states. More specifically, the interaction eAB(r) may not be expressible by the same function as for the pure components because the solute is so strongly modified by the solvent. This point of view is supported by considerations of the electronic models of metal solutions.46 The idea that the solvent strongly modifies the solute metal is reached also through a consideration of the quasi-chemical theory applied to dilute solutions. This is the topic that we consider next. 

Turning now to global methods, the more recent developments of the method of Bernoulli are based upon a theorem of Konig, and generalizations by Hadamard. The essential theorem is sufficiently well illustrated by the following special case let/( ) be analytic (not necessarily a polynomial) over some circular disk centered at the origin, and in this... 

The results just obtained are special cases of a theorem that shows how a large class of time averages can be calculated in terms of the distribution function. Before demonstrating this theorem, it will be convenient for us to first discuss some useful properties of distribution functions. The most important of these are... 

While the matrix R does not explicitly involve the axis of rotation along which e extends, nor the angle of rotation 6, it is known (from a theorem of Euler s) that every R is equivalent to a single rotation definable geometrically by an e and a 0. 

Taking the hermitian conjugate of this also yields a theorem ... 

The normal substances, however, really exhibit small deviations which are all the greater the more complex is the molecule of the substance. The theory of van der Waals, or in fact any hypothesis from which a theorem of corresponding states could be derived, assumes however that the transition from the gaseous to the liquid state, as well as the changes of density in either state, result from alterations in the propinquity of molecules which otherwise remain unaltered. Any association or dissociation of the substance would therefore give rise to abnormalities, and in fact the substances which deviate most from the normal relations (e.g.l water, acetic acid) are those which appear, on other grounds, to be associated in the liquid state. In the case of acetic acid the commencement of polymerisation, even in the state of vapour, is evident from the abnormal densities. 

Using the impact approximation presented in Chapter 6, they may easily be found for any rotational band even if rotational-vibrational interaction is nonlinear in J. In 1954 R W. Anderson proved as a theorem [104] that expansion of the spectral wings in inverse powers of frequency is controlled by successive odd derivatives of the correlation function at the origin. In impact approximation the lowest non-zero derivative of this type is the third and therefore asymptotics G/(co) is described by the power expansion [20]... 

Our attention was attracted to the considerable deviation from axial symmetry of the Powell orbital through our application of a theorem about the values of the function along the principal axes. This theorem is that for any d orbital the sum of the squares of the values along the six principal directions is equal to 15. (In our discussion all functions are normalized to 4ir.) This theorem is proved in the following way. Hultgren6 has shown that the most general d orbital, D, can be written as a linear combination of df and dx2-... 

However, in Maxwell s days everyone assumed that there had to be a mechanical underpinning for the theory of EM. Many researchers worked on very detailed hidden variable theories for the EM field, in an attempt to prove that the laws of EM were in fact a theorem in NM, just like Kepler s laws are a theorem in NM. No one noticed that it was impossible to do this, since Maxwell s equations are not Galilei invariant and Newton s laws are. That includes Lorentz who discovered around 1900 that the Maxwell equations are invariant under another transformation that now bears his name. 

Stability with respect to the right-hand side. Recall that in Section 1 we have established a Theorem 3. This is a way of saying that the stability in with respect to the initial data implies the stability with... 

Kreinovich, V. Y., Arbitrary nonlinearity is sufficient to represent all functions by neural networks A theorem. Neural Networks 4, 381 (1991). 

A theorem, which we do not prove here, states that the nonzero eigenvalues of the product AB are identical to those of BA, where A is an nxp and where B is a pxn matrix [3]. This applies in particular to the eigenvalues of matrices of cross-products XX and X which are of special interest in data analysis as they are related to dispersion matrices such as variance-covariance and correlation matrices. If X is an nxp matrix of rank r, then the product X X has r positive eigenvalues in A and possesses r eigenvectors in V since we have shown above that ... 

Density-functional theory is best known as the basis for electronic structure calculations. A variant of this theory can be used to calculate the structure of inhomogeneous fluids [35] the free energy of the fluid is expressed as a functional of the density of the various components a theorem asserts that this functional attains its minimum for the true density profiles. 

A theorem known as Buckingham s it theorem is very pertinent in the context of dimensionless groups. According to this theorem the number of dimensionless groups is equal to the difference between the number of variables and the number of dimensions used to express them. Any physical equation can be expressed in the form... 

The most likely terminal position was given as Eq. (24), where it was mentioned that if the coefficient could be shown to scale linearly with time, then the Onsager regression hypothesis would emerge as a theorem. Hence the small-x behavior of... 

The actual properties of this transformation combined with the convergence properties of molecular electron densities implies analyticity almost everywhere on the compact manifold. Consequently, this four-dimensional representation of the molecular electron density satisfies the conditions of a theorem of analytic continuation, that establishes the holographic properties of molecular electron densities represented on the compact manifold S3. 

This is an obvious adaptation of a theorem given by Feller. The chain takes an average of n/3 steps in the x direction, and the total probability of a walk from (0,, ) to (x>2 ) is the usual Gaussian. A similar modification of another theorem, which is valid for n+l n, is... 

Send verification conditions into a THEOREM PROVER. If all conditions are proven correct, print "PARTIALLY CORRECT WITH RESPECT TO A AND B ". If any verification condition is either proven incorrect by the THEOREM PROVER or else is rejected or not handled by the THEOREM PROVER, return to either 2) or 3), calling for new input. 

Observe that we have in this procedure worked out some of the steps previously left to the THEOREM PROVER, The previous procedure involves having the progranmer select a set of inductive assertions and critical points, and then feed this into the computer parts a VERIFICATION CONDITION GENERATOR and a THEOREM PROVER. In this alternative construction we still need inductive assertions as the nature of the Rule of Iteration for WHILE statements shows. Now the inductive assertions are fed directly into the THEOREM PROVER which las been augmented by the special axioms and rules D0,D1,D2,D3 and D4 in addition to all of the usual arithmetic axioms, rules of inference, rules for handling identities and special axioms for the primitives in question (such as the factorial axioms in our example). In effect the THEOREM PROVER works backwards from the output condition and the various inductive assertions using DO - D3 to find what amounts to path verification conditions -... 

If we try to define a "free" recursion scheme in the same way we defined a free program scheme - every path is an execution sequence - we find that although the intuitive meaning is clear, it is very hard to formalize this concept. Exactly how should one define a "path" in a recursion scheme Or an "execution sequence" It is possible to do so by a moderately complex tree recursion. argument. Instead we will give a "syntactic" definition akin to the one we established as a theorem for program schemes. 

After all this has been done, we apply the usual verification procedure to the main program and to each procedure body - constructing verification conditions and sending them to a THEOREM PROVER just as before. We claim that if all the verification conditions hold for the main program and all procedures, then the whole program is partially correct for A and B. ... 

---