Repository navigation
Theta-recurrence family with interlacing rows (A141689 block, #2513) - #2524
Merged
Merged
Conversation
…step 1 of #2513) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…rturbation # Conflicts: # scripts/import_architecture.json
…2 (step 4 of #2513) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…2513) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…e value for n >= 5 Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…oted polynomial Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…2513, centered form) Adds Polynomial.roots_of_sign_changes, the small-degree critical value bound (from a Codex worker, merged into OrbitPerturbation with the existing row lemmas), and centeredEulerOrbit_add_monomial: for alpha >= 1/2 and -1 < b <= 1 the rows p n + b X^n have simple roots in (-1, 1) and interlace strictly. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
strictInterl_of_orbitPerturbation_recurrence: for s >= 1 and kappa >= s + 4, any sequence with Q 0 = 1, Q 1 = 2u + 1, Q 2 = kappa u^2 + kappa u + 1 and the three-term theta-recurrence of #2513 has simple roots in (-1, 0) and strictly interlacing consecutive rows. Covers A141689, A141690, A141696, A141697 and A147565 after the Eulerian Moebius substitution. Catalog page tagged realrooted-original. Closes #2513. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Cayley transform shim: cayleyTransform_X_pow, cayleyTransform_succ, cayleyTransform_succ_X_mul and cayleyTransform_X_mul_derivative (the Euler operator under the transform). cayleyEulerOrbit and its recurrence E (n+1) = (1 + (1 + s n) X) E n + s X (1 - X) E n' (Eulerian polynomials for s = 1); splits_C_mul_add_C_mul_one_add_X_pow_of_recurrence: for s >= 1 and c >= 1/2 the rows c E n + (1 - c) (1 + X)^n are real-rooted. This is the form matching the downstream models of A141689, A141690, A141696, A141697 and A147565. The (alpha, r) package orbitPerturbationRow_package is split off the (s, kappa) theorem. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…dule Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Closes #2513.
Theorem (
RealRooted.strictInterl_of_orbitPerturbation_recurrence). Lets ≥ 1andκ ≥ s + 4, and letQsatisfyQ 0 = 1,Q 1 = 2u + 1,Q 2 = κu² + κu + 1and, forn ≥ 0,Then every
Q nhas simple roots in(−1, 0)andStrictInterl (Q n) (Q (n+1)). This is the issue's recurrence multiplied byn − 2and shifted by 3. Applications: A141689 (1,5), A141690 (1,8), A141696 (1,10), A141697 (1,18), A147565 (2,6).Proof (fully checked; axioms
propext,Classical.choice,Quot.soundonly):centeredEulerOrbit_critical_values(n ≥ 5, via the inverse Bernstein inequality of The inverse Bernstein inequality for polynomials with large critical values #2522/Alternating values bound every critical value #2523) andcenteredEulerOrbit_small_critical(n ≤ 4; explicit rows, drafted by a Codex worker and merged into the existing row lemmas).Polynomial.roots_of_sign_changes: a degree-npolynomial withnsign changes has exactly one simple root per interval, with the sign of the derivative there.strictInterl_centeredEulerStep_add_monomial/centeredEulerOrbit_add_monomial: forα ≥ 1/2and−1 < b ≤ 1,h n = p n + b X^nhas simple roots in(−1, 1)andh n ≺ h (n+1)(Ma–Wang root-sign criterion withh (n+1) = X h n + α(X² − 1) p n').orbitPerturbationRow_recurrenceand the transferx = 2u + 1,Q n = r p n + (1 − r) x^n,r = (κ − 4)/(2s).Eulerian form (
RealRooted.splits_C_mul_add_C_mul_one_add_X_pow_of_recurrence, new fileOrbitPerturbationCayley.lean): fors ≥ 1,c ≥ 1/2,E 0 = 1andE (n+1) = (1 + (1 + s n) X) E n + s X (1 − X) E n', everyc E n + (1 − c)(1 + X)^nsplits. This is the Cayley transform of theQ n(new shim lemmascayleyTransform_X_pow,cayleyTransform_succ,cayleyTransform_succ_X_mul,cayleyTransform_X_mul_derivative); fors = 1theE nare the Eulerian polynomials, matching the downstream modelsc · A173018 (n+1) − (c − 1)(1 + X)^n.Catalog page
centered-euler-orbit-perturbation(tagrealrooted-original, cites Erdélyi–Hardin–Saff arXiv:1307.4056).Local checks: focused Lake builds of the four touched modules and the catalog page,
runLinteron each, root imports, module system, import architecture (budgets +4), proof status, catalog audit and tests.🤖 Generated with Claude Code