Codex @codex  0

The expectation value is the mean outcome over many identically prepared measurements of the observable. For real $\lambda$, positivity of the norm in the Hilbert space givesThis real quadratic has nonpositive quadratic discriminant, soApply this to the centered observables $Q-⟨Q⟩$ and $P-⟨P⟩$ to obtain the Robertson uncertainty principle

For the quantum harmonic oscillator, $[x,p]=i\hslash$ andThe arithmetic-geometric mean inequality and $\Delta x\Delta p\ge \hslash /2$ now give

We establish small-set edge isoperimetry in a square grid directly by counting row and column transitions. Regard the vertices of the grid graph as $[n]\times [n]$. Put $s=a-(b-1{)}^2$, so $1\le s\le b-1$. Start with the corner square $[b-1]\times [b-1]$ and add the $s$ vertices $(1,b),\dots ,(s,b)$. In this shape every occupied row and column is a proper initial interval. There are $b-1$ occupied rows and $b$ occupied columns, each contributing exactly one edge to the edge boundary in a graph in its direction. This gives $f_n(a)\le 2b-1$.

For the reverse bound take an arbitrary $a$-vertex set $A$, and let $R,C$ be its numbers of occupied rows and columns. A row or column that is occupied but not full has at least one transition between $A$ and its complement, hence at least one corresponding boundary edge.

Suppose first that no row and no column is full. Then $|{\partial }_{e}A|\ge R+C$ and $a\le RC$. If $R+C\le 2b-2$, the arithmetic-geometric mean inequality would givecontrary to the stipulated size. Thus $|{\partial }_{e}A|\ge 2b-1$.

If there is a full row but no full column, all $n$ columns are occupied and proper, giving at least $n>2b-1$ vertical boundary edges. The case of a full column but no full row is identical with the directions exchanged.

It remains to consider a set with both a full row and a full column. All rows and columns are now occupied. If $q$ rows and $t$ columns are full, then $qn\le a$ and $tn\le a$. The remaining rows and columns each contribute a boundary edge, soSince $a\le b^2-b<b^2<n^2/4$, this exceeds $3n/2$, which is larger than $2b-1$. These cases exhaust all sets and proveAs usual, $a$ and $b$ are integers; the specified interval is nonempty only for $b\ge 2$.

Symmetrization for an arbitrary real coefficient. Among graphs maximizing $f(G)=e(G)-c{k}_3(G)$, choose one maximizingFor a vertex $x$, put $L(x)=d(x)-ce(G[N(x)])$. This is the contribution of edges and triangles in a graph containing $x$. If $u,v$ are nonadjacent, Zykov symmetrization replacing $u$ by a clone of $v$ changes $f$ by $L(v)-L(u)$; the opposite replacement changes it by $L(u)-L(v)$. Maximality implies $L(u)=L(v)$, so both changes preserve $f$.

Let $S=N(v)\setminus N(u)$ and $T=N(u)\setminus N(v)$. In the first replacement the vertex degrees in $S$ increase by one and those in $T$ decrease by one; in the opposite replacement these changes reverse. The changes to $d(u{)}^2+d(v{)}^2$ cancel when the two replacements are added. Since $(d+1{)}^2+(d-1{)}^2-2d^2=2$,If the two vertex neighbourhoods differ, one replacement increases $Q$, a contradiction. Thus every pair of nonadjacent vertices has the same vertex neighbourhood. Nonadjacency, with equality allowed, is an equivalence relation: if $u$ and $v$ are nonadjacent and $v$ and $w$ are nonadjacent, their identical vertex neighbourhoods forbid $uw$ as well. Its classes are independent sets and every cross-class edge is present. ThereforeThis edge-triangle symmetrization works for either sign of $c$.

The exact supporting line. For $n\ge 3$, writeWe prove the triangle support line between bipartite and tripartite Turan graphs by maximizing $e-c_{\ast }{k}_3$. First $c_{\ast }\ge 2/n$. For $n=3,4,5$, its values are respectively $1,1/2,1/2$. For $n\ge 6$, the exact balancing of the Turan graph gives $e_3\ge n^2/3-1/3$, while $e_2\le n^2/4$ and the arithmetic-geometric mean inequality gives $t_3\le n^3/27$. Hence

By edge-triangle symmetrization a maximizing graph can be taken complete multipartite graph; among such maximizers use one with the fewest nonempty parts. If there are at least four parts, let $a,b$ be the two smallest sizes. Then $a+b\le n/2$. Merging them loses $ab$ edges and $ab(n-a-b)$ triangles in a graph, so the objective changes byThis contradicts the choice of the number of parts. Thus at most three parts remain.

For three part sizes $a\ge b\ge d>0$, the objective isIf $1-c_{\ast }b\le 0$, merging the parts of sizes $a,d$ does not decrease it, again contradicting minimality. If $1-c_{\ast }b>0$ and $a-d\ge 2$, transferring one vertex from the largest to the smallest part raises $ad$ by $a-d-1>0$ and strictly increases the objective. Thus a three-part maximizer has all sizes differing by at most one, and is $T_3(n)$. A maximizer with at most two parts has objective at most $e_2$, since it has no triangles in a graph and the Mantel theorem bounds its edges. Finally,Therefore every graph satisfies $e(G)-c_{\ast }{k}_3(G)\le e_2$. At the prescribed edge count this givesFor $n\le 2$, the conclusion is simply the nonnegative lower bound zero. All rounding in the Turan graphs has been retained.

One edge above the bipartite threshold. Write $n=2m$. We prove the Triangle lower bound one edge above the Mantel threshold by induction on $m\ge 2$, allowing at least $m^2+1$ edges. For $m=2$, five edges on four vertices give two triangles in a graph, and adding edges preserves this bound.

We will also use the following consequence of an inductive bound: on $2a$ vertices, at least $a^2+q$ edges, for an integer $q\ge 1$, force at least $a+q-1$ triangles in a graph. Delete surplus edges first to leave exactly $a^2+q$. Repeatedly delete an edge in a triangle in a graph until $a^2+1$ edges remain. The Mantel theorem guarantees such a triangle in a graph at every step; each deletion destroys at least one distinct triangle in a graph. Apply the inductive bound to the remaining graph.

Now take exactly $m^2+1$ edges. If every edge lies in a triangle in a graph, the edge-triangle incidence bound gives $3k_3(G)\ge m^2+1$. This is at least $3m$ for $m\ge 3$; the base case was handled separately.

Otherwise choose an edge $uv$ in no triangle in a graph. Its endpoints have disjoint vertex neighbourhoods, so $d(u)+d(v)\le 2m$. Deleting $u,v$ removes exactly $d(u)+d(v)-1$ edges and leaves at least $(m-1{)}^2+1$ edges. If $d(u)+d(v)\le 2m-1$, it leaves at least $(m-1{)}^2+2$ edges, and the strengthened inductive bound gives at least $m$ triangles in a graph already.

If $d(u)+d(v)=2m$, induction gives at least $m-1$ triangles in a graph after deletion. There must be an additional triangle in a graph containing $u$ or $v$. Otherwise both $N(u)$ and $N(v)$ are independent sets; since they are disjoint and cover all vertices, $G$ would be bipartite graph, contradicting $e(G)>m^2$ by the Mantel theorem. HenceThe bound is sharp: add one internal edge to one class of the complete bipartite graph $K_{m,m}$. Its triangles in a graph are precisely that edge together with each of the $m$ vertices in the other class.

For part (a), fix $\mathbf{x}\in L$ and consider the line segmentThe convex set $L$ contains this entire segment. Forwe have $g(0)=1$ andIf ${\sum }_j{x}_j>n$, then $g(t)>1$ for all sufficiently small positive $t$, contradicting the hypothesis on $L$. Thus

For part (b), $K$ is compact, and the product of the coordinates is a continuous function. The extreme value theorem therefore supplies $\mathbf{u}\in K$ maximizing that product. Assume every $u_j>0$ and apply part (a) to the convex setIt contains $1$, and maximality of $\mathbf{u}$ makes every coordinate product at most one. HenceIf $\mathbf{v}$ is another maximizer, its coordinates are positive and ${\prod }_j(v_j/u_j)=1$. The arithmetic-geometric mean inequality giveswhile the displayed inequality gives the reverse bound. Equality in the arithmetic-geometric mean inequality forces every $v_j/u_j=1$. Therefore the maximizer $\mathbf{u}$ is unique.

The arithmetic-geometric mean inequality givesThus convergence of ${\sum }_n{a}_n$ implies convergence of ${\sum }_n\sqrt{a_n{a}_{n+1}}$ by the comparison test for series.

The converse is false. DefineThe even terms make ${\sum }_n{a}_n$ diverge, whileso the neighboring geometric-mean series converges.

Linearizing about the conductive state givesThe perturbations vanish at $z=0,1$. For a normal mode with vertical dependence $\sin (n\pi z)$, put $q=k^2+n^2{\pi }^2$. The two modal equations are $-q\hat{\psi }=-ikR\hat{\theta }$ and $s\hat{\theta }+ik\hat{\psi }=-q\hat{\theta }$. Eliminating $\hat{\psi }$ givesNeutrality requires $R=(k^2+n^2{\pi }^2{)}^2/k^2$. The arithmetic-geometric mean inequality bounds this below by $4n^2{\pi }^2$, with equality at $k=n\pi$. The first unstable vertical mode is therefore $n=1$, givingThe wavelength statement applies at the first onset. At a general larger $R$, maximizing the growth rate within a fixed vertical mode gives $k^2=n\pi \sqrt{R}-n^2{\pi }^2$, so its preferred wavelength need not remain exactly two. This is the onset of convection in a horizontal Darcy layer.

The set $K\cap P$ is compact because $K$ is closed and bounded, and the productis continuous. By the extreme value theorem, $G$ has a maximizer. Since $K$ meets the interior of the nonnegative orthant $P$, some feasible product is positive, so every maximizer lies in $\mathrm{Int}P$.

On $\mathrm{Int}P$, maximizing $G$ is equivalent to maximizingThe Hessian of $F$ iswhich is negative definite. Thus $F$ is a strictly concave function, and it has at most one maximizer on the convex set $K\cap P$. Denote this unique point by $x^{\ast }$.

For any $x\in K\cap P$, the line segmentlies in $K\cap \mathrm{Int}P$. Since $F(x(t))$ is maximal at $t=0$, its right derivative there is nonpositive:ThereforeThis is the supporting inequality for the product maximizer on a compact convex subset of the positive orthant.

Suppose now that $K$ is invariant under cyclic coordinate permutation. That permutation preserves the product, so uniqueness forces it to fix $x^{\ast }$. Hencefor some $r>0$. More explicitly,Indeed, cyclic symmetry averaging puts the diagonal point with coordinate equal to the mean of any $x\in K$ back in $K$, while the preceding inequality with $x_j^{\ast }=r$ gives ${\sum }_j{x}_j\le nr$.

Finally, given $a=(a_1,\dots ,a_n)\in \mathrm{Int}P$, defineThis set is nonempty, closed, convex and bounded, and it contains $a$. By the arithmetic-geometric mean inequality,Equality holds only when all $x_j/a_j$ are equal and their sum is $n$, namely only at $x=a$. Thus this $K$ has

At a regular constrained stationary point of $F$ on $G=0$, the Lagrange multiplier method solvesFor the first problem, substitute $z=1+xy$ to obtainIts stationary equations imply either $x=y$ or $xy=0$, and in either case the only real stationary point is $x=y=0$, $z=1$. Coercivity ensures that the minimum is attained, soat $(0,0,1)$.

For the second problem, the arithmetic-geometric mean inequality givesConsequentlyEquality occurs at $(0,0,1)$, and hence

Direct contact permits no work extraction, so conservation of internal energy givesThe total entropy change isThe arithmetic-geometric mean inequality makes the last expression positive when $T_1\ne T_2$, with equality only when the bodies were already at the same temperature. This is the entropy production of irreversible heat flow.

Minkowski's lemma states that if $\Lambda$ is a full lattice in ${\mathbb{R}}^n$ and $C\subset {\mathbb{R}}^n$ is measurable, convex, and centrally symmetric, thenimplies that $C$ contains a nonzero point of $\Lambda$.

Let ${\sigma }_1,{\sigma }_2:K\to \mathbb{R}$ be the two real embeddings. The Minkowski embedding of a real quadratic field identifies ${\mathcal{O}}_K$ with a latticeof covolume $\sqrt{|D_K|}$. Choose a constant $c$ satisfyingFor $R>0$, consider the closed diamondIt is convex and centrally symmetric, and its area isMinkowski's lemma supplies a nonzero ${\alpha }_R\in {\mathcal{O}}_K$ whose two embeddings lie in $C_R$.

For $(x,y)\in C_R$, the arithmetic-geometric mean inequality givesSince the coordinate product is the field norm,Finally, $|{\sigma }_2({\alpha }_R)|\le c/R\to 0$ as $R\to \infty$. No fixed nonzero algebraic integer can occur for arbitrarily large $R$, because its second embedding is nonzero. Consequently the elements ${\alpha }_R$ obtained along an unbounded sequence of $R$ contain infinitely many distinct values. Here $N(\alpha )$ denotes the absolute norm, as usual in this inequality.

At a regular constrained extremum of $f$ on $g=0$, the tangent derivatives of $f$ vanish. Since $\nabla g$ is normal to the constraint surface, the Lagrange multiplier condition isOne solves these equations and then compares the resulting candidates, including any boundary or singular cases.

Let the base have dimensions $x$ and $y$, and let the height be $z$. Measure cardboard relative to the thickness of the front and back. The weighted amount used isbecause the bottom has triple thickness, the two front and back faces have ordinary thickness, and the two side faces have double thickness. The constraint is $xyz=3$.

The multiplier equations areThey implyThus $x=2y$ and $z=3y/2$; imposing $xyz=3$ gives $y=1$. ThereforeThis is the global minimum: by the arithmetic-geometric mean inequality,and equality holds at these dimensions. This is an instance of weighted open-box minimization.

If $x_k\ge 1$, then positivity and the arithmetic-geometric mean inequality giveThus all iterates remain in $[1,\infty )$.

Consider the strictly convex functionon $[1,\infty )$. Since $f^{\prime }(x)=x^2-a$ and $f^{\prime \prime }(x)=2x$, its Newton minimization step isIts unique minimizer is $x^{\ast }=\sqrt{a}$.

PutThe numerator is the linear kernel, while the reciprocal of the denominator is the kernel from part c applied to $\Vert x{\Vert }^2$ and $\Vert y{\Vert }^2$. The product of positive-semidefinite kernels therefore shows that $a$ is a positive-semidefinite kernel. The Cauchy-Schwarz inequality and the arithmetic-geometric mean inequality give $|a(x,y)|\le 1/2$, soEach power is positive semidefinite by the Schur product theorem, and the convergent sum is positive semidefinite.

Moreover $k_2(x,x)=1$. If $\Phi$ is its canonical feature map, thenThe feature-space norm gives symmetry and the triangle inequality. Finally, $d(x,y)=0$ implies $k_2(x,y)=1$, hence $a(x,y)=1/2$ andwhich is equivalent to $\Vert x-y{\Vert }^2=0$. Thus $d$ is a metric rather than merely a pseudometric.

Apply coordinate compression in a product of paths in both coordinates. Replacing every fiber by an initial interval preserves the number of edges inside that fiber; between two neighboring fibers, the compressed sets span the minimum of their sizes, at least their original intersection size. Repeating the operation therefore never decreases the number of edges spanned and eventually produces a down-set.

Write the nonzero row lengths of this down-set asThe horizontal edges number $t^2-q$, and the vertical edges numberConsequentlySince $t^2\le q{a}_1$, the arithmetic-geometric mean inequality gives $q+a_1\ge 2t$. Henceas required.