The quotient theorem for Cartesian tensors here says: if contracting with every vector gives the components of a vector in every right-handed orthonormal basis, then obeys the second-order tensor transformation law. Conversely that transformation law guarantees the contraction is a vector. One may equivalently test that is a scalar for every pair of vectors .
By part (a), and . The contraction property in the new basis says
Since this holds for every test vector, . Using gives
For the converse, , exactly the vector law. For the equivalent scalar formulation, invariance of for every gives , forcing the same matrix identity.
The quantifier “every” matters: an arbitrary nonzero matrix can annihilate one fixed vector, so a single successful contraction cannot establish tensoriality. The stated bases test proper rotations; transformation under orthogonal reflections would require an additional hypothesis if that were wanted. “Second-order” counts tensor indices, rather than the matrix rank of a particular component matrix.
The successive differences of the constant entries give a simple LDL decomposition:
For example, entry of is the sum of the first entries of , directly verifying every entry of . Because is an invertible matrix, is strictly positive for every nonzero vector exactly when every diagonal entry of is positive. Consequently
At it is a positive semidefinite matrix and singular; for its quadratic form takes both positive and negative values.
When , taking positive square roots of yields the Cholesky decomposition
A real positive-definite kernel is a symmetric function such that, for every finite collection and every ,
Thus every kernel matrix is a positive semidefinite matrix; “positive definite” here does not require strict positivity. A Reproducing-kernel Hilbert space is a Hilbert space of functions on in which every point evaluation is a continuous linear functional. Its reproducing property is with , and . For a sum of positive-definite kernels, the quadratic form of its kernel matrix is a sum of nonnegative quadratic forms. Symmetry also survives summation. Consequently
For the representer theorem, put . This is a closed finite-dimensional vector space. The orthogonal decomposition by a closed subspace gives , where and . The reproducing property implies for every observed input, and therefore
Since , any minimizer must lie in . For , the reproducing property gives the evaluation vector and . Hence . If minimizes , its representation yields a minimizing . Conversely, if minimizes , then, for any , representing gives . Thus
This is an equivalence of minimizers, not an existence or uniqueness assertion: the loss function is arbitrary. A singular kernel matrix also allows nonunique coefficients, since differences in represent the zero function. Strict convexity of the loss was not used.
Now use the stated minimum-norm description of a sum of reproducing-kernel Hilbert spaces. Let . If the minimizing tuple did not attain the minimum total squared norm among decompositions of , replacing it by that unique minimum-norm tuple would preserve the loss function and strictly lower the penalty. This contradicts optimality. Therefore
For an arbitrary , take its minimum-norm decomposition . Then , proving that minimizes .
Choose from the representer theorem for this minimizing sum, and define . Write for the component kernel matrices. Then
By uniqueness of the minimum-norm decomposition, for every . This proves the common representer coefficients for a sum of kernels conclusion:
The same coefficient vector works simultaneously. Even when is singular, changing that vector by leaves every component unchanged: forces each nonnegative squared component norm to vanish.
Put . The Debiased Lasso correction is
For the Nodewise Lasso, let . Its Karush-Kuhn-Tucker conditions are
so at a nonzero coefficient and at a zero coefficient. Multiplying by gives the nodewise-Lasso residual identity
We require nonzero design columns, a necessary qualification missing from the unrestricted printed formulation. Because , would force both and , and hence . Thus nonzero columns suffice for even when or the full Gram matrix is singular. A zero column instead gives and its coefficient is unidentifiable from ; the proposed normalization and confidence interval do not exist there.
For each , define by and . Set row of to . Since ,
This row construction is the nodewise normalization used by van de Geer and coauthors. The matrix need not be symmetric or be an actual inverse.
Substitute the linear model into the correction. The exact decomposition is
In the fixed-design normal linear model, or with and nodewise estimates and tuning chosen from alone, a linear transformation of a multivariate normal distribution gives . Marginal normality of without this conditional assumption would not suffice for a response-dependent random design. No independence between and is asserted. The diagonal cancellation and the Holder inequality give the debiased-Lasso remainder bound
For a coordinate variance, , whence
Writing for the corresponding standard normal quantile, an approximate confidence interval is
Equivalently its half-width is . We assume and . For asymptotic coverage, the standardized remainder must have convergence in probability to zero and the coordinate variance must be nondegenerate. Exact conditional normality of alone does not give finite-sample exact coverage for .
One sufficient random-design regime is the Gaussian identity design for debiased Lasso: take independent rows , independently of , fixed , , , and
Choose and all for sufficiently large fixed . Here is why this regime has the requested remainder bound. Uniformly over columns, their squared norms divided by tend to one, while all off-diagonal sample cross-correlations have magnitude at most a constant times with probability tending to one. Taking larger makes the zero vector satisfy all nodewise Karush-Kuhn-Tucker conditions strictly, so for every on that event, and eventually. This also gives uniformly.
In this regime, the entrywise entrywise concentration of a Gaussian Gram matrix and Lasso cone condition argument in Gaussian identity design for debiased Lasso gives a Compatibility condition for the Lasso bounded away from zero with probability tending to one. Together with the noise-score event and the Basic inequality for the Lasso, this yields, for a fixed ,
For example, the cone inequality and compatibility bound give on their joint event. Therefore, with a fixed ,
The stated sparsity condition makes this remainder vanish and supplies the preceding confidence-interval requirement. Both dimensions may grow: and satisfy these assumptions. The concentration and Gaussian-design compatibility results are sufficient standard conditions here; the question does not require their proofs. The displayed rate is a high-probability fixed-constant bound, rather than only a claim of boundedness in probability.
The commutator with the scalar metric term vanishes. Reorder the third gamma matrix using the Clifford algebra twice:
Subtract the last term and multiply by to obtain
This is the infinitesimal vector transformation law implemented by the Spinor representation of the Lorentz group. The first contraction is as printed in the PDF; the TeX conversion's is erroneous and would fail, for example, when : the actual commutator is zero.
Insert and the result for into the Spinor representation of the Lorentz group. The contraction of two Levi-Civita symbols gives
The matrix exponential of this block diagonal matrix is the stated , so . The plus sign in its exponent follows from both minus signs above; it is tied to the rotation-parameter convention in the PDF.
For a rotation through about , the Pauli matrix has eigenvalues , hence . The spacetime rotation is the identity, while
This is the spinor sign under a full spatial rotation. A vector returns to itself already at . The comparison concerns the exponentiated Lorentz group representations: a Lie algebra by itself has no distinguished element called a rotation. The sign records the nontrivial lift of this rotation loop to the Spin group.
Set . Work on the strip in conformal gauge, with worldsheet signature and target signature . In light-cone gauge in string theory, the independent fields are the transverse coordinates. Put the Neumann boundary condition at and the Dirichlet boundary condition at ; reversing the endpoints exchanges cosine and sine modes without changing the spectrum. The fixed endpoint is .
Varying the transverse Polyakov action gives and the spatial boundary contribution . At the free endpoint this vanishes precisely when ; at the fixed endpoint . Separation of variables then gives with , hence , . These are Neumann-Dirichlet open-string boundary conditions. No dynamical transverse worldsheet zero mode survives: a constant solution must equal the prescribed , and a linear-in- solution violates the free-end condition.
Write . The orthogonality relation reduces the action to independent harmonic oscillators:
The canonical commutation relations determine normalized annihilation operators at
Thus . These formulas derive the quantization from the action rather than import integer-moded open-string rules.
For the usual phased string oscillators, set and for . Then the half-integer open-string oscillator expansion and algebra are
The corresponding field momentum density is . Completeness of the mixed-boundary eigenfunctions gives , where . This is a distribution identity on the mixed-boundary function space, not an unrestricted value at a fixed endpoint with a Dirichlet boundary condition.
Classically, the transverse Virasoro algebra zero-mode generator is
There is no transverse momentum term. If the two light-cone directions are common directions with Neumann boundary conditions, the full zero-mode constraint adds : . This assumption about the longitudinal directions is needed to interpret oscillator levels as target-space masses.
Quantizing the symmetrically ordered transverse generator gives , where the string level operator is . Each harmonic oscillator contributes to the vacuum energy. Use zeta function regularization and the Riemann zeta function with the actual half-integer spectrum:
Consequently the Neumann-Dirichlet string zero-point energy is
In the common convention , the normal-ordering constant of a string is . This positive shift differs from the vacuum energy of 24 integer-moded transverse bosons. The difference between those two vacuum energies is . To distinguish zero-mode conventions, the ND twist conformal weight is per transverse boson. With 24 bosons, the plane matter generator is ; its physical open-string condition is exactly the strip/light-cone constraint used here. The transverse plane and strip constants differ by the central charge shift . A common exponential frequency cutoff independently gives , confirming the finite part and avoiding invalid termwise manipulation of divergent sums.
Let . The lowest levels of a fully transverse ND bosonic string are
The third level has two excitations; there is no oscillator. Its indices are symmetric because the creation operators commute. With and the common longitudinal momentum convention, the rest energies and masses obey
At fixed positive the corresponding light-cone energies are ; the table lists excitation levels, not a spectrum that remains discrete if longitudinal momentum is varied continuously.
The surviving transverse rotations form . The ground state is a scalar, the next level its vector, and the third level the symmetric square of the vector. Separating its trace gives
The trace state is proportional to ; subtracting this trace gives the 299-dimensional symmetric traceless square.
There is a qualification to the printed “little group”. The little group with mixed string boundary conditions must preserve the endpoints as well as momentum. These boundary conditions break the full 26-dimensional Lorentz group, so the massive states above cannot be classified as representations of the unbroken 26-dimensional massive little group . In a D1–D25 realization the common worldvolume has Lorentz group and trivial connected massive little group; acts on the ND coordinates as an internal rotation group. The scalar, vector and symmetric trace-free decomposition is under the surviving transverse SO(24), with this boundary-background qualification.
Linearity of Stokes flow and rotational symmetry, including reflection in mathematics invariance of the spherical geometry, determine the possible rigid motions before any calculation. Translation is a polar vector; its linear dependence on a single vector must be . A traceless second-rank tensor cannot produce a polar vector by an isotropic linear map: tensor contraction with the identity matrix vanishes and tensor contraction with the totally antisymmetric tensor vanishes because is a symmetric second-rank tensor. Angular velocity is an axial vector. Neither nor a symmetric can produce one by an isotropic linear map. Products such as are excluded by Linearity of Stokes flow. Thus .
Use the Unscaled Papkovich–Neuber representation, with harmonic functions and :
Indeed and because each potential is a harmonic function. Put and . The decaying harmonic functions with the necessary angular dependence are , and . The last is a harmonic function precisely because . A Stokeslet is excluded by the force-free condition, and a rotlet by the torque-free condition. Try
The resulting Stokes flow is
At , the coefficient of fixes ; the remaining constant vector gives . In the mode, matching gives and . Therefore the complete two-mode tensorial squirmer flow is
The boundary condition is satisfied in the laboratory frame, so the Stokes flow tends to zero at infinity. The potential dipole in the mode gives an irrotational flow and decays as ; the leading mode is a stresslet, decaying as . Neither carries a net force or torque. Direct surface integral averaging with the surface slip velocity formula gives the same translation, providing an independent check. Uniqueness of Stokes flow then identifies this decaying solution.
Put the fixed outer centre at the origin, and let the moving inner centre be . This reverses the sign of the vertical offset used in the previous parts: now . At concentricity rotation produces no force and translation has isotropic resistance . Balancing the external load gives
There is no inertial acceleration in this Stokes flow model; velocity is determined instantaneously by force balance.
For the subsequent motion, the full-film journal bearing assumption matters: pressure is single-valued around the whole annulus, with no specified cavitation boundary. Let , , , and be its radial and tangential unit vectors. The squeeze resistance of an eccentric journal bearing has radial and tangential coefficients
For completeness, rotate coordinates until points along , so . Radial translation gives squeezing flux and resistance proportional to . Tangential translation gives ; the constant enforces periodic pressure. Its resistance uses
These expressions supply both translation directions; retaining only the vertical squeezing formula would miss the moving axle's horizontal dynamics.
The rotational fluid force from the earlier calculation points along , with magnitude . Superposing rotation and translation by Linearity of Stokes flow, and resolving the load, gives
For positive the axle initially moves down, then to the right because the rotation-generated force is perpendicular to the downward eccentricity. The equilibrium is displaced horizontally to the right, at the same height as the outer axis. Its eccentricity is the unique solution
The rotational force then points upwards and balances the load. For negative the displacement is to the left, using in the magnitude equation. Uniqueness follows because the logarithmic derivative of has positive numerator after a common positive denominator. If and , no separated static equilibrium exists in this ideal model. If , concentricity remains a solution.
One should not assert that this full-film model necessarily settles to the equilibrium. It predicts full-film journal-bearing whirl. For , eliminate time from the two boxed evolution equations and put . The orbit starting at concentricity obeys
so, with its zero initial horizontal displacement,
The orbit begins on the lower branch, turns at before contact, and returns along the upper branch, forming a closed orbit through concentricity. The ratio of the right-hand side to increases from zero to infinity, giving a unique turning eccentricity below one. Linearizing at equilibrium likewise gives and with : the eigenvalues are imaginary, not damped. Thus the equilibrium position exists, but the initially concentric axle circulates around it in the stated ideal full-film approximation. Cavitation or additional mechanical constraints would change the model; none were specified.
The normalized centre trajectory below illustrates the full-film prediction for . The dashed circle is the contact locus of the axle centre, not either cylinder wall.
For a vector in the nonnegative orthant, the PDF's matrix gives the quadratic form
Thus it is a copositive matrix. On the other hand, with ,
so it is not a positive semidefinite matrix. Equivalently, the eigenvalues are and , with eigenvectors and .
The local TeX has corrupted the matrix entries. The PDF has diagonal entries one and off-diagonal entries two. The all-twos matrix in the TeX would instead have quadratic form and would be a positive semidefinite matrix; it cannot demonstrate the requested distinction.
A pointed cone has no nonzero line through the origin: equivalently . If , its quadratic form vanishes on the nonnegative orthant. Testing the coordinate vectors gives . Testing then gives
Since is a symmetric matrix, every entry is zero. Thus .
The identity matrix gives an interior point. For a symmetric perturbation with operator norm , the Cauchy-Schwarz inequality gives
This open norm ball around lies even in the positive semidefinite cone, hence in . Consequently and the interior is nonempty.
More generally, the interior of the copositive cone consists exactly of strictly copositive matrices. Positivity on the compact nonnegative unit sphere has a positive minimum and persists under small perturbations; a zero there is destroyed by an arbitrarily small negative multiple of .
The real vector space of symmetric matrices has dimension . By the conic Carathéodory theorem, every member of is a conic combination of at most generators. Absorb each nonnegative coefficient into its vector through .
If converges to , write, padding with zero vectors if necessary,
The matrix trace satisfies
The left side is bounded because converges. Thus the finite tuple is bounded. The Bolzano-Weierstrass theorem gives a subsequence on which every vector converges, say . Continuity of the outer product now gives . Hence
This proves closedness of the completely positive cone. The uniform bound on the number of factors and the matrix trace bound are both essential: an arbitrary conic hull of a closed generating set need not be closed.