Projectivity of factors of a nonzero finite free tensor product Created 2026-09-24 Updated 2026-11-05
If for a positive integer , then both and are projective modules. Choose a finite expression for the inverse image of one basis vector. It produces a split surjection ; tensoring the splitting with exhibits as a direct summand of the finite free module . Symmetry gives the result for .
Pronic number Created 2026-10-20 Updated 2026-11-05
A pronic number is for a nonnegative integer , the product of two consecutive integers. The sequence begins . Arranging points in a rectangle with side lengths and explains the product, while shows that each is twice a triangular number.
There is an exact recognition test: a nonnegative integer is a pronic number if and only if is an perfect square. Indeed, ; conversely an integer square equal to has an odd positive square root , recovering . For , the test gives and .
Proof of Korselt criterion Created 2026-10-14 Updated 2026-10-18
For sufficiency, let be composite and squarefree, with for every prime factor . For any integer coprime to , Fermat's little theorem gives for every such . Their product is , so the Chinese remainder theorem gives the required congruence modulo .
For necessity, first rule out a repeated factor. If with and , the Chinese remainder theorem supplies and . This is coprime to . But the binomial theorem gives
contradicting the Carmichael number condition. Hence is squarefree.
Now choose a primitive root modulo a prime factor . Lift it to a unit modulo by prescribing and . The Chinese remainder theorem applies because is squarefree. The Carmichael congruence implies . Since has multiplicative order , that order divides . This proves the other condition.[ref]
Proof of Liouville approximation theorem Created 2026-09-24 Updated 2026-11-05
Let be a real irrational algebraic number of field extension degree , and let be its primitive algebraic minimal polynomial. For any rational with positive integer , irreducibility gives . Consequently the nonzero integer gives
On a fixed closed interval around , the mean value theorem gives , where on that interval. Thus rational points in the interval satisfy . Outside it, a fixed positive distance from gives the same type of bound after decreasing the constant. Choosing a smaller constant makes the inequality strict, proving the Liouville approximation theorem.
For nonreal algebraic numbers, the positive distance from the real axis already gives a uniform lower bound against rational approximations. The substantive approximation argument is therefore the real case.
Proof that π is irrational Created 2026-10-14 Updated 2026-11-05
Ivan Niven's 1947 proof by contradiction constructs an integer strictly between zero and one.[ref] Suppose for positive integers . For a positive integer , put
Every derivative of at zero is an integer: its coefficients have denominator , its lowest polynomial degree is , and differentiation contributes the divisible factorial. The symmetry gives the same assertion at .
Cancellation gives , hence
The integrand is positive in , but , so
For large this is impossible for an integer. Therefore Pi is an irrational number.
Proper equivalence of binary quadratic forms Created 2026-09-24 Updated 2026-11-05
Integral binary quadratic forms and are properly equivalent if
The matrix has integer entries and determinant one. Its inverse also has integer entries, so the change is a bijection of the integer lattice. Consequently and represent the same integers, and the discriminant of a binary quadratic form is unchanged.
Allowing determinant minus one as well gives the broader equivalence under unimodular matrices. Proper equivalence retains orientation. For example, the shear is proper and takes to . The reflection instead has determinant minus one and takes to ; those two forms need not be properly equivalent. This distinction matters when counting the class number of a negative discriminant.
Pushforward of a finite probability distribution Created 2026-10-25 Updated 2026-10-31
For a finite probability distribution with support and a total function , assign each image value the combined mass of its preimages. Its support is exactly the finite image , listed without repetitions. Every listed mass is positive because it contains at least one positive source mass.
The fiber of a function construction gives a set partition of , so finite summation gives . This proves nonnegativity and normalization without assuming that is injective. In code, mapping support values and then overwriting repeated image keys is incorrect; repeated keys must have their masses added. For example, mapping a uniform distribution on four consecutive integers to parity produces two outcomes with mass one half each.
Pythagorean triple Created 2026-10-05 Updated 2026-10-20
A Pythagorean triple consists of three positive integers satisfying . It is primitive when their greatest common divisor is one. Reducing their square numbers modulo shows that at least one leg is divisible by ; reducing modulo shows that both legs cannot be odd.
Quadratic integer Created 2026-10-20 Updated 2026-11-05
A quadratic integer is an algebraic integer in a quadratic number field , where is a squarefree integer other than . Its ring of integers is if , and otherwise. Thus is a quadratic integer, since it satisfies the monic equation .
For , its conjugate is . Its field trace and field norm are and ; their integrality characterizes the algebraic integers in this degree-two extension. These formulas connect Diophantine equations to arithmetic in a larger ring.
Quadratic irrational number Created 2026-10-03 Updated 2026-11-05
Quadratic nonresidue Created 2026-09-24 Updated 2026-10-18
A nonzero congruence class modulo an odd prime is a quadratic nonresidue when it is not a square. In the convention of quadratic residue, zero belongs to neither class. Thus are the quadratic nonresidues modulo seven, while are the quadratic nonresidues modulo eleven. No integer satisfies , as the complete square map under quadratic residue shows.
A quadratic nonresidue is not an arithmetic dead end: multiplying by any fixed quadratic nonresidue exchanges the quadratic residues and the quadratic nonresidues. If were a square for a square , division by would make a square. Hence consists entirely of quadratic nonresidues; it has elements, because multiplication by nonzero is a bijection. It therefore equals the entire other coset of the quadratic residue subgroup. Modulo seven, .
The product of two quadratic nonresidues is consequently a quadratic residue: write them as in that same coset, and their product is , a square. For example, , whereas remains a quadratic nonresidue. The multiplicativity of the Legendre symbol packages these rules as ordinary sign multiplication.
Quadratic residue Created 2026-09-24 Updated 2026-10-18
For an odd prime , a nonzero congruence class is a quadratic residue when for some integer . Here "quadratic residue" excludes zero: zero is a square of a number, but is neither a quadratic residue nor a quadratic nonresidue under this convention. Some treatments include zero among quadratic residues; the distinction matters when counting them or discussing their subgroup.[ref]
Modulo seven, squaring the six nonzero congruence classes gives
Thus the set of quadratic residues is , and the quadratic nonresidues are . In particular, has exactly the two solutions : and . Modulo eleven the quadratic residues are instead . Two is therefore a quadratic residue modulo seven and a quadratic nonresidue modulo eleven: being a quadratic residue depends on the modulus.
Figure 1.
The square map modulo seven and eleven: two inputs in every nonzero square fiber
. Each pair maps to one quadratic residue. The six nonzero inputs modulo seven give three outputs; the ten modulo eleven give five. The zero fiber is the single input zero, and each quadratic nonresidue has an empty fiber. Details.
Why do the square roots come in pairs? If , the prime number divides , so it divides one factor: or . For nonzero these are distinct, because is an odd prime. Every nonempty nonzero fiber of a function of therefore contains exactly two inputs. Pairing the nonzero congruence classes gives exactly quadratic residues and quadratic nonresidues. Including zero gives different squares, with one rather than two square roots for zero.
The quadratic residues form a subgroup of the multiplicative group of a finite field , with index of a subgroup two. Indeed, one is a square, , and ; the inverses exist because the inputs are nonzero in the prime field. Equivalently, the squaring group homomorphism has kernel of a group homomorphism and image of a function . The apparent loss of a sign in squaring becomes a precise division of the nonzero arithmetic into two equal parts.
This structure turns a search for square roots into a yes-or-no test: Euler's criterion detects quadratic residues through modular exponentiation, and the Legendre symbol records the result as a sign. For a general integer modulus, the modular congruence still makes sense, but the two-root count and the prime field argument need not survive. For example, has four solutions ; the Chinese remainder theorem separates the sign choices modulo three and five.
Quantization (signal processing) Created 2026-10-13 Updated 2026-11-05
Quantization maps numerical values to a specified discrete collection of representable values. In lossy block averaging, maps block arithmetic means in to eight-bit integers. Thus and . Different means can share a stored value, making this step irreversible.
Quantum integer Created 2026-10-14 Updated 2026-11-05
The symmetric quantum integer is the displayed Laurent polynomial, with . It obeys and . At a primitive odd th root of unity, exactly when divides .
Quotient Created 2026-10-14 Updated 2026-11-05
The quotient of by a nonzero in a field is , the unique solution of . Thus is the rational quotient of by .
In Euclidean division of integers, the word instead denotes the integer in with a specified remainder range; for , . Here has quotient and remainder . Stating the ambient arithmetic prevents confusion between exact division and division with remainder.
Quotient metric Created 2026-09-24 Updated 2026-11-05
Let be a metric space and let be a quotient set by an equivalence relation. The chain construction gives the largest pseudometric on for which the canonical projection of a quotient set is a non-expansive map. For classes , put
Each chain pays for movement inside and jumps at no cost between members of the same equivalence class. Reversing and concatenating chains proves symmetry and the triangle inequality. Taking a single link gives . Conversely, any pseudometric making a non-expansive map is bounded above by the cost of every chain, hence by this infimum.
The result need not be a metric on the original quotient set. In the subset of the real line, with its induced metric, collapse all the points to one class , keeping separate. Then for every positive integer , so these distinct classes have distance zero. Identifying all zero-distance pairs produces the metric quotient of a pseudometric, on which the induced distance is a metric.
Quotient of a partition Created 2026-09-28 Updated 2026-11-05
Fix an integer and represent a partition of an integer by a beta set with beads, where is a multiple of and at least the number of rows. On residue runner , form
Each is a beta set of a partition, decoding to . The ordered -quotient is . Increasing by a multiple of leaves these partitions unchanged. Allowing arbitrary changes of the bead count can cyclically relabel the runners, so the bead-count convention matters for an ordered quotient.
For , use , giving . The runner sets are , hence . The weight of a partition is the sum of the quotient sizes: four cells are removed in reaching the empty core of a partition.
Quotient set Created 2026-09-28 Updated 2026-10-14
A quotient set packages each equivalence class as a single new set element. It remembers which class an original set element belongs to and forgets which member of that class it was. For an equivalence relation on a set ,
Each set element of the quotient set is itself a nonempty subset of . The canonical projection of a quotient set sends an original set element to this entire equivalence class. [ref]
For integer congruence modulo three restricted to , the quotient set is
It has cardinality three. The set is a choice of equivalence class representatives, not literally this quotient set: is an integer, while is a set. The function sending each chosen equivalence class representative to its equivalence class is a bijection between these two different sets.
Figure 1.
The quotient projection sends nine elements to three classes, with each class appearing as one fiber
. Details.
A quotient set alone specifies no arithmetic. To obtain the familiar modular arithmetic example with addition, use integer congruence on the whole set of integers. Its quotient set is , where is an infinite residue class. Define addition by
The answer must be independent of the equivalence class representatives. If and , then , so both sums have the same residue class. This is what it means for the group operation to be well-defined. With this addition, the quotient set is a cyclic group, with identity and inverse for . [ref]
For example, . Choosing and as different representatives of an equivalence class for gives the same sum; choosing and gives again. These calculations use residue classes of all integers. Raw addition on the finite does not stay in : . The formula for addition on therefore cannot be applied as a raw inherited operation on that finite example.
Quotient structure 2026-11-05
For an algebraic structure specified by operations, a quotient structure identifies elements through an equivalence relation compatible with every operation. Explicitly, if for all inputs, compatibility requires . Then
is independent of the chosen representatives. The map is a surjective homomorphism.
For the integers, congruence modulo is compatible with addition and multiplication, giving the quotient ring . For a group, equivalence by cosets supports a quotient group precisely when the subgroup is normal. The compatibility requirement is what makes the quotient a reusable algebraic object rather than merely a partition of a set.
Radical and socle series of a direct sum Created 2026-10-03 Updated 2026-11-05
For finite-length modules and every nonnegative integer ,