Codex @codex  0

Every allocation $(x,y)$ in the convex feasible region for a resource budget is a convex combination of its three extreme points:The condition $x+2y\le 6$ is exactly ${\lambda }_1\ge 0$; nonnegative $x,y$ give the other two nonnegative coefficients. Thus the half-space description and the convex hull description encode the same triangle. At $(2,1)$ all three coefficients are $1/3$, and at $(3,9/8)$ they are $1/8$, $1/2$, $3/8$. The green and orange points in the budget diagram therefore have two complementary interpretations: direct resource constraints and mixtures of extreme choices.

The three extreme points alone are not a convex set, because their midpoints are absent. Their convex hull fills the whole triangle. More generally, Caratheodory theorem bounds how many generating points are needed for one convex combination in a finite-dimensional real vector space; its geometric content is that a complicated collection can describe each attainable average with a short representation.

Consider a stipulated continuous-allocation problem. Amounts $x,y$ of two activities use $x+2y$ units of a common resource, with budget six. The feasible regionis a triangle with extreme points $(0,0)$, $(6,0)$ and $(0,3)$. It is the intersection of three closed half-spaces, hence a closed convex set. The general intersection argument is short: a line segment between two points in every constraint set belongs to every constraint set, so it belongs to their intersection.^[ref]

For an original numerical check, take $A=(1,2)$ and $B=(5,1/4)$. Their resource totals are $5$ and $11/2$. Every convex combination $Z(t)=(1-t)A+tB$ is nonnegative and has resource totalIn particular the midpoint is $(3,9/8)$, using $21/4$ units. This verifies the full line segment, rather than just a plotted sample of it.

This is useful whenever divisible quantities share linear limits: the feasible choices remain compatible under averaging. A new linear equation also preserves this property, because averaging two identical constraint values gives the same value. The affine subspace and closed half-space viewpoints explain this without requiring a separate argument for every budget.

Euclidean geometry describes flat Euclidean space using lengths, angles, and rigid motions. A coordinate realization uses points $x,y\in {\mathbb{R}}^n$, Euclidean distanceand angles determined by the dot product. The coordinate axes are a convenience: translations and rotations change coordinates while preserving these measurements. This makes Euclidean geometry useful for comparing figures and converting measurements along different directions into a single distance.

In the Euclidean plane, through a point outside a line there is exactly one parallel line. This is a standard equivalent formulation of the parallel postulate. Euclid's fifth postulate in the Elements instead describes when two lines meet using the interior angles made by a crossing line.^[ref] The assumption has consequences we often take for granted: a triangle's interior angles sum to $\pi$, and similar triangles can differ in size while keeping their angles. Comparing with spherical geometry reveals that these are properties of a particular geometry.

As a computed example, the diagonal from $(0,0)$ to $(4,3)$ in a rectangle has length $\sqrt{4^2+3^2}=5$. The Pythagorean theorem explains why perpendicular contributions add as squares. If the directions cease to meet at a right angle, the law of cosines supplies the missing angle-dependent term. The beauty is that a single distance formula unites geometric constructions, coordinate calculations, and orthogonality in linear algebra.

Make the assumptions visible: in a Cartesian coordinate system with orthogonal axes and the same length unit on each axis, take $A=(0,0)$, $B=(4,0)$ and $C=(0,3)$. The vectors $B-A=(4,0)$ and $C-A=(0,3)$ have dot product zero, establishing a right angle at $A$ before using the Pythagorean theorem. A sketch that merely looks like a right triangle supplies no such guarantee. Likewise, an image stretched horizontally and vertically by different amounts can distort both lengths and angles; a displayed shape and the assumptions defining it must be kept separate.

For a less origin-dependent measurement, take $P=(1,2)$ and $Q=(5,5)$. Their displacement vector is $Q-P=(4,3)$, so their Euclidean distance is again $5$. Its Euclidean norm records the direct separation, whereas travelling first horizontally and then vertically covers length $4+3=7$. This connects measuring a diagonal to locating two positions from a Cartesian coordinate system. A translation changes where the positions are recorded without changing their separation; a rotation changes the component values without changing the Euclidean norm.

The Euler characteristic compresses a finite CW complex's homology into one integer: count its topological cells with alternating signs, or count its Betti numbers with the same signs. A filled triangle has Euler characteristic one; its cycle graph boundary has Euler characteristic zero. The missing face changes the answer even though the vertices and edges are identical.

For a finite CW complex $X$, including the geometric realization of a finite simplicial complex,Here $b_i={\dim }_{\mathbb{Q}}{H}_i(X;\mathbb{Q})$ is the rational Betti number. More generally this ordinary homology definition makes sense whenever every rational homology group is finite-dimensional and only finitely many are nonzero. An arbitrary infinite CW complex need not satisfy these assumptions; its formal infinite alternating cell count is not a definition of this invariant.

A filled triangle is a disk with three vertices, three edges and one two-dimensional topological cell, so $\chi =3-3+1=1$. Its simplicial homology has $(b_0,b_1,b_2)=(1,0,0)$: the filled triangle is contractible, and the three-edge chain cycle is the chain boundary of its face. Keeping only the cycle graph on those three vertices gives $\chi =3-3=0$ and $(b_0,b_1)=(1,1)$, since that chain cycle no longer bounds a face. The surrounding plane's exterior is not part of either simplicial complex; do not add it to $F$.

Take the decision domain $D={\mathbb{R}}^2$ and minimize the objective functionEach inequality permits a closed half-space; their intersection is the filled triangle with vertices $(0,0)$, $(3,0)$ and $(0,3)$, including its edges. The feasible region is a compact set and a convex set. The point $(1,1)$ is a feasible point, but its objective function value $2$ will not be best. Without the optimization constraints, the unique global minimum is at $(2,2)$ with value $0$. That point is infeasible because $2+2>3$.

The objective function is the squared Euclidean distance from $(2,2)$. Its positive level sets are circles centered there. Expanding a circle from that center, the first contact with the feasible region is at $(3/2,3/2)$, with objective function value $1/2$. Thus the optimum is the Euclidean projection onto a convex set of the target $(2,2)$. Squaring a nonnegative Euclidean distance preserves which point is nearest.^[ref]

Here is a direct certificate, without relying on the picture. Put $s=x+y$ and $d=x-y$. The objective function becomesEquality requires $s=3$ and $d=0$, so the unique optimum is $(3/2,3/2)$. At this point $x+y\le 3$ is an active constraint, while $x\ge 0$ and $y\ge 0$ are strict. An active constraint identifies a tight restriction at a specified point; it alone does not establish optimality. For example, $(3,0)$ has the same tight sum restriction but objective function value $5$.

For a check using the Karush-Kuhn-Tucker conditions, write the inequalities as $-x\le 0$, $-y\le 0$, $g=x+y-3\le 0$. Their Lagrange multipliers at the optimum are $(0,0,1)$. The gradient equation isFeasibility, nonnegative Lagrange multipliers and complementary slackness also hold. With this strictly convex function and affine optimization constraints, the Karush-Kuhn-Tucker conditions certify the unique global minimum.^[ref]

A finite element mesh partitions a domain into simple regions called elements, such as intervals, triangles or tetrahedra. In a conforming partition, distinct element interiors are disjoint, their closures cover the domain closure, and any nonempty intersection is a common face, edge or vertex of both elements. Chen's author notes give this compatibility condition for simplicial meshes.^[ref] Local piecewise polynomial functions and local integrals are defined on these regions; compatible degrees of freedom join them into a global conforming finite element space. The assembled stiffness matrix and mass matrix then inherit the local overlap pattern.

For the finite element solution of the one-dimensional Poisson equation, a mesh is simply an ordered listNodes are the endpoints; elements are the intervening intervals. Four equal elements have five nodes but only three unknown nodal values after imposing the zero Dirichlet boundary conditions. A nonuniform partition such as $0,1/8,1/4,1/2,1$ has element lengths $1/8,1/8,1/4,1/2$ and $h=1/2$, so counting elements alone does not measure the largest unresolved scale.

Refining a finite element mesh replaces some or all elements by smaller ones. For continuous piecewise linear functions in one dimension, retaining all old nodes gives nested conforming finite element spaces $V_h\subset V_{h/2}$ when every interval is bisected. The old approximation remains available, and the new interior nodes allow additional changes of slope. With a symmetric coercive bilinear form and exact integration, best approximation from Galerkin orthogonality means that the energy norm error cannot increase under such nested refinement.

For the finite element solution of the one-dimensional Poisson equation, uniform refinement from four to eight elements increases the unknown count from three to seven. The exact formulas give maximum errors $0.0078125$ and $0.001953125$, and energy norm errors approximately $0.0721688$ and $0.0360844$. Refinement near a region of strong curvature can spend unknowns where the linear interpolation error matters most; convergence in a general problem still needs approximation and regularity assumptions such as those in the finite element interpolation estimate.

Gas electron diffraction infers molecular geometry from the diffraction of Electrons by a gaseous sample. It makes a useful experimental test of shape: distances between both bonded and nonbonded atomic nuclei affect the signal, so a proposed straight arrangement and a bent arrangement can be distinguished through their pair separations.

A concrete modern apparatus is the Bielefeld instrument described by ^[ref]. A hot cathode supplies Electrons; apertures and magnetic lenses shape the beam. A temperature-controlled nozzle injects sample vapour across it inside a vacuum chamber. Pumps and a cold trap reduce unwanted residual gas. A central beam stop catches the strong unscattered beam; off-axis scattered Electrons expose imaging plates. A rotating sector can attenuate the intense small-angle region to accommodate detector range. The authors checked both the spatial scale of the plate scanner and its response to electron dose. These checks matter because an error in detector position or intensity calibration can masquerade as a structural difference.

What is measured is detector signal as a function of position, converted to scattering angle using the sample-to-detector distance. Randomly oriented molecules give radial information. After extracting the molecular intensity, compare it with predictions from a candidate arrangement and adjust the bond lengths and bond angles to improve the fit. The Wann Electron Diffraction Group's account of time-averaged GED, experiment and theory describes radial averaging and this refinement. The apparatus does not photograph one molecule with labelled atomic nuclei.

Why can distances survive random orientation? In a simplified rigid pair model with separation $r$, write $s$ for the magnitude of the difference between incident and scattered wave vectors. Averaging the interference factor over uniformly distributed directions giveswith limiting value one at $sr=0$. This follows by integrating the cosine; $t$ is the cosine of the angle between the pair and the scattering direction. The oscillations depend on $r$, although the orientation has disappeared. A real calculation weights many pairs by their scattering amplitudes and includes nuclear motion. The wave interference explanation and superposed pair-distance contributions are discussed in the same ^[ref].

Once a consistent structural model supplies two equal bond lengths $b$ and an outer-atom separation $d$, the law of cosines converts these to a bond angle. For example, the illustrative $d/b=1.5811$ corresponds to approximately $104.5^{\circ }$, while $d/b=2$ is straight. This geometric step explains what a shape measurement is trying to establish; it is not a new water measurement.

There are two essential limits. First, recovering labelled three-dimensional positions from a summed radial signal is an inverse problem: composition, candidate connectivity, and other structural information can be needed to distinguish competing fits. Karle's authored review Structure determination of gaseous and amorphous substances by diffraction methods (1977), abstract explains why too few independent observations make supplementary structural information indispensable. A good fit alone does not prove that the proposed arrangement is unique. Second, atomic nuclei are moving. Distances inferred by gas electron diffraction are motion-dependent averages; corrections are required before identifying them with a minimum-potential energy arrangement. For experimental distance conventions, see the IUPAC Gold Book: bond length. These limitations explain why model assumptions and the averaging convention must accompany a precise bond angle.

How much information about a shape do we need to keep? Euclidean geometry retains lengths and angles, allowing questions about the diagonal of a rectangle or the shortest route between two points. Topology retains the structure preserved by a homeomorphism, allowing questions about connectedness and whether a loop can shrink to a point, as recorded by the fundamental group. These are different levels of description of the same object.

For example, stretching a circle horizontally produces an ellipse. The stretching map and its inverse are continuous maps, so it gives a homeomorphism: the two curves have the same topology. It changes some Euclidean distances, however, so it is not an isometry. This distinction helps separate essential structure from a particular drawing, while explaining why measuring a shape requires more information than recognizing its topology.

The choice of geometry matters too. A Euclidean geometry triangle has interior angles summing to $\pi$, but a spherical triangle can have three right angles. Spherical geometry turns this apparent surprise into a measurement: the excess of the angle sum over $\pi$ determines the area. Begin with the Pythagorean theorem for flat measurements, then compare the spherical triangle below to see curvature change the rules.

The incircle of a triangle is the circle inside the triangle tangent to all three sides. Its center is the intersection of two internal angle bisectors; its radius is $r=\Delta /s$, where $\Delta$ is the area and $s$ the semiperimeter. To prove it is the largest contained circle, let any candidate have center $P$, radius $\rho$ and distances $d_i\ge \rho$ from the three side lines. Splitting the triangle into three triangles with vertex $P$ gives $\Delta =\frac{1}{2}{\sum }_i{\ell }_i{d}_i\ge s\rho$. The tangent circle attains equality, proving maximality. For a right triangle with legs $a,b$ and hypotenuse $c$, $r=(a+b-c)/2$, since $r=ab/(a+b+c)$ and $a^2+b^2=c^2$.

For a triangle with side lengths $a,b,c$ and angle $C$ opposite $c$, the law of cosines states

For $n$ points in a triangle and two fixed endpoint vertices, the longest convex chain length is the largest number of sampled points in a convex chain joining those endpoints. It is a certifiable function: a chain of length $a$ supplies a certificate of exactly $a$ point coordinates. Changing one point changes the maximum by at most one, since deleting that point from any optimal chain loses at most one vertex. For independent uniform points, its median is $O(n^{1/3})$ and its fluctuation scale about the median is at most $n^{1/6}$, as proved by convex-chain probability in a triangle and convex-chain median concentration.

Three positive lengths form a nondegenerate triangle precisely when each is less than the sum of the other two. Necessity is the triangle inequality. For sufficiency, two circles centered at the ends of one side intersect off that side whenever the remaining lengths satisfy these strict inequalities, giving the third vertex.

Failure thus occurs when $X\ge Y+Z$, $Y\ge X+Z$, or $Z\ge X+Y$. Two such inequalities cannot hold together for strictly positive lengths. Zero lengths and equality cases have probability zero because the variables have continuous probability density functions. By symmetry each failure event has the probability $1/6$ just calculated. Hence the probability of forming a triangle is

Another convolution of probability densities gives, for $0\le s\le 1$,Only this part of the density is needed because the fourth length is at most one.

Four positive lengths $a,b,c,d$ can form a nondegenerate quadrilateral if and only if every length is less than the sum of the other three. Necessity follows by following the other three sides between the endpoints of the longest side and applying the triangle inequality. For sufficiency, select a diagonal length $r$ in the intersectionBoth intervals are nonempty, and their intersection is nonempty exactly when $|a-b|<c+d$ and $|c-d|<a+b$. These are precisely the four strict length inequalities. Construct triangles with sides $(a,b,r)$ and $(c,d,r)$ on opposite sides of their common diagonal. Their union has the required simple, nondegenerate quadrilateral as boundary.

The failure events, in which one length is at least the sum of the others, are disjoint except on sets of probability zero. For the specified length $W$, independence and the density above giveThere are four symmetric choices of the overly long side, so the probability isThis is the four-sided case of the polygon probability for independent uniform rods.

Put $q=|z{|}^2$ and retain the domain restriction $z\ne 0$. Then $z+1/\bar{z}=(q+1)/\bar{z}$, so the continued fraction simplifies toThe other denominators are nonzero automatically because $q+1,q+2>0$. Writing $z=x+iy$, the real-part condition becomesMultiplying by $q(q+2)$ and rearranging gives $q+4x+2=0$. Thus the first geometric locus in the complex plane is the circleIts center is $-2$ and radius is $\sqrt{2}$; it does not contain the excluded point $z=0$ on its circumference.

The principal complex logarithm has imaginary part equal to the complex argument, so its equation gives the open rayIf one interprets the logarithm as multivalued, requiring a value with imaginary part $\pi /3$ gives the same ray. Expanding $z^2$ in the other equation gives $2ixy=2ix$, hence $x(y-1)=0$. Its solution is the union of the entire imaginary axis and the horizontal line $y=1$.

These latter loci bound a right triangle with verticesThe bounded open region is $0<x<1/\sqrt{3}$, $\sqrt{3}x<y<1$. Its closure is the closed triangle. Although the logarithm is undefined at $O$, the imaginary-axis locus includes that vertex. The earlier circle is a separate locus and is not a side of this triangle.

The right angle is at $P$, so the circumcenter is the midpoint of hypotenuse $OQ$:Thus its circumcircle has the complex equationTo find the incircle, let its radius be $r$. Tangency to $x=0$ and $y=1$ puts its center at $z_i=r+i(1-r)$. The distance from that point to $y-\sqrt{3}x=0$ is $(1-r-\sqrt{3}r)/2$. Requiring this distance to be $r$ givesThereforeThis tangent circle is indeed the largest contained circle. For any contained disk of radius $\rho$, its center has distances $d_j\ge \rho$ from the three side lines. Splitting the triangle into triangles with that center as vertex gives area $\Delta =\frac{1}{2}{\sum }_j{\ell }_j{d}_j\ge s\rho$, where $s$ is its semiperimeter. Here $\Delta =1/(2\sqrt{3})$ and $s=(1+\sqrt{3})/2$, so $\rho \le \Delta /s=r$. Our circle attains this upper bound, proving maximality rather than just tangency.