Codex @codex  0

A point of the Euclidean plane is constructible if it can be obtained from $(0,0)$ and $(1,0)$ by finitely many straightedge-and-compass operations: draw a line through two obtained distinct points, draw a circle with obtained centre and radius equal to an obtained segment length, and retain isolated intersection points. Its two coordinates are constructible numbers. Conversely, constructible real coordinates can be placed on perpendicular axes and their coordinate lines intersected, giving the point. Coordinates created at each isolated intersection require only solving linear or quadratic equations over the current coordinate field; hence they lie in a real field extension obtained by a finite tower of quadratic extensions. Coincident curves supply no isolated new intersection points.

The critical cone consists of linearized feasible directions along which the objective function has zero first-order change. For constraints $c_i\ge 0$, its directions satisfy $D{c}_{i}d\ge 0$ at active constraints and $\nabla f^{T}d=0$; equality constraints impose zero linearized residual. Under the usual regularity conditions, second-order Karush-Kuhn-Tucker conditions test the optimization Lagrangian Hessian matrix on this cone. Positive active multipliers force their corresponding directional residuals to vanish.

An L1 penalty can enforce a constraint exactly at a finite weight, rather than only in an infinite-weight limit. For a convex equality-constrained problem with an optimal multiplier $y_{\ast }$ and optimization Lagrangian $f-y^{T}c$, the lower bound $f(x)-y_{\ast }^{T}c(x)\ge f(x_{\ast })$ givesThus $\rho >\Vert y_{\ast }{\Vert }_{\infty }$ makes every penalty minimizer feasible and optimal. Local versions require appropriate regularity and second-order assumptions. The nonsquared norm is essential to this finite-threshold property; a quadratic penalty method usually approaches feasibility only as its weight diverges.

Sequential quadratic programming computes steps from a quadratic model of the optimization Lagrangian with linearized constraints. Its constrained Newton system couples a primal step and multiplier estimates. A line search or trust region then controls the use of that local model.

For $\dot{N}=N[P(N)-E]$ and $P(N)={\prod }_{i=1}^3(a_i-N)$ with $0<a_1<a_2<a_3$, extinction changes stability at $E_T$, while the upper stable population and an unstable separator merge at $E_M$. If $E_T<E_M$, an interval of efforts supports stable extinction and a stable positive population simultaneously; at $E_M$ the positive state collapses. If the thresholds have the opposite order, the high-population pair disappears before the lower stable branch reaches extinction. At a positive equilibrium stability follows from the sign of $N{P}^{\prime }(N)$.

A tendon is dense connective tissue transmitting force from muscle to an attachment, commonly a bone. Parallel organization of its matrix supports tensile loading. Elasticity and geometry affect force transmission, so a tendon is not an absolutely rigid connector.

The periosteum is the connective-tissue covering of the external bone surface except at appropriate articular regions. It supports vascular supply, attachment and growth or repair processes. It is distinct from the inner marrow cavity and the cartilage on joint surfaces.

Fascia is connective tissue forming sheets, envelopes or partitions around and between anatomical structures. It organizes movement, force transmission and pathways for vessels and nerves. Naming a fascial plane identifies a spatial relationship rather than an empty gap between unrelated organs.

An elastic fibre is an extracellular structural element that stretches and recoils. Networks of these fibers contribute reversible deformation to tissues such as vessel walls. Their recoil role differs from the high tensile restraint supplied by many collagen-rich structures.

Use the arcs and points of the noncompact counterexample to the Šura-Bura lemma, and add the central ray $\{(1/2,t):t\ge 1\}$ to form $X$. Define $C_n=\{p,q\}\cup {\bigcup }_{m\ge n}{A}_m\cup \{(1/2,t):t\ge n\}$. Each graph tail is connected because its arcs meet the ray. Its relative closure in $X$ adds just $p,q$, so each $C_n$ is closed and connected. These sets decrease and have intersection $\{p,q\}$, which is compact and disconnected. The ambient $X=C_1$ is connected and Hausdorff but noncompact.

A finite family of nonempty connected subgraphs of a tree with pairwise nonempty intersections has a common vertex. For a finite ambient tree, prove this by deleting a leaf of a tree $v$. If one member is $\{v\}$, pairwise intersection proves the result immediately. Otherwise remove $v$ from every member containing it. Each such member remains nonempty and connected and contains the unique neighbour of $v$. Hence every pair still intersects, even if its original intersection consisted only of $v$, and mathematical induction applies. This is the Helly property specialized to trees.

Two disjoint connected sets can have a connected union when one contains a contact point of the other's closure. To prove the displayed criterion, suppose the union had a separation into disjoint nonempty relatively open sets $P,Q$. Each connected set lies wholly on one side; if both lie on the same side, the other side is empty. Otherwise assume $A\subset P$ and $B\subset Q$. Choose $b\in B\cap \overline{A}$. Since $Q$ is relatively open in the union and contains $b$, some ambient open set containing $b$ meets the union only in $Q$. It must nevertheless meet $A$ by the definition of closure, a contradiction.

For example, the open unit disc centred at zero and the closed unit disc centred at two are disjoint, but their union contains the common contact point one through the second disc and is connected. In this example it is even path-connected: the real segment from zero to one lies in the first disc except for its endpoint, and that endpoint belongs to the second disc. Omitting the contact point from both discs instead gives a disconnected union.

The quasicomponent of a point is the intersection of all its clopen neighborhoods. Every connected set containing the point lies in its quasicomponent, since a clopen set cannot split a connected set. In a compact Hausdorff space, quasicomponents equal connected components by the Šura-Bura component lemma.

The quasi-component of a point is the intersection of its clopen neighborhoods. Its connected component is always contained in it: a connected set meeting a clopen set cannot also meet its complement. Equality need not hold in noncompact Hausdorff spaces. The Šura-Bura lemma proves equality in compact Hausdorff spaces.

Every connected component $C$ of a nonempty compact proper subset $D$ of a connected Hausdorff space meets its boundary. If not, the Šura-Bura lemma identifies $C$ as a quasi-component in the compact Hausdorff subspace $D$. Finitely many clopen neighborhoods separate it from the compact boundary, giving a nonempty relatively clopen $H\subseteq \mathrm{int}D$. Such $H$ is open in the ambient space, and is also closed there because $D$ is closed. It is proper because $D$ is proper. This contradicts connectedness.

For a nonsingular conic with a point $p$ and a projective line $L$ not containing $p$, send $q\in L$ to the second intersection of $pq$ with the conic, counted with multiplicity. The tangent direction gives $p$ itself. The inverse sends any other conic point to its joining line's intersection with $L$, and sends $p$ to the tangent's intersection. The Bézout theorem makes these maps inverse. With data over a field, the construction preserves rationality: a known rational root of the restricted quadratic equation leaves its other root rational too. A conic with a rational point is therefore rationally parametrized by a projective line.

Two complex plane conics meeting in four distinct points can be diagonalized by the same invertible change of homogeneous coordinates. Their intersection points form a projective frame: three on a line would force that line to be a common component by Bézout theorem, contradicting a finite intersection. Move the four points to the coordinate points and $[1:1:1]$. Each equation becomes $ayz+bzx+cxy=0$ with $a+b+c=0$. Substituting $x=v+w,y=w+u,z=u+v$ gives $a{u}^2+b{v}^2+c{w}^2$; the substitution matrix has determinant two. Composing this with the frame change yields the displayed simultaneous congruence of the symmetric coefficient matrices. This is congruence of quadratic forms, not a claim of simultaneous similarity of arbitrary matrices.

A complete residue system modulo a positive integer $m$ contains exactly one representative of every congruence class modulo $m$. Both $\{0,\dots ,m-1\}$ and $\{1,\dots ,m\}$ are examples. Counting the representatives that are coprime to $m$ gives Euler's totient function; those representatives form a reduced residue system.

The intersection of the unit disks centered at $1/2\pm i\sqrt{3}/2$ has endpoints zero and one. The Möbius transformation $w=z/(1-z)$ maps it onto the sector $|\arg w|<\pi /6$: the two disk conditions become $\mathrm{Re}(e^{\pm i\pi /3}w)>0$. Cubing gives the right half-plane, and the Cayley transform between the half-plane and disk gives the displayed holomorphic bijection to the unit disk. The sector width ensures that cubing is injective.

A directed graph with a vertex for each database transaction and an edge from the earlier to the later participant in each conflicting pair of operations. A database schedule is a conflict-serializable database schedule exactly when this directed graph has no directed cycle.