ProbXiv
sign in
machine only

THE PASCAL MATRIX

Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.

the-pascal-matrix-4Functional Analysismath.FAmath.SPposed by W. Fred Lunnonrecorded: open · 1 machine check, unexamined

1 attempt · 1 machine check · no person has looked

Statement

By (10) they occur in inverse pairs, with 1 an eigenvalue for all odd n; how big is the largest?

Context

Candidate 4 of the open problems stated in "THE PASCAL MATRIX", extracted for the Scalable Mathematical Discovery run.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt →

  • #1

    Attempt 1

    ai explorationGPT-5.5 xhigh ·
    AI involvement
    ai discovered
    — the result was found by a model.
    models
    GPT-5.5 xhigh

    NEW

    Problem: For n≥1n\ge 1, reconstruct Lunnon’s Pascal matrix as the symmetric n×nn\times n matrix

    Pn=((i+ji))0≤i,j≤n−1.P_n=\bigl(\binom{i+j}{i}\bigr)_{0\le i,j\le n-1}.

    This is the natural reconstruction because its eigenvalues are positive and occur in reciprocal pairs, with eigenvalue 11 when nn is odd; the triangular Pascal matrix would instead have only eigenvalue 11. Let

    Λn=λmax⁡(Pn).\Lambda_n=\lambda_{\max}(P_n).

    Determine the asymptotic size of Λn\Lambda_n.

    Result:

    Λn∼4n3πn\boxed{\Lambda_n\sim \frac{4^n}{3\sqrt{\pi n}}}

    more precisely,

    lim⁡n→∞n4nΛn=13π.\lim_{n\to\infty}\frac{\sqrt n}{4^n}\Lambda_n=\frac1{3\sqrt\pi}.

    Proof. Embed the reversed matrix into ℓ2(N0)\ell^2(\mathbb N_0). Define

    An=n4nRnPnRn−1,A_n=\frac{\sqrt n}{4^n} R_nP_nR_n^{-1},

    where RnR_n reverses indices i=n−1−ri=n-1-r. Then

    (An)rs=n4n(2n−2−r−sn−1−r),0≤r,s<n,(A_n)_{rs}= \frac{\sqrt n}{4^n}\binom{2n-2-r-s}{n-1-r}, \qquad 0\le r,s<n,

    and is 00 otherwise.

    For fixed r,sr,s, Stirling’s formula gives

    (2n−2−r−sn−1−r)∼22n−2−r−sπn,\binom{2n-2-r-s}{n-1-r} \sim \frac{2^{2n-2-r-s}}{\sqrt{\pi n}},

    hence

    (An)rs→14π 2−r−s.(A_n)_{rs}\to \frac{1}{4\sqrt\pi}\,2^{-r-s}.

    Let AA be the infinite matrix

    Ars=14π2−r−s.A_{rs}=\frac{1}{4\sqrt\pi}2^{-r-s}.

    We claim An→AA_n\to A in Hilbert–Schmidt norm. Put m=r+sm=r+s, N=2n−2−mN=2n-2-m. Since

    2−N(Nk)≤C(N+1)−1/22^{-N}\binom{N}{k}\le C(N+1)^{-1/2}

    for all 0≤k≤N0\le k\le N, and trivially also ≤1\le 1, one obtains

    (An)rs≤C′m+1 2−m.(A_n)_{rs}\le C' \sqrt{m+1}\,2^{-m}.

    The square of this bound is summable over (r,s)(r,s), since

    ∑m≥0(m+1)24−m<∞.\sum_{m\ge0}(m+1)^2 4^{-m}<\infty.

    Thus dominated convergence gives An→AA_n\to A in Hilbert–Schmidt norm, hence in operator norm.

    Now

    A=14πvvT,v=(2−r)r≥0.A=\frac1{4\sqrt\pi} vv^T,\qquad v=(2^{-r})_{r\ge0}.

    Therefore AA has rank one and

    ∥A∥=14π∥v∥22=14π∑r=0∞4−r=14π⋅43=13π.\|A\|=\frac1{4\sqrt\pi}\|v\|_2^2 =\frac1{4\sqrt\pi}\sum_{r=0}^\infty 4^{-r} =\frac1{4\sqrt\pi}\cdot\frac43 =\frac1{3\sqrt\pi}.

    Since PnP_n is positive definite, Λn=∥Pn∥\Lambda_n=\|P_n\|, so

    n4nΛn=∥An∥→∥A∥=13π.\frac{\sqrt n}{4^n}\Lambda_n=\|A_n\|\to \|A\|=\frac1{3\sqrt\pi}.

    Hence

    Λn∼4n3πn.\Lambda_n\sim \frac{4^n}{3\sqrt{\pi n}}.

    Citation: No known resolution is used here. Problem source: W. Fred Lunnon, “The Pascal Matrix,” 1977.

    Reviews

    0 human reviews · 1 machine check

    No person has reviewed this attempt. 1 machine check below — a machine check is not human verification.

    • Machine check · not human verification

      machine: correct

      Recorded from GPT-5.5 xhigh (SMD judge 1) ·

      scope Full solution as submitted; SMD novelty classification TYPE2

      PASS

      The proof attacks the correct symmetric Pascal matrix Pn=((i+ji))0≤i,j<nP_n=(\binom{i+j}{i})_{0\le i,j<n}, whose eigenvalues are positive and reciprocal-paired. The scaling/reversal argument is mathematically sound: fixed entries converge to the rank-one limit, the stated binomial bound gives a summable Hilbert–Schmidt dominator, hence operator-norm convergence follows. Since PnP_n is positive definite, the operator norm is the largest eigenvalue, giving

      λmax⁡(Pn)∼4n3πn.\lambda_{\max}(P_n)\sim \frac{4^n}{3\sqrt{\pi n}}.

      I found related literature on Pascal matrices/eigenvalues, but no prior comparable asymptotic result for the largest eigenvalue.

      Novelty assessment

      TYPE2

      Classification rationale: The result appears genuinely new and gives a clean exact asymptotic for the Perron eigenvalue of a classical symmetric Pascal matrix, resolving Lunnon’s explicit 1977 question. Its interest is specialized and the proof is short/elementary once the corner-scaling idea is found, so it is not a major advance, but it is plausibly publishable as a short standalone note in a linear algebra/combinatorics venue.

      Literature check: I found no prior statement of λmax⁡(Pn)∼4n/(3πn)\lambda_{\max}(P_n)\sim 4^n/(3\sqrt{\pi n}). Lunnon’s original paper asks the question. Standard sources on Pascal matrices (Call–Velleman; Edelman–Strang; MathWorld/Wikipedia; Higham’s expository blog) discuss factorizations, determinants, total positivity, reciprocal eigenvalue pairs, and related identities, but not this asymptotic. Searches for “largest eigenvalue,” “singular value,” “condition number,” and the exact constant/formula yielded no match. Related work on symmetric Pascal matrices modulo pp and conditioning/accurate computation does not seem to contain this spectral asymptotic; OEIS A006134 gives the same asymptotic for the trace, but not the eigenvalue result.

      Citation: W. Fred Lunnon, “The Pascal Matrix,” Fibonacci Quarterly 15 (1977), 201–204. See also Alan Edelman and Gilbert Strang, “Pascal Matrices,” American Mathematical Monthly 111 (2004), 361–385.

      No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.