Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a partition with at most parts, let be the Schur module constructed in Question 3, equivalently the image of a Young symmetrizer on . For a weakly decreasing integer tuple , put and . Define the rational Schur module byHere is the one-dimensional representation . This is rational, and it is irreducible under the permitted irreducibility assumption; for nonnegative it is the original polynomial Schur module. Larger shifts give the same module, as will also follow from the character formula below.
Write and . For a permutation of the given cycle type, the trace of a permuted tensor power isIn a tensor basis, the trace contracts the matrix entries of around each cycle of ; a cycle of length contributes . This proof applies to nondiagonalizable endomorphisms as well. The eigenvalues give .
The Schur–Weyl duality decomposition, on which and act on the two respective factors, gives the same trace asFor a partition, the character extends polynomially to all endomorphisms because the tensor-power action does. This extension is not asserted for determinant-twisted modules at singular matrices.
We now derive the alternant character formula for the general linear group. Put andUse the permitted symmetric-group character result, the Frobenius alternant character formula:It concerns characters of , rather than assuming the character formula we seek for the general linear group. Substitute the proved trace identity and setThen for every conjugacy class. Independence of the irreducible symmetric-group characters forces .
Each character on diagonal matrices is a symmetric homogeneous polynomial of degree , since conjugation by permutation matrices permutes its arguments. Thus is alternating of degree . Every alternating polynomial of this degree has a unique expansion in alternants : a monomial with repeated exponents has zero coefficient, while each strictly decreasing nonnegative exponent vector is uniquely for a partition of with at most parts. Its coefficient at is the coefficient of that alternant. The identities for therefore give . We have derived the Weyl character formulaFor partitions the quotient is the Schur polynomial, with removable apparent singularities when eigenvalues coincide. For arbitrary dominant integer tuples, multiply the formula for by ; this shifts every numerator exponent by and yields the same boxed formula. The variables must then be nonzero. The expression also shows independence of the shift used to define the determinant twist. Equality of characters identifies these irreducible modules: the group-algebra image on a direct sum of two irreducibles is finite-dimensional and semisimple, and its span of group operators detects the traces on every simple block.
Finally, the character of a dual representation evaluates the original character at . Reverse the numerator's columns after making this substitution. The exponents become . Factoring converts these into for . The denominator undergoes the identical column reversal and factor, so both signs and factors cancel. Hence , andThis tuple is again weakly decreasing, so it is precisely the required dominant label.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
On , define the permutation and diagonal actions byThe inverse in the first formula gives a left action. Applying to every tensor factor and then reordering produces the same tensor as reordering and then applying . Thus the two actions commute. The Schur algebra isIt is the commutant of an operator algebra of the permutation action.
To identify this commutant, use the multilinear isomorphismConjugation by a permutation reorders the factors on the right. Therefore the invariant subspace is the space of symmetric tensors of degree in . It is spanned by . Indeed, the polarization identityexpresses every symmetrized elementary tensor as a linear combination of pure powers. Those symmetrized elementary tensors span the invariant subspace in characteristic zero.
One may restrict to invertible endomorphisms without changing the span. For fixed , the vector-valued polynomial has degree at most . Choose distinct values of away from the finitely many roots of . Polynomial interpolation expresses its constant term as a linear combination of those invertible tensor powers. ConsequentlyThe span is an algebra, since products are .
The image of is semisimple, as a quotient of a semisimple algebra. The double-centralizer theorem for semisimple operator algebras gives . Since the preceding computation says that is the span of the general linear action, the two actions are mutual commutants. More explicitly, semisimple module decomposition givesHere is the multiplicity space, with its natural general linear action. The commutant algebra is the product of the full endomorphism algebras of these multiplicity spaces. Hence each nonzero is irreducible, and distinct spaces have nonisomorphic general linear representations, because the operators span that commutant. A primitive picks a one-dimensional factor from , so is an equivalent realization of as a Schur module.
The range of shapes is exact. If has more than rows, a column antisymmetrizes more than vectors and its action vanishes by . Conversely, for at most rows place the th basis vector in every tensor position belonging to row of . Row symmetrization multiplies this tensor by . Column antisymmetrization is nonzero, because all vectors within each column are distinct, and its different permutations give distinct basis tensors. Thus . This proves the length bound for a Schur module and the stated Schur–Weyl duality. For , the empty partition and give the trivial version.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A standard Young tableau has its entries increasing from left to right in each row and from top to bottom in each column. For the convention , use column-reading order of standard Young tableaux: read columns from left to right, each from top to bottom, and compare the resulting words lexicographically. This makes the requested product direction explicit. The order and the symmetrizer multiplication convention must be chosen together.
We prove the vanishing claim. Suppose the rows of and the columns of have no collision. The argument in Question 1 shows that every column of contains one entry from each eligible row of . Its first column thus selects one entry from every row. Each selected entry is at least the first entry of that row in . Sorting the selected entries, as the standard tableau does, gives a column componentwise at least the first column of : increasing individual entries cannot decrease any order statistic. If the columns are equal, equality of their sums forces every selected entry to be that row's first entry. Delete this common column and repeat. At the first differing column, its first differing entry in is therefore larger; otherwise . Thus absence of a collision implies in column-reading order of standard Young tableaux.
If , there must instead be a transposition in . It fixes and negates , giving . HenceThis is triangular vanishing of Young-symmetrizer products; it does not assert vanishing in the opposite order.
Normalize to . List all standard tableaux in increasing shape dictionary order on integer partitions, and within each shape in increasing column-reading order of standard Young tableaux. Then for , using Question 1 between different shapes and the result above within a shape. The left ideals have an internal direct sum: if with , multiply on the right by to get , since and every later . Repeat with . This proves directness without incorrectly treating all the idempotents as mutually orthogonal.
Let count the standard tableaux of shape and let . In the regular representation a simple module of dimension occurs times, by the Artin–Wedderburn theorem. The direct sum just constructed contains copies of , so for every shape. We supply the needed counting identity independently of the dimension conclusion.
The Robinson–Schensted correspondence bijects permutations with pairs of standard tableaux of the same shape. Here is its row insertion construction and inverse. Insert the successive permutation entries into an increasing row by replacing its first entry larger than the incoming entry, bumping that replaced entry into the next row; if no entry is larger, append at the row end. Continue until a new cell is created. Record the insertion time in that cell of a second tableau. For completeness, the successive bumped entries strictly increase, and their column indices weakly decrease: an entry below a bumped entry was originally larger, so the next replacement occurs no farther right. The entry newly placed in each row is smaller than the entry removed and larger than the entry above it. At a strictly earlier column, that last inequality follows from row increase in the preceding row; at the same column, it follows from the preceding bump. Hence the insertion tableau keeps increasing rows and columns. If a new cell is appended below the first row, the preceding bump guarantees that the row above reaches that column, so the shape stays a Young diagram. Recording times also increase in rows and columns, since every new cell is an outer corner of the current diagram. Thus both tableaux are standard at the end. Conversely, remove the cell with the largest recording label. Reverse its bumping path upward, replacing in each preceding row the rightmost entry smaller than the moving entry and moving the displaced entry upward. This recovers the last inserted letter; iterating recovers the entire permutation. The two rules undo one another at each row. ThusSemisimplicity also gives . Since termwise, equality of these sums forces for every shape. The internal direct sum has dimension and hence fills :There is also a useful numerical form. Right multiplication by is an idempotent with image . In the permutation basis of , each diagonal coefficient is the coefficient of in , namely . Its trace equals its rank, so . Together with the count just obtained this recovers the hook-length formula.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A partition of an integer is a finite sequence with sum ; append zeros when comparing lengths. Its Young diagram has cells with . A Young tableau is a bijective filling of these cells by . Write for its row and column stabilizers, and fix the conventionPermutations act on entries on the left, with the rightmost factor acting first. This defines the Young symmetrizer used throughout. In the dictionary order on integer partitions, means that at the first differing part ; equality is allowed in .
Suppose there is no row-column collision between of shape and of shape . Each column of contains at most one entry from each row of . The first rows of therefore contain at mostentries, where is a column length. Thus for every : dominates in dominance order on partitions. If in dictionary order on integer partitions, a first strictly larger part would contradict the corresponding prefix inequality. Hence .
All the bounds must now be equalities. Every column of contains exactly one entry from row of whenever . Choose sending that entry to the entry of in cell . These prescriptions are bijections within the rows. The columns of then have exactly the same sets of entries as the columns of , so for some . ConsequentlyIf a collision was present instead, its two entries supply the first alternative. This proves the row-column collision lemma, including the prescribed order of the two stabilizer factors.
We next prove the Specht module classification. By Maschke's theorem, the group algebra is a semisimple algebra. Use the permitted basic quasi-idempotence of a Young symmetrizer,and put . The coefficient of in is one, because , so .
For , consider . A collision between the rows of and the columns of gives a transposition . Row symmetrization fixes , whereas column antisymmetrization changes its sign, so . If there is no collision, the proved lemma gives with , andIt follows that is zero or . Since permutations span , . In a semisimple algebra this means that is a primitive idempotent, so is an irreducible left module.
If in dictionary order on integer partitions, the collision lemma applied to every gives , and therefore . Sincethe two simple modules cannot be isomorphic. Conversely, Young tableaux of the same shape are related by a permutation, which conjugates their Young symmetrizers and gives isomorphic left ideals. Finally, the center of has the conjugacy-class sums as a basis. Conjugacy classes are indexed by cycle-type partitions, so its dimension is the number of partitions of . The Artin–Wedderburn theorem gives exactly that many simple-module isomorphism classes. We have already produced one for each partition. Thus the form a complete set of pairwise nonisomorphic irreducible modules.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 29 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a prime , the divisor sum defining the real weight is . If , the second term vanishes and the first is one. Thus , while for every integer because is real and the sum is squared.
Put . With the Fourier transform convention in the question, Fourier inversion givesThe function is smooth and has compact support. Using integration by parts times, with zero endpoint terms, provesChoose an integer to obtain for . In particular every polynomially weighted absolute integral of is finite.
For the double integral, useDifferentiating the second formula gives . absolute convergence from the rapid decay permits Fubini's theorem. The derivative energy constant for a smooth sieve cutoff is thereforeThere is no complex conjugate in this integral: the two factors both become , which is real. The constant is positive; in fact the Cauchy-Schwarz inequality applied to gives .
Here is the basic structure of the smooth divisor-square sieve asymptotic, with enough uniform estimates to specify the error. Write and . Expand the square and count multiples of the least common multiple in an arbitrary interval of length :The sum is effectively restricted to . Each count is , independent of the interval's position, so the total error is .
The Fourier representation of a smooth Selberg weight readsHence, with ,The four local terms correspond to the prime dividing neither divisor, only the first, only the second, or both. This is the Euler product for a smoothed divisor-square correlation. Factor it aswhereThe local factors of are when for small fixed . Thus is a holomorphic function near , and evaluating each local factor at zero gives exactly one. Consequently and there.
The pole expansion now yieldswhen . Integrating the error against the rapidly decreasing transforms gives . The complementary tails are harmless uniformly: absolute values in the original divisor series giveAny prescribed power decay of is available, so these tails and the tails of the limiting kernel are after choosing sufficiently many applications of integration by parts. The same absolute bound justifies the original exchanges of infinite sums and integrals. Using the evaluated double integral,We conclude, uniformly over all interval locations,This proof does not assume that the interval starts near the origin.
Finally choose this one fixed smooth cutoff. primes above in contribute one each to the nonnegative weight, and at most primes lie below . Thereforefor all sufficiently large , uniformly in . The bounded range follows by increasing the fixed constant and using the trivial interval bound . Thus the short-interval prime upper bound from a smooth divisor weight is
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 29 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A precise useful form of the principle is the type I–type II inverse principle for Möbius correlation. Normalize , and supposeFor any positive integer cutoffs with , defineThen , where is the divisor function, and at least one of the following two sums has modulus at least :The first is correlation against a controlled linear combination of indicators of multiples of small moduli, each a periodic function: this is the “somewhat periodic” branch. The second is a bilinear sum with independently weighted factors, both larger than the cutoffs: this is the “somewhat multiplicative” branch. The statement concerns these precise correlations, not an assertion that must itself be periodic or multiplicative.
For clarity, the Vaughan identity for the Möbius function proves this version immediately. Split and likewise at . Since ,Multiply by and sum. The first two terms contribute at most in modulus, and the remaining terms are . The triangle inequality gives the stated dichotomy. It is valid at finite and for any chosen cutoffs in the indicated range.
We now prove the required orthogonality without appealing to a stronger uniform exponential-sum theorem. Write and . The Diophantine bound for the square root of two iswhere is distance to the nearest integer. If is that nearest integer, then , while ; dividing proves the bound.
Use the preceding Dirichlet convolution identity with . The two short terms are . For the type I sum, the exponential geometric sum bound givesConsequentlyusing from counting factor pairs.
For the type II sum, perform a dyadic decomposition into , , keeping . Nonempty blocks have , while . A block satisfies, by the Cauchy-Schwarz inequality and the divisor-square summatory bound,To justify the cutoff, after expanding the square the permissible for a pair still form an interval, with upper endpoint . Its exponential sum has the same geometric bound. Diagonal pairs supply ; for each nonzero difference there are pairs.
The points modulo one are separated by at least . Counting points in consecutive distance bands around zero therefore givesSubstitution yields the bilinear cancellation for badly approximable phases estimateThere are blocks, so . The divisor-square bound itself can be obtained elementarily from prime-power by prime-power and ; no uncontrolled coefficient bound is being suppressed.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 29 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For , define the Riemann zeta function by the absolutely convergent Dirichlet seriesThe Euler product follows from unique prime factorization and absolute convergence. The counting-function integral givesBecause the fractional part is bounded, the last integral, and its derivatives with respect to on compact subsets, converge uniformly for . It is a holomorphic function there. This proves the Meromorphic continuation of the Riemann zeta function to the right half-plane, with a simple pole at one of residue one and no other singularity in that half-plane.
The Gamma function isThe Gamma function recurrence extends it meromorphically; its poles are at the nonpositive integers and it has no zeros. The functional equation of the Riemann zeta function can be stated asor, equivalently,These are identities of meromorphic functions; the second also extends the Riemann zeta function to the remaining half-plane. The critical strip is ; its boundary lines will also be treated below, rather than included among possible exceptional zeros.
For , the absolutely convergent reciprocal Euler product gives . For , the factors , , and in the second functional equation of the Riemann zeta function are finite and nonzero. Hence the only zeros there are the zeros of the sine factor:Each is simple. At zero, the sine zero cancels the pole of ; using its residue one gives , not zero. Nonvanishing on the rest of follows from the boundary-line proof below and the functional equation of the Riemann zeta function. Together these facts prove that the trivial zeros of the Riemann zeta function are the only zeros outside the open critical strip.
Here is a Jensen disk proof of the zeta zero-count bound which avoids any unproved left-half-plane growth estimate. Set , a holomorphic function throughout , including at one. The integral continuation formula givesFor each integer , apply Jensen's formula in the disk with centre , outer radius and inner radius . The outer disk stays in , so its maximum modulus is . At its centre,since . Therefore the number of zeros in its inner disk, counted with multiplicity, is at mostThe rectangle , fits in the inner disk because its farthest point has distance . Summing over such disks counts zeros in the right half of the critical strip up to height . The first functional equation of the Riemann zeta function bijects zeros, with multiplicities, in the left half with their reflections in the right half; its Gamma function factors are finite and nonzero in the strip. ThusThe pole of zeta function at one does not count as a zero: .
Finally, for real and , the Euler-product logarithms and the nonnegative trigonometric polynomialgive the three-four-one product proof of zeta boundary nonvanishing:If had a zero of order , its factor would be as . The real zeta function factor has pole order three, and the factor at stays bounded because . The product would tend to zero as , contradicting that it is at least one. ThereforeAt there is a pole, not a zero. Applying the sine-form functional equation of the Riemann zeta function at now proves nonvanishing on the remaining imaginary axis, completing the earlier assertion about all zeros outside the critical strip.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 29 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For the unit-modulus prime values in this question, the Granville-Soundararajan distance isThe second identity uses . Thus it is the Euclidean distance between the finite weighted vectors and . Nonnegativity, symmetry and the triangle inequality follow from that norm representation, and it vanishes exactly when the two prime-value vectors agree. This proves the prime-restriction metric for pretentious distance.
On whole arithmetic functions at fixed it is a pseudometric. For example and have identical values at every prime and zero distance for every , but different values at four. Thus the literal identity-of-indiscernibles assertion needs the prime-restriction quotient.
Since ,For completeness, partial summation and the prime-counting form of the Prime number theorem giveTo verify the constant and the error, replace by in the first expression. Differentiating shows its two contributions combine to plus a constant. The error integral converges absolutely because , and . This proves the Mertens second theorem in the form needed here. In particular the pretentious distance between one and the Möbius function satisfies
For the last request, retain the earlier prime normalization ; the proof also works with the weaker assumption . Without a bound on prime values, the original definition and the absolute convergence of the displayed measure need not apply to an unrestricted multiplicative arithmetic function. For example is multiplicative and squarefree-supported, but for the displayed measure has infinite positive mass: its prime terms alone are , which diverges by the Prime number theorem.
Put , , and use the Fourier transform convention . Since is supported on squarefree integers, the defining property of a multiplicative arithmetic function gives the absolutely convergent Euler productThe bound on prime values gives for squarefree , so the total variation norm of a measure is bounded by ; thus is a finite measure. Expanding the logarithm of the modulus, with an absolute remainder since , givesAll constants here are uniform in . Moreoverusing the pole of the Riemann zeta function. The nonnegative deficits giveIndeed, the replacement of by for costs at mostby the Mertens first theorem, while discarding the terms costs nothing in this lower bound. Thus the large Fourier coefficient criterion for pretentiousness isIn particular,The comparison function is the Archimedean character with this sign because our Fourier transform uses .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 29 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the Möbius function. Its Möbius divisor-sum identity isIndeed, for the sum is the expansion of ; nonsquarefree divisors contribute zero. Thus, for arithmetic functions ,To prove Möbius inversion, substitute the first formula into the second and collect the coefficient of . It is , which is one for and zero otherwise. Conversely the same divisor interchange recovers from the displayed formula for . In Dirichlet convolution notation this is simply , where is supported at one.
The Prime number theorem with classical zero-free-region error states that some absolute satisfiesHere is the Von Mangoldt function. An equivalent prime-counting form, after decreasing if needed, is . The contributions of proper prime powers are and can be absorbed into this error. We use to keep it distinct from the Fourier transform appearing in Question 5.
Here is a direct deduction of the requested Mertens bound from a log-integrable Chebyshev error from the stated Prime number theorem. First, the divisor identity givesSecond, the exact Dirichlet convolution identityfollows from : multiplication of a Dirichlet convolution by differentiates its two factors, so applying it to and convolving again with gives this formula. Summing it yieldsThe last harmonic sum is . To see this without an endpoint approximation, split into dyadic ranges . In each range , and its exponential factor is at most . Their sum over converges. The finitely many terms with obey the same estimate after adjusting the constant in the prime-number-theorem error. ThereforeFor the Mertens function ,The second sum has absolute value at most , by an integral comparison or the Stirling formula. ConsequentlyThe absolute value in this conclusion is present in the original PDF.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 28 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Herbrand quotient and local norm indices. Let have order . For an additive -module , put and . The relevant Tate cohomology of a cyclic group groups areIf both groups are finite, their size ratio is the Herbrand quotientMultiplicative modules use products for and . A finite module has quotient one: , while , and the two cohomology orders are equal. The six-term periodic cohomology sequence shows for a short exact sequence when these groups are finite. Thus the quotient is unchanged by finite-index changes of lattices. For the trivial -module , the zeroth group is and the negative first group is zero, so .
Now let be a cyclic extension of p-adic fields of degree . For a sufficiently deep principal unit subgroup , the p-adic logarithm is a -equivariant isomorphism with the additive p-adic lattice ; it suffices to take . The normal basis theorem makes a regular -module. Consequently , as a -lattice, is commensurable with a direct sum of copies of . These regular lattices have zero Tate groups: its invariants are the multiples of the sum of the basis elements, every such element is a norm, and vectors with coefficient sum zero are images of . Commensurability and the finite-module calculation give . Since is finite, . These comparisons also establish finiteness of the Tate groups concerned.
The valuation exact sequence now gives . Hilbert theorem 90 makes trivial. One can prove the cyclic statement directly: for of norm one set , and choose for which . Such a exists by linear independence of distinct field automorphisms. Then , so is a coboundary. Therefore the local cyclic norm index isThis is the central use of the Herbrand quotient: it calculates a norm index without first constructing the local reciprocity map.
Let be the ramification index and residue degree. With normalized integer valuations, . A norm is a unit exactly when its preimage is a unit, and the norm valuations fill . Hence there is an exact sequenceThe unit norm index is . In an unramified extension all units are norms and the obstruction is the valuation modulo ; in a totally ramified cyclic extension the entire index comes from units. The norm subgroup is open: on deep principal units, logarithm carries the norm to the field trace, and the trace of a full p-adic lattice contains a sufficiently deep p-adic lattice in .
Hilbert norm residue symbol and the local-to-global principle. More generally, for a local field containing , fix the local reciprocity map with uniformizers acting as arithmetic Frobenius on unramified extensions. The Hilbert norm residue symbol isThis is independent of the chosen root, is bilinear, and has value one exactly when is a norm from . These are standard consequences of Local Artin reciprocity. The case , for which the values are signs, is the one directly governing quadratic forms. The quadratic Hilbert symbol at a place is defined for bywith value one for all when is a square. Equivalently it is one precisely when has a nonzero solution over . For nonsquare , a solution has and gives ; the converse follows from the same norm identity. When is square the conic is already isotropic. Symmetry follows from this conic criterion. The local cyclic norm index gives a norm subgroup of index two; its sign character is multiplicative in , and symmetry gives multiplicativity in . Thus the symbol is a nondegenerate bilinear pairing on the square-class group of a field, since every nonsquare gives a nontrivial norm character. Also , because , and .
For an odd-residue-characteristic p-adic field with residue size , write , , and let be the quadratic character of the residue units. ThenThe unramified quadratic extension has every unit as a norm and only even norm valuations; in a ramified quadratic extension the norm of a unit has square residue. The preceding unit norm index is two, so the square-residue condition in the ramified case is also sufficient. These facts, together with , determine the formula on the generators of the square-class group. At a real place the symbol is negative exactly when both arguments are negative, and at a complex place it is always one. For , with odd units, the dyadic formula isOnly residue classes modulo eight and the parities of enter; other dyadic fields retain the norm definition.
The Hilbert reciprocity law states for . Only finitely many factors can be nontrivial: outside the places above two, the Archimedean places, and the finite places where or is not a unit, the odd-residue formula gives one. For this product formula is a formulation of quadratic reciprocity, including its supplementary laws. It forces local norm obstructions to occur with compatible parity. It is a necessary compatibility law, not by itself a substitute for the following local-to-global theorem.
The Hasse-Minkowski theorem states that a nondegenerate quadratic form over a number field has a nonzero isotropic vector if and only if it does over every completion. Equivalently, two nondegenerate quadratic forms are isometric globally if and only if they are isometric at every place. The forward directions are immediate; the reverse directions are the substantive global theorem. Over non-Archimedean completions, local isometry classes are determined by dimension, determinant square class and the Hasse invariant of a quadratic formAt real places one uses signature, and at complex places dimension suffices. Reciprocity gives for a globally diagonalized form. These invariants make the theorem practically usable: local square classes and norm characters replace an unrestricted search for rational solutions. In particular every quadratic form of dimension at least five over a p-adic field is isotropic; for such a form over a number field the only isotropy obstructions are definite signatures at real places.
As a concrete application, take nonsquare . Then is a global norm from if and only if at every place. The local conditions make the ternary form isotropic everywhere. Hasse-Minkowski theorem gives a global solution of ; since is nonsquare, cannot be zero, and division by gives the global norm. For example fails to be a norm from already at the real place. Thus the quadratic Hilbert symbol detects local norm solvability, while the Hasse-Minkowski theorem turns solvability at all places into a global quadratic solution. The reciprocity and local-to-global theorems in this essay are stated as standard results; the norm interpretation, bilinearity and application are derived above.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





