Musings of a fool about Fermat's Last Theorem (FLT)

Following Jared Sumner/Claude's work on Riemann (circa Sept 2026), I want to investigate approaches for a less technically complex solution to FLT. Of course this is a pipe-dream, but I seem to know more about mathematics than Sumner, whose only prompts were to tell Claude to believe in itself. Jared's comment to the community following this was, don't just use AI to do things you can already do, be audacious. To that end, this document tracks progress (if any).

All school children know that pythagoras is about 'triangles'. The intuition is that triangles don't exist in 'higher dimensions'. Or 'triangles and squares are different', or lengths are not area's etc.

It turns out that intuition can be rigorously proven in many different ways (see below). But a proof of FLT this does not constitute.

And yet, there may still be an 'off chance' that a simple algebraic equation might have solutions anyway. Though.. Wiles has shown that in the case of this equation (x²+y²=z²), that isn't true. There are no other mechanisms than 'chance' which could produce solutions for n>2 That is, between Wiles and proving that n=2 has mechanisms that n>2 does not have we know that the reason FLT is true, is because of geometry.

I then conjectured that this is true for any diophantine equation.. it works because of 'underlying' geometry. Or if you like, algebraically it works because there are no 'cross terms' in the equation. Or.. back to geometry.. The right angle of the triangle 'removes' a cross term from the equation.

Claude then introduced me to Elkies solution to a⁴+b⁴+c⁴=d⁴ (2682440⁴ + 15365639⁴ + 18796760⁴ = 20615673⁴) which somewhat burst my bubble, until I learned that Euler himself had had the same intuition. However it turns out that the 'elliptic curve' described by this equation has some properties that do something analageous to the removal of 'troublesome' cross terms.

The question for next time is.. Are all algebraic equations with real (non-complex) solutions underpinned by some unknown geometry? This is one one of the things that Langlands is about.

The following is the output of a 2 day session with Claude Opus 4.6 We started with an intuition that xⁿ + yⁿ = zⁿ when n=2 encodes some underlying geometric truth which does not exist when n=3. We proved this to be essentially true in many different ways (formally)

The core intuition

FLT is not merely an algebraic statement that happens to have geometric consequences. It IS a geometric statement. The equation xⁿ + yⁿ = zⁿ is inherently about n-dimensional measures (lengths for n=1, areas for n=2, volumes for n=3, etc.), and the rules governing these measures are different for each dimension.

The task is not to show that "integers need geometric permission" in general — most Diophantine equations have nothing to do with geometry. The task is to show that THIS equation, specifically, is geometric in nature, and therefore the geometric constraints of the relevant dimension apply directly.

If xⁿ + yⁿ = zⁿ is a geometric statement, then: - For n=2 it is a statement about areas, governed by the rules of 2D geometry - For n≥3 it would be a statement about volumes (or higher), governed by different rules - The rules that make n=2 work (orthogonality, cross-term cancellation, dissection) provably do not hold for n≥3 (Dehn, Hurwitz, Jordan–von Neumann, Huang et al.) - Therefore no solutions for n≥3 — not because "there's no reason" but because the geometric rules actively forbid it

Can numbers just happen to satisfy an equation?

This is the central question explored in this document. The answer, for the specific equation xⁿ + yⁿ = zⁿ, appears to be NO — because the equation is fundamentally about the geometry of right-angled triangles, which are 2D objects, and the right angle is what makes it work (by eliminating the cross term in the law of cosines). For n ≥ 3, no analogous geometric configuration exists.

However, this geometric intuition has limits — or so it seemed. Euler conjectured (1769) that the natural generalisation — needing n terms of n-th powers to equal an n-th power — was also true. That is, a⁴+b⁴+c⁴ = d⁴ should have no solutions (you'd need four fourth powers, not three). Euler was wrong. In 1986, Noam Elkies found:

2682440⁴ + 15365639⁴ + 18796760⁴ = 20615673⁴

Three fourth powers CAN equal a fourth power. But — and this is the crucial twist — Elkies' solution is NOT a coincidence. It is geometry.

Elkies found an elliptic curve (a genus-1 curve with rational points) sitting INSIDE the K3 surface defined by x⁴+y⁴+z⁴=w⁴. That elliptic curve has infinitely many rational points, each giving a solution. The mechanism is geometric.

The extra variable (three terms instead of two) promotes the equation from a CURVE to a SURFACE. Surfaces can contain curves. Curves of genus 0 or 1 can have rational points. So the surface can have solutions even though the Fermat CURVE cannot.

This CONFIRMS the geometric thesis rather than breaking it:

Solutions exist when and only when there is underlying geometry. The cross terms in Elkies' equation are not eliminated — they are absorbed by the geometric structure of the K3 surface. The elliptic curve provides the specific relationships between a, b, c that make the cross terms work out to a perfect fourth power.

Euler's intuition survives in spirit: the number of terms matters because it determines the DIMENSION of the geometric object. Two terms give a curve. Three terms give a surface. Higher-dimensional objects have room for geometry to hide inside. The "higher-dimensional hypotenuse" exists — it's just the elliptic curve embedded in the K3 surface.

FLT is true because two-term Fermat equations define curves with no rational structure. Elkies works because three-term equations define surfaces which CAN contain rational curves. More variables = higher-dimensional geometry = room for the cross terms to be tamed by structure rather than eliminated by symmetry.

Approach 1: xⁿ + yⁿ = zⁿ is a statement about n-dimensional measures

The argument

x, y, and z in xⁿ + yⁿ = zⁿ are lengths — one-dimensional quantities. Raising a length to the n-th power produces an n-dimensional measure: n=2 gives areas, n=3 gives volumes, n=4 gives hypervolumes.

The equation xⁿ + yⁿ = zⁿ therefore asserts: the sum of two n-dimensional measures (built from lengths x and y) equals a third n-dimensional measure (built from length z).

For n=2: this is the Pythagorean theorem — the sum of the areas of two squares equals the area of a third square. This works because: - Triangles exist as 2D objects, providing the geometric configuration (the right angle) - The right angle creates orthogonality, which kills the cross term - 2D dissection is unrestricted (Bolyai–Gerwien): any polygon can be cut and rearranged into any other polygon of equal area - The Pythagorean dissection proof physically demonstrates this

For n=3: this would assert that the sum of two cubes (volumes) equals a third cube (volume). This fails because: - There is no 3D geometric object analogous to the right triangle that provides a "cubic orthogonality" configuration - 3D dissection is restricted (Dehn): you CANNOT generally cut one polyhedron into another of equal volume — the Dehn invariant is an additional conserved quantity - The cross terms 3a²b + 3ab² in (a+b)³ represent physical volume (rectangular slabs) that cannot be made to vanish by any geometric configuration - There is no composition identity for cubes (Huang et al. 2022)

What needs to be proven

That xⁿ + yⁿ = zⁿ IS inherently geometric — that the exponent n is not merely an algebraic parameter but directly encodes the dimension of the measures involved.

This means showing: 1. x, y, z in the Fermat equation are necessarily lengths (1D quantities) 2. xⁿ is necessarily an n-dimensional measure of the length x 3. The equation xⁿ + yⁿ = zⁿ is therefore necessarily a statement about the additivity of n-dimensional measures 4. The additivity rules for n-dimensional measures are governed by n-dimensional geometry 5. n-dimensional geometry for n≥3 does not support pure-sum (cross-term-free) additivity

Steps 3–5 are essentially proven (Dehn, Jordan–von Neumann, Huang et al.). Steps 1–2 are the crux: showing that the Fermat equation cannot be "just algebra" but must be interpreted geometrically.

The challenge

The standard objection is: xⁿ + yⁿ = zⁿ is "just an equation about integers." The number 27 doesn't know it's a cube. The equation doesn't care about geometry.

The counter: for n=2, the equation x² + y² = z² is also "just an equation about integers." Yet it is PROVABLY equivalent to a geometric statement (the Pythagorean theorem). Every solution corresponds to a right triangle, and every right triangle gives a solution. The algebra and the geometry are the same thing.

The question is whether this equivalence between algebra and geometry, which is proven for n=2, extends to all n. If xⁿ + yⁿ = zⁿ is necessarily geometric for all n (not just n=2), then the geometric impossibility for n≥3 becomes an algebraic impossibility.

Status

Open. The geometric interpretation of x² + y² = z² is well-established (it IS the Pythagorean theorem). The geometric interpretation of x³ + y³ = z³ as a statement about volumes is intuitive but not yet formalised as a mathematical equivalence.

Approach 2: The equation xⁿ + yⁿ = zⁿ has no cross terms, and cross-term-free equations are only solvable for n=2

The argument

The equation xⁿ + yⁿ = zⁿ is a "pure" sum of n-th powers — there are no cross terms. Compare: - x² + y² = z² — no cross term (no xy term) - x² - xy + y² — HAS a cross term (-xy); this is the Eisenstein norm - (x+y)² = x² + 2xy + y² — cross term 2xy appears when you expand

The Pythagorean equation works because orthogonality can eliminate the cross term from the expansion of (length)². The inner product ⟪u,v⟫ vanishes when u ⊥ v, and:

‖u+v‖² = ‖u‖² + 2⟪u,v⟫ + ‖v‖²

When ⟪u,v⟫ = 0: ‖u‖² + ‖v‖² = ‖u+v‖² — Pythagoras, no cross term.

For n≥3: the expansion of (a+b)ⁿ has cross terms that CANNOT be eliminated: - (a+b)³ = a³ + b³ + 3a²b + 3ab² — cross terms 3a²b + 3ab² - These are strictly positive for positive a, b - No "cubic orthogonality" exists to make them vanish (Jordan–von Neumann, Hurwitz)

The key observation about the Eisenstein norm

The Eisenstein integer norm a² - ab + b² is quadratic (degree 2) but HAS a cross term (-ab). The Gaussian integer norm a² + b² is quadratic (degree 2) and has NO cross term.

The Pythagorean equation x² + y² = z² corresponds to the Gaussian norm — the pure, cross-term-free one.

The Eisenstein norm a² - ab + b² does NOT give rise to a Fermat-like equation. The equation x² - xy + y² = z² is a different beast entirely — and it behaves differently.

This suggests that the cross-term-free nature of xⁿ + yⁿ = zⁿ is not incidental but essential to the problem. The equation DEMANDS purity (no cross terms), and purity is only achievable via orthogonality, which is only possible for degree 2.

What needs to be proven

That a cross-term-free equation of degree n in the form xⁿ + yⁿ = zⁿ can only have integer solutions if there exists a mechanism to produce "pure" n-th power sums — and that such a mechanism only exists for n=2.

This is a tighter claim than Approach 1 because it focuses on the specific structure of the equation (no cross terms) rather than the general geometric interpretation.

The proof would need: 1. Every solution to x² + y² = z² arises from cross-term cancellation (proven — Gaussian integer parametrisation is complete) 2. Cross-term cancellation requires orthogonality (proven — the iff in Mathlib) 3. Orthogonality is a degree-2 phenomenon (proven — inner products are bilinear) 4. For n≥3, integer solutions to xⁿ + yⁿ = zⁿ would also require cross-term cancellation 5. Since cross-term cancellation is impossible for n≥3, no solutions exist

Step 4 is the gap. It's asking: is cross-term cancellation the ONLY way to get a pure sum of n-th powers to equal an n-th power in integers?

Status

Open. Steps 1–3 are proven. Step 4 is the key unsolved question.

What we have proven (machine-verified in Lean 4)

All formalised in Fermat/Basic.lean and compiled against Mathlib.

Part 1: n=2 works because of cross-term cancellation

• Pythagoras ↔ inner product vanishes (cross term = 0) — from Mathlib
• Norm expansion: ‖x+y‖² = ‖x‖² + 2⟪x,y⟫ + ‖y‖² — from Mathlib
• All Pythagorean triples classified (parametrised) — from Mathlib
• Gaussian integer norm is multiplicative — from Mathlib
• Gaussian integer norm is a sum of squares — proved
• Brahmagupta–Fibonacci identity — proved
• Pythagorean parametrisation identity — proved

Part 2: Cross terms are unavoidable for n ≥ 3

• Cubic expansion with cross term identified — proved
• Cubic cross term strictly positive for positive integers — proved
• a³ + b³ < (a+b)³ for positive a, b — proved
• Quartic cross term strictly positive — proved
• a⁴ + b⁴ < (a+b)⁴ for positive a, b — proved
• x³ + y³ = (x+y)(x²-xy+y²) factorisation — proved
• x²-xy+y² > 0 for (x,y) ≠ (0,0) — proved

Part 2b: No composition identity for d ≥ 3

Theorem (Huang, Liao, Lu, Zhang, arXiv:2210.03401): For d > 2, no non-trivial composition identity exists for sums of d-th powers. Proven (2022). Not yet formalised in Lean.

FLT results from Mathlib

• FLT for n = 3 (via cyclotomic descent) — from Mathlib
• FLT for n = 4 (via infinite descent) — from Mathlib
• FLT reduces to odd primes — from Mathlib

Dead ends (honestly documented)

The composition identity bridge (14 Sep 2026)

Attempted: Show that a solution to xⁿ + yⁿ = zⁿ would imply a composition identity for sums of n-th powers, contradicting Huang et al.

Failed because: Huang et al. operates on polynomial identities (formal equalities holding for all values). A single integer solution is a point, not an identity. You cannot promote a point to an identity because the Fermat curve has genus ≥ 1 (Faltings), so no rational parametrisation exists. This is a category error — identities and points are different mathematical objects.

The Hurwitz norm bridge (14 Sep 2026)

Attempted: Show that a solution would force a degree-n multiplicative norm on some ring, and Hurwitz forbids such norms for n ≥ 3.

Failed because: Hurwitz's theorem is about quadratic norm forms on division algebras (dimensions 1, 2, 4, 8). It says nothing about degree-n norms. Degree-3 multiplicative norms DO exist — every cubic number field has one (e.g. ℤ[∛2] has norm a³+2b³+4c³−6abc). The Fermat exponent and the norm degree are independent — ℤ[ω] has a degree-2 norm but is used to prove FLT for n=3. The apparent connection between Hurwitz and FLT was a coincidence.

Supporting results

Formalisation

Lean 4 project

The project is at /Users/richard/personal/home/fermat/ with Mathlib as a dependency. The file Fermat/Basic.lean contains all machine-verified proofs listed above.

What could still be formalised

• Huang et al.'s Theorem 3.1 (Harrison center theory)
• A formal proof that the Fermat curve has no rational parametrisation for n ≥ 3
• The geometric interpretation of xⁿ + yⁿ = zⁿ as an n-dimensional measure statement

Open directions

The two approaches converge on the same question from different angles:

• Approach 1 asks: can we prove xⁿ + yⁿ = zⁿ IS geometric, so geometric constraints apply?
• Approach 2 asks: can we prove pure (cross-term-free) n-th power sums require orthogonality?

Both reduce to: is there a way to show that integer solutions to xⁿ + yⁿ = zⁿ are inextricably tied to the dimensional geometry encoded by the exponent n?

If so, the geometric impossibility for n≥3 (Dehn, Jordan–von Neumann, no cubic orthogonality) would directly imply no solutions — not because "integers need permission" but because the equation itself IS a geometric statement, and the geometry says no.

Approach 3: The discriminant argument (Fermat-era tools only)

The line-sweep method

To find rational points on a curve, draw a line through a known rational point. If the line hits the curve at a second point, and that point is rational, you have a new solution. For the circle (n=2), this generates ALL Pythagorean triples.

n=2 (the circle): x² + y² = 1

Take the known point (-1, 0). Draw a line Y = t(X + 1) with rational slope t. Substituting into x² + y² = 1 and factoring out the known root X = -1 gives a LINEAR equation in X, with solution:

X = (1 - t²)/(1 + t²),  Y = 2t/(1 + t²)

Alternatively, viewing it as a quadratic in X: the discriminant is 4 — a positive constant, independent of t. Every rational slope gives a rational point. GUARANTEED.

This is why Pythagorean triples exist in infinite families.

n=3 (the cubic): x³ + y³ = 1

Take the known point (1, 0). Draw a line Y = t(X - 1) with rational slope t. Substituting into x³ + y³ = 1 and factoring out the known root X = 1 gives a QUADRATIC in X:

(1 + t³)X² - (2t³ - 1)X + (t³ + 1) = 0

The discriminant is -3(4t³ + 1).

This is: - Negative for all t > -(1/4)^{1/3} ≈ -0.63 — no real second intersection at all - Zero only at t = -(1/4)^{1/3} — irrational, so no rational point - Positive only for t < -(1/4)^{1/3} — and even then, a rational point requires -3(4t³ + 1) to be a perfect rational square

The contrast

What this shows

The discriminant being a positive constant for n=2 is equivalent to the cross-term cancellation / orthogonality property. It's the algebraic expression of "the circle has no gaps."

The discriminant being mostly negative for n=3 is the algebraic expression of "the cubic curve is the wrong shape" — it bulges outward from the circle, and lines through rational points mostly miss it entirely.

What Fermat would have known

This argument uses only: - Equations of curves (coordinate geometry — Fermat and Descartes, c. 1630s) - Intersection of lines with curves (classical) - Discriminants of quadratic equations (known since antiquity) - The concept of rational vs irrational (Euclid)

Fermat could have computed the discriminant for n=3 and observed that it's negative for most slopes. Whether he could have turned this observation into a proof is the open question.

Status

Partially proven. The discriminant calculation is verified (both by SymPy and in principle formalisable in Lean). The geometric obstruction is real. The remaining gap: proving that NO rational t makes -3(4t³+1) a perfect rational square while also yielding a positive point. This is an elliptic curve problem (s² = -12t³ - 3), and showing it has no relevant rational points would complete the n=3 case via this method.

Note: this is essentially a geometric rephrasing of the classical descent argument for n=3. The novelty is that the discriminant comparison between n=2 and n=3 makes the obstruction visually obvious — the constant discriminant for n=2 vs the varying discriminant for n=3 IS the difference between "geometry that generates solutions" and "geometry that obstructs them."

Extension to all n ≥ 3

The discriminant argument generalises naturally. For the Fermat curve xⁿ + yⁿ = 1, intersecting with a line through the known point (1,0) and factoring out the known root leaves a degree (n-1) polynomial:

n=2 is the ONLY case where the residual is linear, because 2-1=1 is the only value where the remaining equation is degree 1. Linear equations over ℚ always have rational solutions. This is a theorem, not a conjecture.

For n ≥ 3, the residual is degree ≥ 2, and there is no guarantee of rational solutions. This is the formal algebraic expression of "the geometry works for n=2 and fails for n≥3."

The n=3 circularity

For n=3 specifically, the requirement that the quadratic discriminant -3(4t³+1) be a perfect rational square reduces to the Mordell equation y² = x³ - 432. The only rational solutions to this equation are (12, ±36), which correspond to the trivial points (0,1) and (1,0) on the cubic Fermat curve.

However, proving y² = x³ - 432 has no other rational solutions turns out to be equivalent to FLT for n=3 — the Mordell curve is isomorphic to the Fermat cubic. So the discriminant approach correctly reduces FLT(3) to a Mordell equation but doesn't independently prove it.

This is still valuable: it shows that the geometric line-sweep obstruction and the classical number-theoretic proof are the same argument viewed from different angles.

Approach 4: The Pythagorean identity cosⁿ(θ) + sinⁿ(θ) = 1 holds only for n=2

The identity

The Pythagorean theorem can be written trigonometrically. If a = c·cos(θ) and b = c·sin(θ) are the sides of a right triangle with hypotenuse c, then:

a² + b² = c²  ⟺  cos²(θ) + sin²(θ) = 1

This identity is true for ALL θ. It is not a theorem about specific angles — it is the definition of what sine and cosine are (coordinates on the unit circle).

The identity fails for n ≥ 3

Theorem: For n ≥ 3 and θ ∈ (0, π/2): cosⁿ(θ) + sinⁿ(θ) < 1 (strictly).

Proof (3 lines): 1. In (0, π/2): 0 < cos(θ) < 1 and 0 < sin(θ) < 1 2. For n ≥ 3: cosⁿ(θ) = cos²(θ) · cos^{n-2}(θ) < cos²(θ) [since cos^{n-2} < 1] Similarly: sinⁿ(θ) < sin²(θ) 3. Therefore: cosⁿ(θ) + sinⁿ(θ) < cos²(θ) + sin²(θ) = 1. QED.

The Pythagorean identity is unique to n=2.

Geometric consequence

For n=2: every Pythagorean triple (a,b,c) gives a point (a/c, b/c) ON the unit circle, reachable as (cos θ, sin θ) for some angle θ. The rational parametrisation via t = tan(θ/2) generates all solutions.

For n≥3: if aⁿ + bⁿ = cⁿ, set p = a/c, q = b/c. Then pⁿ + qⁿ = 1. But since p, q ∈ (0, 1) and n ≥ 3: - pⁿ < p² and qⁿ < q² - So p² + q² > pⁿ + qⁿ = 1 - The point (p, q) lies OUTSIDE the unit circle

This means: FLT solutions for n≥3 would correspond to points outside the unit circle. They are not reachable by (cos θ, sin θ) for any θ. The trigonometric mechanism that generates all Pythagorean triples cannot generate any higher-power solutions.

What this proves and what it doesn't

Proves: The trig parametrisation (the generating mechanism for Pythagorean triples) produces no solutions for n≥3. The mechanism is specific to n=2 because the identity cos²(θ) + sin²(θ) = 1 is specific to n=2.

Doesn't prove: That there are no solutions at all. Points outside the unit circle exist — they're just not reachable by the trig mechanism. A solution to x³+y³=z³ would live on the curve x³+y³=1 (which bulges outside the unit circle), and proving that curve has no positive rational points requires additional argument.

Status

The trigonometric identity theorem is proven (elementary, 3 lines). Formalisation in Lean 4 should be straightforward. The connection to the geometric impossibility is clear. The gap to FLT is the same as in all other approaches: showing that points outside the unit circle cannot accidentally satisfy the Fermat equation in integers.

Approach 5: Power-reduction and Fourier analysis of cosⁿθ + sinⁿθ

The power-reduction identities

When cosⁿθ + sinⁿθ is expanded via power-reduction formulas, the multi-angle terms cancel completely only for n=2:

n=2: cos²θ = (1 + cos2θ)/2 sin²θ = (1 - cos2θ)/2 cos²θ + sin²θ = 1

The cos2θ terms have OPPOSITE signs and cancel. The sum is constant = 1. This is an IDENTITY — true for all θ.

n=3: cos³θ = (3cosθ + cos3θ)/4 sin³θ = (3sinθ - sin3θ)/4 cos³θ + sin³θ = [3(cosθ + sinθ) + cos3θ - sin3θ] / 4

Multiple terms survive. Not constant. Equals 1 only at θ=0° and θ=90° (trivial).

n=4: cos⁴θ = (3 + 4cos2θ + cos4θ)/8 sin⁴θ = (3 - 4cos2θ + cos4θ)/8 cos⁴θ + sin⁴θ = (3 + cos4θ)/4

The cos2θ terms cancel (the even-power symmetry between cos and sin still kills these), but cos4θ SURVIVES. Not constant. Equals 1 only at θ=0° and θ=90°.

Why only n=2 gives complete cancellation

For n=2: the power-reduction introduces cos(2θ) with opposite signs in cos² and sin². This is because cos²θ - sin²θ = cos(2θ) — the double-angle formula — which means the asymmetric part of cos² and sin² is exactly one harmonic that cancels in the sum.

For n≥3: power-reduction introduces multiple harmonics (cos(kθ), sin(kθ) for various k). These harmonics have different coefficients in cosⁿ and sinⁿ, so they cannot all cancel simultaneously. At least one residual harmonic always survives, making the sum non-constant.

This is the cross-term argument in Fourier language: the "cross term" in cosⁿθ + sinⁿθ is the set of surviving harmonics. For n=2 there are none (complete cancellation = identity). For n≥3 there is always at least one (incomplete cancellation = not an identity).

Status

Proven (elementary trig). The power-reduction expansions are identities, verifiable algebraically. The cancellation pattern is exact. This connects the cross-term argument, the trig identity, and the line-sweep discriminant into a single picture.

Approach 6: Automorphisms and rotational symmetry

The observation

The unit circle x²+y²=1 has rotational symmetry — an infinite, continuous symmetry group SO(2). Rotating the known point (1,0) by any angle θ gives (cosθ, sinθ), another point on the circle. When tan(θ/2) is rational, the new point is rational. This is the generating mechanism for ALL Pythagorean triples.

For n≥3, the curve xⁿ+yⁿ=1 is not rotationally symmetric. It has only discrete symmetries (swap x,y; negate coordinates for even n; multiply by roots of unity over ℂ). The automorphism group over ℚ is tiny — it maps trivial points only to trivial points.

The automorphism group

Over ℚ: - n=2: Aut = SO(2) = rotations. Infinite, continuous. Every rational point is a rational rotation of (1,0). - n≥3: Aut_ℚ contains at most swap (x,y)↦(y,x) and sign changes. Finite, discrete. Applied to (1,0), produces only (0,1) and (-1,0).

Over the algebraic closure, Fermat curves have automorphism groups of order 6n², involving n-th roots of unity. But these extra automorphisms are not defined over ℚ and do not produce rational points.

Connection to the group law (n=3)

For n=3, the Fermat cubic is an elliptic curve with a group law: - (1,0) + (0,1) = O (point at infinity — identity) - 2·(1,0) = (0,1) - 3·(1,0) = O - The rational point group is ℤ/3ℤ = {O, (1,0), (0,1)} - Rank 0 — no points of infinite order - The group law applied to trivial points produces NOTHING new

For n=5, Klassen-Tzermias showed the Jacobian over ℚ is (ℤ/5ℤ)² — finite, all points accounted for, all trivial.

The pattern

What this shows

The circle is the UNIQUE Fermat curve with continuous symmetry. This continuous symmetry is what generates rational points. For n≥3, only discrete symmetries exist, and they cannot generate non-trivial rational points.

The remaining gap

Can rational points exist on a curve WITHOUT being generated by symmetries? For general curves: yes (some elliptic curves have "unexpected" points). For Fermat curves specifically: the evidence says no, but a general proof would likely require Jacobian analysis overlapping with Wiles-type techniques.

Session summary (14 Sep 2026)

What we explored

1. The geometric intuition: FLT is true because Pythagoras is inherently quadratic
2. Cross-term cancellation: only possible for n=2 via orthogonality
3. Composition identities: none exist for n≥3 (Huang et al. 2022)
4. The trig identity: cos²θ+sin²θ=1 is unique to n=2
5. Power-reduction: multi-angle terms cancel only for n=2
6. Line-sweep discriminant: constant (=4) for n=2, variable for n≥3
7. Residual polynomial degree: linear (n-1=1) only for n=2
8. Rotational symmetry: exists only for the circle (n=2)
9. Automorphism group: infinite for n=2, finite for n≥3

What we proved (machine-verified in Lean 4)

See the "What we have proven" section above.

Dead ends (honestly documented)

• Composition identity bridge (category error: identities ≠ points)
• Hurwitz norm bridge (Hurwitz doesn't forbid degree-3 norms)
• The n=3 discriminant reducing to Mordell y²=x³-432 (circular — equivalent to FLT(3))

The persistent gap

Every approach proves that the MECHANISM for generating solutions is unique to n=2 and absent for n≥3. None proves that solutions cannot exist WITHOUT a mechanism.

The gap is essentially: "can rational points exist on a curve with no generating structure?" For Fermat curves the answer appears to be no, but proving it in full generality requires arithmetic techniques beyond what we've assembled.

Approach 7: Symmetries determine rational points (Garcia-Fritz & Pasten 2025)

The discovery

The paper "Effective Mordell for curves with enough automorphisms" by Garcia-Fritz and Pasten (arXiv:2503.10443, 2025) proves exactly the principle we've been arguing for:

Theorem (Garcia-Fritz & Pasten): For curves of genus ≥ 2 with "enough automorphisms" relative to the Mordell-Weil rank of their Jacobian, there is an explicit, computable upper bound on the height of all rational points.

In plain terms: if a curve has many symmetries and its Jacobian has low rank, then the symmetries CONSTRAIN where rational points can be. More symmetry + lower rank = tighter constraints. Enough of both = effectively computable bound that allows you to find ALL rational points.

Connection to Fermat curves

Fermat curves xⁿ + yⁿ = zⁿ are among the most symmetric algebraic curves: - Automorphism group over the algebraic closure has order 6n² - The Jacobian rank over ℚ is typically 0 (only finite torsion) - This is exactly the "enough automorphisms" condition

The paper establishes that for such curves, rational points are effectively bounded — they are forced into orbits of the automorphism group. Since the rational automorphisms of Fermat curves map trivial points only to trivial points, the rational points should be exactly the trivial ones.

What this validates

This validates the core intuition of our approach: 1. For n=2 (the circle): INFINITE symmetry group (rotations) → INFINITE rational points 2. For n≥3 (Fermat curves): FINITE symmetry group → rational points constrained to symmetry orbits → only trivial points

The principle "symmetries determine rational points" is not just an intuition — it is an active research programme at the frontier of arithmetic geometry, and it DOES work for curves with enough automorphisms.

What remains

The Garcia-Fritz & Pasten theorem applies to genus ≥ 2 (i.e. n ≥ 4). It gives effective HEIGHT BOUNDS, not directly "zero non-trivial points." To get from the height bound to "all points are trivial" requires computing the specific bound for Fermat curves and showing it excludes all non-trivial points. This is computational work, not new theory.

For n=3 (genus 1, elliptic curve), the theorem doesn't directly apply. But n=3 is already proven in Mathlib via cyclotomic descent.

Status

Active research frontier. The Garcia-Fritz & Pasten result (2025) represents the state of the art in exactly the direction we've been exploring. The specific application to Fermat curves for n ≥ 4 would be a concrete next step — compute the height bounds from their Theorem 1.1 for the Fermat curve and verify they exclude non-trivial points.

Where we stand (15 Sep 2026)

The argument in plain language

Fermat's Last Theorem is true because:

1. The equation x² + y² = z² is the Pythagorean theorem — a geometric fact about right triangles, which are 2D objects in Euclidean space.

2. The Euclidean metric is necessarily quadratic (degree 2) because it arises from the inner product, which is bilinear. This is not a choice — it is forced by the axioms of geometry (Jordan-von Neumann theorem).

3. The equation x² + y² = z² has solutions because the unit circle (which IS this equation, normalised) has a continuous rotational symmetry that generates all rational points from any single one. Every Pythagorean triple is a rotation of the trivial solution (1, 0, 1).

4. For n ≥ 3, every property that makes n=2 work is provably absent:

5. No inner product (parallelogram law fails)
6. No trig identity (cosⁿθ + sinⁿθ < 1)
7. No rational parametrisation (genus ≥ 1)
8. No composition identity (Huang et al. 2022)
9. No continuous symmetry (Fermat curves are not circles)
10. No constant discriminant in the line sweep

11. Cross terms are unavoidable

12. The generating mechanism for solutions is unique to n=2 and absent for n≥3. Recent work (Garcia-Fritz & Pasten, 2025) shows that for curves with enough automorphisms (which Fermat curves have), rational points are determined by symmetry orbits — confirming that when the generating symmetry is absent, rational points are constrained to trivial ones.

What is proven

• All the individual obstructions (points 1-4 above): PROVEN
• FLT for n=3: PROVEN (Mathlib, cyclotomic descent)
• FLT for n=4: PROVEN (Mathlib, infinite descent)
• That symmetries constrain rational points on highly symmetric curves: PROVEN (Garcia-Fritz & Pasten 2025)
• The specific computation applying their theorem to Fermat curves: NOT YET DONE

The gap

The gap has narrowed considerably. It is no longer "can accidental solutions exist?" in the abstract. It is now: "compute the Garcia-Fritz & Pasten height bound for Fermat curves and verify it excludes non-trivial points." This is computational work using established theory, not a conceptual breakthrough.

Next steps

1. Study the Garcia-Fritz & Pasten framework in detail
2. Compute their height bound M(X) for Fermat curves xⁿ+yⁿ=zⁿ
3. Verify the bound excludes non-trivial rational points
4. If successful, this gives an independent proof of FLT for n ≥ 4 via automorphism-constrained height bounds (combined with n=3 from Mathlib)

Garcia-Fritz & Pasten: honest assessment (15 Sep 2026)

The Garcia-Fritz & Pasten theorem does NOT provide a route to FLT. Three problems:

1. Height bound is vacuous for rank 0. When Jacobian rank = 0, every rational point has Néron-Tate height 0 trivially. The theorem says "height ≤ something positive," which is always true. It gives no information in this case.

2. Too few rational automorphisms. Fermat curves have 6n² automorphisms over the algebraic closure, but only ~6 over ℚ (permutations and sign changes). The root-of-unity scalings are not defined over ℚ. The paper needs ℚ-rational automorphisms.

3. Rank 0 ≠ FLT. Even with rank 0, rational points inject into finite torsion, but determining WHICH torsion classes are actual curve points requires curve-specific arithmetic — which IS the classical FLT proof for each n.

Also: Fermat Jacobians are NOT always rank 0 (Gross-Rohrlich 1978).

The principle "symmetries constrain rational points" is valid but insufficient for FLT.

Dead end: the dissection/folding proof (15 Sep 2026)

Attempted: Show that two cubes cannot be dissected and rearranged into a third cube, therefore a³ + b³ ≠ c³.

Failed because: Cubes CAN be dissected into other cubes. The Dehn invariant of every cube is ZERO (all dihedral angles are π/2). By the Dehn-Sydler theorem, polyhedra with equal volume and equal Dehn invariant are scissors-congruent. Since all cubes have Dehn invariant 0, any two cubes of equal total volume can be cut and rearranged into a third.

The Dehn obstruction blocks tetrahedron-to-cube dissection (different Dehn invariants), not cube-to-cube. We had the causation backwards: - WRONG: dissection impossible → no integer solutions - RIGHT: no integer solutions → the dissection question never arises

FLT is not a consequence of 3D dissection failure.

Approach 8: The law of cosines and the universal angle (15 Sep 2026)

The core observation

The law of cosines is the GENERAL relationship between three lengths:

c² = a² + b² − 2ab·cos(θ)

The Pythagorean theorem a² + b² = c² is the SPECIAL CASE θ = π/2 (90°).

The right angle is: - Universal — the same for all (a,b). Every right triangle has θ=90°. - Pre-existing — it exists as a geometric fact, independent of any equation. - Rational — cos(90°) = 0, a rational number.

These three properties together produce integer solutions: the universal rational angle defines a single curve (the unit circle), which can be parametrised, which generates all Pythagorean triples.

Why n ≥ 3 fails

For a³+b³=c³ to hold with c = (a³+b³)^{1/3}, the law of cosines gives:

cos(θ) = [a²+b² − (a³+b³)^{2/3}] / (2ab)

This angle is: - Not universal — different for each (a,b). No single geometric configuration. - Not pre-existing — the angle is determined by a,b, not by geometry. - Not rational — cos(θ) is rational iff (a³+b³)^{2/3} is rational, iff a³+b³ is a perfect cube, iff a³+b³=c³ has a solution. The rationality of the angle and the existence of the solution are THE SAME CONDITION.

The causal asymmetry

For n=2: Geometry → angle (90°) → equation (Pythagoras) → solutions For n≥3: Solutions → angle → ... but nothing produces the solutions

For n=2, the causal chain starts with geometry. The right angle exists independently and produces solutions. For n≥3, the chain has no starting point. Solutions would need to bootstrap their own geometric justification into existence.

This is not an analogy. It is the literal structure of the problem: - The law of cosines IS the relationship between lengths in Euclidean space. - The ONLY way to get a pure power-sum (no cross term) is to set cos(θ) = 0. - cos(θ) = 0 gives θ = 90° which gives c² = a² + b² (degree 2 only). - There is no angle that gives c³ = a³ + b³ or any higher degree.

What this proves

1. The law of cosines is the unique general relationship between three lengths in Euclidean geometry. (Proven — consequence of the metric being quadratic.)

2. The Pythagorean equation a²+b²=c² is the unique special case where the cross term vanishes (θ=90°). (Proven — cos(θ)=0 iff θ=π/2.)

3. No analogous universal angle produces aⁿ+bⁿ=cⁿ for n≥3. (Proven — the required angle depends on a,b and equals a rational value only when a solution already exists.)

4. For n=2, geometry independently supplies the rational angle that produces solutions. For n≥3, no independent geometric fact supplies a rational angle. (Proven — the 90° angle is a geometric axiom; no cubic analogue exists.)

What this doesn't prove

That solutions for n≥3 are impossible. It proves there is no geometric cause for them, no pre-existing angle, no universal mechanism. It does not formally exclude the possibility that three specific integers satisfy the equation without geometric justification.

The gap — in its thinnest form

The argument is now: for the specific equation xⁿ+yⁿ=zⁿ (not an arbitrary Diophantine equation), integer solutions MUST have a geometric origin because the equation arises from raising LENGTHS to powers. Lengths are geometric. Their relationships are governed by the law of cosines. The law of cosines only supports n=2.

The unproven step: "integer solutions to xⁿ+yⁿ=zⁿ must have a geometric origin." For n=2, this is proven (every Pythagorean triple IS a right triangle). For n≥3, this is the claim that closes the proof.

Fermat's perspective

All of the above uses only tools available to Fermat (d. 1665): - The law of cosines (known since antiquity) - The Pythagorean theorem (known since antiquity) - Trigonometry (cos, sin — known in Fermat's era) - The concept of a right angle - Infinite descent (Fermat's own invention)

The observation that "no cubic analogue of the right angle exists" would have been accessible to Fermat. Whether he could have formalised it into a proof is unknowable, but the conceptual content is entirely within his toolkit.

Approach 9: Infinite descent + cross-term argument (15 Sep 2026)

Combining Fermat's infinite descent with the cross-term/angle argument leads directly to the classical proofs:

• For n=3: the factorisation a³+b³ = (a+b)(a²-ab+b²), combined with coprimality, requires both factors to be perfect cubes. This IS Euler's descent, derived geometrically from the cross-term structure.
• For n=4: Fermat's own proof uses (a²)²+(b²)²=(c²)² as a Pythagorean triple — directly exploiting the n=2 structure.
• For n≥5: the analogous factorisation in cyclotomic integers is Kummer's approach, which stalls for irregular primes.

The geometric perspective illuminates WHY the classical proofs work but does not extend them further.

Final summary: What I learned (15 Sep 2026)

The intuition is correct

The intuition that n=2 is a special case — that Pythagoras works because it is geometry, because triangles are 2D, because the metric is quadratic, because the inner product is bilinear — is correct. This is not speculation. It is borne out by at least nine independent, rigorous proofs:

1. Cross-term cancellation: orthogonality kills the cross term only for n=2
2. Trig identity: cos²θ+sin²θ=1 is an identity only for n=2
3. Power-reduction: multi-angle harmonics cancel completely only for n=2
4. Line-sweep discriminant: constant (=4) only for n=2
5. Residual degree: linear (degree 1) only for n=2
6. Genus: genus 0 (rational curve) only for n≤2
7. Rotational symmetry: continuous symmetry only for n=2
8. Composition identity: Brahmagupta-Fibonacci exists only for n=2 (Huang et al.)
9. Law of cosines / universal angle: the right angle (90°) is the unique fixed rational angle that eliminates the cross term, and it gives n=2 only

Each of these is proven. Several are formalised in Lean 4 and machine-verified. They all say the same thing from different angles: n=2 is uniquely geometric.

But this does not constitute a proof of FLT

All nine proofs demonstrate that the MECHANISM for producing integer solutions is unique to n=2 and absent for n≥3. None of them proves that integer solutions CANNOT EXIST without a mechanism.

The gap: could there be a "freak" solution — three specific integers that just happen to satisfy aⁿ+bⁿ=cⁿ for some n≥3, without any geometric or algebraic structure producing them?

For n=2, this is provably impossible: every Pythagorean triple is accounted for by the geometric mechanism (the Gaussian integer parametrisation is complete). Zero solutions are unexplained. Zero are accidental.

For n≥3, we have proved there is no mechanism, no parametrisation, no generating structure. But proving that "no mechanism" means "no solutions" — rather than merely "extremely unlikely" — requires arithmetic tools that go beyond geometry.

What we have is a mountain of evidence, not a proof

The situation is analogous to knowing that: - There is no engine in the car - There is no fuel in the car - There are no wheels on the car - The road ahead is blocked

And yet being unable to prove the car cannot reach its destination, because mathematics requires ruling out the possibility that the car teleports.

Every physical/structural reason for the car to move is absent. But "every reason is absent" is not a mathematical proof of "cannot happen."

What Wiles actually did (see below)

Wiles didn't prove FLT by showing n=2 is special. He proved it by showing that a hypothetical solution for n≥3 would create an object (the Frey elliptic curve) so pathological that it violates a deep theorem about the structure of elliptic curves (modularity). He didn't prove "the car has no engine" — he proved "if the car reached its destination, the laws of physics would be broken."

This is fundamentally different from our approach. We showed the engine is missing. Wiles showed the destination is unreachable. Both are true, but only the second constitutes a proof.

Possible future direction: Iwasawa theory and cyclotomic fields

Why rings matter for FLT

The integers ℤ are a ring — a set closed under both addition and multiplication. This dual structure means addition and multiplication are not independent: they are locked together by prime factorisation. Every integer breaks down into primes in exactly one way (unique factorisation), and this constrains which additive relationships are possible.

Pythagorean triples exist because the Gaussian integers ℤ[i] (integers extended with √-1) are ALSO a ring with unique factorisation. The multiplicative structure of ℤ[i] (factoring into Gaussian primes) determines which integers can be expressed as sums of two squares, and the parametrisation of all Pythagorean triples follows.

For FLT, the natural ring to work in is ℤ[ζₙ] — the integers extended with an n-th root of unity. The equation xⁿ+yⁿ=zⁿ factors beautifully in this ring:

xⁿ + yⁿ = (x+y)(x+ζy)(x+ζ²y)···(x+ζⁿ⁻¹y)

If ℤ[ζₙ] has unique factorisation, you can analyse these factors individually and derive a contradiction via descent. This is what Kummer did for regular primes (primes p where the class number of ℤ[ζₚ] is not divisible by p).

The problem: ℤ[ζₙ] does NOT always have unique factorisation. The class number measures how badly it fails. For irregular primes (37, 59, 67, ...), unique factorisation breaks down and Kummer's descent stalls.

The Iwasawa theory approach

Iwasawa theory (1960s–1970s) was designed specifically to understand how class numbers behave across towers of cyclotomic rings. Instead of studying ℤ[ζₚ] for a single prime p, it studies the whole tower ℤ[ζₚ], ℤ[ζₚ²], ℤ[ζₚ³], ... simultaneously, finding patterns in how the class numbers grow.

The Iwasawa Main Conjecture (proved by Mazur and Wiles, 1984) connects cyclotomic class numbers to p-adic L-functions — analytic objects that encode deep arithmetic information. This was supposed to be the key to extending Kummer's approach to all primes.

Ironically, Wiles proved the Iwasawa Main Conjecture (1984) and then proved FLT (1994) by a completely different method (modularity of elliptic curves). The Iwasawa theory tools are sitting there, proven and powerful, but nobody has assembled them into an independent proof of FLT.

Why this matters

An Iwasawa-theoretic proof of FLT would show that the ring ℤ[ζₙ] never has the right properties to support solutions to xⁿ+yⁿ=zⁿ, regardless of its class number. This would be a purely algebraic/number-theoretic proof, without elliptic curves.

This connects directly to our work: our geometric arguments show that n=2 is special because the relevant ring (ℤ[i]) has perfect structure (class number 1, unique factorisation, multiplicative norm). For n≥3, the ring structure deteriorates. An Iwasawa theory proof would make "deteriorated ring structure → no solutions" rigorous for ALL n, completing the argument we could not close by elementary means.

Status

Active research area. Iwasawa theory and cyclotomic fields are well-established fields with active researchers. The specific goal of proving FLT independently of modularity via these tools is a known open question. The tools exist. The framework exists. Nobody has assembled them into a complete proof yet.

Keywords for further investigation: Iwasawa theory, cyclotomic fields, class number, regular and irregular primes, p-adic L-functions, Herbrand-Ribet theorem.

Approach 10: Completing the square, Cardano, and Abel-Ruffini (15 Sep 2026)

The connection

Completing the square is cross-term elimination: it absorbs the cross term bx in x²+bx+c into a perfect square (x+b/2)². This is a LINEAR shift that stays in ℤ.

For cubics, the analogous operation (Cardano's formula) requires cube roots and square roots of complex numbers. The cross terms cannot be absorbed within ℤ — you MUST leave the integers. The casus irreducibilis (16th century) proves that some cubics with real roots require passing through ℂ.

For degree ≥ 5, Abel-Ruffini (1824) proves there is NO radical formula at all. The cross terms are not just hard to absorb — they are provably impossible to absorb by any algebraic formula using radicals.

Possible proof structure

IF it can be shown that integer solutions to xⁿ+yⁿ=zⁿ require an algebraic mechanism for eliminating cross terms in (a+b)ⁿ, then:

• n=2: mechanism exists (completing the square) → solutions exist ✓
• n=3,4: mechanism exists but leaves ℤ → separate descent arguments needed
• n≥5: NO mechanism exists (Abel-Ruffini) → no solutions (directly!)

For n≥5, this would give a PROOF, not just evidence — provided the premise ("solutions require cross-term elimination") can be established.

Status

Dead end. Abel-Ruffini does not connect to FLT. Three reasons:

1. Abel-Ruffini concerns the GENERAL degree-n polynomial, not specific equations. Specific equations can have solutions even when no general formula exists (e.g. x⁵=32 has solution x=2).

2. The cross-term elimination in (a+b)ⁿ is not the same operation as solving xⁿ+yⁿ=zⁿ. In the Fermat equation, c is a free variable, not a+b. The actual proofs of n=3 and n=4 use infinite descent, not Cardano/Ferrari.

3. No formula ≠ no solution. x⁵-x-1 has a real root despite having no radical formula. Same gap as all other approaches.

However, the observation about completing the square being unique to degree 2 remains valid as EVIDENCE that n=2 is special. It just can't be extended to a proof via Abel-Ruffini.

Cross-term irreducibility for n=5 (15 Sep 2026)

The computation

The Fermat equation A⁵+B⁵=C⁵ can be written as:

S[S⁴ - 5PS² + 5P²] = C⁵

where S = A+B and P = AB.

The polynomial S⁴ - 5PS² + 5P² factors as (S²-αP)(S²-βP) where α = (5+√5)/2 and β = (5-√5)/2 — both IRRATIONAL.

This factorisation is irreducible over ℚ. You cannot decompose it using rational operations alone. To factor the n=5 Fermat equation, you MUST enter ℚ(√5) or ℚ(ζ₅).

Compare with n=2: a²+b² = (a+bi)(a-bi) factors over ℤ[i], which is a UFD. The factorisation works perfectly and constructs all Pythagorean triples.

What this shows

The factorisation mechanism that produces Pythagorean triples (factor in ℤ[i], both factors must be perfect squares, derive parametrisation) CANNOT work for n=5 because the factorisation is irreducible over ℚ.

What this doesn't show

That no OTHER mechanism could produce solutions. A solution could in principle exist without coming from any factorisation — verified by direct computation rather than algebraic construction.

The persistent gap, precisely stated

For n=2: every solution MUST come from the factorisation (proven — the Gaussian integer parametrisation is complete). Since the factorisation works, solutions exist.

For n=5: the factorisation doesn't work over ℚ. IF every solution must come from a factorisation, then no solutions exist. But "every solution must come from a factorisation" is unproven.

This is the same gap as in all other approaches, but now precisely located: prove that solutions to xⁿ+yⁿ=zⁿ must arise from the algebraic factorisation of the equation. If true, irreducibility over ℚ for n≥3 proves FLT.

Connection to Kummer

This IS Kummer's approach, arrived at from the cross-term direction. Kummer factored xⁿ+yⁿ in ℤ[ζₙ] and used unique factorisation to derive contradictions. When unique factorisation fails (irregular primes), his method stalls — exactly as our cross-term irreducibility stalls.

The geometric/cross-term perspective and classical algebraic number theory are the SAME mathematics expressed differently.

Honest final assessment (15 Sep 2026)

What we achieved

Over two days, we explored ten approaches to FLT from elementary geometric and algebraic perspectives. Every approach independently confirms that n=2 is uniquely special — the only case supported by Euclidean geometry, trigonometry, orthogonality, rotational symmetry, composition identities, and rational parametrisation.

We formalised key results in Lean 4 (machine-verified) and documented everything honestly, including dead ends.

What we didn't achieve

A proof of FLT. Every approach hits the same irreducible gap: proving that the ABSENCE of a generating mechanism means the ABSENCE of solutions. This gap appears to genuinely require arithmetic tools (infinite descent for specific n, or modularity for all n) rather than geometric or algebraic-structural arguments alone.

What we learned about the gap

The gap is not vague — it is precisely located. It is the claim:

"Solutions to xⁿ+yⁿ=zⁿ must arise from the algebraic factorisation of the equation."

For n=2 this is proven (Gaussian integer parametrisation is complete). For n≥3 this is unproven and may require fundamentally new ideas.

If this claim could be proven, FLT would follow from the irreducibility of the cross-term factorisation over ℚ for n≥3 — a fact we can demonstrate.

The landscape

Our work maps onto the existing mathematical landscape:

• Our cross-term arguments = Kummer's cyclotomic approach (different language, same maths)
• Our "no mechanism" gap = the class number obstruction (same wall Kummer hit)
• Our "symmetry determines points" intuition = Iwasawa theory (active research)
• The actual proof (Wiles) = sidesteps the gap entirely via modularity

The elementary approach is not proven impossible, just unsolved. The tools exist (Iwasawa theory, cyclotomic fields). The gap is well-defined. A proof staying within ℤ — or at least avoiding elliptic curves — remains an open question.

Have we ruled out all non-coincidence mechanisms? (15 Sep 2026)

YES. Every known non-coincidence mechanism for producing integer solutions to xⁿ+yⁿ=zⁿ has been individually ruled out for n≥3:

What remains is ONLY "pure numerical coincidence" — ruled out by Wiles (1995).

The complete picture

1. All structural mechanisms for solutions: ABSENT for n≥3 (our work, proven)
2. Coincidental solutions: ABSENT for n≥3 (Wiles, proven)
3. Therefore: FLT is true

The thesis

The REASON FLT is true is geometric: the equation is about right-angled triangles, which are 2D objects, and every mechanism that makes n=2 work is provably absent for n≥3.

The PROOF that FLT is true requires additionally ruling out coincidence, which is what Wiles did via modularity of elliptic curves.

The reason is simpler than the proof. The equation is about triangles. Triangles are 2D. And 2 ≠ 3.

Do integer solutions require underlying geometry? (15 Sep 2026)

The conjecture

The work in this document suggests a broad conjecture:

Integer solutions to polynomial equations exist only when there is an underlying geometric reality that the equation encodes.

For xⁿ+yⁿ=zⁿ: the geometric reality is the right-angled triangle (n=2). For n≥3, no geometric reality exists, and no solutions exist. The following statement summarises the evidence:

"For the Fermat equation xⁿ+yⁿ=zⁿ with n≥3, no integer solution can exist because the equation has no geometric realisation — it satisfies no local-global principle, admits no rational parametrisation, has no generating structure, and its associated curve has no rational points beyond the trivial ones forced by symmetry."

This is not a proof. It is damning evidence.

A potential counterexample: x³ + y³ + z³ = 33

The equation x³ + y³ + z³ = k asks which integers k can be written as the sum of three cubes. For most small values of k, solutions are found easily. But k = 33 resisted all attempts until 2019, when Andrew Booker discovered:

33 = 8866128975287528³ + (−8778405442862239)³ + (−2736111468807040)³

This solution was found by enormous computational search, not by any algebraic method. Nobody knows a geometric reason why 33 is a sum of three cubes. The numbers involved are gigantic and appear to have no structural relationship to 33. The solution looks entirely "accidental."

Similarly, k = 42 was only solved later in 2019 by Booker and Sutherland:

42 = (−80538738812075974)³ + 80435758145817515³ + 12602123297335631³

These cases challenge the conjecture: integer solutions exist, but no geometric explanation is known. Either:

1. There IS a hidden geometry behind sums of three cubes that we haven't found, or
2. The conjecture is false — some equations have "accidental" integer solutions with no geometric origin

The question of which integers are sums of three cubes remains wide open. It is not known whether every integer not of the form 9k±4 can be expressed as a sum of three cubes.

The Langlands perspective

The belief that integer solutions always have geometric explanations is essentially the philosophy behind the Langlands programme — the most ambitious ongoing project in modern mathematics. Langlands conjectured (1967) that arithmetic (integer solutions, prime factorisations) and geometry (automorphic forms, representations) are ultimately the same thing.

Wiles' proof of FLT is a specific instance of this philosophy: he showed that the arithmetic of the Fermat equation is governed by the geometry of elliptic curves and modular forms.

Whether THIS philosophy can be turned into a general theorem — proving that Diophantine equations without geometric structure cannot have solutions — remains one of the great open questions in mathematics.

For the blog

FLT is true because triangles are 2D. The equation x²+y²=z² encodes the geometry of right triangles. Every mechanism that makes it work — the right angle, the trig identity, the rational parametrisation, the composition identity, the rotational symmetry — is provably absent for n≥3. The only thing left is pure coincidence, which Wiles rules out.

The deeper question — whether "no geometry means no solutions" can be proven as a general principle — is open. The x³+y³+z³=33 example shows that some equations appear to have "accidental" solutions with no known geometric origin. But appearances may be deceiving: the geometry may simply be hidden.

Mathematics is still deciding whether numbers are obedient to geometry, or whether they occasionally act on their own. For xⁿ+yⁿ=zⁿ, they are obedient — no geometry, no solutions. For a⁴+b⁴+c⁴=d⁴, they are also obedient — Elkies found the hidden geometry (elliptic curves on K3 surfaces) and the solutions followed.

Perhaps numbers never act on their own. Perhaps there is always geometry underneath. That is the conjecture this document ultimately proposes, and the question for the next century of mathematics.

Future direction: Elkies, K3 surfaces, and the geometry of cross terms

The discovery that Elkies' solution to a⁴+b⁴+c⁴=d⁴ comes from an elliptic curve on a K3 surface opens a new line of investigation. The cross terms in the Fermat equation are not merely obstacles — they encode geometric structure. For two-term equations (FLT), the cross terms define curves of genus ≥1 with no rational points. For three-term equations, they define surfaces that can contain rational curves.

The question: can we characterise EXACTLY when cross terms can be "tamed" by underlying geometry? This would unify FLT, Elkies, Waring's problem, and the sum-of-three-cubes problem into a single geometric framework.

This is where the story continues.