the Boltzmann problem
DOCX · 24.4 KB
Open DOCX file
Short working note by Phil dated 12.23.14. It states the general constrained maximization problem, discusses the dimension of the constraint surface (m-s), and asks which area of math it belongs to. He rules out calculus of variations (comparing Goldstein ch. 2) and settles on the Lagrange multiplier method, noting Buck's advanced calculus text as a reference.
AI-written summary; may contain errors.
Extracted text (machine-read; may contain errors)
The Boltzmann Problem PhL 12.23.14
This is a generalization of the Boltzmann problem but I give that name to the title.
Statement of the General Problem. Consider a real function of m real variables,
f(x1, x2, .....xm) . f : Rm → R
We are interested in finding where this function is a maximum. However, there are also a set of s constraint equations:
g1(x1, x2, .....xm) = 0
g2(x1, x2, .....xm) = 0
....
gs(x1, x2, .....xm) = 0
We want the maximum of f, but subject to all the constraints.
Comments:
1. Each constraint equation is a surface of dimension of dimension m-1 which exists within the larger space Rm. For example, we could rewrite a constraint equations as xm = Gi(x1, x2, .....xm-1) so that Gi: Rm-1 → R. For each choice of x1, x2, .....xm-1 values, there is a unique xm (just assume for now), and that is your surface.
2. Suppose there are only two constraint equations g1 and g2 each defining its own m-1 dimensional surface in Rm. In general, the locus of points in Rm on which both these constraints are met is a surface of m-2 dimensions. For example, if g1 and g2 are linear constraints, each one defines a hyperplane, and then both constraints are met on the intersection of those two hyperplanes, which is a hyperplane of dimension m-2. If we had m = 3, then g1 and g2 would define actual planes in 3D space, and their intersection is a line which is a surface of dimension m-2 = 3-2 = 1.
3. If there are s constraint equations, then it seems that the fully constrained surface would be of dimension m - s. So we certainly need to have s ≤ m in order to have a non-null solution surface of constraint.
Question: Where in the mathematical house of many mansions does this problem lie? Perhaps the subject is calculus of variations. I have seen other situations where you might want to maximize things like "the action" in a physics problem, or perhaps you want to minimize some error. In the Boltzmann problem we happen to want to find the maximum number of "states" available to a system of m particles. My PC math world does not have an entry for calculus of variations.
Goldstein Chapter 2. This is on variational principles, but we are there trying to find a set of function solutions qi(t) [ the generalized coordinates] which cause a certain integral to be minimized. That leads to the Lagrange equations of motion. But in our Boltzmann problem, we are not trying to find any functions like qi(t). We just have a simple "geometry problem" of finding the max of a function subject to a set of constraints. So I don't think we have a fit here. So "calculus of variations" is not the right topic.
Lagrange Multiplier Method. Here is wiki right off the bat,
So it appears this is the "box" into which this problem falls. Notice that we have equality constraints and not inequality constraints. So this wiki page is going to give a reasonable summary I think. But do I already have this in some book somewhere? Yes, Buck has stuff on this subject, which is referred to as "Extremal properties of functions of several variables" on page 349. Have I ever really read this calculus book? Well, it was the text of Math 105a "advanced calculus" at Harvard Spring 1968 when I was a Sophomore.
Maybe I should do some work in this book just on general principles.