xˣ = y, by fractions
It began with one picture, xˣ = 64. The equation has one real root, and no fraction equals it. What a fraction can do is trap it: one fraction on either side, each side one comparison of two whole numbers, decided exactly. An AI model computed the root for every y to a thousand and proposed the traps; claimbox stated them as claims; this page decides every side again with code of its own and reads what the fractions show.
Decided here: every side of every trap the study proposed, the four whole-number roots from both sides, and the eight claims about xˣ = 64, each by one exact comparison of integers (certs/xx-ledger.json, tools/run-xx-ledger.py). claimbox’s words are shown beside ours. Computed and not decided: the roots’ digits, their continued fractions, the closest fractions and every statistic. Proved in Lean and checked by two kernels: that the root is unique and that a fraction bounds it exactly when one integer exceeds another (certs/xx-reduction-lean.json). Read and not decided: the negative-base convention. Refused: one claim of our own, that the root of 64 is transcendental. Cited and not decided: the Gelfond–Schneider theorem.
x = ln 64 / W(ln 64), where W is Lambert’s function. That form describes the number; it decides nothing. The decimals below are decided by two fractions.
| what | the number | decided here | claimbox’s record |
|---|---|---|---|
| the root, computed | 3.39912154005228331235329865137612775126497803353051 | — | — |
| below it | x > 458912/135009 | CERTIFIED | CERTIFIED |
| above it | x < 400097/117706 | CERTIFIED | CERTIFIED |
| so, printed outward | 3.399121540 < x < 3.399121541 | CERTIFIED | — |
xˣ grows for x above 1, so x is above a fraction p/q exactly when (p/q)p/q is below 64, that is, when pp is below 64q·qp. For the fraction below, each side of that comparison is a whole number of 2,598,236 digits. The recorder computes both exactly and compares them; the step from x to the comparison is proved in Lean and checked by two kernels (§4).
The two fractions are neighbouring convergents of the root’s continued fraction, [3; 2, 1, 1, 44, 1, 14, 4, 1, 6, …]: the closest fractions for their size, on opposite sides of x. Its large fifth quotient is why 775/228, with a denominator below a thousand, is already off by only 1.266965e-06.
| the claim about xˣ = 64 | origin | each side, digits | decided here | claimbox’s record |
|---|---|---|---|---|
| x > 33991/10000 | proposed | 154,026 and 154,026 | CERTIFIED | CERTIFIED |
| x < 4249/1250 | proposed | 15,417 and 15,417 | CERTIFIED | CERTIFIED |
| x > 4249/1250 | planted wrong | 15,417 and 15,417 | REFUTED | REFUTED |
| x < 33991/10000 | planted wrong | 154,026 and 154,026 | REFUTED | REFUTED |
| x > 58815/17303 | proposed | 280,518 and 280,518 | CERTIFIED | CERTIFIED |
| x < 47207/13888 | proposed | 220,646 and 220,646 | CERTIFIED | CERTIFIED |
| x > 458912/135009 | proposed | 2,598,236 and 2,598,236 | CERTIFIED | CERTIFIED |
| x < 400097/117706 | proposed | 2,241,410 and 2,241,410 | CERTIFIED | CERTIFIED |
| x is transcendental | cert-machine’s own | no comparison | REFUSED | — |
The first two rows are the AI’s four-decimal proposal; the planted rows move it one unit in the last decimal, the wrong way, and are refuted. A refutation here is a comparison of two numbers, so it has no witness point to draw.
The last row is cert-machine’s own claim, and it is refused. This decider answers one question: does the root lie above or below a given fraction, by one comparison of two whole numbers. "Transcendental" says the root is a root of no polynomial with integer coefficients: infinitely many polynomials, not one comparison, and no number of decided brackets reaches it. It is true: the root is not a fraction (p/q in lowest terms with q > 1 would give pp = 64q·qp, which q cannot divide, and no whole k has kk = 64), and an irrational algebraic x would make xˣ transcendental by the Gelfond–Schneider theorem, while 64 is not. That theorem is cited, not decided here (§3, one). What would make it decidable. A kernel-checked proof: the Gelfond–Schneider theorem formalized (Mathlib at the pin of lean/xx-reduction, d13f23b7, holds no Gelfond–Schneider theorem), then the two-line argument above in Lean on top of XXReduction.existsUnique_root. With that, it is a theorem to check, not a comparison to compute. claimbox stated no such claim; it is the one row of this page that is not claimbox’s.
Each dot is the root of xˣ = y. A solid dot is trapped between fractions decided here; a hollow dashed one is computed only. The large dots are the roots that are whole numbers.
For y up to 100, the bar is the number of decimal places on which the two decided fractions agree: those decimals of the root are decided. The dashed line is how many decimals the closest fraction with a denominator of at most 1,000 shares with the computed root. Where the root is a whole number, the bar reaches the top line, labelled exact.
Each column is one root, for y from 2 to 400; each row is a partial quotient, the first at the top. The brighter a cell, the larger the quotient, and a large quotient means the convergent before it is an unusually good fraction. Near 27 and 256 the bright cells pile up at the top: there, the whole number is the fraction.
| y | the root x | closest fraction, q ≤ 1,000 | its error | the bracket | both sides: here · claimbox |
|---|---|---|---|---|---|
| 2 | 1.559610469462… | 641/411 | 2.361337e-07 | 471/302 < x < 641/411 | CERTIFIED CERTIFIED |
| 3 | 1.825455022925… | 502/275 | -4.774703e-07 | 502/275 < x < 387/212 | CERTIFIED CERTIFIED |
| 4 | 2 | 2/1 | 0 | x ≥ 2 and x ≤ 2 | CERTIFIED CERTIFIED |
| 10 | 2.506184145589… | 203/81 | -1.130608e-05 | 203/81 < x < 198/79 | CERTIFIED CERTIFIED |
| 27 | 3 | 3/1 | 0 | x ≥ 3 and x ≤ 3 | CERTIFIED CERTIFIED |
| 64 | 3.399121540052… | 775/228 | 1.266965e-06 | 758/223 < x < 775/228 | CERTIFIED CERTIFIED |
| 100 | 3.597285023540… | 795/221 | 4.433289e-08 | 259/72 < x < 795/221 | CERTIFIED CERTIFIED |
| 255 | 3.998359701237… | 2439/610 | 9.545011e-07 | 2435/609 < x < 2439/610 | CERTIFIED CERTIFIED |
| 256 | 4 | 4/1 | 0 | x ≥ 4 and x ≤ 4 | CERTIFIED CERTIFIED |
| 257 | 4.001633623636… | 2449/612 | 3.632923e-07 | 4 < x < 2449/612 | CERTIFIED CERTIFIED |
The root, the closest fraction and its error are the proposer’s, computed. The bracket is decided here, both sides; the first word is this page’s and the second claimbox’s record, each the same on both sides.
Read from the computed roots. The brackets are decided; the patterns below are observations on computed numbers, and each is labelled as one. The first is a theorem, cited.
The root is a whole number exactly at y = 4, 27, 256 and 3,125, and each is pinned from both sides: x ≥ k and x ≤ k, both certified here. For every other whole y the root is not even algebraic. If it were a fraction p/q in lowest terms with q above 1, then pp = yq·qp, which q cannot divide; if it were an irrational algebraic number, xˣ would be transcendental by the Gelfond–Schneider theorem. That theorem is cited, not decided here, which is why the claim of §1’s last row is refused. So 4 roots are fractions, and every other one is a number no fraction will ever equal.
Just off kᵏ the root sits just off k, by about 1/(kᵏ(1 + ln k)), the reciprocal of the slope of xˣ at k. Its continued fraction says so with one huge quotient: at y = 255 it is 608, where the slope predicts 610.9; at y = 3,126 it is 8,155, against 8154.5. The closest fraction there is the whole number k.
Pool the partial quotients of all the irrational roots and they follow the law that almost every real number obeys: a quotient of 1 occurs 0.41162 of the time, against the law’s 0.41504. Their geometric mean is 2.6729, against Khinchin’s constant 2.6855, and (ln qn)/n averages 1.1777, against Lévy’s 1.1866. These are observations on 1,002 computed roots, not a proof.
A large partial quotient makes the convergent just before it unusually close. The largest found is 4,651,670, in the root for y = 709. Its convergent sits closer to the root than a fraction of its size usually can. For y = 100, the fraction 795/221 is already off by only 4.433289e-08.
| y | position | partial quotient (computed) | the convergent just before it (computed) |
|---|---|---|---|
| 709 | 22 | 4,651,670 | 20921543179/4735484816 |
| 419 | 32 | 35,362 | 13411503747543/3189935931869 |
| 621 | 26 | 24,682 | 433820684589981/99395501124953 |
| 101 | 29 | 16,855 | 927575580554664451/257542007895192516 |
| 441 | 28 | 8,503 | 216551952620850577/51251230167401757 |
| 3,126 | 1 | 8,155 | 5/1 |
What the decisions rest on. Each verdict above is an exact integer comparison, and the step from the root to that comparison is decided: proved in Lean 4 with Mathlib (lean/xx-reduction). For a whole N ≥ 2, xˣ = N has exactly one positive real root (XXReduction.existsUnique_root), and for whole numbers 1 ≤ q ≤ p it lies above p/q exactly when pp < Nq·qp (XXReduction.lt_root_iff; XXReduction.le_root_iff, XXReduction.root_lt_iff and XXReduction.root_le_iff for the other three comparisons, XXReduction.natCast_le_root_iff and XXReduction.root_le_natCast_iff for a whole number). Every one of the 15 theorems passes Lean’s kernel inside lake build, Lean’s kernel again inside Comparator on a fresh runner, and nanoda, a kernel written independently of Lean’s (run 41221355209), and depends on no axiom beyond propext, Classical.choice and Quot.sound. A fraction the study proposed is above 1 in lowest terms, so 1 ≤ q < p; a whole-number bound is q = 1: every comparison on this page is inside the theorems. What is left is read or cited:
What is not claimed. That the computed digits are right beyond the decided ones; that the observations of §3 are theorems; that the root of 64 is transcendental (true, cited, refused here); anything about a y the study did not decide. The study’s numbers are a proposer’s, and this page draws them dashed.
Re-run: python3 -I tools/run-xx-ledger.py --check · make drift (the copies against claimbox) · in claimbox: python3 -m claimbox check corpus/xxy/claims.claim --run · the Lean proof: .github/workflows/xx-reduction.yml on GitHub Actions, recorded by node tools/record-xx-reduction.js <run>.