{"id":"d3328404-18a7-45e7-b214-9824359ffc9f","arxiv_id":"2411.16881","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A construction of orthogonal polynomials on bubble-diamond fractals is given, together with a proven three-term recursion formula.","lead":"This paper constructs analogs of Legendre orthogonal polynomials on a family of self-similar fractal sets called bubble-diamond fractals. It proves these polynomials satisfy a three-term recursion formula, extending fractal harmonic analysis beyond previously studied examples.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.7's three-term recursion is indexed off by one: Green's operator raises multiharmonic degree by one, so g_{j+1} involves P_{j+2}, not just p_{j+1}; the b=1 case contradicts (4.9).","rationale":"The reader's weakest_assumption concerns Proposition 3.2, whose proof indeed only shows membership in H_j and does not establish the claimed dimension and boundary representation. That is a genuine gap in the construction of the multiharmonic basis. However, it is not the most load-bearing problem with the paper's central claim: even if Proposition 3.2 were fully proved, Theorem 4.7 would still fail because the recursion is indexed incorrectly. The paper's reindexing P_{2j+k}=P_{jk} makes P_n an element of H_{floor(n/2)}, so the orthogonal polynomial p_j has multiharmonic degree floor(j/2). The Green operator, being the inverse of the Laplacian, raises multiharmonic degree by exactly one, moving from the space spanned by P_j to the space spanned by P_{j+2} (and P_{j+3}, depending on parity). Thus g_{j+1} cannot be expressed using only p_{j+1}, p_j, and p_{j-1}; it requires p_{j+2}. The b=1 calculation is a direct counterexample using the classical interval case, which the paper explicitly claims to recover. This is an internal inconsistency, not a disagreement with external consensus, and it invalidates the main theorem as stated. The numerical code and figures are useful supporting material, but they cannot repair a false algebraic claim. For these reasons the verdict should be REJECT, or at minimum the paper must be substantially revised so that the recursion is stated with the correct index shift and the normalization condition a=1 is rederived.","tokens_in":14106,"tokens_out":16093,"duration_ms":134891,"concrete_test":"For b=1, compute explicitly on [0,1]: set p_0=1 and p_1=1/2-x, let G(x,y)=x(1-y) for x<=y and y(1-x) for y<=x, and compute g_2(x)=-\\int_0^1 G(x,y)p_1(y)dy = -x^3/6 + x^2/4 - x/12. Expand g_2 in the Gram-Schmidt basis {p_0,p_1,p_2,p_3}. If the coefficient of p_3 is nonzero, then g_2 is not in span{p_0,p_1,p_2}, contradicting (4.9) for j=1. This single analytic check settles the indexing flaw in Theorem 4.7.","verdict_should_be":"REJECT","load_bearing_attack":"The central claim is the three-term recursion in Theorem 4.7, but its proof uses an inconsistent notion of degree. Under the paper's own reindexing P_{2j+k}=P_{jk}, the monomial P_n lies in H_{floor(n/2)}; hence the Gram-Schmidt polynomial p_j lies in H_{floor(j/2)}. Since Delta g_{j+1}=p_j, the function g_{j+1} lies in H_{floor(j/2)+1}, not in H_{j+1} and not in span{P_0,...,P_{j+1}} in the scalar index. The proof asserts that \"g_{j+1} can be expressed as a sum of P_{j+1} and lower order terms\"; this is off by one: the lowest scalar-index basis elements of H_{floor(j/2)+1} are P_{j+2} and P_{j+3} (for even j), so g_{j+1} generally has a nonzero p_{j+2} component. Consequently the expansion (4.12) is missing at least p_{j+2}, and the conclusion a=1 is not justified. The defect is concrete: for b=1 (the unit interval), p_0=1, p_1=1/2-x, and g_2=-\\int_0^1 G(x,y)p_1(y)dy = -x^3/6 + x^2/4 - x/12, which has a nonzero p_3 component. Theorem 4.7 for j=1 claims g_2=p_2+s_1p_1+t_1p_0, an expression involving only polynomials of degree at most 2, impossible for this cubic g_2. Thus the theorem as stated is false, not merely unproven.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a theory of polynomials and orthogonal polynomials on the bubble-diamond fractals K_b, a family of p.c.f. self-similar fractals with branching parameter b. The authors define monomials as multiharmonic functions (solutions of Δ^{j+1}u=0), compute their inner products through recursive coefficient formulas, apply Gram-Schmidt orthogonalization to obtain an orthonormal family, and claim that this family satisfies a three-term recursion of Legendre type. The main result is Theorem 4.7, which asserts that the antiderivative g_{j+1} of the j-th orthogonal polynomial is expressible as a three-term linear combination of p_{j+1}, p_j, and p_{j-1}.","tokens_in":14469,"tokens_out":13601,"duration_ms":105794,"significance":"If correct, the construction would give an explicit, computable orthogonal polynomial system on a class of fractals with varying spectral dimension, with recursion coefficients computed from inner products and norms rather than fitted. The paper includes reproducible Python code and illustrative figures. However, the central three-term recursion theorem contains a fundamental degree/indexing error: in the b=1 (unit interval) limit it is already false. Several foundational structural claims, notably Proposition 3.2 and Theorem 4.3, are also under-proved. Because the theorem is the paper's main advertised result, the error is load-bearing and cannot be fixed by local revisions.","major_comments":[{"comment":"The three-term recursion is invalid because of an off-by-one degree error. Since Δ g_{j+1} = p_j and p_j is a linear combination of P_0,...,P_j with P_n ∈ H_{⌊n/2⌋}, we have p_j ∈ H_{⌊j/2⌋}; hence g_{j+1} ∈ H_{⌊j/2⌋+1}, not H_{j+1} as claimed in (4.8). Consequently the expansion (4.12) of g_{j+1} over {p_ℓ}_{ℓ=0}^{j+1} is not justified; components p_{j+2} and p_{j+3} can be nonzero. A concrete counterexample occurs for b=1, the unit interval: p_1(x)=1/2−x, and g_2(x)=−∫_0^1 G(x,y)p_1(y)dy = −x^3/6 + x^2/4 − x/12, which is a cubic polynomial. The claimed identity g_2 = p_2 + s_1 p_1 + t_1 p_0 is impossible because p_2 is at most quadratic, p_1 linear, and p_0 constant. Thus Theorem 4.7 is false as stated, and the proof's conclusion that a=1 in (4.12) does not follow.","section":"Theorem 4.7, Eqs. (4.7)–(4.12)"},{"comment":"The proof that {f_{mk}} is a basis for H_j is incomplete. The sentence 'The first part follows by observing that both sides of (3.1) belong to H_j' only shows that the right-hand side is a function in H_j with the specified boundary data; it does not show that the boundary-value map is surjective onto H_j, nor that the functions f_{mk} are linearly independent. Since this structural result is used repeatedly (e.g., to justify the dimension of the polynomial spaces and the recursive coefficient formulas in Theorems 3.3 and 3.4), a complete proof is needed. The citation to [11] may supply the argument for the Sierpinski gasket, but the bubble-diamond case requires verification.","section":"Proposition 3.2"},{"comment":"The recursive formulas for α_j, β_j, η_j, γ_j are stated without proof, with the note that they are 'derived from the same method as [8, Theorem 2.3, Theorem 2.12].' These formulas are load-bearing: they determine the monomials P_{jk} on V_* through (4.1), and all subsequent inner products and Gram-Schmidt coefficients depend on them. The manuscript gives no derivation or indication of how the formulas adapt from [8] to the bubble-diamond setting, leaving the reader unable to check the construction.","section":"Theorem 4.3, Eq. (4.3)"},{"comment":"The assertion that G(p,q) = lim_{ℓ→∞} G_ℓ(p,q) 'can be continuously extended to a function on K_b × K_b' is not proved. The Green function is used in Proposition 2.11 to solve the Dirichlet problem and in Theorem 4.7 to define g_{j+1}; without a proof of existence, continuity, and uniqueness of the extension, the analytic foundation for these results is incomplete. At minimum the manuscript should justify the limit and the extension, citing a theorem or providing an argument.","section":"Definition 2.10"}],"minor_comments":[{"comment":"The indexing is inconsistent: the Gram-Schmidt process is applied to {P_j}_{j≥1}, but p_0 = P_0, and the reindexing P_{2j+k}=P_{jk} does not define P_0 for k=1,2. Please clarify the scalar indexing of P_n and the two-parameter notation P_{jk}.","section":"Definition 4.5"},{"comment":"The definition of p_ℓ is confusing: it uses 'i ≠ k' and then 'for i, k, n distinct'. Please clarify which indices are summation indices and which are fixed, and whether the value depends on the choices.","section":"Eq. (3.5)"},{"comment":"The proof states '∆ P_{(j+1)k} = P_{jk}' without comment. This identity is reminiscent of differentiation of monomials in the classical case, but for the two types k=1,2 it needs a precise derivation in the bubble-diamond setting, especially since the boundary conditions in Definition 4.1 involve normal derivatives.","section":"Proposition 4.2"},{"comment":"The link to the Python code is welcome, but the manuscript should state whether the figures are generated from the recursive formulas of Theorems 3.3, 3.4, and 4.3 or directly from the Gram-Schmidt construction; this would help the reader assess which parts of the implementation are independent of the claims.","section":"Section 5"}],"recommendation":"reject","confidential_remarks":"The off-by-one error in Theorem 4.7 is decisive: the b=1 case is an explicit computation that contradicts the theorem, so the central advertised result does not hold. Even if the paper were reorganized around a weaker or corrected claim, the structural gaps in Proposition 3.2 and Theorem 4.3 would require major additional work. The authors may wish to investigate whether a correct recursion exists for a different operator (e.g., multiplication by a harmonic coordinate) or for the two-parameter family p_{j,k}, rather than for the Green's antiderivative g_{j+1}."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe headline result—the three-term recursion in Theorem 4.7—does not survive contact with b=1. On the unit interval the construction should reproduce classical Legendre polynomials. p_1 is x-1/2. The Green's anti-derivative g_2 is -∫ G(x,y)(y-1/2)dy, which evaluates to x^3/6 - x^2/4 + x/12, a cubic with a nonzero p_3 component. Theorem 4.7 for j=1 claims g_2 = p_2 + s_1 p_1 + t_1 p_0, all of degree at most 2. That is impossible. The same issue appears at j=0: g_1 is quadratic while the claimed expansion is linear.\n\nThe root cause is an indexing error. With P(2j+k)=P_{jk}, the monomial P_n lies in H_{floor((n-1)/2)}, and the Gram-Schmidt polynomial p_j lies in H_{floor(j/2)}. Since Δ g_{j+1}=p_j, the anti-derivative g_{j+1} lies in H_{floor(j/2)+1}, not in H_{j+1} as the paper asserts. The space H_{floor(j/2)+1} contains two basis functions per multiharmonic level, so its lowest single-index components are around j+2 and j+3, not j+1. The expansion (4.12) is missing at least p_{j+2}. The proof's statement that 'g_{j+1} can be expressed as a sum of P_{j+1} and lower order terms' is off by one (or more).\n\nWhat the paper does well: the monomial construction via the scaling identity (4.1) and the recursive coefficient formulas (4.3) are new for bubble-diamond fractals, and the Gram-Schmidt construction of orthonormal polynomials is well-defined if one accepts the existence and boundary representation of the spaces H_j. The paper clearly extends the Sierpinski gasket framework. The numerical figures look plausible.\n\nThe softer spots are secondary: Proposition 3.2's proof is one sentence and does not establish surjectivity or linear independence; Theorem 4.3's recursive formulas are asserted without derivation; the continuous extension of Green's function is stated without proof. These could be fixed with references or added lemmas. But the three-term recursion is not a missing proof—it is a false statement.\n\nMy take: the paper has a solid core of monomial and orthogonal polynomial construction, but the advertised recursion is wrong. A serious referee would be needed to sort out whether a corrected recursion (likely involving p_{j+2}) can be established. As it stands, Theorem 4.7 should not be accepted. I would send it to review to get the indexing fixed, because the underlying construction is worth salvaging.","headline":"The three-term recursion in Theorem 4.7 is off by one and false as stated—on the unit interval it already fails at j=0 and j=1—though the monomial and orthogonal polynomial construction on bubble-diamond fractals has real content worth salvaging.","tokens_in":35,"tokens_out":13201,"would_cite":false,"duration_ms":290366,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["42C05","28A80","33F05","33A99"],"pacs":[],"model":"deepseek-v4-flash","headline":"On every bubble-diamond fractal, explicit Legendre-type polynomials obey a three-term recursion.","keywords":["spectral graph theory","Legendre orthogonal polynomials","pcf fractals","bubble-diamond fractals","multiharmonic functions","three-term recursion","fractal Laplacian","Gram-Schmidt orthogonalization"],"falsifier":"Compute, for a fixed branching parameter such as $b=2$ and a low degree such as $j=1$, the four functions $f_{01},f_{02},f_{11},f_{12}$ by solving $\\Delta^{j+1}f=0$ with the boundary conditions of Proposition 3.2; if these four functions are linearly dependent, or if some $f\\in H_j$ with the required boundary data is not reproduced by formula (3.1), then the basis claim that supports the whole construction is false. Alternatively, verify the identity $d_j^{-2}=d_0^{-2}t_1t_2\\cdots t_j$ from Theorem 4.7 on a numerically computed example; a mismatch would expose an error in the recursion coefficient formulas.","tokens_in":13908,"feed_emoji":"📐","tokens_out":8483,"duration_ms":67830,"temperature":0.7,"pith_summary":"This paper develops a theory of polynomials on the bubble-diamond fractals, a family of self-similar fractals indexed by a branching parameter $b$, and constructs an analogue of Legendre orthogonal polynomials on them. The central claim is that the monomials $P_{j1},P_{j2}$, defined through Laplacian boundary conditions, can be orthogonalized by Gram-Schmidt to yield a family of orthogonal polynomials that satisfies a three-term recursion $g_{j+1}=p_{j+1}+s_jp_j+t_jp_{j-1}$ with explicit coefficient formulas. If correct, this yields an efficiently computable orthogonal polynomial system on every $K_b$, and for $b=1$ it reduces to the classical Legendre polynomials on the interval. This matters because such polynomials are natural building blocks for approximation, spectral analysis, and numerical methods on spaces where classical derivatives are unavailable.","feed_headline":"Fractal Legendre polynomials obey a three-term recursion","feed_subtitle":"On every bubble-diamond fractal, Gram-Schmidt on fractal monomials yields orthonormal polynomials with explicit recursion coefficients.","key_machinery":"The load-bearing mechanism is the identification of polynomials of degree at most $j$ with the multiharmonic space $H_j=\\{u:\\Delta^{j+1}u=0\\}$, a space of dimension $2j+2$ whose elements are determined by the boundary values $\\{\\Delta^m u(q_k):m=0,\\ldots,j,\\ k=1,2\\}$. Inside this space the paper uses two computable bases: the multiharmonic functions $f_{jk}$ and the monomials $P_{jk}$, each with a scaling identity under the fractal maps $F_i$ that reduces their construction to finitely many scalar sequences ($a_j,b_j,p_j,q_j$ and $\\alpha_j,\\beta_j,\\eta_j,\\gamma_j$). The recursion itself is carried by the auxiliary polynomials $g_{j+1}=-\\int_{K_b}G(x,y)p_j(y)\\,d\\mu(y)$, which satisfy $\\Delta g_{j+1}=p_j$ and therefore lie in $H_{j+1}$. The symmetry identity $\\langle g_{j+1},p_\\ell\\rangle=\\langle p_j,g_{\\ell+1}\\rangle$ then forces the expansion of $g_{j+1}$ against the orthogonal basis to contain at most the three consecutive terms appearing in Theorem 4.7, which is what makes the coefficient formulas $s_j$ and $t_j$ explicit.","core_discovery":"The paper's central discovery is that the family $\\{\\pi_j\\}$ obtained by Gram-Schmidt orthogonalization of the monomials $\\{P_j\\}$ on the bubble-diamond fractal $K_b$ obeys a three-term recursion, exactly the structure that makes classical orthogonal polynomials useful. Theorem 4.7 states $g_{j+1}=p_{j+1}+s_jp_j+t_jp_{j-1}$, where $g_{j+1}$ is the Green-operator image of $p_j$, $p_{-1}=g_0=0$, and the coefficients are $s_j=d_j^2\\langle g_{j+1},p_j\\rangle$ and $t_j=d_{j-1}^2d_j^{-2}$, with $d_j=\\|p_j\\|^{-1}$. In the normalized basis $\\pi_j=d_jp_j$ the recursion becomes $\\tilde g_{j+1}=\\sqrt{t_{j+1}}\\pi_{j+1}+s_j\\pi_j+\\sqrt{t_j}\\pi_{j-1}$ (Corollary 4.8). To reach this, the paper builds two bases for the space $H_j=\\{u:\\Delta^{j+1}u=0\\}$ of polynomials of degree at most $j$: the multiharmonic functions $f_{jk}$ and the monomials $P_{jk}$, whose boundary values and inner products are computed by explicitly solved recursions (Theorems 3.3, 3.4, 4.3, and 4.4). When $b=1$, the construction reproduces the classical Legendre polynomials.","pith_inferences":["The paper leaves open whether the span of all $\\pi_j$ is dense in $L^2(K_b,\\mu)$; on the Sierpinski gasket the analogous polynomials fail to be complete, and the same failure is plausible for $b\\ge2$. A numerical check of the Jacobi-operator spectrum or the associated moment problem would settle this.","A testable extension would be to derive closed-form expressions for $\\alpha_j,\\beta_j,\\eta_j,\\gamma_j$ for general $b$; the paper gives recursions, but closed forms would allow direct generation of the Legendre polynomials without solving coupled recursions at each degree.","The two-point boundary structure suggests that a fractal with more than two boundary points would need a block-tridiagonal recursion rather than a three-term one, and the same Green-operator symmetry argument might carry over to that setting.","The bounds in Corollary 4.9 hint that the Green operator acts like a compact Jacobi matrix in the polynomial basis; analyzing the corresponding transfer matrix could yield spectral information about the Laplacian on $K_b$."],"forward_implications":["On every $K_b$ the orthonormal family $\\{\\pi_j\\}$ provides an explicit orthogonal basis of each polynomial space $H_j$, so projections onto polynomials of bounded degree can be computed from the scalar coefficient sequences rather than by repeated numerical integration.","The recursion supplies a Jacobi-matrix description of the Green operator in the polynomial basis, and the coefficient bounds $0\\le t_j\\le\\|G\\|_2^2$ and $-\\|G\\|_2\\le s_j\\le0$ control the growth of the unnormalized polynomials via $\\|p_j\\|\\le d_0^{-1}\\|G\\|_2^j$ (Corollary 4.9).","Setting $b=1$ recovers the classical Legendre polynomials on the interval, so the construction gives a one-parameter family of fractal Legendre systems ranging from the interval to highly branched fractals.","Theorem 4.4 expresses every monomial inner product in terms of the scalar sequences $\\alpha_j,\\beta_j,\\eta_j,\\gamma_j$, so the Gram-Schmidt coefficients and hence the recursion coefficients are determined by finitely many scalar data at each degree."],"supporting_citations":[{"why":"Defines the bubble-diamond self-similar graphs whose completion is $K_b$.","marker":"[7]"},{"why":"Provides the boundary-value recursion method used to compute the monomial sequences $\\alpha_j,\\beta_j,\\eta_j,\\gamma_j$.","marker":"[8]"},{"why":"Supplies the Gram-Schmidt orthogonalization and Green-function inner-product technique on which the fractal Legendre construction is based.","marker":"[9]"},{"why":"Establishes the Laplacian, Gauss-Green formula, and Green's function on fractals used to define polynomials and the auxiliary functions $g_j$.","marker":"[10]"},{"why":"Supplies the multiharmonic basis and the simultaneous recursions that justify Proposition 3.2 and the coefficient formulas.","marker":"[11]"}],"fun_headline_variants":["Fractal orthogonal polynomials satisfy three-term recursion","On bubble-diamond fractals, orthogonal polynomials recur","Three-term recursion emerges for fractal Legendre analogs","Fractal analog of Legendre polynomials follows classic recursion","Bubble-diamond fractals yield orthogonal polynomials with recursion"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything rests on the premise that knowing the values $\\Delta^m u$ at the two boundary points for $m=0,\\dots,j$ completely determines every solution of $\\Delta^{j+1}u=0$, with exactly $2j+2$ independent solutions at each degree $j$; the paper takes this from spline theory on the Sierpinski gasket, and if the premise failed the polynomial construction would not be well defined.","fun_headline_variants_meta":{"raw":{"variants":["Fractal orthogonal polynomials satisfy three-term recursion","On bubble-diamond fractals, orthogonal polynomials recur","Three-term recursion emerges for fractal Legendre analogs","Fractal analog of Legendre polynomials follows classic recursion","Bubble-diamond fractals yield orthogonal polynomials with recursion"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000361,"raw_usage":{"total_tokens":1956,"prompt_tokens":960,"completion_tokens":996,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":576,"completion_tokens_details":{"reasoning_tokens":934}},"tokens_in":576,"tokens_out":996,"duration_ms":9162,"temperature":1.0,"reasoning_tokens":934,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T12:50:25.869672+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute, for a fixed branching parameter such as $b=2$ and a low degree such as $j=1$, the four functions $f_{01},f_{02},f_{11},f_{12}$ by solving $\\Delta^{j+1}f=0$ with the boundary conditions of Proposition 3.2; if these four functions are linearly dependent, or if some $f\\in H_j$ with the required boundary data is not reproduced by formula (3.1), then the basis claim that supports the whole construction is false. Alternatively, verify the identity $d_j^{-2}=d_0^{-2}t_1t_2\\cdots t_j$ from Theorem 4.7 on a numerically computed example; a mismatch would expose an error in the recursion coefficient formulas.","supporting_citations":[{"cited_title":"Gaps labeling theorem for the Bubble-diamond self-similar graphs","cited_arxiv_id":"2204.11401","evidence_quote":"Defines the bubble-diamond self-similar graphs whose completion is $K_b$."},{"cited_title":"Needleman, R","cited_arxiv_id":null,"evidence_quote":"Provides the boundary-value recursion method used to compute the monomial sequences $\\alpha_j,\\beta_j,\\eta_j,\\gamma_j$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Gram-Schmidt orthogonalization and Green-function inner-product technique on which the fractal Legendre construction is based."},{"cited_title":"Strichartz","cited_arxiv_id":null,"evidence_quote":"Establishes the Laplacian, Gauss-Green formula, and Green's function on fractals used to define polynomials and the auxiliary functions $g_j$."},{"cited_title":"Strichartz and M","cited_arxiv_id":null,"evidence_quote":"Supplies the multiharmonic basis and the simultaneous recursions that justify Proposition 3.2 and the coefficient formulas."}],"review_version":1}