Dixon's identity¶
A family of binomial and hypergeometric summation identities associated with A. C. Dixon, including a terminating triple-binomial evaluation.
Core Idea¶
Dixon's identity names several exact binomial and hypergeometric summations associated with A. C. Dixon; each equates a highly structured sum to a factorial or gamma quotient under explicit parameter restrictions. The label names a family, so a use should print the exact variant and its domain. Finite binomial forms terminate for nonnegative integers, whereas the hypergeometric theorem has analytic convergence and pole restrictions. Integer specialization links them but does not erase those conditions. MacMahon, Selberg-integral, or algorithmic proofs are alternative certifications; checking a few values is only diagnostic.
How would you explain it like I'm…
The Neat Cube Trick
Alternating Cube Sum Formula
Alternating Binomial Cube Summations
Scope of Application¶
The family is used in combinatorics, special functions, and symbolic summation when the exact variant is declared. Use the name only with the exact displayed variant, admissible parameters, termination or convergence rule, and closed form; do not apply it to merely similar triple-binomial sums.
- Combinatorics. Evaluates finite binomial sums.
- Hypergeometric functions. Specializes a well-poised 3F2 theorem.
- Symbolic computation. Tests summation algorithms.
- Integral methods. Connects to Selberg-type evaluations.
- Proof comparison. Contrasts derivations of one equality.
Clarity¶
Always print the formula and domain. The original one-parameter identity, three-parameter generalization, and analytic theorem share a name but are not interchangeable statements. The closest near miss sets the boundary: A nearby terminating hypergeometric identity is the closest miss when its balancing/well-poised relation differs.
Manages Complexity¶
Dixon's identity compresses a long alternating sum into a factorial or gamma quotient. Parameter balance, termination, and analytic continuation explain why this compression is exceptional rather than generic. The name covers a related family rather than a single unqualified equation. The finite binomial forms require nonnegative integral parameters so that the ostensibly infinite sum terminates through vanishing binomial coefficients. The hypergeometric theorem instead has analytic convergence restrictions and gamma-function singularities; taking an integer limit is a bridge between forms, not permission to ignore those conditions. Proof provenance is also separate from truth: the MacMahon Master Theorem, Selberg-integral arguments, and computer summation can certify the same evaluation by different routes. A numerical check can catch transcription errors but does not replace a symbolic proof valid throughout the declared parameter domain. The central finite combinatorics–analytic continuation tradeoff is this: The same family crosses discrete and analytic domains.
Abstract Reasoning¶
Use three linked moves: identify the exact Dixon variant; check parameter and convergence restrictions; verify termination or analytic meaning. As a collapse test, identity collapses when the domain or summand changes so the stated quotient no longer follows. A fourth check is to match the claimed closed form.
Knowledge Transfer¶
Exact-summation reasoning transfers to other hypergeometric identities, but the Dixon label stops when its kernel, balance, or closed form is absent. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. Dixon is one named well-poised evaluation.
Neighborhood in Abstraction Space¶
Dixon's identity sits in a moderately populated region (52nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Abstract Algebra & Category Theory (24 abstractions)
Nearest neighbors
- Algebraic normal form — 0.87
- Arithmetic operation — 0.86
- Terminal singularity — 0.86
- Mac Lane's coherence theorem — 0.85
- Newton–Okounkov body — 0.85
Computed from structural-signature embeddings · 2026-10-08