Entropy Maximizations on Electron Density

Incomplete and imperfect data characterize the problem of constructing electron density representations from experimental information. One fundamental concern is identification of the proper protocol for including new information at any stage of a density reconstruction. An axiomatic approach developed in other fields specifies entropy maximization as the desired protocol. In particular, if new data are used to modify a prior charge density distribution without adding extraneous prejudice, the new distribution must both agree with all the data, new and old, and be a function of maximum relative entropy. The functional form of relative entropy is s = - r In (r/t), where r and t respectively refer to new and prior distributions normalized to a common scale.Entropy maximization has been used to deal with certain aspects of the phase problem of X-ray diffraction. Varying degrees of success have marked the work which may be roughly assigned to categories as direct methods, data reduction and analysis, and image enhancement. Much of the work has been expressed in probabilistic language, although image enhancement has been somewhat more physical or geometric in description. Whatever the language, entropy maximization is a specific and deterministic functional manipulation. A recent advance has been the description of an algorithm which, quite deterministically, adjusts a prior positive charge density distribution to agree exactly with a specified subset of structure-factor moduli by a constrained entropy maximization.Entropy on an N-representable one-particle density matrix is well defined. The entropy is the expected form, and it is a simple function of the one-matrix eigenvalues which all must be non-negative. Relationships between the entropy functional and certain properties of a one-matrix are discussed, as well as a conjecture concerning the physical interpretation of entropy. Throughout this work reference is made to informational entropy, not the entropy of thermodynamics.