Paper IXReading edition

What this final edition establishes

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

What this final edition establishes

The original external problem is Nishibuchi's Conjecture 3.9 for generalized Euler numbers. Its full parameter range is resolved. If \(p\) is prime, \(m\) is positive with \(m\mid p-1\) or \(m=2\), \(0\le j<mp\), and \(q=\operatorname{lcm}(2,p-1)\), then the original Euler coefficients are \(p\)-adically integral and

\[ E_{mpn+qp^r}^{(mp,j)}\equiv E_{mpn}^{(mp,j)}\pmod{p^r} \qquad (r\ge1,\ n\ge r). \]

The paper states the generating function and the conversion between ordinary degree and packet row before using this formula. The normalized coefficient is \(C_{N,j}(n)\) and the original coefficient is \(E_{Nn}^{(N,j)}=j!C_{N,j}(n)\). The constant coefficient of the original series is \(j!\).

The strongest common-step conclusion in width four is particularly compact. For \(n\ge0\) and \(k,H\ge1\),

\[ \sum_{i=0}^k(-1)^{k-i}\binom ki E_{4(n+iH)}^{(4,j)} \equiv0\pmod{2^{\,v_2(k!)+kv_2(H)+A_j(k)}}, \]

where

\[ A_0(k)=A_1(k)=k,\qquad A_2(k)=\max\{k+4,\,2k+\lfloor k/2\rfloor+1\},\qquad A_3(k)=k+2. \]

There is no starting-row threshold. The exponent is exact in addresses zero and one for every order and positive step. It is exact in address two at every power-of-two order. The proof chapters also give mixed-step forms, the cancellation criterion in addresses zero and one, and exact first-displacement laws.

What this final edition establishes — table 1
ResultScopeEvidence in this edition
Nishibuchi Conjecture 3.9Every parameter in the original statement; explicit \(n\ge r\)Inherited Lean proof
Width-four all-row common-step bound, first differences, least periods and isometryEvery address, row and positive displacementInherited Lean proof
General prime-power inverse transfer and mixed stepsEvery prime-power width; signed steps for odd primesWritten proof and audit
Factorial gains and exact higher-order familiesFour width-four addresses, with stated sharpness scopesWritten proof and audit
Taylor radii and broader dyadic first differencesExact radii in addresses \(0,1,2\); stated all-rank casesWritten proof and audit
Ordinary Euler tail simplicityPartial families and an explicit remaining discriminant problemOpen in full generality

The complete earlier Paper IX development follows alongside the strengthening. Dated appendices retain the original continuation arguments and recovered historical text. Statements about an earlier open target or an earlier build remain records of that checkpoint; the current theorem and scope statements govern this edition. The Lean companion supplies the exact formal source map and distinguishes source reconciliation from compiler execution. The visual guide supplies exact finite examples and theorem-derived diagrams.

This is a project publication under the name Komorebi P. The recorded parallel proof audits are internal computational-assistant reviews. They are not external peer review. The edition makes no claim of journal acceptance, external certification, or global historical priority.

Source and conversion record

Source SHA-256: 960dd29deed6998f8643a0ffc568aa162ffb5fcf90677c5a6b1a34038a0b5c93

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Paper IX

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index