Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
slug: oeis-a091190-somos-prime-integrality
bibkey: hanna2004a091190
doi: null
url: https://oeis.org/A091190
triage: theorem
motivation_gids:
  - D5/S1/Recurrence/Invariants/SomosPrimeIntegrality

The Somos prime integrality family in OEIS A091190/A091200

Problem

More generally, given A(x) satisfies xA(x)^p = B(xA(x^p)) where B(x) = x/(1-p*x), then it appears that A(x) is an integer series only when p is prime.

For every natural , a rational solution with exists for , where . Every such solution has integer coefficients if and only if is prime. The coefficientwise expression for is inlined in IsGF.

Statement echo

Source clauseLean counterpartFidelity
xA(x)^p = B(xA(x^p))IsGF preserves the outer and inner substitutionsexact registered convention
B(x)=x/(1-p*x)IsGF inlines coefficient zero at n=0 and p to the power n-1 otherwiseexact registered convention
offset-zero first term oneIsGF requires constant coefficient oneexact registered convention
integer only when primeclaim proves equivalence with primality for every normalized solutionexact registered convention
exponents in the registered domainclaim requires p at least two and asserts rational existenceexact registered convention

Motivation

The externally stated OEIS conjecture is preregistered in #18793. The settling declaration is D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result; its admission basis is open-problem-resolution (#18793; Proved).

Gap

The preregistration records the OEIS source and literature screen. The checked entries cite no proof. Literature-screen completeness is ASSUMED-UNVERIFIED. The mathematical gap is discharged by the settling declaration under the displayed coefficient rings and normalizations.

Route

The geometric denominator identity gives the residual . Prime Frobenius congruence makes integral corrections possible through the shared lifting construction. At a composite exponent the low-degree differential recurrence gives a contradiction modulo the least prime divisor. General.prime_of_integral is the necessity step used by result.

Falsifier

A prime exponent with a nonintegral normalized solution or a composite exponent with an integral normalized solution contradicts result.

Evidence

The Lean module and its Blueprint Scribe carry the exact statement. The axiom closure is contained in {propext, Classical.choice, Quot.sound}. The frozen module record is Golden/Frozen/state/D5/S1/Recurrence/Invariants/SomosPrimeIntegrality.lean.json. Escape audit unfinished: #19794; no compiled registration is delivered.

Publicized owner audit targets under #19794: D5.S1.Recurrence.Invariants.AbsoluteReciprocalGeometricParity.agree_mul; D5.S1.Recurrence.Invariants.CubicFifteenSubstitutionParity.agree_iff; D5.S1.Recurrence.Invariants.CubicFifteenSubstitutionParity.agree_pow; D5.S1.Recurrence.Invariants.CubicFifteenSubstitutionParity.agree_subst_order; D5.S1.Recurrence.Invariants.CubicFifteenSubstitutionParity.power_two_one. Four-slot registration is unfinished for each target.

Experiment

Pinned experiment. Command: python3 check.py in that directory; exit 0; script SHA-256 4af4904971adab029c3b7b91644f6a4ab789f41c203eff909726101f246257e5.

Computed: for prime , integrality holds through order 14 when and through order 8 otherwise. For composite , the first noninteger coefficient occurs at the least prime factor and equals . At the value is . The first 14 terms match A091190 and A091200.

Declaration classification

Same-delivery helpers are expanded for classification; consumed bind-only helpers are proof organization. The table names live consumers and the surviving construction or induction witness.

Declarationproof_shapeescape_witnessDirect proof-value consumers
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.IsGFbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.claim, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.isGF_iff, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.claimbind-onlynone
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.subst_one_seriesbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.low_order, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_base, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.isGF_iff
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residualbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_integral, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_rational, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_solution_of_correction, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.low_order, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.low_recurrence, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.map_residual, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.prime_of_integral, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_agree, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_base, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_divisible, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_top, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.unique, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.isGF_iff, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.twist_agreebind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_agree, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_top
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.unit_power_topbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_top
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_agreebind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_solution_of_correction
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_topbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_solution_of_correction, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.unique
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_basebind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_solution_of_correction
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_solution_of_correctioncontentD5.S1.Recurrence.Invariants.HannaPrimeSubstitutionIntegrality.General.Lifting.exists_liftedD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_integral, D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_rational
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.uniquecontentD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.uniqueD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.residual_divisiblebind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_integral
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_integralcontentD5.S1.Recurrence.Invariants.HannaPrimeSubstitutionIntegrality.General.Lifting.exists_liftedD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.exists_rationalcontentD5.S1.Recurrence.Invariants.HannaPrimeSubstitutionIntegrality.General.Lifting.exists_liftedD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.B_equationbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.isGF_iff
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.isGF_iffbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.map_residualbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.low_orderbind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.low_recurrence
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.low_recurrencebind-onlynoneD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.prime_of_integral
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.prime_of_integralcontentD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.prime_of_integralD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.result
D5.S1.Recurrence.Invariants.SomosPrimeIntegrality.resultcontentD5.S1.Recurrence.Invariants.SomosPrimeIntegrality.General.prime_of_integral

Triage

ItemStatusEvidence kind
Rational existence and integrality iff primality (#18793)provedkernel-checked result
The same lifting mechanism for Hanna (#18792)provedkernel-checked HannaPrimeSubstitutionIntegrality.result
Cubic dyadic parity (#18788)provedkernel-checked HannaA377106ParityReversion.result
First failure at the least prime factor for composites up to 30computedpinned experiment; exact scope above
Uniform first-noninteger coefficient formulaopennot a statement of a delivered theorem
General Somos equation for other Bopenoutside the registered claim
Mathematical remaining goals for the three registered settlementsprovedthe three result declarations discharge the registered claims

What the settlement shows

Proved in Lean: the assertion covers every exponent and every normalized rational solution, with rational existence for all those exponents and both directions of integrality iff primality. The low-degree obstruction supplies the necessary direction. A uniform location or formula for the first noninteger coefficient remains outside the formal conclusion.

ASSUMED-UNVERIFIED

Literature completeness and originality are not established. The other source families and uniform extensions marked open above are outside this settlement. Four-slot escape registration remains unfinished under #19794.