On continuous functions on the p-adic integers, define the forward difference operator and the Mahler coefficients by
Writing , the explicit iterate follows from . The ultrametric inequality and integral binomial coefficients imply and , where the supremum norm is taken over .
The Mahler theorem states that every such has a unique expansion with uniform convergence
Conversely, every sequence in tending to zero yields a continuous function by this expansion. The binomial polynomials form an orthonormal expansion in the non-Archimedean sense: .
Here is the requested proof under the permitted coefficient-decay assumption. For , the binomial polynomial is a continuous function on . Its values on nonnegative integers are integral, and those integers are dense in the p-adic integers. Since is a closed set in , . Also , so , including .
If , the ultrametric inequality gives the uniform tail bound
Completeness of gives a uniform limit , and the uniform limit theorem makes continuous. At any nonnegative integer , all with vanish. Finite binomial inversion gives
since the inner sum is . Hence on a dense subset and therefore on all of . The values at recover each coefficient recursively because ; this proves uniqueness. The expansion bounds by , and the earlier coefficient inequality proves equality. This also proves the converse statement.
Although the problem allows us to assume decay, it can be established independently. By compactness and uniform continuity, approximate uniformly by constant on residue classes modulo . On this finite-dimensional space, and
The matrix of has entries divisible by , so its operator norm is at most ; consequently for . Thus . Since , arbitrary uniform approximation proves automatic decay of Mahler coefficients.
For the last claim, construct the discrete antidifferentiation on the p-adic integers
Its coefficient sequence is , still tending to zero, so it is continuous. By Pascal's identity, . The boundedness of permits applying it to the uniform limit, giving . For the stated linear map, invariance under translation by one now gives
Thus translation-invariant linear forms on p-adic continuous functions vanish:
No continuity of has been assumed or used. In particular, one must not justify this by applying termwise to an infinite Mahler expansion; it is the existence of a continuous discrete antiderivative that makes the conclusion valid.
Fix a positive-mass unitary irreducible representation at rest, with . Use the central charge in supersymmetry convention
The conjugate relation is , with the dotted epsilon tensor the conjugate of the undotted one. The supercharges commute with and the central charges. Their Lorentz transformation is that of a Weyl spinor; together with the ordinary Poincare algebra, these relations specify the Super-Poincaré algebra. Take and write . This makes the normalization of the mass bound explicit: a convention that writes instead has .
When , define four fermionic annihilation operators and their fermionic creation operators by
In the rest frame they obey the canonical anticommutation relations and . Choose a spin-zero Clifford vacuum annihilated by all four . Acting with each distinct creator at most once constructs the fermionic Fock space
The five levels have the binomial coefficient multiplicities , so the massive supermultiplet contains states. The four creators are two copies of the spin-one-half SU(2) representation. Their second exterior power is
Here the first factor carries physical spin and the second counts the two supersymmetries. Thus level two contains one spin-one triplet and three spin-zero singlets; levels one and three each contain two spin-one-half doublets. The final spin content is
Even levels give eight boson states and odd levels eight fermion states, exhibiting boson-fermion degeneracy in a supermultiplet.
For nonzero , pair the two supersymmetries before normalizing. Define
The rest-frame algebra gives and consequently
For , divide by to recover four normalized oscillators. Positivity of the Hilbert space norm proves the BPS bound in supersymmetry, since
Therefore
For a BPS state saturating this bound, both and their adjoints annihilate every state of the representation. Four of the eight real supercharges act trivially. Only the two oscillators remain, so a scalar Clifford vacuum gives a shortened massive supermultiplet with two spin-zero states and one spin-one-half doublet:
This is the irreducible count at fixed central charge. A CPT completion of a supermultiplet can require the charge-conjugate multiplet as well, doubling it to eight states; the full hypermultiplet count must not be confused with this four-state count. Saturation is a representation-theoretic relation between mass and conserved charge: shortening persists while the state remains BPS, although its existence can change across parameter space.
For even , unitary skew-diagonalization of an antisymmetric matrix brings the central-charge matrix to blocks , . Repeat the oscillator construction separately for each block. Every block supplies two oscillators with norm and two with norm , giving
If blocks saturate, complex oscillators disappear, leaving . Starting with spin , the irreducible state count and preserved fraction are
The largest massive shortening, , preserves one-half. The ordinary massive representation has . This rest-frame discussion excludes , where the massless supermultiplet construction uses a null momentum instead.
The resolution principle for sheaf cohomology states that an exact sequence
with for every computes as the cohomology of . In particular one may use a flasque resolution.
An affine morphism is one for which the inverse image of every affine open subset of is affine. We use vanishing of quasi-coherent cohomology on an affine scheme: a quasi-coherent sheaf has zero higher sheaf cohomology on an affine variety. Take a flasque resolution . Each direct image sheaf is flasque, because restriction on is restriction on . On an affine open , the augmented complex of sections is
Its positive-degree cohomology vanishes by the affine theorem, and its degree-zero kernel is . Checking exactness on this affine basis shows that is a flasque resolution of . The global-section complexes are identical, proving cohomology under an affine morphism:
For projective space, put with its usual grading and . Construct the twisting sheaf on projective space by setting its sections on to be the degree- part , viewed as a module over . It is free of rank one with generator , even when is negative. On overlaps the generators differ by the unit , so these modules glue to a line bundle .
Assume first . These local modules all embed in the graded fraction field, and agreement on overlaps identifies global sections with . Since is a unique factorization domain and at least two distinct variables occur, a reduced fraction belonging to every has no nonconstant denominator. Thus the intersection is . Counting monomials by stars and bars gives
Here . The printed formula needs the convention that a counting binomial coefficient is zero when its upper integer is smaller than its nonnegative lower integer; the generalized polynomial convention for negative upper integers would give incorrect dimensions. For , every twist on the single point is trivial, so for every and its higher cohomology is zero. This case supplies the base of dimension induction; the displayed top-cohomology formula below is for .
The standard affine opens have affine finite intersections. The acyclic cover theorem and affine vanishing identify sheaf cohomology with a Čech cochain complex ending in degree . In particular for .
Let , with inclusion . Multiplication by gives the hyperplane exact sequence for twisting sheaves
Exactness is checked in the local trivializations, where a hyperplane equation is a non-zero-divisor and the quotient is its restriction to . Since a closed immersion is an affine morphism, the first part identifies the cohomology of with that on .
For , the long exact sequence in sheaf cohomology and give
Starting from the given vanishing for sufficiently large and descending gives for and for .
Now let , and assume the formulas in dimension . Restriction
is surjective for every : for it is polynomial restriction, and for both groups are zero since . The long exact sequence in sheaf cohomology therefore makes injective. For , dimension induction gives , so the same sequence makes
injective. Composing these injections up to a sufficiently large twist, where the target is zero by the given hypothesis, proves for every and .
The remaining part of the long exact sequence in sheaf cohomology is consequently
where the last zero uses the affine-cover dimension bound on . Hence . Using dimension induction and eventual vanishing, downward summation yields
by telescoping Pascal's identity; for it is zero. Thus, without invoking Serre duality in the induction,
Finally, the canonical bundle of projective space is , obtained by taking determinants in the dual Euler sequence. Serre duality therefore predicts
It pairs the two computed extreme-degree dimensions and pairs zero intermediate groups with zero intermediate groups, exactly as required.
For a fixed occupancy , let be the per-flow rate on every active route, so feasibility means . A proportionally fair allocation is a feasible allocation satisfying, for every other feasible ,
The sum counts the proportional changes over individual flows. By the first-order condition for a concave function, it is exactly the allocation solving
This is weighted logarithmic utility optimization, and its negative objective is a strictly convex function, which gives unique rates on active routes. Routes with have no per-flow rate to determine.
Index the four routes by , , , , and let be each route's total service. Write
The four capacity constraints say , , , and . Equivalently,
For fixed maxima , every active route in the first group optimally takes total service , and every active route in the second takes , because its logarithmic objective is increasing. Up to the constant , the objective therefore becomes with . Its maximizer is , when , with the evident endpoint choices when one group is empty. Hence the proportionally fair allocation on a four-cycle is
Set on inactive routes. If , all service totals are zero. In particular, for , , as required. Two disjoint active routes in the same group can each receive the same total service; service totals need not sum to one over the entire network.
With independent document arrivals given by Poisson processes of rates and independent unit-mean exponential distributions for document sizes, each of the active documents has completion rate . The flow-level network model is consequently a continuous-time Markov chain with
At all downward rates are zero. The total departure rate is at most four, so the bounded total jump rate ensures no explosion.
The original PDF's displayed factor is a binomial coefficient, not the plain quotient produced by the TeX extraction. The candidate stationary distribution for this reversible four-cycle flow model is
Use . For and ,
so . For the corresponding ratio is . Thus detailed balance for a continuous-time Markov chain holds for every adjacent pair, proving the displayed stationary distribution whenever .
For completeness, its existence condition can be made explicit. Put and . At fixed ,
Therefore the sum over states with is at most , using the binomial theorem. This is summable if . Conversely, restricting to the single maximizing route in each group leaves the series , which diverges if . Hence
These are exactly the four strict resource-load inequalities. With positive arrival rates the Markov chain is irreducible, so the normalized stationary distribution is unique.
Use a positive-energy unitary representation with finite helicity states, excluding continuous-spin representations. In the specified frame the Pauli matrices give
For every and every state ,
Positivity therefore gives on this massless supermultiplet. The equal-chirality anticommutator then shows that every central charge in supersymmetry vanishes on this superalgebra representation.
Normalize the remaining supercharges as fermionic raising and lowering operators:
They obey the canonical anticommutation relations
Choose a Clifford vacuum of helicity annihilated by every . Such a vector exists because the commuting fermion number operators have eigenvalues and , and lowering every occupied mode produces a nonzero empty state. In an irreducible representation this empty space has dimension one; multiple empty states produce a direct sum of copies. The states are
The canonical anticommutation relations make these states orthonormal for a normalized Clifford vacuum. In the helicity convention , its adjoint has . Thus the Clifford vacuum is the highest-helicity state and
Reversing the rotation convention reverses the displayed ordering and leaves all counts unchanged. The level- states form the exterior power , which explains the binomial coefficient. Summing the binomial coefficients gives the helicity spectrum of a massless supermultiplet:
Each application of a fermionic raising and lowering operator reverses fermion parity. The even and odd levels each contain states, so a physical massless supermultiplet has boson and fermion states.
These formulas describe one irreducible representation of the massless Super-Poincaré algebra at fixed four-momentum. A reducible superalgebra representation can contain several such supermultiplets. Also, the CPT theorem sends helicity to and conjugates internal charges. CPT completion of a supermultiplet may therefore require a second -state supermultiplet, with highest helicity . A necessary condition for the original helicity spectrum of a massless supermultiplet to be self-conjugate is ; internal charges must also admit the conjugation in a realization compatible with the Spin-statistics theorem. Thus this helicity condition alone is not sufficient for CPT completion of a supermultiplet without doubling. In particular, the original irreducible count is not automatically the count after CPT completion of a supermultiplet.
For the conventional bounds on extended supersymmetry, suppose all massless states satisfy . The helicity spectrum of a massless supermultiplet occupies an interval of width , whereas the available interval has width . Hence
An ordinary four-dimensional renormalizable quantum field theory without gravity uses interacting massless fields of spin angular momentum at most one. Massless spin angular momentum requires supergravity, whose gravitational coupling has negative mass dimension and is a nonrenormalizable interaction by power counting in quantum field theory. Setting gives for conventional renormalizable theories. The bound is attained by four-dimensional N=4 super Yang-Mills theory: choosing gives
for its supersymmetric vector multiplet.
Allowing gravity permits , so for conventional theories including gravity. The four-dimensional N=8 supergravity supergravity multiplet attains the bound with :
It has states, boson and fermion states. The conventional claim about a maximum “in general” assumes local interacting four-dimensional theories in Minkowski spacetime with a finite spectrum of fields and no massless spin angular momentum above two. It is not a theorem excluding arbitrary free higher-spin angular momentum constructions or all theories in other spacetime settings.
Finally, a chiral gauge spectrum means that the independent left-handed Weyl spinors occur in complex gauge group representations without obligatorily paired conjugate left-handed Weyl spinors. In four-dimensional N=1 supersymmetry, an irreducible matter supermultiplet with helicities can carry a complex gauge group representation . Its CPT completion of a supermultiplet supplies the right-handed antiparticle in , as every left-handed Weyl spinor requires; it does not supply a second independent left-handed Weyl spinor in . Consequently a chiral gauge spectrum is possible.
For , the matter hypermultiplet has helicities before internal charge conjugation. If it carries a complex gauge group representation , its CPT completion of a supermultiplet adds the conjugate hypermultiplet. Equivalently, the resulting full hypermultiplet contains two chiral superfields, one in and one in . These give a vectorlike gauge spectrum. Half-hypermultiplets can occur in pseudoreal representations, which also do not produce genuinely complex chiral gauge spectra. A supersymmetric vector multiplet has Adjoint representation, hence real gauge quantum numbers. Since every algebra contains an subalgebra, the same obstruction applies to greater extended supersymmetry.
Therefore a conventional chiral gauge spectrum is possible only for or . Here means no supersymmetry; among theories with actual supersymmetry, only qualifies. These are necessary structural conditions, not a guarantee that a chosen chiral gauge spectrum satisfies anomaly cancellation.
The hypothesis says exactly that is a k-Sperner family with : it contains no three members forming a strict inclusion chain. Every maximal chain in a Boolean lattice consequently contains at most two members of , so the same random-chain argument gives . For a fixed amount of Lubell mass, cardinality is maximized by using the levels with the two largest binomial coefficients. The Erdős theorem on k-Sperner families therefore gives
The bound is attained by taking the union of two levels having those sizes.
For a uniform set family , the Local LYM inequality is
To prove it, count the incident pairs with , , and . Every contributes exactly pairs, whereas every belongs to at most members of . Therefore
which is the displayed inequality after using the binomial coefficient identity .
The LYM inequality says that every antichain satisfies
For the proof from the local inequality, take the lowest occupied level below the middle and replace that level by its upper shadow. The result remains an antichain: any new containment involving a set in the upper shadow would already give a containment involving the member of immediately below it. The dual form of the Local LYM inequality says that this replacement cannot decrease the Lubell mass. Repeating upward below the middle, and similarly replacing high levels by their lower shadows, eventually puts the whole family in one middle level. Its final Lubell mass is at most one, so the original mass is also at most one.
For the maximal chain in a Boolean lattice proof, choose a Uniformly random maximal chain in a Boolean lattice. An -element set lies on it with probability . Because an antichain meets each chain at most once, the expected value of the number of its members on the chain is at most one. By linearity of expectation, that expected value is precisely the displayed sum.
The Sperner theorem follows because for every . If equality holds in the resulting cardinality bound, every member lies on a largest level. For even this is the unique middle level. For odd , the two middle levels have equal size; the regular connected inclusion graph between them and equality in Local LYM inequality force a chosen portion of the lower level to be either empty or the whole level. Hence the maximum antichains are exactly the complete middle level, with either middle level allowed when is odd.
By Bayes' theorem, with respect to Lebesgue measure on ,
The omitted constant includes the binomial coefficient and the normalizing constant of the beta distribution; the uniform prior contributes only the support indicator.
Let two systems exchange energy inside an otherwise isolated composite system, so is fixed. By the Second law of thermodynamics, equilibrium maximizes the total entropy
At an interior maximum,
Thus , which is entropy maximization under thermal contact and the condition for thermal equilibrium.
Stability requires this entropy maximum to be locally strict, so each ordinary subsystem has a concave entropy-energy relation. Since
one has , or equivalently
This is the entropy concavity and positive heat capacity criterion.
Now let and . Because the spins are distinguishable, the number of microstates is the binomial coefficient
The Boltzmann entropy and the Stirling formula give, to leading order for large ,
The total energy is
Therefore
Solving for the up-spin fraction gives the independent spin-one-half two-level system result
For ordinary positive absolute temperature,
with as and as . Since the spectrum is bounded above, the population-inverted range is also mathematically possible and corresponds to negative temperature; is the infinite-temperature state.
Substitution gives
and direct differentiation yields
Thus the energy increases with temperature throughout either finite-temperature branch, in particular throughout the required positive-temperature range.
Define the binomial coefficient as the number of -element subsets of an -element set, equivalently as . Partitioning the -element subsets of according to whether they contain proves Pascal's identity
Thus the forward difference operator satisfies
For , the binomial coefficient is
When ,
This is Pascal's identity.
The extension of the one-dimensional freely jointed chain is
As the integer runs from to , the possible extensions are therefore
For fixed and , choosing which of the links point in the positive direction determines the microstate. The state degeneracy is consequently the binomial coefficient
The binomial theorem gives
The central binomial coefficient is the largest of these nonnegative binomial coefficients, so
For the upper bound, fix a prime number . By Legendre formula,
Each summand is either zero or one. Hence the P-adic valuation satisfies
If , this implies
There are at most such prime numbers. If instead , then , so the P-adic valuation is at most one. Multiplying the prime-power contributions therefore yields
We give the Agrawal–Biswas primality test, which has one-sided error. Small inputs and perfect powers can first be recognized deterministically. For every remaining integer , put and choose a uniformly random monic polynomial
Using repeated squaring in the quotient ring , test the identity
This takes time polynomial in because every intermediate polynomial has degree below .
If is prime, the intermediate binomial coefficients are divisible by , so the identity always holds. Now suppose that is composite and is not a prime power. Choose a prime divisor and write with and . Over ,
because an intermediate coefficient equal to is nonzero modulo . Hence
is a nonzero polynomial of degree below over .
Reduction of random modulo is uniform among the monic degree- polynomials. The polynomial has at most distinct monic irreducible factors of degree . On the other hand, the number of monic irreducibles of degree obeys the standard lower bound
Whenever is one of these irreducibles but does not divide , the tested congruence fails. Thus one trial detects compositeness with probability at least
after the finitely many small are handled directly. Repeating times makes the probability of missing a composite less than , while a prime is never rejected. Therefore compositeness is in RP, and primality testing is in
The number of successes has a binomial distribution. Each arrangement of successes and failures has probability by independence, and the binomial coefficient counts the arrangements. Therefore
The final equality is the binomial theorem. Writing as a sum of independent Bernoulli random variables gives its expectation and variance: , . Thus the matching normal distribution has
The normal approximation is appropriate when both expected counts and are sufficiently large; large alone is insufficient if is extremely close to zero or one.
For the guessing student, , , . Therefore the expected number of correct answers is , and , . The inclusive integer range becomes after the continuity correction. Standardizing the normal distribution gives
Here , and the last step uses the supplied bound. The approximate probability is . The normal approximation provides the requested conclusion; as a separate check, summing the five exact binomial probabilities gives approximately , also exceeding one half.
Assuming the egg colours are independent with the same probability , the number of white eggs has the binomial distribution with four trials. The possibilities are
ContentsProbability
The binomial coefficients count which eggs are white. Marginal colour probabilities alone would not determine nest probabilities without the independence assumption.
Neither biscuit type can run out in this case. Treat each freely made choice as an independent Bernoulli trial, with success meaning chocolate. The number taken after choices has a binomial distribution, so
The binomial coefficient counts the possible success positions, and every such arrangement has the same probability. Independence of successive choices is the probabilistic model implicit in the question; identical marginal preferences alone would not imply it.
Under a uniform shuffle, every unordered five-card hand is equally likely, giving possible hands. Choose the triple's rank in 13 ways and its suits in ways; then choose a different pair rank in 12 ways and its suits in ways. Each full house determines these choices uniquely, so there is no further ordering factor. Therefore
The count uses binomial coefficients because the order of cards within a hand is irrelevant.
A uniformly shuffled deck makes all unordered five-card hands equally likely, giving possible hands. Choose the rank appearing four times in ways; all four suits of that rank are then fixed. The remaining card can be any of the other cards. No hand is counted twice, because five cards cannot contain two different complete four-card ranks. This use of combinatorics gives the probability
Here is a binomial coefficient; the probability also simplifies to .