Fix an even weight and write . Extend the slash operator for modular forms to positive-determinant rational matrices by the determinant-normalized slash operator
The automorphy factor identity makes this a right action. Let be the integral matrices of determinant . Their left -cosets have unique determinant-n matrix representatives for Hecke operators
An integral row operation obtained from Bézout's identity makes the first column , and a row shear reduces the other top entry modulo , proving this description. The usual Hecke operator is
This normalization has . Right multiplication by permutes the left cosets in , so has the same modular transformation law as . Each summand is holomorphic in . Holomorphy at the cusp and preservation of cusp forms follow directly from the coefficient formula below; the full modular group has only one cusp orbit. Thus the operators act on both and .
If , summing over kills terms unless . Writing gives output exponent , so a term of exponent requires and has original index . Its multiplier is . The Fourier coefficients of a composite-index Hecke operator are consequently
For , this means . In particular . For a prime number ,
with a nonexistent fractional-index coefficient interpreted as zero.
The Hecke multiplication relations follow from these coefficients. For coprime indices, the two divisor choices combine uniquely and give . For prime powers put , and, on formal Fourier series, let and . These individual maps need not preserve level one, but , and the coefficient formula gives
Multiplying on the left by and cancelling yields
Induction gives ; combining distinct prime factors proves
The modular Hecke algebra is therefore commutative and generated by its prime-index operators. The identity , rather than the generally false reversed identity, is what proves the prime-power recurrence.
On use the positive definite Petersson inner product
Exponential cusp decay makes this integral finite. The Hecke operators are self-adjoint for the Petersson inner product. Here is the correspondence argument. For a positive-determinant matrix , set . The finite sum over the double coset unfolds its pairing into
Changing variables preserves hyperbolic area, and shows that the determinant-normalized slash factors transfer from to on . The new quotient is by ; folding it back gives the operator for the reversed double coset. For , its adjugate again lies in . Positive scalar matrices act trivially in the determinant normalization, so and its adjugate give the same action. The adjugate involution preserves the entire determinant- correspondence, and the external normalization is real. Thus
Finite-dimensional spectral theory now gives a simultaneous orthonormal eigenbasis on , since the operators commute and are self-adjoint. For a common Hecke eigenform with eigenvalues , the first-coefficient formula gives . If , every coefficient vanishes and , a contradiction. Rescale each eigenform to have . The resulting basis is orthogonal, and
All these eigenvalues and coefficients are real. A fixed simultaneous eigenspace is one-dimensional, because its normalized Fourier coefficients are uniquely determined by the eigenvalues.
Applying the multiplication relations to an eigenform gives
The recurrence yields . Multiplicativity then gives the Euler product of a Hecke eigenform
initially in a right half-plane, for example using the Fourier coefficient bound for a cusp form. Modular inversion and the Mellin transform of a cusp-form L-function continue to an entire function and give .
There is also an integral structure. If , choose , , with a monomial in of weight and constant term one. These forms have integral Fourier coefficients and start with ; their first coefficients form a unitriangular matrix. They are a basis, and every cusp form with integral coefficients is an integral combination of them, by successive elimination of its first coefficients. The coefficient formula shows that preserves this lattice. Its characteristic polynomial is consequently monic with integer coefficients, proving that the Hecke eigenvalues are algebraic integers. Together with self-adjointness, this gives real algebraic integers without requiring any unproved bound for their sizes.
For even , the full space decomposes as . The normalized Eisenstein series is a simultaneous eigenform with
Its coefficients are , and the elementary divisor identity verifies the eigenvalue formula, including the constant coefficient. Thus the cusp eigenbasis plus diagonalizes the operators on . Weight two and odd weights have no forms; in weight zero the constant function has eigenvalue . As a concrete cuspidal example, , so for its Fourier coefficients, and the recurrence gives .
For a classical error-correcting code of length , alphabet size , minimum Hamming distance and codewords, the Singleton bound is
For a linear code this is . Deleting any coordinates is injective on the codewords, since two words agreeing on the remaining coordinates would differ in fewer than positions; this also explains the classical bound.
For an n-qubit quantum code carrying logical qubits and having quantum code distance , the quantum Singleton bound is
More generally replace by for code dimension . The proof applies to degenerate codes too.
Let . Purify the maximally mixed encoded input by a reference of dimension :
Distance makes erasure of any subset of at most qubits correctable. The allowed quantum erasure correction condition says that a correctable erased set is decoupled from :
This is the matrix-element correction condition in another form: all operators on have constant diagonal matrix elements and zero off-diagonal matrix elements in the logical basis, so tracing the other physical qubits in yields the displayed product.
First justify the sizes needed for the partition. If , partition all physical qubits into , both of size at most . Both sets are correctable. Purity of and the Schmidt decomposition give
Adding forces , a contradiction. Thus , without assuming the bound we aim to prove.
Choose disjoint sets of size , and let contain the remaining qubits. The joint state is pure, so decoupling and Subadditivity of Von Neumann entropy give
Adding and cancelling gives . The Von Neumann entropy of -dimensional states is at most : for positive eigenvalues , concavity of the logarithm gives . Here , so , proving the quantum bound. The code is assumed to encode information (); a one-dimensional code requires a separate distance convention, since simply re-preparing a known state makes its erasure-correction condition vacuous.
False. Take the Bell state
The joint state is pure, so . Taking either partial trace kills the off-diagonal terms and gives , whose two eigenvalues are . Thus , contradicting the proposed inequality . Quantum entanglement allows a pure joint state to have mixed subsystem states.
The concavity inequality is true, but its printed equality condition is false. At equality always holds, even for distinct states; for example take and . The correct statement on is
For , entropy is therefore strictly concave.
We give the matrix inequality needed for the proof. Define the quantum relative entropy if the support of is contained in that of , and otherwise. Diagonalize the two states with eigenvalues , and put . Each row and column of sums to one. The elementary scalar inequality
follows from , with equality exactly at ; use limits at zero. Consequently
Equality forces whenever . Hence every eigenvector of is also a -eigenvector with eigenvalue , so . Conversely identical states give zero relative entropy. This proves nonnegativity of quantum relative entropy and its equality condition, including states with zero eigenvalues under the support convention.
Now set . For its support contains both component supports. Direct expansion gives
Since both coefficients are positive, equality holds exactly when both component states equal , equivalently . At either endpoint the mixture has only one component and equality is automatic. This proves the corrected strict concavity of Von Neumann entropy.
For a density matrix on a finite-dimensional Hilbert space, its Von Neumann entropy in bits is
where are its eigenvalues and . It is the Shannon entropy of the spectrum, is zero for a pure state, and is invariant under unitary conjugation.
The command centres the log measurements and performs principal component analysis of their covariance matrix. With cor=F, it does not first standardize the variables to variance one. For a unit principal component loading vector , the score has sample variance . By the spectral theorem for real symmetric matrices, expand in an orthonormal eigenbasis; that variance is a weighted average of the eigenvalues. Its maximum is the largest eigenvalue, reached at the corresponding eigenvector. Repeating subject to orthogonality to previous directions gives the other principal components.
The software uses the divisor- sample covariance matrix for its component standard deviations, whereas var used divisor . Diagonalizing the displayed matrix gives approximately
Taking square roots of the latter gives , agreeing with the output to the rounding of the displayed sample covariance matrix. The normalization changes these numerical standard deviations but leaves the eigenvectors and proportions of explained variance of a principal component unchanged.
The first principal component explains about of the total log-variable variance, the second another , and the last about . Keeping two preserves about . An original scree plot displays the sharp drop after the first component:
Figure 1.
Principal-component variances and cumulative explained variance for the log-tree measurements
. Details.
Consequently the centered cloud is very elongated along one direction: a one-dimensional approximation represents almost all of its squared variation. From the displayed covariance matrix, a unit first eigenvector, with its arbitrary sign chosen positive, is approximately
Its principal component score is therefore . All coefficients have the same sign, so this direction describes overall tree size, with log volume dominating the unstandardized variation. The summary alone supplies proportions, not the loading directions; the displayed sample covariance matrix supplies the latter. This is a geometric approximation, not evidence of an exact deterministic relation or independent original variables.
One further use is principal component analysis on a correlation matrix, obtained with cor=T, which equalizes marginal variances and answers a different scaling-sensitive question. Another is principal component regression: fit a response to selected principal component scores rather than highly correlated original predictors, choosing the number using prediction assessment. The fitted transformation also projects new measurements into the same low-dimensional coordinates, provided the training centering and scaling are retained.
Write the binary incidence matrix of a set system as to avoid confusing it with a sample size. Then
counts the number of blocks containing treatment , and for , counts blocks containing both treatments. The displayed structure therefore makes every treatment replication equal to and every pair concurrence equal to .
Assume the usual nonempty block design, with and . If , any block containing one treatment contains every other treatment: otherwise that treatment's replication would exceed its concurrence with the omitted one. Every block is consequently complete, so and . With random allocation within blocks this is a randomized complete block design. If , the design is a balanced incomplete block design. Counting partners of a fixed treatment in its blocks gives
For , gives , hence . Moreover has eigenvalue on the -dimensional zero-sum subspace and eigenvalue on the constant direction. Thus , while . This proves , the Fisher's inequality for block designs. The case allows singleton blocks; their lack of connectedness prevents general treatment comparison after block adjustment, but does not invalidate the rank inequality.
First ignore the day information and use a one-way normal linear model with five group means and independent errors of common variance. There are observations. The analysis of variance has treatment, residual and corrected-total statistical degrees of freedom , respectively. The mean squares in ANOVA give
Under equal treatment means this has the F-distribution with degrees. It exceeds the given upper critical value , so the unblocked analysis rejects equality at .
The actual day allocation omits a different treatment on each of the five days. Hence it is a balanced incomplete block design with
Every pair occurs on exactly the three days omitting neither member. In the additive two-way analysis of variance, use an intercept, four independent treatment contrasts and four day contrasts. The design is connected, so the model rank is and its residual has statistical degrees of freedom. Day effects and treatment effects are not orthogonal, because a different treatment is absent each day; the unadjusted treatment sum of squares cannot be used for the adjusted test.
Enter days first and then treatments. The supplied sequential sums of squares give
The day, treatment-after-day, residual and corrected-total statistical degrees of freedom are . Under the additive normal linear model and the null of equal treatment effects, the adjusted numerator and residual squared lengths are independent chi-squared quantities, so the ratio has the F-distribution with degrees. It is below even the given critical value . After accounting for days there is no significant treatment difference at either or . This inference assumes independent homoscedastic normal errors and an additive day effect; with one observation per observed treatment–day cell, unrestricted interactions cannot also be fitted.
The isomorphic pair is ; is different. All three have order , so order alone does not settle the question; explicitly . We give a concrete realization and an element-order distinction.
On , the Pfaffian is
It is a nonsingular plus-type quadratic form: the three displayed pairs give a hyperbolic decomposition. Change of basis multiplies the Pfaffian by the determinant, which is always one in . Hence the exterior-square realization of PSL4 over F2 embeds into . The kernel of a group homomorphism is trivial: an element acting trivially on the exterior square fixes every decomposable two-space, then every one-space as an intersection of two-spaces, and hence is a scalar; over this scalar is one.
For a second model let be the even-weight vector subspace of and quotient by the all-one vector. The dot product descends to a nondegenerate alternating bilinear form on the six-dimensional quotient, and
is well defined, since complementing an even subset changes half its weight from to . It has zero vectors, so is plus type. Coordinate permutations give a faithful action: fixing the quotient fixes each weight-two subset, because its complement has weight six, and fixing all two-subsets forces the identity permutation.
From the independently derived symplectic order and quadratic orbit count below,
Thus and the image of is its index-two subgroup . The index-two subgroup is unique: a nontrivial group homomorphism sends every transposition to the same nonidentity element and is the sign map.
To separate , observe that contains of order 15. An odd-order projective element of lifts to a semisimple linear operator, since its order upstairs divides three times an odd order in characteristic two. The possible eigenspace degree patterns are , and . In the split case all eigenvalues have order dividing three, so the projective element has no order 15. In the case the eigenvalues are with ; its fifth power is scalar because , so its projective order divides five. In the irreducible case the determinant-one torus has order and quotienting its scalar subgroup of order three gives projective order dividing seven. There is therefore no element of order 15 in .
Several small-parameter coincidences connect the finite classical groups to permutation groups. The projective-line action immediately gives , , and by faithful actions of degrees three, four and five and their orders. Also : its involutions have Klein-four centralizers, giving five Sylow subgroups; their conjugation action is faithful and embeds its order-60 simple group into . Simplicity here can be checked from class sizes : no proper nontrivial normal class union has order dividing 60. The same five-subgroup action extends to , with trivial kernel of a group homomorphism and order 120, giving . Indeed its kernel intersects trivially, so centralizes that normal subgroup. Commuting projectively with both upper and lower elementary unipotents forces a representing matrix to be scalar, so this kernel is trivial.
The less immediate coincidence can be exhibited on the ten unordered triple partitions used in Question 4. Let , , , assign to and to , and label the other partitions by applying to the zero partition, with and . Inspection of these nine partitions gives
Translations and inversion generate : conjugating the upper unitriangular matrices by inversion gives the lower ones, and elementary elimination generates . Their projective action has order . These partition permutations come from even permutations of six letters, whose partition action is faithful as proved below; hence they fill .
Finally, on the even-weight module of modulo its all-one vector, coordinate permutations preserve a nondegenerate alternating bilinear form in dimension four and act faithfully, again by the weight-two-subset argument. Both and have order 720, proving , with commutator subgroup . These examples illustrate both the need to quotient group centers and the low-rank exceptions to general simplicity. They do not make equal orders sufficient for group isomorphism, as the two order-20160 examples already demonstrate.
Write the integrand, without its common overall factor, as . Keep each constant Grassmann variable on the left. For the first supersymmetry component, varying the bosonic term gives
Varying its fermion term gives . The plus sign in the second term comes from moving the odd parameter past . The middle terms cancel and the rest form . The second supersymmetry component similarly gives . Hence, off shell,
This proves the local total-derivative identity for rigid worldsheet supersymmetry; the action is invariant when the corresponding boundary flux vanishes and the transformation preserves the allowed fields. A constant parameter preserves a periodic boson and a periodic fermion. In a Neveu–Schwarz sector, however, is antiperiodic for constant and does not preserve the periodic boson. Thus the bulk identity does not supply a global constant supercharge in every spin sector. This is the spin-structure obstruction to constant worldsheet supersymmetry; the local superconformal formulation handles the different sectors consistently.
For independent field variations, integration by parts gives bulk terms
The equations of motion are therefore
For variations vanishing at the temporal ends, the spatial seam term is proportional to the difference between its values at and of
The bosonic part cancels for closed string periodicity, also in a fixed winding sector. For a real fermion impose and the same relation on its variation. Seam cancellation requires , so the two untwisted possibilities are periodic, (Ramond sector), or antiperiodic, (Neveu–Schwarz sector). The two chiralities of a closed string can choose these signs independently, giving R–R, NS–NS, R–NS and NS–R sectors. This discussion assumes the ordinary Lorentz-invariant untwisted boundary conditions of the flat theory.
The chiral equations and boundary signs give the following Fourier series
where in R and in NS. Thus integer or half-integer modes follow directly from the Fourier series monodromy. With the conventional string oscillator normalization their anticommutation relations and reality conditions are
For an open string the endpoint gluing identifies the two sets of coefficients, leaving one R or NS tower.
In ten-dimensional light-cone gauge in string theory, the eight transverse bosonic modes have positive integer level and each NS fermionic creator has a positive half-integer level. For the unprojected low levels of the open RNS string, all states through in the NS sector are
The antisymmetric index restrictions are consequences of fermionic anticommutation; the boson–fermion pair has all 64 choices. The displayed partitions exhaust levels at most . Here the NS normal-ordering constant of a string is .
In the R sector , and the zero modes satisfy . Thus generate the Ramond zero-mode Clifford algebra. The unprojected ground states span a sixteen-dimensional transverse spinor space, . All states in the requested range are
There is no intervening half-level, since all nonzero R modes have integer level. Acting with the zero modes only moves within the ground spinor space and does not generate further independent copies.
The GSO projection keeps odd NS fermion-excitation parity, removing the tachyonic vacuum and the entire NS level. In R it keeps one eigenvalue of total fermion parity, whose zero-mode part is spinor chirality. It leaves eight massless spinor states. At R level one, the retained families are and , of opposite ground chirality, so there are states. The retained NS states are spacetime bosons and the R states spacetime fermions. Consequently the retained levels have at mass zero and at , with no tachyon.
Equality at every higher mass level follows from the standard Jacobi abstruse identity, or equivalently the equality of the transverse generating functions
The left side counts the projected NS bosons, the right side the projected R fermions. Their common coefficients start . This consistent truncation yields spacetime supersymmetry; the bulk worldsheet symmetry alone would not remove the tachyon or impose the projection.
Here a supersymmetry-preserving combination means a real combination of Hermitian Majorana spinor supercharges, in a positive-norm unitary representation of the ordinary Super-Poincaré algebra. This reality qualification is essential. Let be normalized and in the charge domains, and define the real symmetric matrix
For real , the Hermitian operator satisfies
Therefore is a positive semidefinite matrix, and
The reverse implication uses positivity: diagonalize , so a zero quadratic form has zero component in every positive-eigenvalue direction. This converts the problem into nullity of real N=1 supercharges, not just a condition on the determinant of an operator-valued expression.
In the equivalent Weyl spinor form, . After a fixed invertible change of real charge basis, is the realification of the Hermitian two-by-two matrix
up to the harmless spatial-sign convention. A complex Hermitian matrix has the same eigenvalues in its realification, each repeated twice. The Pauli matrix multiplication law gives , so these eigenvalues are and , each twice. Positivity forces . If one nonzero real annihilates the state, has a kernel: either , with exactly two zero eigenvalues, or , with four. Thus
For a momentum eigenstate these are the null-momentum and zero-momentum cases; the expectation-matrix proof also covers states not assumed to have definite momentum. There are no massive states preserving a real charge in this unextended algebra.
If “linear combination” instead allows arbitrary complex coefficients, the unrestricted claim is false. In a massive fermionic Fock space with two lowering operators and a spin-half Clifford vacuum spectator, take
Then . The three vectors , and are linearly independent, by their occupation numbers and spectator spin labels. The complex annihilator is therefore only one-dimensional. Such a lowering operator is not a Hermitian generator of preserved real supersymmetry. The boxed conclusion applies to the physical real-charge interpretation; it also assumes no domain-wall charge in N=1 supersymmetry.
Use local coordinates , at . The Jacobian matrix, its trace and its determinant are
Consequently is attracting when , repelling when , and a saddle equilibrium when . A transition between a node and a focus at changes the linear geometry but is not a bifurcation of the local topological phase portrait.
The stationary bifurcation curve is . To identify it, write , . At a non-equatorial equilibrium point, eliminating gives
Near , if , these yield and . The two branches are related by the local reflection . Their determinants are , so they are saddle equilibria. This is a pitchfork bifurcation; on the portion with the saddle branches lie on the side where is stable, giving a subcritical pitchfork bifurcation.
A Hopf bifurcation requires , hence
The oscillation frequency is . At the intersection , but : there is a double zero eigenvalue with one eigenvector. The map from to has nonzero Jacobian determinant, so two independent parameter conditions produce this codimension-two bifurcation. Reflection removes quadratic terms; the appropriate initial comparison is with a reflection-symmetric cubic double-zero normal form, subject to the cubic degeneracy checked below.
For completeness, the printed vector field has a subcritical, rather than supercritical, Hopf bifurcation. In the mechanical coordinates , , at its cubic acceleration has coefficient and coefficient . For a small harmonic oscillation, the averaged cubic change of is , where
Thus a small unstable periodic orbit lies on the attracting side of the Hopf bifurcation. This calculation matters when comparing the original equations with the later assumed normal form.
Figure 1.
Local bifurcation curves for the spherical system, rotating convection, and the fold–Hopf system
. Details.
Let and . The eigenvalues at the conductive equilibrium point are and , both negative since and . The coupled Jacobian matrix has characteristic polynomial
where
A simple zero eigenvalue occurs on . The reflection , with fixed, makes its generic steady-state bifurcation a pitchfork bifurcation.
For a nonzero imaginary pair, substitute into : the real and imaginary parts require and . Hence
With , this Hopf bifurcation curve is present only for . At its intersection with the pitchfork bifurcation curve,
and . The zero eigenvalue has geometric multiplicity one: its eigenvector has , . Thus this is a reflection-symmetric Bogdanov–Takens bifurcation, rather than two independent zero modes.
The Routh-Hurwitz stability criterion gives the stable trivial state below for and below for . The rest of the line , beyond , is a stationary bifurcation of an already unstable trivial state. Likewise the extension of below is only an algebraic line, since its putative frequency is not real. The middle panel of the bifurcation diagram in part 1(b) distinguishes the actual curves from this extension.