From the Pythagorean Dream to the Fermatian Obstruction: The Unified Chain

1. Introduction

1.1. Historical Context

The Pythagorean school, founded in Croton (Magna Graecia) around the 6th century BC, established one of the first philosophical-mathematical syntheses in Western history: the belief that “everything is number” ($\pi \alpha \nu \tau \alpha \alpha \rho \iota \theta \mu o\varsigma$). For the Pythagoreans, numbers were not mere calculation tools but ontological principles structuring cosmic reality. This worldview found its purest expression in figurate numbers: geometric representations of integers by means of regular point configurations.

The Pythagorean theorem crystallised the harmony between geometry and arithmetic:

$$h^2=a^2+b^2,$$

where h denotes the hypotenuse of a right triangle and a, b its legs. Euclid provided the complete parameterisation of primitive Pythagorean triples:

$$a=m^2-n^2,b=2mn,h=m^2+n^2,$$

with $m>n>0$, $gcd(m,n)=1$, $m\not\equiv n(mod2)$.

Nicomachus of Gerasa (∼60–120 AD) systematised in his Introductio Arithmetica the classical Greek arithmetic knowledge. He established the cumulative sum of cubes:

$$S_3\left(n\right)=\sum _{k=1}^n{k}^3=T_n^2,T_n={\displaystyle \frac{n(n+1)}{2}}.$$

It is essential to note that Nicomachus did not formulate nor suggest any identity involving symmetric differences ${(n+1)}^2-{(n-1)}^2$; his contribution was limited exclusively to the cumulative sum formula. Attributing the Cubic Identity (derived in Section 3) to him would be an inadmissible historiographic anachronism.

Johann Faulhaber (1580–1635) computed $S_p\left(n\right)={\sum }_{k=1}^n{k}^p$ for p up to at least 17 in his Academia Algebrae (1631) [14], discovering the polynomial nature of these sums and observing that $S_3\left(n\right)=T_n^2$ is the only case with a perfect quadratic factorisation.

Jakob Bernoulli (1654–1705) published posthumously in Ars Conjectandi (1713) [8] the general formula for $S_p\left(n\right)$ in terms of the coefficients that today bear his name. The Bernoulli numbers $B_j$ vanish for all odd $j\ge 3$; this is a fundamental fact for the Universal Identity.

Pierre de Fermat (1607–1665) wrote in 1637, in the margin of his copy of Diophantus’s Arithmetica: “Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et generaliter nullam in infinitum ultra quadratum potestatem in duos eiusdem nominis fas est dividere cuius rei demonstrationem mirabilem sane detexi. Hanc marginis exiguitas non caperet.” Most historians consider that his “marvellous proof” was incomplete.

Leonhard Euler (1707–1783) provided the first proof of FLT for $p=3$ (∼1770) by infinite descent in the ring $\mathbb{Z}\left[\omega \right]$ of Eisenstein integers, where $\omega =e^{2\pi i/3}$. The key factorisation $x^3+y^3=(x+y)(x+\omega y)(x+{\omega }^{2}y)=z^3$ requires unique factorisation in $\mathbb{Z}\left[\omega \right]$, a property Euler assumed tacitly and that was rigorously established by Gauss and Kummer [2].

Sophie Germain (1776–1831) developed the first systematic framework for attacking FLT via modular congruences, verifying conditions for all primes $p<100$. She adopted the masculine pseudonym “M. Le Blanc” to correspond with Lagrange and Gauss. Gauss wrote in 1807: “When a person of the sex which, according to our customs and prejudices, must encounter infinitely more difficulties than men to familiarise herself with these thorny researches, succeeds nevertheless in surmounting these obstacles and penetrating their most obscure parts, she must without doubt have the noblest courage, quite extraordinary talents, and superior genius.”

Ernst Kummer (1810–1893) introduced the revolutionary concept of ideal numbers and proved FLT for all regular primes.

Kenneth Ribet proved in 1986 that Frey’s elliptic curve (associated with a hypothetical counterexample to FLT) would violate the Taniyama–Shimura–Weil conjecture, reducing FLT to a problem in the theory of modular forms.

Andrew Wiles (1953–) proved FLT in full generality in 1994 (published in 1995) [1] via the Modularity Theorem for elliptic curves. Wiles’ proof unifies algebraic geometry, representation theory, complex analysis, and number theory.

Table 1 summarises the chronological development.

1.2. The Two Traditions and the Bridge

The sum formula of Nicomachus,

$$S_3\left(n\right):=\sum _{k=1}^n{k}^3=T_n^2,T_n={\displaystyle \frac{n(n+1)}{2}},$$

is one of the oldest identities in number theory [3]. Applying the backward-difference operator ∇ yields the individual cubic difference ${\delta }_3\left(a\right)=3a^2-3a+1$, a formula within reach of any secondary-school student.

More than sixteen centuries later, Euler’s factorisation of $a^3+b^3$ over the ring of Eisenstein integers $\mathbb{Z}\left[\omega \right]$ employs the norm of the element $a-\omega (a-1)$ [2]. The central observation of this work is that these two objects are the same:

$${\delta }_3\left(a\right)=N_{\mathbb{Z}\left[\omega \right]}\left(a-\omega (a-1)\right).$$

This three-line algebraic identity is the bridge between the two traditions, and is the seed of the Unified Chain developed in Section 6.

1.3. The Gap This Work Covers

The classical approaches to FLT operate at the level of algebraic number theory (Kummer’s ideal numbers, 1847) or modular forms (Wiles, 1994). What was missing was an elementary, quantitative, and structural map of the Fermatian obstruction, graded by the exponent p and accessible from first-year modular arithmetic. This work provides exactly that map, and adds a new element: the explicit articulation that the central quantity ${\delta }_3\left(a\right)$ connects four distinct mathematical traditions in a single identity.

1.4. What Is Genuinely Original

The individual equalities comprising the Unified Chain are consequences of classical results. The originality of this work lies in the following contributions not present in the prior literature:

(i)

The explicit articulation of the complete path $\nabla T_n^2\to {\delta }_3\left(a\right)\to N_{\mathbb{Z}\left[\omega \right]}\to {\Phi }_3\to N_{\mathbb{Q}\left({\zeta }_3\right)/\mathbb{Q}}$ as a single named, proved, numerically verified identity. No prior work in the known literature presents this chain in this form.

(ii)

The reorientation of the Faulhaber–Bernoulli formula from cumulative sums toward individual powers via ${\delta }_m\left(n\right)=n^m-{(n-1)}^m$.

(iii)

The Tower of Norms representation (Section 7), making explicit how each perfect cube accumulates hexagonal norms layer by layer.

(iv)

The Cyclotomic Compatibility Index $\mathrm{ICC}(n,p)$ (Section 8), a new invariant that quantifies whether a given integer can be a cyclotomic norm, and hence whether $h^p=a^p+b^p$ can have integer solutions.

(v)

The Window Incompatibility Theorem (Section 9), formalising why hexagonal windows cannot merge.

(vi)

The Extreme Reduction Theorem (Section 11), reducing $a^3+b^3=c^3$ to the case $a=1$ by elementary means.

(vii)

The Fermatian Rigidity Index $R\left(p\right)$ (Section 13.2), a new quantitative measure.

(viii)

The structural map of the Fermatian obstruction from elementary discrete calculus, graded by the exponent p and accessible from first-year modular arithmetic.

1.5. Scope and Non-Claims

Explicit declaration. This work does not prove Fermat’s Last Theorem, definitively established by Wiles [1]. It does not supersede Euler’s classical argument for $p=3$[2]: the three-language equivalence (Section 10.1) uses the unique-factorisation-domain (UFD) property of $\mathbb{Z}\left[\omega \right]$, which is precisely Euler’s key ingredient. The ERT should be read as a structural reduction of the problem to the case $a=1$, not as a complete proof of FLT.

1.6. Roadmap

Section 2 establishes the theoretical framework. Section 3 derives the Cubic Identity and the Eisenstein norm identity. Section 4 develops the general cyclotomic framework. Section 5 proves the UFBI and the Structural Stratification Theorem. Section 6 states and proves the Unified Chain Formula. Section 7 introduces the Tower of Norms. Section 8 defines and analyses the Cyclotomic Compatibility Index. Section 9 proves the Window Incompatibility Theorem. Section 10 establishes the Three-Language Equivalence, the Order Theorem, and the LTE and Order Filters. Section 11 proves the Extreme Reduction Theorem. Section 12 closes the base case $a=1$. Section 13 presents the structural comparison between the Pythagorean and Fermat cases. Section 14 derives 3-adic constraints. Section 15 discusses Löschian numbers and arithmetic density. Section 16 presents the universal symbolic representation. Section 17 presents all computational verifications. Section 18 discusses the results. Section 19 lists open questions. Section 20 concludes.

2. Theoretical Framework

2.1. Discrete Calculus: Fundamental Operators

Definition 1

(Fundamental discrete operators). Let $f:\mathbb{N}\to \mathbb{R}$. Define:

$$\begin{array}{cc}\hfill \nabla f\left(n\right)& :=f\left(n\right)-f(n-1),n\ge 2(\mathrm{backward}\mathrm{difference}),\hfill \end{array}$$

(1)

$$\begin{array}{cc}\hfill \Delta f\left(n\right)& :=f(n+1)-f\left(n\right)(\mathrm{forward}\mathrm{difference}),\hfill \end{array}$$

(2)

$$\begin{array}{cc}\hfill \Sigma f\left(n\right)& :=\sum _{k=1}^{n}f\left(k\right)(\mathrm{cumulative}\mathrm{sum}).\hfill \end{array}$$

(3)

Theorem 1

(Fundamental Theorem of Discrete Calculus, Boole 1860 [7]). If $S\left(n\right)={\sum }_{k=1}^{n}f\left(k\right)$, then $\nabla S\left(n\right)=f\left(n\right)$ for all $n\ge 2$.

Proof. 

$S\left(n\right)-S(n-1)=\left[f\left(1\right)+\dots +f\left(n\right)\right]-\left[f\left(1\right)+\dots +f(n-1)\right]=f\left(n\right)$.    □

Remark 1.

This result is the discrete analogue of the Fundamental Theorem of Calculus ${\displaystyle \frac{d}{dx}}{\int }_a^{x}f\left(t\right)dt=f\left(x\right)$. The cumulative sum Σ acts as a “discrete integral” and ∇ as a “discrete derivative”; they are mutually inverse.

The analogy between continuous and discrete calculus is best illustrated by the parallel:

$$\underset{\mathrm{Leibniz}\text{-}\mathrm{Newton}(17\mathrm{th}\mathrm{c}.)}{\underbrace{{\displaystyle \frac{d}{dx}}{\int }_a^{x}f\left(t\right)dt=f\left(x\right)}}⟷\underset{\mathrm{Boole}\left(1860\right)}{\underbrace{\nabla S\left(n\right)=f\left(n\right)}}$$

2.2. The Individual Finite Difference ${\delta }_m\left(n\right)$

Definition 2

(Individual finite difference). For integers $m\ge 1$ and $n\ge 1$:

$${\delta }_m\left(n\right):=n^m-{(n-1)}^m.$$

The first values are: ${\delta }_1\left(n\right)=1$, ${\delta }_2\left(n\right)=2n-1$, ${\delta }_3\left(n\right)=3n^2-3n+1$, ${\delta }_4\left(n\right)=4n^3-6n^2+4n-1$.

Observation 2.

The quantity ${\delta }_m\left(n\right)$ is not the difference of a cumulative sum: it measures the increment of $n^m$ when passing from $n-1$ to n. Reorienting the Faulhaber–Bernoulli formula toward these individual increments—rather than cumulative sums—is a conceptual contribution of this work.

2.3. The Faulhaber–Bernoulli Formula

Theorem 3

(Faulhaber–Bernoulli, Bernoulli 1713 [8]). For all $p\ge 1$ and $n\in \mathbb{N}$:

$$S_p\left(n\right):=\sum _{k=1}^n{k}^p={\displaystyle \frac{1}{p+1}}\sum _{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}{n}^{p+1-j},$$

where $B_0=1$, $B_1^{+}=\frac{1}{2}$, $B_2=\frac{1}{6}$, $B_4=-\frac{1}{30}$, $B_6=\frac{1}{42}$, and $B_j=0$ for all odd $j\ge 3$. The canonical relevant cases are:

$$S_1\left(n\right)=T_n={\displaystyle \frac{n(n+1)}{2}},S_2\left(n\right)={\displaystyle \frac{n(n+1)(2n+1)}{6}},S_3\left(n\right)=T_n^2={\displaystyle \frac{n^2{(n+1)}^2}{4}}.$$

Theorem 4

(Cumulative sum of cubes, Nicomachus ∼100 AD [3]). For all $n\in \mathbb{N}$:

$$S_3\left(n\right)=\sum _{k=1}^n{k}^3=T_n^2={\displaystyle \frac{n^2{(n+1)}^2}{4}}.$$

Remark 2.

Among all power sums $S_p\left(n\right)={\sum }_{k=1}^n{k}^p$, the identity $S_3\left(n\right)=T_n^2$ is the unique instance that is a polynomial perfect square [6]. This exceptional algebraic compactness is the arithmetic seed of the structure developed below.

2.4. Eisenstein Integers

Let $\omega =e^{2\pi i/3}={\displaystyle \frac{-1+\sqrt{-3}}{2}}$, a primitive cube root of unity satisfying ${\omega }^2+\omega +1=0$ and ${\omega }^3=1$. The ring of Eisenstein integers is

$$\mathbb{Z}\left[\omega \right]=\{u+v\omega :u,v\in \mathbb{Z}\},$$

with norm $N(u+v\omega )=u^2-uv+v^2$. This ring is a Euclidean domain (hence a UFD) with unit group $\{\pm 1,\pm \omega ,\pm {\omega }^2\}$ [4].

2.5. Multiplicative Order and the LTE Lemma

Definition 3.

For a prime q and integer t with $q\nmid t$, the multiplicative order ${\mathrm{ord}}_q\left(t\right)$ is the smallest positive integer r such that $t^r\equiv 1(modq)$. By Fermat’s little theorem, ${\mathrm{ord}}_q\left(t\right)\mid q-1$.

Lemma 1

(Lifting the Exponent (LTE) [12]). Let q be an odd prime and $a,b\in \mathbb{Z}$ with $q\mid a+b$, $q\nmid a$, $q\nmid b$, and n a positive odd integer. Then:

$$v_q(a^n+b^n)=v_q(a+b)+v_q\left(n\right),$$

where $v_q\left(m\right)$ denotes the q-adic valuation of m.

3. The Cubic Finite Difference and the Eisenstein Norm

3.1. The Cubic Identity

Theorem 5

(Cubic Identity). For all $n\in \mathbb{N}$:

$$n^3={\displaystyle \frac{n^2}{4}}\left[{(n+1)}^2-{(n-1)}^2\right]=T_n^2-T_{n-1}^2.$$

Proof. 

Applying the Fundamental Theorem of Discrete Calculus to $S_3\left(n\right)=T_n^2$:

$$n^3=\nabla S_3\left(n\right)=T_n^2-T_{n-1}^2=\frac{n^2{(n+1)}^2}{4}-\frac{{(n-1)}^2{n}^2}{4}=\frac{n^2}{4}\left[{(n+1)}^2-{(n-1)}^2\right]=\frac{n^2}{4}·4n=n^3.$$

The deductive chain of Step 1 is illustrated below:

$$\underset{\mathrm{Nicomachus},\mathrm{c}.100}{\underbrace{S_3\left(n\right)=T_n^2}}\stackrel{\nabla }{\to }\underset{\mathrm{Cubic}\mathrm{Identity}(\mathrm{Boole}+\nabla )}{\underbrace{n^3=T_n^2-T_{n-1}^2}}\stackrel{\mathrm{expand}}{\to }\underset{\mathrm{individual}\mathrm{finite}\mathrm{difference}}{\underbrace{{\delta }_3\left(a\right)=3a^2-3a+1}}\stackrel{\mathrm{FLT}}{\to }h\notin \mathbb{Z}.$$

   □

Remark 3.

The key factor is ${(n+1)}^2-{(n-1)}^2=4n$: a pure monomial. This is why the compact representation is exclusive to $p=3$ among all powers $p\ge 2$ [6].

Definition 4.

The individual cubic finite difference is

$${\delta }_3\left(a\right):=a^3-{(a-1)}^3=3a^2-3a+1.$$

The first values 1, 7, 19, 37, 61, 91, 127, 169, 217, … are the centred hexagonal numbers (OEIS A003215 [13]).

Numerical example: $a=6$. From Nicomachus: $S_3\left(6\right)=T_6^2={21}^2=441$, $S_3\left(5\right)=T_5^2={15}^2=225$, ${\delta }_3\left(6\right)=441-225=91$. Directly: ${\delta }_3\left(6\right)=3\left(36\right)-3\left(6\right)+1=108-18+1=91$.

3.2. The Eisenstein Norm Identity

Theorem 6

(Connecting Identity). For every integer a:

$${\delta }_3\left(a\right)=a^3-{(a-1)}^3=N_{\mathbb{Z}\left[\omega \right]}\left(a-\omega (a-1)\right).$$

Proof. 

Set ${\alpha }_a=a-(a-1)\omega$, so $u=a$ and $v=-(a-1)$. Then

$$N\left({\alpha }_a\right)=a^2-a·(-(a-1))+{(-(a-1))}^2=a^2+a(a-1)+{(a-1)}^2=3a^2-3a+1={\delta }_3\left(a\right).$$

Alternative proof via Euler’s factorisation. Since $x^3-y^3=(x-y)(x-\omega y)(x-{\omega }^{2}y)$ over $\mathbb{Z}\left[\omega \right]$, setting $x=a$, $y=a-1$ (so $x-y=1$) gives

$${\delta }_3\left(a\right)=\underset{{\alpha }_a}{\underbrace{(a-\omega (a-1\left)\right)}}·\underset{{\overline{\alpha }}_a}{\underbrace{(a-{\omega }^2(a-1))}}=N\left({\alpha }_a\right).$$

The norm formula is illustrated below:

$$\underset{\mathrm{Euler},u^2}{\underbrace{a^2}}+\underset{\mathrm{cross}\mathrm{term},-uv}{\underbrace{a(a-1)}}+\underset{\mathrm{Gauss},v^2}{\underbrace{{(a-1)}^2}}=\underset{{\delta }_3\left(a\right)(\mathrm{this}\mathrm{work})}{\underbrace{3a^2-3a+1}}$$

   □

Numerical example: $a=6$.${\alpha }_6=6-5\omega$, $u=6$, $v=-5$. $N\left({\alpha }_6\right)=36+30+25=91$.

4. The General Cyclotomic Framework

For a prime p, the p-th cyclotomic polynomial is

$${\Phi }_p\left(t\right)={\displaystyle \frac{t^p-1}{t-1}}=t^{p-1}+t^{p-2}+\dots +t+1,$$

with homogenisation

$${\Phi }_p(X,Y)=Y^{p-1}{\Phi }_p\left({\displaystyle \frac{X}{Y}}\right)=\sum _{j=0}^{p-1}{X}^j{Y}^{p-1-j}.$$

For $p=3$: ${\Phi }_3(X,Y)=X^2+XY+Y^2$, the norm form of $\mathbb{Q}\left(\omega \right)/\mathbb{Q}$.

Theorem 7.

Let p be a prime and a any integer. Then

$${\delta }_p\left(a\right):=a^p-{(a-1)}^p={\Phi }_p(a,a-1)=N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}\left(a-{\zeta }_p(a-1)\right),$$

where ${\zeta }_p=e^{2\pi i/p}$ and $N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}$ is the field norm.

Proof. 

The factorisation over $\mathbb{Q}\left({\zeta }_p\right)$, $x^p-y^p=(x-y){\prod }_{j=1}^{p-1}(x-{\zeta }_p^{j}y)$, with $x=a$, $y=a-1$ gives $x-y=1$ and

$${\delta }_p\left(a\right)=\prod _{j=1}^{p-1}\left(a-{\zeta }_p^j(a-1)\right).$$

The product equals $N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}(a-{\zeta }_p(a-1))$ because $\mathrm{Gal}(\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q})\cong {(\mathbb{Z}/p\mathbb{Z})}^{\times }$ permutes the set $\{{\zeta }_p^j:1\le j\le p-1\}$ transitively.    □

Remark 4.

For $p=3$, $\mathbb{Q}\left({\zeta }_3\right)=\mathbb{Q}\left(\omega \right)$ and $N_{\mathbb{Q}\left(\omega \right)/\mathbb{Q}}$ coincides with $N_{\mathbb{Z}\left[\omega \right]}$, recovering Theorem 3.4. For $p=2$, ${\delta }_2\left(a\right)=2a-1$ and ${\Phi }_2(a,a-1)=2a-1$; the norm is over $\mathbb{Q}\left({\zeta }_2\right)=\mathbb{Q}$ and is trivially the identity. This is why the quadratic case carries no algebraic constraint: ${\delta }_2$ sweeps all odd integers.

Table 2. Structure of ${\delta }_p\left(a\right)=a^p-{(a-1)}^p$ for small primes.

p	Ring	${\mathit{\delta }}_{\mathit{p}}\left(\mathit{a}\right)$	Prime factor constraint
2	$\mathbb{Z}$	$2a-1$	all odd primes
3	$\mathbb{Z}\left[\omega \right]$	$3a^2-3a+1$	$q\equiv 1(mod3)$
5	$\mathbb{Z}\left[{\zeta }_5\right]$	$5a^4-10a^3+10a^2-5a+1$	$q\equiv 1(mod5)$
7	$\mathbb{Z}\left[{\zeta }_7\right]$	${\sum }_{k=0}^6\left({\displaystyle \genfrac{}{}{0pt}{}{7}{k+1}}\right){(-1)}^k{a}^{6-k}$	$q\equiv 1(mod7)$

Table 2. Structure of ${\delta }_p\left(a\right)=a^p-{(a-1)}^p$ for small primes.

p	Ring	${\mathit{\delta }}_{\mathit{p}}\left(\mathit{a}\right)$	Prime factor constraint
2	$\mathbb{Z}$	$2a-1$	all odd primes
3	$\mathbb{Z}\left[\omega \right]$	$3a^2-3a+1$	$q\equiv 1(mod3)$
5	$\mathbb{Z}\left[{\zeta }_5\right]$	$5a^4-10a^3+10a^2-5a+1$	$q\equiv 1(mod5)$
7	$\mathbb{Z}\left[{\zeta }_7\right]$	${\sum }_{k=0}^6\left({\displaystyle \genfrac{}{}{0pt}{}{7}{k+1}}\right){(-1)}^k{a}^{6-k}$	$q\equiv 1(mod7)$

Numerical example: $a=6$, $p=3$.${\Phi }_3(6,5)=36+30+25=91$.

5. The Universal Faulhaber–Bernoulli Identity

5.1. The UFBI

Theorem 8

(Universal Faulhaber–Bernoulli Identity (UFBI)). For all $p\ge 1$ and $n\in \mathbb{N}$:

$$n^p={\displaystyle \frac{1}{p+1}}\sum _{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}{\delta }_{p+1-j}\left(n\right),{\delta }_m\left(n\right)=n^m-{(n-1)}^m.$$

Proof. 

Applying the Fundamental Theorem of Discrete Calculus to the Faulhaber–Bernoulli formula:

$$\begin{array}{cc}\hfill n^p& =S_p\left(n\right)-S_p(n-1)\hfill \\ \hfill & ={\displaystyle \frac{1}{p+1}}\sum _{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}\left[n^{p+1-j}-{(n-1)}^{p+1-j}\right]\hfill \\ \hfill & ={\displaystyle \frac{1}{p+1}}\sum _{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}{\delta }_{p+1-j}\left(n\right).\hfill \end{array}$$

The transition from Faulhaber–Bernoulli to the UFBI is illustrated below:

$$\begin{array}{c}\underset{\mathrm{Faulhaber}\text{-}\mathrm{Bernoulli}(\mathrm{Bernoulli},1713)}{\underbrace{S_p\left(n\right)={\displaystyle \frac{1}{p+1}}{\sum }_{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}{n}^{p+1-j}}}\\ \stackrel{\nabla }{\to }\\ \underset{\mathrm{UFBI}(\mathrm{this}\mathrm{work},2026)}{\underbrace{n^p={\displaystyle \frac{1}{p+1}}{\sum }_{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}{\delta }_{p+1-j}\left(n\right)}}\end{array}$$

   □

Observation 9.

The classical Faulhaber–Bernoulli formula expresses $S_p\left(n\right)$: cumulative sums of powers. The UFBI expresses $n^p$ itself: the individual power. The conceptual move is to apply ∇ to extract the internal structure of the individual power from its cumulative sum.

5.2. Structural Stratification

Definition 5

(Internal structural complexity). $C\left(p\right)$ is the number of active indices $j\in \{0,1,\dots ,p\}$ in the UFBI, i.e., those with $B_j^{+}\ne 0$. Since $B_j=0$ for all odd $j\ge 3$, the active indices are $j\in \{0,1,2,4,6,\dots ,2\lfloor p/2\rfloor \}$: exactly $\lfloor p/2\rfloor +1$ values.

Theorem 10

(Structural Stratification). $C\left(p\right)=\lfloor p/2\rfloor +2$. $C\left(p\right)$ grows monotonically. $p=3$ is the only $p\ge 2$ for which the UFBI reduces to a pure monomial in n.

The monotone growth of algebraic complexity is illustrated below:

$$\begin{array}{c}\underset{C=3,\mathrm{binomial}}{\underbrace{p=2}}⟶\underset{C=3,\mathrm{pure}\mathrm{monomial}\left(\mathrm{unique}\right)}{\underbrace{p=3}}⟶\underset{C=4,\mathrm{trinomial}}{\underbrace{p=4,5}}\\ ⟶\underset{C=5,\mathrm{tetranomial}}{\underbrace{p=6,7}}⟶\underset{C\to \infty ,\mathrm{Bernoulli}\mathrm{series}}{\underbrace{p\to \infty }}\end{array}$$

Monotone growth of algebraic complexity; $p=3$ is the only point of optimal compactness (Theorem 5.4).

5.3. Explicit Developments for $P=2,\dots ,6$

Using $B_0=1$, $B_1^{+}=\frac{1}{2}$, $B_2=\frac{1}{6}$, $B_4=-\frac{1}{30}$, $B_6=\frac{1}{42}$:

$$\begin{array}{cc}\hfill p=2,C\left(2\right)=3:& n^2={\displaystyle \frac{1}{3}}\left({\delta }_3\left(n\right)+{\displaystyle \frac{3}{2}}{\delta }_2\left(n\right)\right),\hfill \end{array}$$

(4)

$$\begin{array}{cc}\hfill p=3,C\left(3\right)=3(\mathrm{pure}\mathrm{monomial}):& n^3=T_n^2-T_{n-1}^2,\hfill \end{array}$$

(5)

$$\begin{array}{cc}\hfill p=4,C\left(4\right)=4:& n^4={\displaystyle \frac{1}{5}}\left({\delta }_5\left(n\right)+\frac{5}{2}{\delta }_4\left(n\right)+\frac{5}{3}{\delta }_3\left(n\right)-\frac{1}{6}{\delta }_1\left(n\right)\right),\hfill \end{array}$$

(6)

$$\begin{array}{cc}\hfill p=5,C\left(5\right)=4:& n^5=\frac{1}{6}\left({\delta }_6\left(n\right)+3{\delta }_5\left(n\right)+\frac{5}{2}{\delta }_4\left(n\right)-\frac{1}{2}{\delta }_2\left(n\right)\right),\hfill \\ \hfill p=6,C\left(6\right)=5:& n^6=\frac{1}{7}\left({\delta }_7\left(n\right)+\frac{7}{2}{\delta }_6\left(n\right)+\frac{7}{2}{\delta }_5\left(n\right)\right.\hfill \end{array}$$

(7)

$$\begin{array}{cc}\hfill & \left.-\frac{7}{6}{\delta }_3\left(n\right)+\frac{1}{6}{\delta }_1\left(n\right)\right).\hfill \end{array}$$

(8)

Numerical example: UFBI for $p=3$, $n=6$. Since $p=3$ yields a pure monomial, this reduces to $n^3=T_n^2-T_{n-1}^2$. For $n=6$: $T_6^2-T_5^2=441-225=216=6^3$.

Note: ${\delta }_3\left(6\right)=91\ne 216$. The UFBI gives $n^p=6^3=216$; the individual difference ${\delta }_3\left(6\right)=6^3-5^3=91$ is a different (but related) quantity.

Table 3. Structural stratification of the UFBI.

p	$\mathit{C}\left(\mathit{p}\right)$	Algebraic type of $\mathbf{\nabla }{\mathit{S}}_{\mathit{p}}\left(\mathit{n}\right)$	FLT status
2	3	Binomial: $2n-1$	Infinitely many solutions
3	3	Pure monomial $n^3$ (unique)	Impossible (Euler, 1770)
4	4	Trinomial with Bernoulli coefficients	Impossible (Wiles, 1994)
5	4	Trinomial	Impossible
6	5	Tetranomial	Impossible
7	5	Tetranomial	Impossible
8	6	Pentanomial	Impossible
$p\to \infty$	∞	Bernoulli series	Impossible

Table 3. Structural stratification of the UFBI.

p	$\mathit{C}\left(\mathit{p}\right)$	Algebraic type of $\mathbf{\nabla }{\mathit{S}}_{\mathit{p}}\left(\mathit{n}\right)$	FLT status
2	3	Binomial: $2n-1$	Infinitely many solutions
3	3	Pure monomial $n^3$ (unique)	Impossible (Euler, 1770)
4	4	Trinomial with Bernoulli coefficients	Impossible (Wiles, 1994)
5	4	Trinomial	Impossible
6	5	Tetranomial	Impossible
7	5	Tetranomial	Impossible
8	6	Pentanomial	Impossible
$p\to \infty$	∞	Bernoulli series	Impossible

6. The Unified Chain

6.1. The Five Traditions and Their Convergence

The Unified Chain asserts that a single number ${\delta }_3\left(a\right)=3a^2-3a+1$ is simultaneously:

1.

The result of applying ∇ to Nicomachus’s formula (discrete calculus).

2.

The norm of the Eisenstein integer ${\alpha }_a=a-(a-1)\omega$ (algebraic number theory).

3.

The value of the cyclotomic binary form ${\Phi }_3(a,a-1)$ (cyclotomic theory).

4.

A detector of multiplicative orders: $q\mid {\delta }_3\left(a\right)$ if and only if ${\mathrm{ord}}_q\left(a{(a-1)}^{-1}\right)\mid 3$ (modular arithmetic).

5.

The a-th centred hexagonal number $H_a=3a^2-3a+1$ (geometry of $\mathbb{Z}\left[\omega \right]$) [13].

6.2. The Unified Chain Formula

Theorem 11

(Unified Chain). For all $a\in {\mathbb{Z}}^{+}$:

$$\underset{\begin{array}{c}\mathrm{Nicomachus}/\mathrm{Boole}\\ (1\mathrm{st}\text{–}19\mathrm{th}\mathrm{c}.)\end{array}}{\underbrace{\nabla T_n^2}}=\underset{\begin{array}{c}\mathrm{discrete}\\ \mathrm{calculus}\end{array}}{\underbrace{{\delta }_3\left(a\right)}}=\underset{\begin{array}{c}\mathrm{Eisenstein}\mathrm{norm}\\ \mathrm{Euler}(18\mathrm{th}\mathrm{c}.)\end{array}}{\underbrace{N_{\mathbb{Z}\left[\omega \right]}\left(a-\omega (a-1)\right)}}=\underset{\begin{array}{c}\mathrm{cyclotomic}\mathrm{form}\\ \mathrm{Gauss}(19\mathrm{th}\mathrm{c}.)\end{array}}{\underbrace{{\Phi }_3(a,a-1)}}=\underset{\begin{array}{c}\mathrm{field}\mathrm{norm}\\ \mathrm{Dedekind}(19\mathrm{th}\text{–}20\mathrm{th}\mathrm{c}.)\end{array}}{\underbrace{N_{\mathbb{Q}\left({\zeta }_3\right)/\mathbb{Q}}\left(a-{\zeta }_3(a-1)\right)}}$$

Each equality sign connects a mathematical tradition separated by centuries.

Proof. 

First equality ($\nabla T_n^2={\delta }_3\left(a\right)$): By the Fundamental Theorem, $\nabla T_n^2=\nabla S_3\left(n\right)=n^3-{(n-1)}^3={\delta }_3\left(n\right)$. Evaluating at $n=a$ gives ${\delta }_3\left(a\right)$.

Second equality (${\delta }_3\left(a\right)=N_{\mathbb{Z}\left[\omega \right]}(a-\omega (a-1))$): Theorem 3.4.

Third equality (${\delta }_3\left(a\right)={\Phi }_3(a,a-1)$): ${\Phi }_3(a,a-1)=a^2+a(a-1)+{(a-1)}^2=3a^2-3a+1={\delta }_3\left(a\right)$.

Fourth equality (${\Phi }_3(a,a-1)=N_{\mathbb{Q}\left({\zeta }_3\right)/\mathbb{Q}}(a-{\zeta }_3(a-1))$): Theorem 4.1 with $p=3$.

The second step of the deductive chain, from ${\delta }_3\left(a\right)$ to four equivalent languages, is illustrated below.

First part:

$$\underset{\mathrm{discrete}\mathrm{calculus}(\mathrm{this}\mathrm{work})}{\underbrace{{\delta }_3\left(a\right)=3a^2-3a+1}}⟺\underset{\mathrm{modular}\mathrm{arithmetic}(\mathrm{Fermat}/\mathrm{Lagrange})}{\underbrace{q\mid {\delta }_3\left(a\right)\iff {\mathrm{ord}}_q\left(t_a\right)=3}}$$

Second part:

$$\underset{\mathrm{Eisenstein}\mathrm{norm}(\mathrm{Euler},18\mathrm{th}\mathrm{c}.)}{\underbrace{{\delta }_3\left(a\right)=N_{\mathbb{Z}\left[\omega \right]}(a-\omega (a-1))}}=\underset{\mathrm{cyclotomic}\mathrm{form}(\mathrm{Gauss},19\mathrm{th}\mathrm{c}.)}{\underbrace{{\Phi }_3(a,a-1)}}$$

   □

6.3. What Is Original About the Chain

Each individual equality is a consequence of classical results. The originality is the explicit articulation of the complete path as a single named identity, proved from beginning to end, connecting five traditions that existed separately in the literature. No prior work in the known literature presents this chain in this unified form.

6.4. What the Chain Teaches

The Unified Chain teaches that the arithmetic of cubes has an internal structure invisible at first sight, and that revealing it requires five distinct mathematical languages which, when unified, explain where and why Fermat’s equation fails. The five “readings” of the number 91 in Section 6.5 below illustrate this concretely.

6.5. Complete Numerical Verification for $A=6$, Result $=91$

Step 1. From Nicomachus (discrete calculus):

$$S_3\left(6\right)=T_6^2={21}^2=441,S_3\left(5\right)=T_5^2={15}^2=225,\nabla T_n^2{|}_{n=6}=441-225=91.$$

Step 2. Direct formula: ${\delta }_3\left(6\right)=3\left(36\right)-3\left(6\right)+1=108-18+1=91$.

Step 3. Eisenstein norm: ${\alpha }_6=6-5\omega$, $N\left({\alpha }_6\right)=36+30+25=91$.

Step 4. Cyclotomic form: ${\Phi }_3(6,5)=36+30+25=91$.

Step 5. Field norm: By Theorem 4.1, $N_{\mathbb{Q}\left({\zeta }_3\right)/\mathbb{Q}}(6-5{\zeta }_3)={\prod }_{j=1}^2(6-{\zeta }_3^j·5)=91$.

Table 4. Numerical verification of the Unified Chain for $a=6$.

Expression	Computation	Result
$\nabla T_6^2=S_3\left(6\right)-S_3\left(5\right)$	$441-225$	91
${\delta }_3\left(6\right)=3\left(36\right)-18+1$	$108-18+1$	91
$N(6-5\omega )$, $u=6$, $v=-5$	$36+30+25$	$91=7\times 13$
${\Phi }_3(6,5)=36+30+25$	$6^2+6·5+5^2$	91

Table 4. Numerical verification of the Unified Chain for $a=6$.

Expression	Computation	Result
$\nabla T_6^2=S_3\left(6\right)-S_3\left(5\right)$	$441-225$	91
${\delta }_3\left(6\right)=3\left(36\right)-18+1$	$108-18+1$	91
$N(6-5\omega )$, $u=6$, $v=-5$	$36+30+25$	$91=7\times 13$
${\Phi }_3(6,5)=36+30+25$	$6^2+6·5+5^2$	91

6.6. Verification Table of the Unified Chain

Table 5. Values of ${\delta }_3\left(a\right)$, factorisations, and ${\alpha }_a=a-\omega (a-1)$. Every prime factor satisfies $q\equiv 1(mod3)$.

a	${\mathit{\delta }}_3\left(\mathit{a}\right)$	Factorisation	${\mathit{\alpha }}_{\mathit{a}}$	$\mathit{N}(\mathit{a}-(\mathit{a}-1\left)\mathit{\omega }\right)$
1	1	unit	1	—
2	7	7	$2-\omega$	$4+2+1=7$
3	19	19	$3-2\omega$	$9+6+4=19$
4	37	37	$4-3\omega$	$16+12+9=37$
5	61	61	$5-4\omega$	$25+20+16=61$
6	91	$7·13$	$6-5\omega$	$36+30+25=91$
7	127	127	$7-6\omega$	$49+42+36=127$
8	169	${13}^2$	$8-7\omega$	$64+56+49=169$
9	217	$7·31$	$9-8\omega$	$81+72+64=217$
10	271	271	$10-9\omega$	$100+90+81=271$

Table 5. Values of ${\delta }_3\left(a\right)$, factorisations, and ${\alpha }_a=a-\omega (a-1)$. Every prime factor satisfies $q\equiv 1(mod3)$.

a	${\mathit{\delta }}_3\left(\mathit{a}\right)$	Factorisation	${\mathit{\alpha }}_{\mathit{a}}$	$\mathit{N}(\mathit{a}-(\mathit{a}-1\left)\mathit{\omega }\right)$
1	1	unit	1	—
2	7	7	$2-\omega$	$4+2+1=7$
3	19	19	$3-2\omega$	$9+6+4=19$
4	37	37	$4-3\omega$	$16+12+9=37$
5	61	61	$5-4\omega$	$25+20+16=61$
6	91	$7·13$	$6-5\omega$	$36+30+25=91$
7	127	127	$7-6\omega$	$49+42+36=127$
8	169	${13}^2$	$8-7\omega$	$64+56+49=169$
9	217	$7·31$	$9-8\omega$	$81+72+64=217$
10	271	271	$10-9\omega$	$100+90+81=271$

6.7. The Seven Connected Areas

The Unified Chain connects seven mathematical areas in a single identity:

1.

History and philosophy of mathematics: Nicomachus (1st c.), Taylor (18th c.), Boole (19th c.), Euler (18th c.), Gauss (19th c.).

2.

Discrete calculus: operators ∇, $\Delta$, $\Sigma$; Fundamental Discrete Theorem.

3.

Elementary number theory: prime divisibility; p-adic valuations.

4.

Modular arithmetic: multiplicative orders ${\mathrm{ord}}_q\left(t\right)$; congruences of ${\delta }_m\left(n\right)$.

5.

Abstract algebra / group theory: group ${(\mathbb{Z}/q\mathbb{Z})}^{\times }$; Lagrange’s theorem.

6.

Algebraic number theory: Eisenstein integers $\mathbb{Z}\left[\omega \right]$; norm $N(u+v\omega )=u^2-uv+v^2$; Euler’s factorisation.

7.

Cyclotomic theory: cyclotomic polynomials ${\Phi }_p$; field $\mathbb{Q}\left({\zeta }_p\right)$; Galois group:

$$\mathrm{Gal}(\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q})\cong {(\mathbb{Z}/p\mathbb{Z})}^{\times }.$$

7. The Tower of Norms

This section introduces a new representation not explicit in the prior literature.

Theorem 12

(Tower of Norms). For every positive integer a:

$$a^3=\sum _{k=1}^a{\delta }_3\left(k\right)=\sum _{k=1}^a{N}_{\mathbb{Z}\left[\omega \right]}\left(k-\omega (k-1)\right)=\sum _{k=1}^a{\Phi }_3(k,k-1).$$

Each perfect cube is a tower of hexagonal norms stacked layer by layer.

Proof. 

Since ${\delta }_3\left(k\right)=k^3-{(k-1)}^3$, the sum telescopes: ${\sum }_{k=1}^a{\delta }_3\left(k\right)=a^3-0^3=a^3$. Each summand equals $N\left({\alpha }_k\right)$ by Theorem 3.4.

The structure of the Tower of Norms is illustrated below:

$$\underset{\mathrm{telescoping}\mathrm{sum}(\mathrm{this}\mathrm{work})}{\underbrace{a^3={\sum }_{k=1}^a{\delta }_3\left(k\right)}}=\underset{\mathrm{Eisenstein}\mathrm{norms}(\mathrm{Euler},18\mathrm{th}\mathrm{c}.)}{\underbrace{{\sum }_{k=1}^{a}N\left(k-\omega (k-1)\right)}}=\underset{\mathrm{cyclotomic}\mathrm{forms}(\mathrm{Gauss},19\mathrm{th}\mathrm{c}.)}{\underbrace{{\sum }_{k=1}^a{\Phi }_3(k,k-1)}}$$

Every prime in the tower satisfies $q\equiv 1(mod3)$: arithmetic signature of $\mathbb{Z}\left[\omega \right]$.    □

Table 6. Tower of Norms for $a=6$.

k	${\mathit{\delta }}_3\left(\mathit{k}\right)$	$\mathit{N}\left({\mathit{\alpha }}_{\mathit{k}}\right)$	Prime factors	$\mathit{q}mod3$
1	1	$N\left(1\right)$	unit	—
2	7	$N(2-\omega )$	7	$\equiv 1$
3	19	$N(3-2\omega )$	19	$\equiv 1$
4	37	$N(4-3\omega )$	37	$\equiv 1$
5	61	$N(5-4\omega )$	61	$\equiv 1$
6	91	$N(6-5\omega )$	$7,13$	$\equiv 1$
Sum	$216=6^3$		all $\equiv 1(mod3)$

Table 6. Tower of Norms for $a=6$.

k	${\mathit{\delta }}_3\left(\mathit{k}\right)$	$\mathit{N}\left({\mathit{\alpha }}_{\mathit{k}}\right)$	Prime factors	$\mathit{q}mod3$
1	1	$N\left(1\right)$	unit	—
2	7	$N(2-\omega )$	7	$\equiv 1$
3	19	$N(3-2\omega )$	19	$\equiv 1$
4	37	$N(4-3\omega )$	37	$\equiv 1$
5	61	$N(5-4\omega )$	61	$\equiv 1$
6	91	$N(6-5\omega )$	$7,13$	$\equiv 1$
Sum	$216=6^3$		all $\equiv 1(mod3)$

Example 1

(Tower for $a=6$).

$$6^3=216=\sum _{k=1}^6{\delta }_3\left(k\right)=1+7+19+37+61+91.$$

Remark 5.

Every prime appearing in the entire tower satisfies $q\equiv 1(mod3)$. This is the precise arithmetic signature of the hexagonal lattice $\mathbb{Z}\left[\omega \right]$.

8. The Cyclotomic Compatibility Index

Definition 6

(Cyclotomic Compatibility Index). For a positive integer n and a prime p, define:

$$\mathrm{ICC}(n,p):=\left\{\begin{array}{cc}1\hfill & \mathrm{if}\mathrm{every}\mathrm{prime}\mathrm{factor}q\mathrm{of}n\mathrm{satisfies}q\equiv 1(modp),\hfill \\ 0\hfill & \mathrm{otherwise}.\hfill \end{array}\right.$$

Theorem 13

(ICC Theorem). For every prime p and every integer a: $\mathrm{ICC}({\delta }_p\left(a\right),p)=1$. That is, ${\delta }_p\left(a\right)$ is always cyclotomically compatible.

Proof. 

Proposition 8.3(b) below shows that every prime factor q of ${\delta }_p\left(a\right)$ with $q\nmid a(a-1)$ satisfies $q\equiv 1(modp)$. The case $q\mid a(a-1)$ cannot arise since ${\delta }_p\left(a\right)\equiv 1(modp)$ implies $p\nmid {\delta }_p\left(a\right)$, and direct inspection handles small cases.    □

Proposition 1

(Prime factor constraints). Let p be a prime and a an integer.

(a) 

${\delta }_p\left(a\right)\equiv 1(modp)$ for every integer a. In particular, $p\nmid {\delta }_p\left(a\right)$.

(b) 

If q is a prime with $q\nmid a(a-1)$ and $q\mid {\delta }_p\left(a\right)$, then $q\equiv 1(modp)$.

Proof. (a) By Fermat’s little theorem, $a^p\equiv a(modp)$ and ${(a-1)}^p\equiv a-1(modp)$, so ${\delta }_p\left(a\right)\equiv 1(modp)$.

(b) Set $t\equiv a{(a-1)}^{-1}(modq)$. Then ${\delta }_p\left(a\right)={(a-1)}^p(t^p-1)$ and since $q\nmid (a-1)$, we have $q\mid {\delta }_p\left(a\right)\iff t^p\equiv 1(modq)$, i.e., ${\mathrm{ord}}_q\left(t\right)\mid p$. Since p is prime, ${\mathrm{ord}}_q\left(t\right)\in \{1,p\}$. If ${\mathrm{ord}}_q\left(t\right)=1$ then $t\equiv 1$, forcing $q\mid 1$, a contradiction. Hence ${\mathrm{ord}}_q\left(t\right)=p$, and by Fermat’s little theorem $p\mid (q-1)$, i.e., $q\equiv 1(modp)$.    □

Corollary 1.

As p grows, the natural density of primes eligible to divide ${\delta }_p\left(a\right)$ is approximately $1/(p-1)$ (by Dirichlet’s theorem). The cyclotomic norm structure imposes an increasingly severe sieve on the prime factors of ${\delta }_p\left(a\right)$.

Theorem 14

(Obstruction via ICC). For $a,b\ge 2$, we have $\mathrm{ICC}(a^3+b^3,3)=0$ in almost all cases. More precisely, if $a^3+b^3=h^3$ for some $h\in \mathbb{Z}$, then $\mathrm{ICC}(h^3,3)=\mathrm{ICC}({\delta }_3\left(h\right),3)=1$ would be required, but the factorisation $a^3+b^3=(a+b)(a^2-ab+b^2)$ introduces the factor $(a+b)$, which generically contains primes $q\not\equiv 1(mod3)$.

Example 2

(ICC computation for $a=6$, $b=10$). $6^3+{10}^3=216+1000=1216=2^6\times 19$. $\mathrm{ICC}(1216,3)=0$ since $2\equiv 2(mod3)$. Hence $h\notin \mathbb{Z}$. Compare with the individual differences: $\mathrm{ICC}({\delta }_3\left(6\right),3)=\mathrm{ICC}(91,3)=1$ since $91=7\times 13$, $7\equiv 13\equiv 1(mod3)$.

Note: $\mathrm{ICC}=1$ but 91 is not of the form ${\delta }_3\left(h\right)$ for any integer h: it would require $3h^2-3h+1=91$, giving $h={\displaystyle \frac{3\pm \sqrt{9-12+364}}{6}}$, which is not an integer. This shows the ICC is necessary but not sufficient; the full Tower of Norms structure must be satisfied.

Table 7. ICC computation for selected pairs $(a,b)$ with $p=3$.

$(\mathit{a},\mathit{b})$	${\mathit{a}}^3+{\mathit{b}}^3$	Factorisation	$\mathbf{ICC}(·,3)$	$\mathit{h}\in \mathbb{Z}$?
$(1,2)$	9	$3^2$	0	No
$(2,3)$	35	$5\times 7$	0 ($5\not\equiv 1$)	No
$(3,4)$	91	$7\times 13$	1	No *
$(5,6)$	341	$11\times 31$	0 ($11\not\equiv 1$)	No
$(6,10)$	1216	$2^6\times 19$	0 ($2\not\equiv 1$)	No
$(3,5)$	152	$2^3\times 19$	0	No

* $\mathrm{ICC}=1$ but $91\ne {\delta }_3\left(h\right)$ for any integer h.

Table 7. ICC computation for selected pairs $(a,b)$ with $p=3$.

$(\mathit{a},\mathit{b})$	${\mathit{a}}^3+{\mathit{b}}^3$	Factorisation	$\mathbf{ICC}(·,3)$	$\mathit{h}\in \mathbb{Z}$?
$(1,2)$	9	$3^2$	0	No
$(2,3)$	35	$5\times 7$	0 ($5\not\equiv 1$)	No
$(3,4)$	91	$7\times 13$	1	No *
$(5,6)$	341	$11\times 31$	0 ($11\not\equiv 1$)	No
$(6,10)$	1216	$2^6\times 19$	0 ($2\not\equiv 1$)	No
$(3,5)$	152	$2^3\times 19$	0	No

* $\mathrm{ICC}=1$ but $91\ne {\delta }_3\left(h\right)$ for any integer h.

9. The Window Incompatibility Theorem

Definition 7

(Hexagonal Window). For any integer $x\ge 1$, the hexagonal window of x is the triple $W\left(x\right)=\{x-1,x,x+1\}$, corresponding to the three consecutive layers in the Tower of Norms centred at x.

Theorem 15

(Window Incompatibility). For $a,b\ge 2$, the hexagonal windows $W\left(a\right)$ and $W\left(b\right)$ cannot merge into a single hexagonal window $W\left(h\right)$ in $\mathbb{Z}\left[\omega \right]$. That is, there is no integer h such that the tower of norms for $h^3$ equals the sum of the towers for $a^3$ and $b^3$.

Proof sketch. 

The tower for $a^3$ has all prime factors $q\equiv 1(mod3)$. Similarly for $b^3$. The sum $a^3+b^3=(a+b)(a^2-ab+b^2)$ introduces the factor $(a+b)$, which for $a,b\ge 2$ always has prime factors not congruent to $1(mod3)$ in almost all cases (verified computationally for all pairs up to $a,b\le 600$; see Section 17). When $\mathrm{ICC}(a^3+b^3,3)=0$, the sum cannot equal any ${\delta }_3\left(h\right)$, hence cannot equal any single hexagonal norm, and the merger fails.    □

The Window Merger Attempt for $a=6$, $b=10$ is illustrated below:

Top row (individual windows):

$$\underset{N(6-5\omega )=91=7\times 13,\mathrm{all}\mathrm{factors}\equiv 1(mod3)}{\underbrace{W\left(6\right)=\{5,6,7\}}}\underset{N(10-9\omega )=271,271\equiv 1(mod3)}{\underbrace{W\left(10\right)=\{9,10,11\}}}$$

Attempted merger (sum):

$$6^3+{10}^3=1216=2^6\times 19\underset{2\equiv 2(mod3)\Rightarrow \mathrm{ICC}(1216,3)=0}{\underbrace{⟹}}h\notin \mathbb{Z}$$

10. Three-Language Equivalence and Filters

10.1. Three-language Equivalence

Theorem 16

(Three-Language Equivalence). Let q be a prime with $q\nmid a(a-1)$, and set $t_a\equiv a{(a-1)}^{-1}(modq)$. The following conditions are equivalent:

(I) 

$q\mid {\delta }_3\left(a\right)$ (discrete calculus);

(II) 

${\mathrm{ord}}_q\left(t_a\right)\mid 3$ (modular arithmetic);

(III) 

there exists an Eisenstein prime π above q such that $\pi \mid {\alpha }_a$ in $\mathbb{Z}\left[\omega \right]$, which additionally requires $q\equiv 1(mod3)$ (algebraic number theory).

The equivalence (I)⇔(II) holds for every prime q coprime to $a(a-1)$. Adding the hypothesis $q\equiv 1(mod3)$ extends this to the full three-way equivalence.

Proof. (I)⇔(II): Proposition 8.3(b) with $p=3$.

(I)⇔(III) under $q\equiv 1(mod3)$: Write $q=\pi \overline{\pi }$ in $\mathbb{Z}\left[\omega \right]$. By Theorem 3.4, $N\left({\alpha }_a\right)={\delta }_3\left(a\right)$, so $q\mid {\delta }_3\left(a\right)$ iff $\pi \overline{\pi }\mid N\left({\alpha }_a\right)$ iff $\pi \mid {\alpha }_a$ or $\overline{\pi }\mid {\alpha }_a$.

The Three-Language Equivalence is illustrated below:

$$\underset{\mathrm{discrete}\mathrm{calculus}}{\underbrace{q\mid {\delta }_3\left(a\right)}}⟺\underset{\mathrm{modular}\mathrm{arithmetic}}{\underbrace{{\mathrm{ord}}_q\left(t_a\right)\mid 3}}\underset{q\equiv 1(mod3)}{⟺}\underset{\mathrm{algebraic}\mathrm{number}\mathrm{theory}}{\underbrace{\exists \pi \mid {\alpha }_a\mathrm{in}\mathbb{Z}\left[\omega \right]}}$$

   □

Example 3

(Three languages for $a=6$, $q=7$ and $q=13$). For $q=7$: $5^{-1}\equiv 3(mod7)$, $t_6=6·3mod7=4$. Then $4^1=4$, $4^2\equiv 2$, $4^3\equiv 1(mod7)$. So ${\mathrm{ord}}_7\left(4\right)=3$ and $3\mid 3$, confirming $7\mid 91$. Also $7\equiv 1(mod3)$. Splitting in $\mathbb{Z}\left[\omega \right]$: $N(2-\omega )=4+2+1=7$, so $7=(2-\omega )(2-{\omega }^2)$.

For $q=13$: $5^{-1}\equiv 8(mod13)$, $t_6=6·8mod13=9$. Then $9^3=729\equiv 1(mod13)$, so ${\mathrm{ord}}_{13}\left(9\right)=3$, confirming $13\mid 91$. Also $13\equiv 1(mod3)$. Splitting: $N(4+\omega )=16-4+1=13$, so $13=(4+\omega )(4+{\omega }^2)$.

10.2. Fundamental Congruences of ${\delta }_m\left(n\right)$

Proposition 2

(Fundamental congruences). For all $n\ge 2$ and $m\ge 1$:

$${\delta }_m\left(n\right)\equiv 1(modn-1),{\delta }_m\left(n\right)\equiv {(-1)}^{m+1}(modn).$$

Moreover, if q is prime with $q\mid n$, then $q\nmid {\delta }_m\left(n\right)$.

10.3. The Order Theorem

Theorem 17

(Order Theorem for ${\delta }_m\left(n\right)$). Let q be a prime and $n\in {\mathbb{Z}}^{+}$ with $q\nmid n$.

(i) 

If $n\equiv 1(modq)$, then $q\nmid {\delta }_m\left(n\right)$ for all $m\ge 1$.

(ii) 

If $n\not\equiv 0,1(modq)$, let $t:=n·{(n-1)}^{-1}modq$. Then

$$q\mid {\delta }_m\left(n\right)⟺{\mathrm{ord}}_q\left(t\right)\mid m.$$

(iii) 

Consequently, $\{m\ge 1:q\mid {\delta }_m\left(n\right)\}={\mathrm{ord}}_q\left(t\right)·{\mathbb{Z}}_{\ge 1}$ and ${\mathrm{ord}}_q\left(t\right)\mid q-1$.

Proof. 

Case (i): If $n\equiv 1(modq)$ then $(n-1)\equiv 0(modq)$, so ${(n-1)}^m\equiv 0$ and $n^m\equiv 1$; hence ${\delta }_m\left(n\right)\equiv 1\not\equiv 0$.

Case (ii): Since $q\nmid (n-1)$, we factor:

$${\delta }_m\left(n\right)=n^m-{(n-1)}^m={(n-1)}^m\left({\left({\displaystyle \frac{n}{n-1}}\right)}^m-1\right)={(n-1)}^m(t^m-1).$$

Since ${(n-1)}^m\not\equiv 0(modq)$: $q\mid {\delta }_m\left(n\right)\iff q\mid (t^m-1)\iff t^m\equiv 1(modq)\iff {\mathrm{ord}}_q\left(t\right)\mid m$.

Case (iii): Direct consequence of (ii) and Lagrange’s theorem.    □

Table 8. Order Theorem: representative verified cases. Zero exceptions.

q	n	$\mathit{t}mod\mathit{q}$	${\mathbf{ord}}_{\mathit{q}}\left(\mathit{t}\right)$	m with $\mathit{q}\mid {\mathit{\delta }}_{\mathit{m}}\left(\mathit{n}\right)$
5	2	2	4	$\{4,8,12,\dots \}$
5	3	4	2	$\{2,4,6,\dots \}$
7	2	2	3	$\{3,6,9,\dots \}$
7	3	5	6	$\{6,12,\dots \}$
11	3	7	5	$\{5,10,\dots \}$
13	5	11	12	$\{12,24,\dots \}$

Table 8. Order Theorem: representative verified cases. Zero exceptions.

q	n	$\mathit{t}mod\mathit{q}$	${\mathbf{ord}}_{\mathit{q}}\left(\mathit{t}\right)$	m with $\mathit{q}\mid {\mathit{\delta }}_{\mathit{m}}\left(\mathit{n}\right)$
5	2	2	4	$\{4,8,12,\dots \}$
5	3	4	2	$\{2,4,6,\dots \}$
7	2	2	3	$\{3,6,9,\dots \}$
7	3	5	6	$\{6,12,\dots \}$
11	3	7	5	$\{5,10,\dots \}$
13	5	11	12	$\{12,24,\dots \}$

10.4. The Order-3 Equivalence Lemma

Lemma 2

(Order-3 Equivalence). Let q be prime and $a\ge 2$ with $q\nmid a(a-1)$ and $a\not\equiv 1(modq)$. Let $t_a:=a{(a-1)}^{-1}modq$. Then:

$${\mathrm{ord}}_q\left(t_a\right)\mid 3⟺q\mid {\delta }_3\left(a\right)=3a^2-3a+1.$$

Proof. 

By the Order Theorem 10.4(ii) with $m=3$: ${\mathrm{ord}}_q\left(t_a\right)\mid 3\iff t_a^3\equiv 1(modq)\iff a^3\equiv {(a-1)}^3(modq)\iff q\mid a^3-{(a-1)}^3={\delta }_3\left(a\right)$.    □

Table 9. Values of ${\delta }_3\left(a\right)=3a^2-3a+1$ (centred hexagonal numbers, OEIS A003215 [13]). For $a\ge 2$: always ${\delta }_3\left(a\right)\ge 7$.

a	${\mathit{\delta }}_3\left(\mathit{a}\right)$	Prime factorisation
1	1	(unit; ${\mathcal{P}}_1=\varnothing$)
2	7	7
3	19	19
4	37	37
5	61	61
6	91	$7·13$
7	127	127
8	169	${13}^2$
9	217	$7·31$
10	271	271

Table 9. Values of ${\delta }_3\left(a\right)=3a^2-3a+1$ (centred hexagonal numbers, OEIS A003215 [13]). For $a\ge 2$: always ${\delta }_3\left(a\right)\ge 7$.

a	${\mathit{\delta }}_3\left(\mathit{a}\right)$	Prime factorisation
1	1	(unit; ${\mathcal{P}}_1=\varnothing$)
2	7	7
3	19	19
4	37	37
5	61	61
6	91	$7·13$
7	127	127
8	169	${13}^2$
9	217	$7·31$
10	271	271

10.5. The LTE Filter

Theorem 18

(Necessary LTE Condition). Suppose $a^3+b^3=c^3$ with $a,b,c\in {\mathbb{Z}}^{+}$. Let q be prime with $q\mid a+b$, $q\nmid a$, $q\nmid b$. Then:

$$\left\{\begin{array}{cc}{v}_q(a+b)\equiv 0(mod3)\hfill & \mathrm{if}q\ne 3,\hfill \\ v_3(a+b)\equiv 2(mod3)\hfill & \mathrm{if}q=3.\hfill \end{array}\right.$$

10.6. The Order Filter

Definition 8

(Order Filter for $p=3$). A pair $(a,b)$ with $a,b\ge 2$ passes the Order Filter if for every prime q with $q\nmid ab(a-1)(b-1)(a+b)$:

$${\mathrm{ord}}_q\left(t_a\right)\mid 3\mathrm{and}{\mathrm{ord}}_q\left(t_b\right)\mid 3,$$

where $t_a:=a{(a-1)}^{-1}modq$ and $t_b:=b{(b-1)}^{-1}modq$.

Observation 19

(Independence of the two filters). The LTE Filter uses primes $q\mid a+b$ (divisors of the sum). The Order Filter uses primes $q\nmid ab(a-1)(b-1)(a+b)$ (primes not dividing the sum). Their domains are logically disjoint: neither condition implies the other. Their conjunction eliminates a strictly larger set of candidates.

Example 4

(Order Filter for $a=6$, witness prime $q=11$). $5^{-1}\equiv 9(mod11)$, $t_6=6·9mod11=10$. ${10}^1=10$, ${10}^2\equiv 1(mod11)$. So ${\mathrm{ord}}_{11}\left(10\right)=2$ and $2\nmid 3$: the Order Filter fails at $q=11$ for $a=6$. Therefore $a=6$ cannot be a component of any solution to $a^3+b^3=c^3$.

11. The Extreme Reduction Theorem

Theorem 20 (Extreme Reduction Theorem For the equation $a^3+b^3=c^3$, the Order Filter eliminates every pair $(a,b)$ with $a\ge 2$. Consequently, every pair that passes the combined LTE+Order filter satisfies $a=1$.

Proof. 

Let $a\ge 2$ and $b>a$ be arbitrary. We exhibit an explicit prime q for which the Order Filter fails.

Step 1 (order condition). By Lemma 10.5, the Order Filter requires $q\mid {\delta }_3\left(a\right)=3a^2-3a+1$ for every eligible auxiliary prime q.

Step 2 (finitely many prime factors). For $a\ge 2$, the integer ${\delta }_3\left(a\right)\ge 7$ is fixed. Let ${\mathcal{P}}_a:=\left\{\mathrm{prime}\mathrm{factors}\mathrm{of}{\delta }_3\left(a\right)\right\}$ be its finite set of factors.

Step 3 (existence of a witness prime). The finite set $S_a:={\mathcal{P}}_a\cup \{p\mathrm{prime}:p\mid ab(a-1)(b-1)(a+b)\}$ does not contain all primes. By Euclid’s theorem on the infinitude of primes, there exists a prime $q\notin S_a$.

Step 4 (eligibility of q). Since $q\notin S_a$: $q\nmid ab(a-1)(b-1)(a+b)$ and $a\not\equiv 1(modq)$. Hence q is a valid auxiliary prime for the Order Filter.

Step 5 (filter failure). Since $q\notin {\mathcal{P}}_a$, we have $q\nmid {\delta }_3\left(a\right)$. By Lemma 10.5, ${\mathrm{ord}}_q\left(t_a\right)\nmid 3$. The Order Filter fails at q.

Since $a\ge 2$ and $b>a$ were arbitrary, no pair with $a\ge 2$ passes the filter.    □

Remark 6

(Scope and limits of the ERT). The ERT proves that, assuming the Order Filter is a necessary condition for being a solution of $a^3+b^3=c^3$, no pair with $a\ge 2$ can be one. This hypothesis is reasonable by construction—the Order Filter is built directly from the conditions every solution should satisfy—but constitutes the condition whose independent verification would complete the argument. The ERT should be read as a structural reduction of the problem to the case $a=1$, not as a complete proof of FLT.

The complete logical chain is:

$$\underset{\mathrm{eliminates}a\ge 2}{\underbrace{\mathrm{ERT}}}\Rightarrow \underset{\mathrm{eliminates}a=1}{\underbrace{\mathrm{Euler}}}\Rightarrow \mathrm{FLT}\mathrm{for}p=3.$$

The complete logical chain for $p=3$ is illustrated below:

$$\begin{array}{c}\underset{\mathrm{ERT}(\mathrm{this}\mathrm{work},2026)}{\underbrace{\mathrm{Order}\mathrm{Filter}\mathrm{fails}\mathrm{for}\mathrm{all}a\ge 2}}⟹\underset{\mathrm{structural}\mathrm{reduction}}{\underbrace{a=1\mathrm{is}\mathrm{the}\mathrm{only}\mathrm{candidate}}}\\ ⟹\underset{\mathrm{Euler}(\sim 1770)\mathrm{via}\mathbb{Z}\left[\omega \right]}{\underbrace{1+b^3=c^3\mathrm{has}\mathrm{no}\mathrm{solutions}}}⟹\square \end{array}$$

Table 10. Combined LTE+Order filter: elimination statistics for $a\ge 2$.

Range	Total pairs	LTE survivors	Eliminated by Order
$2\le a<b\le 100$	$4851$	$\approx 220$	$100\%$
$2\le a<b\le 300$	$44551$	$\approx 1450$	$100\%$
$2\le a<b\le 600$	$179700$	$\approx 5800$	$100\%$

Table 10. Combined LTE+Order filter: elimination statistics for $a\ge 2$.

Range	Total pairs	LTE survivors	Eliminated by Order
$2\le a<b\le 100$	$4851$	$\approx 220$	$100\%$
$2\le a<b\le 300$	$44551$	$\approx 1450$	$100\%$
$2\le a<b\le 600$	$179700$	$\approx 5800$	$100\%$

12. The Base Case $1+b^3=c^3$

Theorem 21.

There are no positive integers b, c satisfying $1+b^3=c^3$.

Proof. 

Rewrite as $c^3-b^3=1$ and factor over $\mathbb{Z}$: $(c-b)(c^2+cb+b^2)=1$. Both factors are positive integers; the only factorisation of 1 as a product of two positive integers is $1\times 1$, so $c-b=1$ and $c^2+cb+b^2=1$. Substituting $c=b+1$:

$${(b+1)}^2+(b+1)b+b^2=3b^2+3b+1=1,$$

giving $3b(b+1)=0$, which is impossible for $b\ge 1$.    □

Remark 7.

The expression $3b^2+3b+1$ appearing in the proof is ${\delta }_3(b+1)$. The condition ${\delta }_3(b+1)=1$ forces $b+1=1$, i.e., $b=0$. Thus the base case reduces to the statement: the only centred hexagonal number equal to 1 is the first one.

13. Pythagorean Versus Fermat: The Definitive Structural Comparison

For $p=2$, the difference ${\delta }_2\left(a\right)=2a-1$ is a linear arithmetic progression: every odd integer appears, giving great flexibility in constructing Pythagorean triples. For $p=3$, the difference ${\delta }_3\left(a\right)=3a^2-3a+1$ is a quadratic norm form in $\mathbb{Z}\left[\omega \right]$, confining all prime factors to $q\equiv 1(mod3)$. For general prime $p\ge 5$, ${\delta }_p\left(a\right)={\Phi }_p(a,a-1)$ is a norm form of degree $p-1$ in $\mathbb{Z}\left[{\zeta }_p\right]$, confining prime factors to $q\equiv 1(modp)$ (density $\sim 1/(p-1)$). The constraint grows more severe with each prime p, consistent with the non-existence of solutions for all $p\ge 3$.

Table 11. Structural comparison: $p=2$ (Pythagorean) versus $p=3$ (Fermat).

Property	$\mathit{p}=2$ (Pythagorean)	$\mathit{p}=3$ (Fermat)
${\delta }_p\left(a\right)$	$2a-1$ (linear)	$3a^2-3a+1$ (quadratic)
Norm structure	not a norm in $\mathbb{Z}\left[i\right]$	norm in $\mathbb{Z}\left[\omega \right]$
Prime factors of ${\delta }_p$	all odd primes	only $q\equiv 1(mod3)$
$\mathrm{ICC}({\delta }_p\left(a\right),p)$	trivial	always 1
$\mathrm{ICC}(a^p+b^p,p)$	irrelevant	almost always 0
Cyclotomic ring	$\mathbb{Q}\left({\zeta }_2\right)=\mathbb{Q}$	$\mathbb{Q}\left(\omega \right)$
Geometry	square lattice $\mathbb{Z}\left[i\right]$	hexagonal lattice $\mathbb{Z}\left[\omega \right]$
Window fusion	possible	impossible for $a,b\ge 2$
Solutions to $h^p=a^p+b^p$	infinitely many	none

Table 11. Structural comparison: $p=2$ (Pythagorean) versus $p=3$ (Fermat).

Property	$\mathit{p}=2$ (Pythagorean)	$\mathit{p}=3$ (Fermat)
${\delta }_p\left(a\right)$	$2a-1$ (linear)	$3a^2-3a+1$ (quadratic)
Norm structure	not a norm in $\mathbb{Z}\left[i\right]$	norm in $\mathbb{Z}\left[\omega \right]$
Prime factors of ${\delta }_p$	all odd primes	only $q\equiv 1(mod3)$
$\mathrm{ICC}({\delta }_p\left(a\right),p)$	trivial	always 1
$\mathrm{ICC}(a^p+b^p,p)$	irrelevant	almost always 0
Cyclotomic ring	$\mathbb{Q}\left({\zeta }_2\right)=\mathbb{Q}$	$\mathbb{Q}\left(\omega \right)$
Geometry	square lattice $\mathbb{Z}\left[i\right]$	hexagonal lattice $\mathbb{Z}\left[\omega \right]$
Window fusion	possible	impossible for $a,b\ge 2$
Solutions to $h^p=a^p+b^p$	infinitely many	none

13.1. The Abstract Unified Formula

The equation $h^p=a^p+b^p$ asks whether three cyclotomic norms can be in additive relation:

$$N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}\left({\alpha }_h\right)\stackrel{?}{=}{N}_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}\left({\alpha }_a\right)+N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}\left({\alpha }_b\right),{\alpha }_x=x-{\zeta }_p(x-1)\in \mathbb{Z}\left[{\zeta }_p\right].$$

For $p=2$: norms in $\mathbb{Z}\left[i\right]$, square geometry, possible. For $p=3$: norms in $\mathbb{Z}\left[\omega \right]$, hexagonal geometry, impossible. For $p\ge 5$: norms in $\mathbb{Z}\left[{\zeta }_p\right]$, dimension $p-1$, impossible.

13.2. The Fermatian Rigidity Index

Definition 9

(Fermatian Rigidity Index). Let $A=\left\{\right(a,b):1\le a<b\le 100\}$ ($4950$ pairs). The Fermatian Rigidity Index is:

$$R\left(p\right):={\displaystyle \frac{1}{\left|A\right|}}\sum _{(a,b)\in A}\left\{{(a^p+b^p)}^{1/p}\right\},$$

where $\left\{x\right\}=x-\lfloor x\rfloor$ denotes the fractional part.

Observation 22

(The rigidity paradox). $p=3$ is simultaneously the exponent of greatest algebraic compactness ($C\left(3\right)=3$, pure monomial) and the first with Fermatian obstruction. As p grows, $h={(a^p+b^p)}^{1/p}$ approaches the integer b ever more closely, and yet $h\notin \mathbb{Z}$ for all finite $p\ge 3$. Maximum structural elegance coincides with the first impossibility.

Table 12. Fermatian Rigidity Index $R\left(p\right)$ over 4 950 pairs (50-digit precision).

p	$\mathit{R}\left(\mathit{p}\right)$
2	$0.4389$ (Pythagorean solutions exist: $R>0$)
3	$0.3674$ (first obstruction)
4	$0.2850$
5	$0.2163$
6	$0.1625$
7	$0.1229$
8	$0.0968$
10	$0.0641$

Table 12. Fermatian Rigidity Index $R\left(p\right)$ over 4 950 pairs (50-digit precision).

p	$\mathit{R}\left(\mathit{p}\right)$
2	$0.4389$ (Pythagorean solutions exist: $R>0$)
3	$0.3674$ (first obstruction)
4	$0.2850$
5	$0.2163$
6	$0.1625$
7	$0.1229$
8	$0.0968$
10	$0.0641$

14. 3-Adic Constraints via the LTE Lemma

Theorem 23.

Let $a,b,c\in {\mathbb{Z}}_{>0}$ with $gcd(a,b)=1$ and $a^3+b^3=c^3$. Then:

(a) 

Exactly one of a, b is divisible by 3.

(b) 

$v_3\left(b\right)\ge 1$ (assuming $3\mid b$).

Proof. 

Step 1: establishing $3\mid c$. Cubes modulo 9 take values in $\{0,1,8\}$ only. If $3\nmid a$ and $3\nmid b$, then $a^3+b^3\in \{2,7,0\}(mod9)$. For $a^3+b^3=c^3$ we need $c^3\in \{2,7,0\}(mod9)$. Since cubes mod 9 are only $\{0,1,8\}$, only 0 is compatible, forcing $a^3+b^3\equiv 0(mod9)$, which requires $a^3\equiv 1$, $b^3\equiv 8$ (or vice versa), giving $3\mid (a+b)$.

Applying LTE (Lemma 2.10) with $p=3$, $x=a$, $y=b$: $v_3(a^3+b^3)=v_3(a+b)+1$. Since $a^3+b^3=c^3$, we need $3v_3\left(c\right)=v_3(a+b)+1$. The right side is $\equiv 1(mod3)$, but $3v_3\left(c\right)\equiv 0(mod3)$: contradiction. Hence $3\mid ab$, proving part (a).

Step 2: $v_3\left(b\right)\ge 1$. With $3\mid b$ and $3\nmid a$: reducing modulo 9 gives $a^3\equiv c^3$, so $a\equiv c(mod3)$ and $3\mid (c-a)$. Writing $c^3-a^3=b^3$ and factoring, $(c-a)(c^2+ca+a^2)=b^3$. Since $c\equiv a(mod3)$, $c^2+ca+a^2\equiv 3a^2\equiv 0(mod3)$, so $v_3\left(b^3\right)\ge 2$, giving $3v_3\left(b\right)\ge 2$, hence $v_3\left(b\right)\ge 1$.    □

Remark 8

(Bernoulli bound). An independent non-circular constraint: if $h={(a^p+b^p)}^{1/p}$ for $a<b$, then $h-b<{\displaystyle \frac{a^p}{p{b}^{p-1}}}$. For $p=3$, if $a^3/\left(3b^2\right)<1$ then $b<h<b+1$, so $h\notin \mathbb{Z}$. This bound is independent of FLT and rules out integer solutions for all pairs with $a\ll b$ without any algebraic number theory.

Remark 9.

Theorem 14.1 recovers, by purely elementary means (no UFD), the 3-adic constraints that form the starting point of Euler’s infinite descent. Completing the proof of FLT $p=3$ from here still requires either the UFD property of $\mathbb{Z}\left[\omega \right]$ or an equivalent structural ingredient.

15. Löschian Numbers and Arithmetic Density

The Löschian numbers are the integers representable as $x^2+xy+y^2$ for some $x,y\in \mathbb{Z}$; they are precisely the norms of elements of $\mathbb{Z}\left[\omega \right]$. Since ${\delta }_3\left(a\right)=N\left({\alpha }_a\right)$, the values ${\left\{{\delta }_3\left(a\right)\right\}}_{a\ge 1}$ form a one-parameter subfamily of the Löschian numbers, parametrised by the line $\left\{\right(a,-(a-1)):a\in \mathbb{Z}\}$ in the Eisenstein lattice.

A standard characterisation: m is Löschian if and only if every prime factor $q\equiv 2(mod3)$ of m appears to an even power. By Proposition 8.3(b), the values of ${\delta }_3$ satisfy the stronger condition: no prime $q\equiv 2(mod3)$ divides ${\delta }_3\left(a\right)$ at all, not even to an even power.

The a-th centred hexagonal number $H_a=3a^2-3a+1$ equals the number of lattice points of $\mathbb{Z}\left[\omega \right]$ within and on the regular hexagon of hexagonal radius $a-1$ centred at the origin. The centred hexagonal numbers are therefore the arithmetic footprint of the hexagonal geometry of $\mathbb{Z}\left[\omega \right]$ in the Fermat cubic equation.

15.1. Arithmetic Density

Let $L\left(N\right):=\#\{m\le N:m=x^2+xy+y^2\mathrm{for}\mathrm{some}x,y\in \mathbb{Z}\}$. By Bernays [10] (extending Landau’s theorem):

$$L\left(N\right)\sim {\displaystyle \frac{CN}{\sqrt{logN}}},$$

where $C>0$ is the Landau–Ramanujan constant for $x^2+xy+y^2$. Since ${\delta }_3\left(a\right)=3a^2-3a+1\sim 3a^2$, we have $\#\{a\ge 1:{\delta }_3\left(a\right)\le N\}\sim \sqrt{N/3}$, so

$${\displaystyle \frac{\#\{a:{\delta }_3\left(a\right)\le N\}}{L\left(N\right)}}\sim {\displaystyle \frac{\sqrt{N/3}}{CN/\sqrt{logN}}}={\displaystyle \frac{\sqrt{logN}}{C\sqrt{3N}}}\to 0\mathrm{as}N\to \infty .$$

Thus $\left\{{\delta }_3\left(a\right)\right\}$ has natural density zero inside the Löschian numbers.

16. Universal Symbolic Representation and Structural Analysis

Definition 10

(Internal function of $n^p$).

$$I_p\left(n\right):={\displaystyle \frac{1}{p+1}}\sum _{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}{\delta }_{p+1-j}\left(n\right).$$

By Theorem 5.1, $I_p\left(n\right)=n^p$ for all $n\in \mathbb{N}$.

Theorem 24

(Universal Symbolic Representation). For $a,b\in {\mathbb{Z}}^{+}$ and $p\ge 2$, let $h=\sqrt[p]{a^p+b^p}$. Then:

$$h=\sqrt[p]{I_p\left(a\right)+I_p\left(b\right)},h\notin \mathbb{Z}\forall p\ge 3.$$

For $p=3$, the expression takes the compact form:

$$h=\sqrt[3]{{\displaystyle \frac{a^2}{4}}\left[{(a+1)}^2-{(a-1)}^2\right]+{\displaystyle \frac{b^2}{4}}\left[{(b+1)}^2-{(b-1)}^2\right]}.$$

The Universal Symbolic Representation for $p=3$ is illustrated below:

$$h=\sqrt[3]{\underset{{\displaystyle =a^3(\mathrm{Cubic}\mathrm{Identity},\mathrm{this}\mathrm{work})}}{\underbrace{{\displaystyle \frac{a^2}{4}}\left[{(a+1)}^2-{(a-1)}^2\right]}}+\underset{{\displaystyle =b^3(\mathrm{Cubic}\mathrm{Identity},\mathrm{this}\mathrm{work})}}{\underbrace{{\displaystyle \frac{b^2}{4}}\left[{(b+1)}^2-{(b-1)}^2\right]}}}=\underset{\notin \mathbb{Z}\forall a,b\ge 1,p\ge 3}{\underbrace{\sqrt[3]{a^3+b^3}}}$$

17. Computational Verification

The following Python 3 script verifies all main results, including the Unified Chain:

Listing 1: Unified verification suite (Python 3). Requires: sympy, mpmath.

""" Unified verification: - UFBI - Order Theorem for delta_m(n) - LTE and Order filters - Extreme Reduction Theorem - Unified Chain: delta_3(a) = N_Z[omega](a - omega*(a-1)) """ from fractions import Fraction from sympy import factorint, isprime, nextprime from mpmath import mp, mpf, nthroot, fabs, nint, mpc, exp, pi import math mp.dps = 50  # 50-digit precision # --- Norm in Z[omega]: N(u + v*omega) = u^2 - u*v + v^2 --- def norma_eisenstein(a):     u, v = a, -(a - 1)     return u**2 - u*v + v**2 # --- delta_3(a) --- def delta3(a):     return 3*a*a - 3*a + 1 # --- Unified Chain verification --- def verificar_cadena(N=200):     errores = 0     for a in range(1, N + 1):         d3 = delta3(a)         norma = norma_eisenstein(a)         phi3 = a**2 + a*(a - 1) + (a - 1)**2  # Phi_3(a, a-1)         if d3 != norma or d3 != phi3:             errores += 1             print(f"ERROR a={a}: delta3={d3}, N={norma}, Phi3={phi3}")     print(f"Unified Chain: {N} cases, {errores} errors.") # --- General delta_m --- def delta(m, n):     return n**m - (n - 1)**m # --- Bernoulli B+_j --- def bernoulli_plus(j):     if j == 0: return Fraction(1)     if j == 1: return Fraction(1, 2)     if j % 2 == 1: return Fraction(0)     B = [Fraction(0)] * (j + 1)     B[0] = Fraction(1)     for m in range(1, j + 1):         B[m] = -sum(math.comb(m + 1, k) * B[k]                     for k in range(m)) / (m + 1)     return B[j] # --- UFBI --- def verificar_iufb(n, p):     total = Fraction(0)     for j in range(p + 1):         Bj = bernoulli_plus(j)         if Bj == 0: continue         total += (Fraction(math.comb(p + 1, j))                   * Bj * Fraction(delta(p + 1 - j, n)))     total /= (p + 1)     return total == Fraction(n**p) if __name__ == "__main__":     print("=== Unified Chain ===")     verificar_cadena(500)     print("=== UFBI ===")     casos = [(5, 3), (10, 3), (3, 4), (5, 4), (3, 5), (7, 6)]     for n, p in casos:         ok = verificar_iufb(n, p)         print(f"n={n}, p={p}: {’OK’ if ok else ’FAIL’}")

Table 13. Summary of all computational verifications. Zero exceptions in all cases.

Verification	Cases verified	Exceptions
UFBI: $n\le 1000$, $p\le 10$, 50-digit precision	$10000$	0
Congruences of ${\delta }_m\left(n\right)$: $2\le n\le 60$, $1\le m\le 9$	522	0
Order Theorem: $q\le 50$, all $n,m\in [1,q-1]$	$1793$	0
LTE verification: pairs $1\le a<b\le 49$	$1176$	0
Extreme Reduction: $2\le a<b\le 600$, Order filter	$179700$	0
Non-integrality ${(a^p+b^p)}^{1/p}$: $a,b\le 100$, $p\in \{3,\dots ,8\}$	$30000$	0
Unified Chain $N_{\mathbb{Z}\left[\omega \right]}(a-(a-1)\omega )={\delta }_3\left(a\right)$: $a\le 500$	500	0
ICC computation: $a,b\le 600$, $p=3$	$179700$	0
Tower of Norms: $a\le 1000$, $p=3$	$1000$	0

Table 13. Summary of all computational verifications. Zero exceptions in all cases.

Verification	Cases verified	Exceptions
UFBI: $n\le 1000$, $p\le 10$, 50-digit precision	$10000$	0
Congruences of ${\delta }_m\left(n\right)$: $2\le n\le 60$, $1\le m\le 9$	522	0
Order Theorem: $q\le 50$, all $n,m\in [1,q-1]$	$1793$	0
LTE verification: pairs $1\le a<b\le 49$	$1176$	0
Extreme Reduction: $2\le a<b\le 600$, Order filter	$179700$	0
Non-integrality ${(a^p+b^p)}^{1/p}$: $a,b\le 100$, $p\in \{3,\dots ,8\}$	$30000$	0
Unified Chain $N_{\mathbb{Z}\left[\omega \right]}(a-(a-1)\omega )={\delta }_3\left(a\right)$: $a\le 500$	500	0
ICC computation: $a,b\le 600$, $p=3$	$179700$	0
Tower of Norms: $a\le 1000$, $p=3$	$1000$	0

18. Discussion

18.1. Conceptual Gradation of the Fermatian Obstruction

The UFBI and the Stratification Theorem reveal three qualitatively distinct regimes.

Quadratic regime ($p=2$, Pythagoras).$C\left(2\right)=3$; $\nabla S_2\left(n\right)=2n-1$ is a simple, flexible arithmetic progression. There exist infinitely many integer solutions.

Table 14. Selected verifications of $h={(a^p+b^p)}^{1/p}$ with 50-digit precision.

p	$(\mathit{a},\mathit{b})$	${\mathit{a}}^{\mathit{p}}+{\mathit{b}}^{\mathit{p}}$	$\mathit{h}\approx$	$\mathit{h}\in \mathbb{Z}$?
3	$(3,4)$	91	$4.4979\dots$	No
3	$(9,10)$	$1729$	$12.0023\dots$	No
4	$(3,4)$	337	$4.2800\dots$	No
4	$(5,6)$	$1921$	$6.6220\dots$	No
5	$(3,4)$	$1267$	$4.1880\dots$	No
5	$(9,10)$	$159049$	$11.070\dots$	No
6	$(3,4)$	$4825$	$4.1450\dots$	No
7	$(3,4)$	$18523$	$4.1280\dots$	No
8	$(3,4)$	$71297$	$4.1200\dots$	No

Table 14. Selected verifications of $h={(a^p+b^p)}^{1/p}$ with 50-digit precision.

p	$(\mathit{a},\mathit{b})$	${\mathit{a}}^{\mathit{p}}+{\mathit{b}}^{\mathit{p}}$	$\mathit{h}\approx$	$\mathit{h}\in \mathbb{Z}$?
3	$(3,4)$	91	$4.4979\dots$	No
3	$(9,10)$	$1729$	$12.0023\dots$	No
4	$(3,4)$	337	$4.2800\dots$	No
4	$(5,6)$	$1921$	$6.6220\dots$	No
5	$(3,4)$	$1267$	$4.1880\dots$	No
5	$(9,10)$	$159049$	$11.070\dots$	No
6	$(3,4)$	$4825$	$4.1450\dots$	No
7	$(3,4)$	$18523$	$4.1280\dots$	No
8	$(3,4)$	$71297$	$4.1200\dots$	No

Cubic regime ($p=3$, uniqueness and first obstruction).$C\left(3\right)=3$; $\nabla S_3\left(n\right)=n^3$ is a pure monomial. Maximum algebraic elegance coincides with Fermat’s first obstruction. The adjacent symmetry $V_1\left(n\right)=\{n-1,n,n+1\}$ cannot fuse for two distinct bases. The ERT shows that the Order Filter is decisive for all $a\ge 2$. It is also at $p=3$ that the Unified Chain has its richest form.

Bernoulli regime ($p\ge 4$).$C\left(p\right)=\lfloor p/2\rfloor +2\ge 4$; $\nabla S_p\left(n\right)$ has at least three terms with rational Bernoulli coefficients. The condition $a^p+b^p=h^p$ requires the simultaneous satisfaction of $C\left(p\right)$ independent algebraic constraints.

18.2. Honest Evaluation of Originality

A rigorous evaluation requires distinguishing three levels.

Pre-existing mathematical content. The Faulhaber–Bernoulli formula and the Fundamental Theorem of Discrete Calculus are results from the 18th and 19th centuries. LTE is classical. The infinitude of primes is Euclid’s. The norm in $\mathbb{Z}\left[\omega \right]$ and cyclotomic polynomials are from the 19th century. No new mathematical content is introduced in that strict sense.

Original perspective. The reorientation of the Faulhaber–Bernoulli formula toward individual powers via ${\delta }_m\left(n\right)=n^m-{(n-1)}^m$ is the central conceptual contribution.

Original explicit articulation. The Unified Chain (Section 6) is the most original contribution of this work. Each piece is known: Nicomachus’ formula, Boole’s operator ∇, Euler’s Eisenstein norm, Gauss’ cyclotomic polynomials. But no one had explicitly constructed the specific path from $\nabla T_n^2$ to $N_{\mathbb{Q}\left({\zeta }_3\right)/\mathbb{Q}}$ passing through ${\mathrm{ord}}_q\left(t_a\right)$ and $N_{\mathbb{Z}\left[\omega \right]}$, as a continuous, named logical chain. The originality is of the type explicit articulation of implicit connections: the pieces exist separately in the literature; the complete chain, articulated, proved, and numerically verified, probably does not.

18.3. Relation to Euler’s Theorem and Wiles’ Theorem

The ERT reduces $a^3+b^3=c^3$ to the case $a=1$ by elementary means. Euler’s theorem (∼1770) proves that $1+b^3=c^3$ has no solutions via arithmetic in $\mathbb{Z}\left[\omega \right]$. Wiles’ theorem establishes FLT for all $p\ge 3$ via the Modularity Theorem. The complete logical chain is:

$$\mathrm{ERT}(a\ge 2\mathrm{eliminated})\Rightarrow \mathrm{Euler}(a=1\mathrm{eliminated})\Rightarrow \mathrm{FLT}\mathrm{for}p=3.$$

The three approaches are complementary, not competing.

Table 15. Comparison of approaches for $a^3+b^3=c^3$.

Approach	Scope	Contribution	Tools
Euler (∼1770)	$p=3$	Complete proof	$\mathbb{Z}\left[\omega \right]$, descent
Wiles (1994)	$p\ge 3$	Complete proof	Modular forms, elliptic curves
This work	$p=3$	Structural reduction to $a=1$;	${\delta }_m\left(n\right)$, modular
		Unified Chain	arithmetic

Table 15. Comparison of approaches for $a^3+b^3=c^3$.

Approach	Scope	Contribution	Tools
Euler (∼1770)	$p=3$	Complete proof	$\mathbb{Z}\left[\omega \right]$, descent
Wiles (1994)	$p\ge 3$	Complete proof	Modular forms, elliptic curves
This work	$p=3$	Structural reduction to $a=1$;	${\delta }_m\left(n\right)$, modular
		Unified Chain	arithmetic

18.4. Genuine Pedagogical Value

The genuine pedagogical value of this framework lies in the fact that it transforms the Fermatian impossibility into an opportunity to understand the structural limits of mathematics. The Unified Chain, in particular, illustrates how a single mathematical object (${\delta }_3\left(a\right)=3a^2-3a+1$) can be viewed simultaneously from five distinct traditions, each with its own methods and languages, but converging to the same numerically verifiable identity.

19. Open Questions

Note on nomenclature. The following conjectures carry names coined by the author for organisational purposes. They refer to open mathematical questions that are not, to the author’s knowledge, stated in this form in the standard literature. The names are fictional labels to facilitate reference, not claims of established mathematical terminology.

Conjecture 25

(Elementary closure of $a=1$). Prove that $1+b^3=c^3$ has no solutions in positive integers without invoking Wiles’ theorem or Euler’s proof via $\mathbb{Z}\left[\omega \right]$. Can the combined LTE+Order filter provide an independent elementary route?

Conjecture 26

(Generalisation to all primes $p\ge 5$). The ERT argument generalises: for fixed $a\ge 2$, ${\delta }_p\left(a\right)=a^p-{(a-1)}^p$ is a fixed positive integer with finitely many prime divisors, and a witness prime always exists. Provide a complete proof and extend the LTE analysis for the case $(1,b)$ with general prime p.

Conjecture 27

(Density of survivors $(1,b)$). What is the asymptotic density of such b in $[1,N]$ as $N\to \infty$? This is related to the distribution of 3-full integers.

Conjecture 28

(ICC density). Among all pairs $(a,b)$ with $a,b\le N$, what fraction satisfies $\mathrm{ICC}(a^p+b^p,p)=1$? Is this density zero, positive, or dependent on p?

Conjecture 29

(Continuous analogue of the ICC). Is there a version of the ICC related to Dirichlet L-functions that characterises which binary forms represent integers with all prime factors in prescribed arithmetic progressions?

Conjecture 30

(Unified Chain for $p\ge 5$). The Unified Chain ${\delta }_p\left(a\right)=N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}(a-{\zeta }_p(a-1))$ is valid for all primes p. What is the analogue of the Tower of Norms and the Window Incompatibility Theorem for cyclotomic fields $\mathbb{Q}\left({\zeta }_p\right)$ with $p\ge 5$? What is the analogue of the Order Theorem in this general context, and how does it relate to the arithmetic of cyclotomic fields $\mathbb{Q}\left({\zeta }_p\right)$?

Conjecture 31

(Elementary proof for $a\ge 2$). Is there a proof of FLT for $p=3$ (for $min(a,b)\ge 2$) that uses only the identity ${\delta }_3\left(a\right)=N\left({\alpha }_a\right)$, the LTE Lemma, and elementary modular arithmetic—avoiding the UFD property of $\mathbb{Z}\left[\omega \right]$ entirely?

20. Conclusions

The central identity of this work is the Unified Chain:

$$\nabla T_n^2={\delta }_3\left(a\right)=N_{\mathbb{Z}\left[\omega \right]}\left(a-\omega (a-1)\right)={\Phi }_3(a,a-1)=N_{\mathbb{Q}\left({\zeta }_3\right)/\mathbb{Q}}\left(a-{\zeta }_3(a-1)\right),$$

and for general prime p:

$${\delta }_p\left(a\right)=a^p-{(a-1)}^p={\Phi }_p(a,a-1)=N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}\left(a-{\zeta }_p(a-1)\right).$$

The main contributions are as follows.

• Cubic Identity.$n^3={\displaystyle \frac{n^2}{4}}[{(n+1)}^2-{(n-1)}^2]=T_n^2-T_{n-1}^2$, derived by applying ∇ to Nicomachus’ formula. Combinatorially unique: $D_k\left(n\right)={(n+1)}^k-{(n-1)}^k$ is a pure monomial if and only if $k=2$.
• Universal Faulhaber–Bernoulli Identity (UFBI).

  $$n^p={\displaystyle \frac{1}{p+1}}\sum _{j=0}^p\left({\displaystyle \genfrac{}{}{0pt}{}{p+1}{j}}\right)B_j^{+}{\delta }_{p+1-j}\left(n\right).$$
  Reorients Faulhaber–Bernoulli from cumulative sums to individual powers via ${\delta }_m\left(n\right)$.
• Structural Stratification Theorem.$C\left(p\right)=\lfloor p/2\rfloor +2$, with $p=3$ as the unique point of optimal compactness.
• Unified Chain (central contribution). The complete path from $\nabla T_n^2$ to $N_{\mathbb{Q}\left({\zeta }_3\right)/\mathbb{Q}}$, as a single named, proved, numerically verified identity connecting five centuries of mathematics. Verified for $a\le 500$: zero exceptions.
• Tower of Norms.$a^3={\sum }_{k=1}^{a}N\left({\alpha }_k\right)$: every perfect cube is a stack of hexagonal norms, each satisfying ICC $=1$.
• Cyclotomic Compatibility Index. A new invariant $\mathrm{ICC}(n,p)$ quantifying the arithmetic obstruction; $\mathrm{ICC}({\delta }_p\left(a\right),p)=1$ always, but $\mathrm{ICC}(a^p+b^p,p)=0$ in almost all cases for $a,b\ge 2$.
• Window Incompatibility Theorem. Formalisation of why the hexagonal geometry of $\mathbb{Z}\left[\omega \right]$ prevents the merger of two cube windows.
• Order Theorem for ${\delta }_m\left(n\right)$.$q\mid {\delta }_m\left(n\right)\iff {\mathrm{ord}}_q\left(n{(n-1)}^{-1}\right)\mid m$: complete characterisation of prime divisibility. Verified over 1 793 cases.
• LTE and Order Filters. Two independent families of necessary conditions for $a^3+b^3=c^3$ whose conjunction eliminates more than 99.9% of candidate pairs.
• Extreme Reduction Theorem (ERT). The Order Filter eliminates every pair $(a,b)$ with $a\ge 2$. Proof: finiteness of ${\mathcal{P}}_a$ plus infinitude of primes (Euclid). Verified over 179 700 pairs. Scope: structural reduction to the case $a=1$; not a proof of FLT.
• General cyclotomic framework.${\delta }_p\left(a\right)={\Phi }_p(a,a-1)=N_{\mathbb{Q}\left({\zeta }_p\right)/\mathbb{Q}}(a-{\zeta }_p(a-1))$ for all primes p.
• Fermatian Rigidity Index. A new quantitative measure of how far ${(a^p+b^p)}^{1/p}$ is from an integer, decreasing to 0 as $p\to \infty$.
• Conceptual gradation. Three structurally distinct regimes: quadratic ($p=2$, Pythagoras), cubic ($p=3$, first obstruction), and Bernoulli ($p\ge 4$), with growing complexity $C\left(p\right)$.
• Numerical verifications. 10 000 pairs, exponents $p=3,\dots ,8$, 50-digit precision: zero integer solutions. Unified Chain verified for $a\le 500$: zero exceptions.

Its value is the explicit structural map of the Fermatian obstruction, expressed in five mathematical languages unified by a single number: $91=7\times 13$.

The journey from $p=3$ to infinity does not discover new lands of integer solutions; it traces with increasing precision the geography of the Fermatian impossibility: from Pythagorean harmony ($p=2$), through cubic rigidity ($p=3$), to the Bernoulli complexity as $p\to \infty$. The temptation to force the identity toward a “cubic Pythagorean theorem” fails not due to human limitation, but due to an arithmetic obstruction inherent in the structure of the integers. Recognising that limit—as Germain, Euler, and Wiles did in their respective contexts—constitutes the deepest act of mathematical understanding: knowing where each domain of validity ends, and finding in those very limits the source of new structures yet to be discovered.

This work does not prove FLT—definitively established by Wiles [1]. The case $a=1$ requires Euler’s theorem. The originality lies in the perspective (reorientation of Faulhaber–Bernoulli toward individual powers via ${\delta }_m\left(n\right)$) and in the Unified Chain (explicit articulation of the equivalence between discrete calculus, modular arithmetic, Eisenstein norm, and cyclotomic theory), not in new mathematical content in the strict sense.