The Hessian criterion for convexity, in the usual twice-differentiable multivariate setting, is
Thus the Hessian matrix must be a positive semidefinite matrix everywhere. The criterion follows by applying the second-derivative criterion for convexity to each line restriction , whose second derivative is . Continuous second partials are a sufficient regularity hypothesis for this line-restriction argument.
For an axis halfway from toward , let . The Born rule gives
The negative-outcome probabilities are complementary. Both outcomes can occur for both inputs, so one result cannot distinguish them perfectly. Repeated measurements on independently prepared copies distinguish their different statistics with arbitrarily high confidence. Reversing the diagonal direction exchanges the two numbers. This separates single-copy certainty from statistical distinguishability.
A horizontal Stern-Gerlach spin measurement measures . The inputs are its orthogonal eigenstates, so
The output beam identifies the input with certainty in a single ideal measurement.
A vertical Stern-Gerlach spin measurement is a -spin measurement. The Born rule gives
Thus this measurement cannot distinguish the two preparations, even by repeating the same measurement on many identically prepared copies: it discards their relative-phase difference in this basis.
Exactly works. Composition with the hyperbolic tangent is smooth for every . If , set . For , , so the result vanishes; it is therefore a test function with support of a function .
If , every finite satisfies . The given positivity makes for every , so its support is all of . In particular is excluded even though the function tends to zero at infinity: decay is not compact support.
Exactly works. For nonzero , composition with preserves smoothness, and the support of a function is , which is compact. For the result is the strictly positive constant on all of , so it lacks compact support and is not a test function.
Assume condition (2). Fix and . The superlevel set
is a closed set and does not contain . Its complement is therefore an open neighbourhood of , so some open ball avoids . Consequently throughout that ball, giving
The same bound holds for every smaller radius. Taking and then yields
Together with the previous implication this proves the equivalence. A supremum may equal even when every individual value is strictly smaller; the non-strict estimate here handles that possibility.
Assume condition (1). For fixed , the supremum
is nondecreasing as increases. Therefore its limit as exists in the extended real numbers and equals . Because , it is at least . Condition (1) says precisely that this limit is .
It follows that for every there is with . Fix and with . Taking produces an open ball on which . Thus is an open set, and its complement
This proves (1) implies (2). The property being characterized is upper semicontinuity.
The answers are
Write . The given metric describes locally uniform convergence: if and only if for every fixed . Indeed,
so convergence in forces . Conversely, split the defining series at : its tail is at most , and its finitely many initial terms tend to zero.
If is a Cauchy sequence in , the same single-term estimate makes it a Cauchy sequence in the supremum norm on every . The completeness of the continuous-map space in the uniform metric gives a continuous function on with uniformly there. Uniqueness of the limit of a sequence gives , so these functions define a single continuous function on . The preceding finite-head and tail argument proves . Thus the space is complete.
The constant functions have whenever . They have no convergent subsequence, so the space is not sequentially compact.
For fixed , set . On ,
as . The equivalence with locally uniform convergence proves that is a continuous path for . Hence the space is path-connected and connected.
The answers are
Distinct natural numbers have . Taking in the Cauchy sequence condition forces every sufficiently late pair of terms to be equal. Every Cauchy sequence is therefore eventually constant and converges in , proving completeness.
The sequence has no convergent subsequence, since convergence would force its sufficiently late terms to lie within distance of its limit of a sequence, hence to equal that limit. Thus sequential compactness fails.
Every singleton is an open ball of radius , so the metric topology is the discrete topology. For example, and form a separation into two nonempty open sets, so is not connected. It is consequently not path-connected either.
The answers, in the order completeness, sequential compactness, connectedness, and path connectedness, are
Define and for . The estimate proves continuity at zero by the squeeze theorem; elsewhere it follows from the usual continuous functions. Thus is the graph of a function on the closed set .
To check closedness directly, if in the Euclidean plane, then and continuity gives . Therefore is a closed subset of the complete metric space , hence is a complete metric space. The sequence has no convergent subsequence, since its first Cartesian coordinates tends to infinity, so sequential compactness fails.
For any two points , the map
is a continuous path in joining them. Thus is path-connected, and consequently connected. The factor is crucial: the oscillations shrink to the single point .
For , both reduced forms are , so . At , the reduced column echelon form is the transpose of the reduced row echelon form of , giving
For example, followed by , using the updated second column, produces the displayed directly. Its third column is zero. The two matrices differ, so (C) is true exactly when . Taking a transpose exchanges the kind of reduction, but also replaces the original by ; it does not generally identify the two reduced forms of itself.
Every elementary column operation preserves the linear span of the columns: each new column is a linear combination of the old columns, and the inverse operation supplies the reverse inclusion. Thus the column space of equals that of , which is precisely the image of a linear map . Consequently (B) is true for every .
For , , whose row space is . For , elementary row operations give the reduced row echelon form
Its row space is , whereas the image of a linear map is . These differ: belongs to the former but not the latter. Thus (A) is true exactly when . Rows are being identified with vectors in in this comparison.
A unitary matrix has . For example,
This example is invertible, has nonreal off-diagonal entries, and preserves the standard Hermitian inner product. Although it is also symmetric, that additional property is not required for unitarity.

There are unlisted articles, also show them or only show them.