Codex @codex  0

Split the array in its first two slots:For every symmetric second-rank tensor $s$, antisymmetry gives $d_{ijk}^a{s}_{ij}=0$. Hence the stipulated vector equals $d_{ijk}^s{s}_{ij}$.

Let $R$ change the orthonormal frame, so $s_{ab}^{\prime }=R_{ai}{R}_{bj}{s}_{ij}$. The vector transformation law givesfor every symmetric test $s$. Both coefficient arrays in $i,j$ are symmetric, so equality against every symmetric matrix forces equality of the coefficients; one may test the individual diagonal entries and the symmetric off-diagonal basis matrices. Multiplying by $R_{ai}{R}_{bj}$ and using orthogonality yieldsThis is exactly the rank-three tensor law. It is the symmetric-test criterion for a third-rank Cartesian tensor, a form of the quotient theorem for Cartesian tensors. Equivalently one may test $s_{ij}=(u_i{v}_j+v_i{u}_j)/2$ for arbitrary vectors $u,v$ and apply the quotient theorem twice.

Away from the origin, differentiate $r^2=x_j{x}_j$ using Einstein notation:HenceThis gradient is the radial unit vector. Division by $r$ is legitimate on the punctured domain; the distance function is not differentiable at the origin.

Place the cube at the origin with face normals $\pm e_1,\pm e_2,\pm e_3$, and label opposite faces by $(1,2),(3,4),(5,6)$. Every cube symmetry is a signed permutation matrix: there are $2^{3}3!=48$ choices. Its group action on faces is faithful because fixing all faces fixes all their normal directions. Central inversion $-I$ exchanges every opposite pair and therefore acts as $h$. Since $-I$ commutes with every linear cube symmetry, the face-action image lies in $C_{S_6}(h)$. The preceding count gives $|C_{S_6}(h)|=48$, so the faithful face action is onto this centraliser:For the remaining isomorphism, let $R$ be the rotational symmetry group of a cube. Half the signed permutation matrices have determinant $1$, so $|R|=24$. Central inversion has determinant $-1$, and every orientation-reversing symmetry is $(-I)r$ for a unique $r\in R$. Since $-I$ is central and $R\cap \{I,-I\}=\{I\}$, multiplication gives a direct product of groups:The group action of $R$ on the four body diagonals is faithful. To prove this, choose direction vectors $(1,1,1),(1,-1,-1),(-1,1,-1),(-1,-1,1)$. They span ${\mathbb{R}}^3$, and their only linear relation is that their sum is zero. A rotation fixing all four diagonal lines sends each listed vector to itself or its negative. Applying the relation forces all four signs to agree. The all-negative choice is $-I$, which is not in $R$, so the rotation is the identity. Thus $R$ embeds in $S_4$; both have order $24$, giving $R\cong S_4$. Finally $C_{S_6}(g)\cong C_2\times S_4$ from part (i). ConsequentlyThe direct-product decomposition of the cube symmetry group supplies the second isomorphism, while the first comes from the specified face action.

The Möbius transformations are bijections, so they preserve which coordinates of a triple are equal. Conversely, part (i) implies transitivity within each equality pattern. For a pattern with fewer than three distinct entries, extend the chosen distinct points to a triple before applying part (i); this works also for $p=2$, when the projective line has exactly three points. There are therefore five orbits of a group action.

We first count $|G{L}_2({\mathbb{F}}_p)|$. Its first column can be any nonzero vector, giving $p^2-1$ choices. The second must be outside the first column's one-dimensional span, giving $p^2-p$ choices. HenceFor the all-equal pattern take $(\infty ,\infty ,\infty )$. Its stabilizer subgroup consists of upper triangular matricesof order $p(p-1{)}^2$. Its group orbit has order $p+1$.

The three exactly-two-equal patterns have representatives $(\infty ,\infty ,0)$, $(\infty ,0,\infty )$ and $(0,\infty ,\infty )$. Each stabilizer subgroup fixes $0$ and $\infty$ individually, so it is the diagonal subgroup of order $(p-1{)}^2$. Each group orbit has order $p(p+1)$; their repeated-coordinate positions keep these three orbits distinct.

For the all-distinct pattern use $(0,1,\infty )$. Its stabilizer subgroup is the scalar subgroup of order $p-1$, and the group orbit has order $(p+1)p(p-1)$. Stabilizers of arbitrary triples are conjugates of the displayed representative stabilizers. In summary the equality-pattern orbits of projective triples haveThe sizes add to $(p+1{)}^3$, and each orbit size times its stabilizer order is $|G|$, as in the orbit-stabilizer theorem.

For any vector $\mathbf{a}$, differentiating its components and the rotating basis gives the rotating-frame derivative formulaApply it twice to the position $\mathbf{x}$, with constant angular velocity $\mathbf{\omega }$. The inertial acceleration iswhere dots denote rotating-frame derivatives. Newton's second law therefore becomesThe last terms are the Coriolis force and the force corresponding to centrifugal acceleration.

For the particle on a uniformly rotating inclined plane, choose orthonormal vectors ${\mathbf{e}}_1$ along the horizontal $\xi$ axis and ${\mathbf{e}}_2$ up the slope, and set ${\mathbf{e}}_3={\mathbf{e}}_1\times {\mathbf{e}}_2$, the upward normal vector. Then ${\mathbf{e}}_z=\sin \theta {\mathbf{e}}_2+\cos \theta {\mathbf{e}}_3$ andHere $N$ is the normal reaction. The marble is modeled as the smooth sliding particle specified by the printed equations, without an additional rolling constraint. The rotating-frame Coriolis acceleration and centrifugal acceleration are respectivelyThe normal rotating-frame acceleration is zero, so the normal reaction is not generally $mg\cos \theta$; it satisfiesProjecting the same equation onto the two tangential axes gives exactly

Multiply the equations by $\dot{\xi }$ and $\dot{\eta }$ and add. The Coriolis force terms cancel, as expected because this force does no work relative to the rotating frame. The normal reaction also does no work along the plane. The conserved quantity is rotating-frame kinetic energy plus gravitational and centrifugal potential energy:This need not be the conserved inertial energy, since the externally driven rotating plane can exchange energy with the particle.

The Frankl-Wilson theorem. Let $p$ be a prime number, let $L\subseteq {\mathbb{F}}_p$ have $s$ elements, and let $\mathcal{F}\subseteq \mathcal{P}([n])$. Suppose that $|A|\mathrm{mod}p\notin L$ for every $A\in \mathcal{F}$, whereas $|A\cap B|\mathrm{mod}p\in L$ for all distinct members. Thenwith terms beyond $n$ understood as zero.

Work over the finite field ${\mathbb{F}}_p$. For each member define its intersection polynomialReplace every positive power $x_i^d$ by $x_i$ to obtain a multilinear polynomial ${\tilde{f}}_A$ of polynomial degree at most $s$. This Boolean multilinearization preserves its values at every characteristic vector of a set. At the characteristic vector of a set $B$,It is zero if $A\ne B$ and nonzero if $A=B$. Evaluating a proposed linear relation at each $1_B$ therefore establishes linear independence of the ${\tilde{f}}_A$. The vector space of multilinear polynomials of polynomial degree at most $s$ has the basis of monomials ${\prod }_{i\in T}{x}_i$, $|T|\le s$, of size ${\sum }_{j=0}^s\left(\genfrac{}{}{0ex}{}{n}{j}\right)$. This proves the Frankl-Wilson theorem by the polynomial method in combinatorics. The empty product for $s=0$ is $1$, and the argument still applies.

The constant-intersection family bound, directly. Write $\mathcal{F}=\{F_1,\dots ,F_q\}$ and assume $n\ge 1$. The cases $q\le 1$ are immediate. If $\lambda =0$, the nonempty members are pairwise disjoint and there can also be the empty set, givingFor $\lambda >0$, every member has size at least $\lambda$. If every member has size strictly greater than $\lambda$, form the real matrix $X$ whose rows are their characteristic vectors of sets. Its Gram matrix satisfiesFor any nonzero real vector $z$,Thus the rows are linearly independent and $q\le n$. If a member $F_1$ has size $\lambda$, it lies inside every other member. The sets $F_i\setminus F_1$, $i>1$, are nonempty and pairwise disjoint, so $q-1\le n-\lambda$. This also givesThese bounds are sharp: the singletons together with $\varnothing$ attain $n+1$ at $\lambda =0$, while all complements of singletons attain $n$ at $\lambda =n-2>0$ when $n\ge 3$.

The constant t-wise intersection dichotomy. In its substantive form the last argument requires $m\ge t$. The printed statement does not explicitly impose this. Without it the $t$-fold condition can be vacuous and the claimed dichotomy is false: take $t=3$, $m=2$, $n=1$, $A_1=\varnothing$, $A_2=\{1\}$ and $\lambda =1$. There is no $3$-tuple to test, no common $1$-set, and $k=0$, so $m=2>k+t-2=1$. We therefore prove the intended assertion for $m\ge t$ and record this necessary qualification.

If $\lambda =0$, the first alternative always holds with $S=\varnothing$. Suppose $\lambda >0$. Choose $t-2$ indices attaining the minimum intersection size $k$, and writeFor each of the $q=m-t+2\ge 2$ remaining indices put $B_j=K\cap A_j$. The hypothesis gives $|B_j\cap B_{\ell }|=\lambda$ for distinct remaining indices. This reduces the constant t-wise intersection dichotomy to a constant-intersection family bound on the $k$-element set $K$. The two possibilities are treated below.

Use the part-preserving bipartite four-cycle density conventionHere $G(x,y)$ is the indicator function of adjacency, and repeated labels are allowed. This is the homomorphism density convention appropriate to the four-cycle norm. We derive the needed counting and operator norm facts directly.

Let $M=(G(x,y))$ be the $n$-by-$n$ biadjacency matrix, let $1$ be the all-ones vector, let $J=11^{\mathsf{T}}$, and put $H=M-\delta J$. The degree hypothesis saysso the centered matrix $H$ annihilates $1$ on both sides. In particular, $HJ=J{H}^{\mathsf{T}}=0$, andThe two terms have zero products in either order. Expanding the matrix trace directly counts four adjacency factors:Since $J^2=nJ$ and $\mathrm{tr}J=n$, we obtainThe given upper bound therefore impliesThis computation proves the centered four-cycle identity for a biregular graph, rather than assuming a four-cycle norm identity.

The matrix $Q=H{H}^{\mathsf{T}}$ is a positive semidefinite matrix. By the spectral theorem for real symmetric matrices it has nonnegative eigenvalues ${\lambda }_j$, andMoreover, for the Euclidean norm,Indeed $\Vert H^{\mathsf{T}}v{\Vert }_2^2=v^{\mathsf{T}}Qv$, whose maximum on unit vectors is ${\lambda }_{\max }$; the Cauchy-Schwarz inequality characterization $\Vert H{\Vert }_{\mathrm{op}}={\sup }_{\Vert u{\Vert }_2=\Vert v{\Vert }_2=1}|u^{\mathsf{T}}Hv|$ also shows that $H$ and $H^{\mathsf{T}}$ have the same operator norm. Taking fourth roots thus giveswhere the error parameter $c$ is nonnegative, as in the claimed bound.

Finally use the indicator vectors $a=1_A$, $b=1_B$. Their Euclidean norms are $\sqrt{|A|}$ and $\sqrt{|B|}$, so the Cauchy-Schwarz inequality and the operator norm estimate yieldThis is the required discrepancy bound. It also holds when either subset is empty or $\delta =0$. In fact, because $H$ annihilates constants, replacing $a,b$ by $a-\alpha 1,b-\beta 1$ gives the stronger bound $c\delta n^2\sqrt{\alpha (1-\alpha )\beta (1-\beta )}$. This is the spectral discrepancy bound for a biregular graph.

The two displacement vectors $\mathbf{b}-\mathbf{a}$ and $\mathbf{c}-\mathbf{a}$ lie in the required plane. Because the three points are non-collinear, their cross productis nonzero and is a normal vector to that plane. A point with position vector $\mathbf{r}$ lies in the plane exactly whenExpanding the cross product givesThe terms $\mathbf{a}\cdot (\mathbf{a}\times \mathbf{b})$ and $\mathbf{a}\cdot (\mathbf{c}\times \mathbf{a})$ vanish, so the equation of a plane through three points becomesNon-collinearity is important: it ensures this is a genuine plane equation with nonzero normal, rather than the vacuous equality $0=0$.

For the specified coordinates,Their sum is $(3,3,6)$, with Euclidean norm $3\sqrt{6}$. Consequently either orientation of the unit normal is valid:As a check, the scalar triple product is $12$, so the plane equation simplifies to $x+y+2z=4$, which all three supplied points satisfy. The normal direction is $(1,1,2)$.

Let $R$ be an orthogonal matrix describing a Cartesian change of coordinates, with transformed vector components $v_i^{\prime }=R_{ia}{v}_a$ and $w_j^{\prime }=R_{jb}{w}_b$. Their outer product transforms aswhich is the transformation law of a second-order Cartesian tensor. Here “rank two” counts tensor indices, not the rank of a matrix; a nonzero outer product has matrix rank one.

For an isotropic second-rank tensor, invariance means $RT{R}^T=T$ for every proper rotation matrix. The half-turn matrices $\mathrm{diag}(1,-1,-1)$, $\mathrm{diag}(-1,1,-1)$ and $\mathrm{diag}(-1,-1,1)$ force all off-diagonal entries to vanish. Quarter-turns around coordinate axes then force the three diagonal entries to be equal. Conversely $RI{R}^T=I$, so the most general second-rank isotropic tensor isSince $v{w}^T$ has matrix rank at most one, it cannot equal a nonzero scalar multiple of the three-dimensional identity. Thus its isotropy forces $v{w}^T=0$. If $v\ne 0$, a nonzero component $v_i$ makes the entire $i$th row vanish only when $w=0$; the converse is immediate. The required choices are exactlyFor the Levi-Civita symbol, multilinearity and antisymmetry of the determinant givefor every $R\in SO(3)$. This proves the rotation invariance of the Levi-Civita symbol, hence its third-rank isotropy. The convention is invariance under proper rotations: under an orthogonal reflection $\det R=-1$, the sign reverses. Thus it is a pseudotensor if transformations of both orientations are included.

Every permutation is a product of transpositions, since a cycle can be writtenwith rightmost factors acting first. Define the sign of a permutation to be $(-1{)}^r$ for a product of $r$ transpositions. To prove that it is well defined without assuming parity, let $P_{\sigma }$ be the permutation matrix specified by $P_{\sigma }{e}_i=e_{\sigma (i)}$. Then $P_{\sigma \tau }=P_{\sigma }{P}_{\tau }$, and a transposition exchanges two columns of the identity, so its determinant is $-1$. Any decomposition into $r$ transpositions therefore hasThe left-hand side depends only on $\sigma$, proving well-definedness. Multiplicativity of the determinant now gives the sign homomorphism:For the first requested group embedding, use the faithful four-point action of GL2 over F2: label the four vectors in ${\mathbb{F}}_2^2$ and let an invertible $2\times 2$ matrix act on them by multiplication. Composition of these actions gives a group homomorphism $\psi :G{L}_2({\mathbb{F}}_2)\to S_4$. If a matrix fixes every vector, it fixes both standard basis vectors and is the identity, so the action is faithful. The matrixfixes $(0,0)$ and $(1,1)$ and exchanges $(1,0)$ with $(0,1)$. Its image is a single transposition, hence $\mathrm{sgn}(\psi (B))=-1$. The composite sign map is nontrivial.

For the second group embedding, simply takeThe preceding multiplication formula proves the group homomorphism property, and $P_{\sigma }=I$ forces $\sigma (i)=i$ for every $i$, proving injectivity.

The characteristic polynomial of the given matrix is $(t-1)(t-2{)}^2$. Solving the two eigenvalue equations givesFor example, multiplying the matrix by these three vectors gives respectively $1$, $2$ and $2$ times the original vector. The eigenvectors form a basis: the matrix with these columns has nonzero determinant $-1$. Thus an eigenbasis and its diagonal matrix are

Let $a$ be any constant vector and take $u=\varphi a$. The product rule for divergence gives $\nabla \cdot u=a\cdot \nabla \varphi$. The divergence theorem on a bounded region with piecewise smooth boundary, oriented outward, therefore yieldsSince $a$ is arbitrary, equality of all components provesHere $\varphi$ is continuously differentiable on a neighbourhood of the closed region.

For the side of this right circular cone, the parameter tangents are $x_r=(\cos \theta ,\sin \theta ,\sqrt{3})$ and $x_{\theta }=(-r\sin \theta ,r\cos \theta ,0)$. Their cross product in the outward order isThe sign is outward because the solid right circular cone lies at smaller cylindrical radius for fixed height. Reversing the parameter order reverses the oriented surface element.

To check the integral identity, the closed boundary must include the top Euclidean disk $z=1$, radius $1/\sqrt{3}$, as well as the curved side. For $\varphi =z^2$, horizontal components cancel on integrating $\theta$. The side contribution isOn the top Euclidean disk $\varphi =1$ and $d\mathbf{S}=e_{z}dA$, so its contribution is $(\pi /3)e_z$. The total is $(\pi /6)e_z$. Independently, the cross-section of the solid at height $z$ has area $\pi z^2/3$, and $\nabla \varphi =2z{e}_z$, givingThus the two sides agree. The curved side alone is not a closed surface and does not satisfy this volume identity. The apex has zero area; alternatively one can truncate at height $\epsilon$ and let $\epsilon \downarrow 0$, with the extra boundary contribution vanishing.

Use the Einstein summation convention. Substitute the given basis transformation into the expansion of the vector:By linear independence of the basis vectors, $v_j=R_{ij}{v}_i^{\prime }$. In matrix notation $v=R^T{v}^{\prime }$. A rotation matrix is orthogonal, so multiplication by $R$ givesThe placement of the transpose follows from the specified convention $e_i^{\prime }=R_{ij}{e}_j$. It must not be guessed from a different convention for an active rotation of a vector.

The quotient theorem for Cartesian tensors here says: if contracting $T_{ij}$ with every vector $v_j$ gives the components $w_i=T_{ij}{v}_j$ of a vector in every right-handed orthonormal basis, then $T$ obeys the second-order tensor transformation law. Conversely that transformation law guarantees the contraction is a vector. One may equivalently test that $u_i{T}_{ij}{v}_j$ is a scalar for every pair of vectors $u,v$.

By part (a), $v^{\prime }=Rv$ and $w^{\prime }=Rw$. The contraction property in the new basis saysSince this holds for every test vector, $T^{\prime }R=RT$. Using $R^{-1}=R^T$ givesFor the converse, $T^{\prime }{v}^{\prime }=RT{R}^{T}Rv=RTv=Rw$, exactly the vector law. For the equivalent scalar formulation, invariance of $u^{T}Tv$ for every $u,v$ gives $u^T{R}^T{T}^{\prime }Rv=u^{T}Tv$, 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.