The one-point compactification of an uncountable discrete space is a hereditarily normal space but not a perfectly normal space. A subspace missing is discrete; one containing it is closed, hence compact Hausdorff and normal. However, every neighborhood of misses only finitely many points of . A countable intersection misses at most countably many points, so the closed singleton is not a G-delta set.
For locally compact noncompact Hausdorff spaces, a continuous proper map extends continuously to their one-point compactifications by the displayed rule. The inverse image of is , a neighborhood of infinity because the inverse image of a compact set is compact. The extension itself is proper, since it is continuous from a compact space to a Hausdorff space. A nonproper map can fail to admit any continuous extension: projection sends two vertical sequences escaping to the same point at infinity to two distinct constant sequences, incompatible with continuity at that point.
Tableau algorithm for ALC 2026-10-31
A concept satisfiability procedure that expands concept labels into a graph, branches on disjunctions, creates witnesses for existential restrictions, propagates universal restrictions along existing edges, and tests for a tableau clash. General TBoxes require global constraints and a termination device such as direct blocking in description logic.
Consider fluid at rest with mean depth and a bottom displacement . The linearized free-surface boundary conditions at and moving-bottom kinematic boundary condition at give a periodic particular response and velocity potentialThe bottom derivative fixes the signed response coefficient to the title formula. Here , , and the forcing must avoid . This equality is resonance with the natural finite-depth surface gravity wave; nonzero undamped resonant forcing has no bounded periodic solution. The response reverses phase below resonance. General initial data can add free surface gravity waves, which do not decay in this inviscid model. Near resonance the resulting wave steepness and particle excursions, rather than the bottom displacement alone, determine whether the linearization remains valid.
Composition of affine transformations 2026-10-31
If and , their function composition is , again an affine map. With column-vector homogeneous coordinates, its matrix is the product of the matrix for with that for , so the rightmost factor acts first.
Affine dependence 2026-10-31
An affine dependence of points is a nonzero coefficient family satisfying the displayed identities. Equivalently, the augmented vectors are linearly dependent. Both identities are independent of the chosen origin. The absence of an affine dependence is affine independence.
For , the displayed function, expressed using the complementary error function, satisfies , with on the positive boundary ray and on the negative boundary ray. Put , , so . Then and ; the derivative identity verifies the equation. Its boundary traces are for and for . At fixed nonzero polar angle it decays at infinity, but along fixed and it approaches one. The downstream thermal layer has width , so uniform radial decay would be an incompatible far-field condition.
Chromatic number from acyclic longest paths 2026-10-31
For a finite graph, let count the vertices on a longest directed path in an acyclic orientation . Its minimum over those orientations is the chromatic number. A proper -colouring gives an orientation from smaller to larger colours, so every directed path has strictly increasing colours and at most vertices. Conversely, assign to each vertex the number of vertices in a longest directed path ending there. Along an edge this number increases: an ending path at cannot contain without forming a directed cycle, so it can be extended. The resulting labels give a proper colouring using at most colours. These two constructions prove equality. Counting edges instead of vertices in path length subtracts one from the displayed minimum.
Every subgroup of an Abelian group generated by elements has at most generators. Lift it under a surjection . A subgroup has at most generators by induction: its first-coordinate image is either zero or . In the latter case choose a lift of , and subtract its multiples to reduce to the kernel in . The images of these generators generate the original subgroup. The Abelian hypothesis matters: is generated by a transposition and a full cycle but contains the elementary abelian group generated by disjoint transpositions, requiring generators by its vector-space dimension over .
Two-bag 0-1 knapsack problem 2026-10-31
Assign each item to neither bag or exactly one of two bags, respecting both capacities and maximizing total value. With nonnegative integer capacities , a dynamic programming state indexed by the item prefix and both capacities gives time complexity. Every transition uses the preceding item layer to prevent reuse of an item.
The cumulative hierarchy is a transitive class even without the ambient Axiom of foundation. If is a nonempty member, choose the least ordinal with . It is a successor . An element of that intersection is a subset of , while has no element in , so . This proves internal Foundation. If the hierarchy also satisfies the other ZF axioms, restricting every quantifier of a finite ZF proof to this definable class translates it into a proof from ZF without foundation. Thus adjoining Foundation preserves consistency relative to the remaining axioms.
Strong zero-dimensionality 2026-10-31
In a normal Hausdorff space, strong zero-dimensionality means that any disjoint closed sets can be separated by a clopen set, equivalently by disjoint clopen neighborhoods. For general Tychonoff spaces, the usual definition asks this for completely separated sets. In the normal setting Urysohn's lemma makes the formulations agree. The condition is equivalent to zero-dimensionality of the Stone-Čech compactification.
Clopen evaluation embedding 2026-10-31
The characteristic functions of a clopen topological basis give a topological embedding of a zero-dimensional topological space into a product of discrete two-point topological spaces. The separation axiom makes those functions distinguish points, and their coordinate preimages recover the original topological basis.
Normalization proof of Young's inequality 2026-10-31
The conjugate-power constrained product maximum proves Young's inequality for products by rescaling. For nonnegative and conjugate exponents , let . If , both variables vanish. Otherwise the displayed normalized variables satisfy , hence . Since , this means , proving . Equality in the constrained maximum requires , equivalent to ; the zero case gives the same equality criterion. This approach simultaneously gives the sharp constant and every equality case.
Heartwood 2026-10-31
The inner, generally nonconducting portion of a woody stem, distinguished from the more recently formed sapwood.
Sawdust Created 2026-10-31 Updated 2026-11-05
Sawdust consists of small particles of wood produced by cutting or abrasion. Relative to an intact piece of wood, its larger exposed surface affects exchange with the surroundings and access by decomposing microorganisms.
Let be a holomorphic function on an open set . Among continuously differentiable functions, all solutions of arewhere is an arbitrary holomorphic function on . The Wirtinger derivatives satisfy and , so the product rule verifies the particular solution . Subtracting it from any other solution leaves a continuously differentiable function with vanishing Wirtinger derivative, hence a holomorphic function by the Cauchy-Riemann equations. Conversely adding such a holomorphic function changes no prescribed derivative. For on the complex plane, the solutions are with any entire function.
Work by William Turner 2026-10-31
Work by William T. Greene 2026-10-31
Work by William Marcet 2026-10-31
There are unlisted articles, also show them or only show them.