How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite Averaging and Character-Theory Prerequisites: Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Four explicit calculations accompany the prerequisite lemmas: a projection and its kernel in complex three-space, the three conjugacy-class indicators of the symmetric group on three letters, the Gram matrix and pairings on a three-point function space, and the strict unit-sum witness consisting of 1 and −1. The examples use the conventions of the companion theory page.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A coordinate projection in complex three-space
Example
In , set . The map is the projection onto along .
Facts & Assumptions
Given: , , and the subspace displayed above.
For a subspace of a finite-dimensional space there exists a linear idempotent with image and restriction equal to the identity on (Finite-dimensional subspaces admit projections without Choice).
Verification
For , and , the formula gives . Moreover .
For every , . Conversely any satisfies , so and . This explicitly realizes the projection supplied by F1.
The equation is equivalent to and , with arbitrary. Hence . Every vector decomposes as with the first summand in and the second in . If , then , so the intersection is zero and the decomposition is unique. Thus the stated kernel is exactly the direction along which projects.
Sources
Axler, 2.33, p. 42, supplies the complement construction being illustrated. These particular vectors and coordinate calculations are locally chosen.
The three conjugacy-class indicators of the symmetric group S3
Example
For and any field , the indicators of , , and form a basis of the -valued class functions. In particular that space has dimension three.
Facts & Assumptions
Given: is the permutation group of ; products act rightmost first, and is a field.
For conjugation on a finite group, the distinct conjugacy-class indicators form a basis of class functions over any field (Orbit indicators form a basis of invariant functions).
Verification
Conjugation sends a transposition to : at the composite sends to , at it sends it to , and it fixes every other point. In particular and . Thus all three transpositions, and no other permutations, constitute one conjugacy class.
Similarly, sends to , then to , then to , so it is a three-cycle. Directly , so the two three-cycles form one class. Every conjugate of is . A permutation of three points is either the identity, a transposition, or a three-cycle: fixing two points forces the third to be fixed; fixing exactly one exchanges the other two; fixing none forces a three-cycle by following any point’s successive images. Hence the three listed classes exhaust .
The group is finite and these are exactly its three classes by steps 1.1–1.2, so F1 gives the asserted indicator basis over . More explicitly, for every class function one has , because evaluation on each of the three classes picks out its constant value. For example the coefficients give the function with values at , on the transpositions, and on the three-cycles. This calculation remains valid in characteristic two, where the last two values coincide, while the indicator basis itself stays independent by evaluation on the three disjoint nonempty classes.
Sources
Judson, Example 14.2.1 lists these classes; Etingof et al., §4.3(2), p. 65, discusses . The indicator-basis calculation is a local illustration, not a character-table computation.
The normalized Hermitian form on three points
Example
For , identify functions with their value triples and put . Its Gram matrix in the point-indicator basis is . For and , one has and . Multiplying each point indicator by gives an orthonormal basis.
Facts & Assumptions
Given: , point indicators , and the displayed normalized form and vectors .
The normalized finite function-space form is an inner product linear in its first variable (The normalized Hermitian form on a finite function space).
Verification
The set is nonempty of cardinality three, so F1 applies with normalization . The point indicators are a basis: for every function , and evaluating a zero combination at each point makes all coefficients zero.
For , only the value at point contributes to , giving . For , the two indicators never both have nonzero value at the same point, so the pairing is zero. Thus , which is the matrix .
Since , . Also . In particular this nonzero vector has strictly positive diagonal value.
Put , where is the positive real square root. Direct substitution gives . Scaling each basis vector by the nonzero scalar preserves spanning and independence (divide the coefficients by ), so is an orthonormal basis.
Sources
Axler, 6.3(b), p. 184, gives positive weighted inner products. The equal weights and the displayed vectors are the local example.
Distinct unit summands need not attain the sum bound
Statement refuted
The assertion “for all and all unit complex numbers , ” is false.
Facts & Assumptions
Given: The universal equality assertion for unit complex summands.
The upper bound is attained exactly when all unit summands agree (Equality in the unit-complex finite-sum bound).
Counterexample
Take , and in . Their moduli are and , so both satisfy the unit-modulus hypothesis and .
Their sum is , whose modulus is zero. Consequently , so this instance fails the asserted equality and refutes its universal quantifier. The summands are distinct, in agreement with F1.
Sources
Etingof et al., Lemma 5.4.5 proof, p. 101, motivates the strictness interface. The pair is the locally specified counterexample.