Extension of a character across a cyclic quotient Created 2026-10-07 Updated 2026-10-14
If is a subgroup of a finite abelian group, , and is the least positive integer with , then each character of a finite abelian group on has exactly extensions to . The displayed root choice makes the extension well-defined. Starting with the trivial subgroup and adjoining generators proves that the number of characters equals the group order without using a decomposition into cyclic groups.
Let be finite abelian and let be a character of a finite abelian group. To adjoin , let be the least positive integer with and choose a complex number of modulus one with . Then is well-defined and extends to . There are exactly choices, corresponding to the roots. Iterating proves character extension to , proves that has exactly characters, and proves separation of points by extending a primitive character of the cyclic subgroup generated by a nonzero point. No structure theorem is needed for this argument.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 16 1 Solution Created 2026-10-03 Updated 2026-10-14
We prove the Roth theorem on three-term arithmetic progressions by a density increment on an ordinary integer arithmetic progression. The required increment will be small, but depend only on the current subset density.
First establish the increment step. Suppose has subset density and no nonconstant three-term arithmetic progression. Put , regard as a subset of the cyclic group , and set . Then and . Use the normalized Fourier coefficient on a finite abelian groupThe character orthogonality geometric-series identity for and zero otherwise gives Fourier inversion on a finite group, Parseval identity on a finite group, andSince is odd, multiplication by two permutes its frequencies. If one argument is and the other two have absolute value at most one, Cauchy-Schwarz and the Parseval identity on a finite group give .
A modular arithmetic progression whose three entries lie in satisfies the corresponding integer equation: the absolute value of is less than , so congruence to zero forces equality. Thus , since only constant arithmetic progressions remain. Meanwhile, the choices and give at least arithmetic progressions in for . As , this gives . Expand . The seven terms other than the main term are each bounded by . For ,Consequently a nonzero frequency obeys , where . It is nonzero because .
We turn this coefficient into a local increase. Let . Partition the unit circle into equal intervals and consider the points , , modulo one. Two occupy the same interval, yielding an integer with . Set . If exceeds a sufficiently large absolute multiple of , then and each residue-class arithmetic progression of step in has at least terms. Partition each into pieces of lengths between and , distributing the final remainder among the pieces.
On each such arithmetic progression , the character of a finite abelian group differs from its value at the first point by at most . Write . Thereforeso . But , and hence the sum of the positive is at least . Some piece must consequently satisfy . On that piece,Also, once , . This proves the one-frequency density increment on an integer interval: for absolute constants , if , there is a arithmetic progression of length at least on which the subset density rises by at least . For example one may decrease to and choose large enough for the displayed elementary inequalities.
Now fix and suppose the required conclusion fails. On each new arithmetic progression, identify its points in order with . This affine identification preserves all integer arithmetic progressions, so its copy of is still progression-free. All densities remain at least . Put , , and choose an integer . Every increment raises the subset density by at least and changes the length by . Iterating the latter inequality givesChoose . Then every length up to step exceeds , so every increment is available. After increments the subset density exceeds one, a contradiction. ThusFor there are no sets satisfying the subset density assumption. The argument above proves the substantive case without invoking the theorem being asked for.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 16 3 i Solution Created 2026-10-03 Updated 2026-10-14
The expectations use normalized counting measure on a finite abelian group . This is the finite-group convention implicit in the averaging notation; an arbitrary infinite group has no normalized counting probability measure on all its points. For , define , and let denote complex conjugation. The Gowers U3 norm isAveraging first over gives the Derivative identity for the Gowers U3 normIndeed, if , the average over is . The eighth root is consequently well-defined. Homogeneity follows because the cube has four unconjugated and four conjugated factors, so . If the norm is zero, every squared term in the finite average vanishes. Taking gives , so pointwise. This proves positive definiteness.
For the triangle inequality, we prove the needed Gowers-Cauchy-Schwarz inequality. For eight functions on a product of finite sets , form the box norm multilinear averageFix a coordinate . After averaging its two variables separately, this is , where uses all vertices with and those with , with the remaining parity conjugations. The Cauchy-Schwarz inequality giveswhere replaces the function at each vertex by the original function with its th index set to . Each right-hand average is a squared absolute value averaged over the other coordinates, hence nonnegative. Apply this operation successively for , to every resulting factor. The eight final families each use one original at all vertices. Taking roots gives the box Cauchy-Schwarz inequalityNow take and . With and , these independent variables induce uniform : each such tuple has exactly preimages. Therefore each box norm is the corresponding norm, and the mixed cube obeysExpand the eight factors in the cube expression for . Its mixed terms are bounded by this inequality, and their bounds sum to . Thus , completing the norm proof.
Two consequences will be useful below. Multiplication by a character of a finite abelian group leaves the norm unchanged, because the alternating character product around a three-dimensional cube equals one. Alsowhere the last inequality uses the term and . Hence .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 8 3 b Solution Created 2026-10-03 Updated 2026-10-07
Write the finite abelian group additively. A character of a finite abelian group is a group homomorphism . We first prove that there are exactly such characters of a finite abelian group, without assuming a structure theorem.
Use extension of a character across a cyclic quotient. Given a subgroup and , let be the least positive integer with . The subgroup has cosets of . If is a character of a finite abelian group on , choose any of the roots and defineThis is well-defined: two representations differ by an integer multiple of , and the root equation exactly cancels that difference. It is a character of a finite abelian group, and every extension arises from one of the choices of . Build a chain from the trivial subgroup to by adjoining elements. The character of a finite abelian group count multiplies by the same factor as the subgroup order at every step, so .
For a nontrivial character of a finite abelian group , choose with . Translating the group sum showsso the sum is zero. Applied to , this provesThe orthogonal nonzero characters of a finite abelian group therefore form a basis of all complex functions on , a vector space of dimension .
With the unnormalized Fourier coefficients , expansion in that basis gives the Fourier inversion on a finite groupUnder a normalized forward-transform convention the prefactor would instead be one. Thus the unspecified constant is determined by the convention, and the inversion itself follows directly from character of a finite abelian group counting and orthogonality.