Pith. sign in

REVIEW 2 major objections 5 minor 21 references

Sampling Observability for Heat Equations with Memory

T0 review · 2 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A heat equation with memory is recoverable from finitely many instantaneous observations if and only if the kernel is nonzero at some sampling time and the chosen times avoid the zero sets of the scalar Volterra modes.

desk verdict First sharp sampled-observability result for heat equations with memory; worth refereeing, but the key asymptotic lemma is quoted from a to-appear paper and extended to C^2 kernels without proof. read the letter →

arxiv 2411.14382 v1 pith:HCKV5JXY submitted 2024-11-21 math.OC math.AP

Lingying Ma , Gengsheng Wang , Yubiao Zhang This is my paper · ORCID
classification math.OCmath.AP MSC 93B0745K0535K0593C57
keywords heatequationwithmemorysamplingobservabilitytwo-sidedinequalitygeometricobservationconditionbackwarduniquenessimpulsecontrollabilityVolterraintegro-differentialuniquecontinuation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish exactly when the initial state of a heat equation with memory can be reconstructed from finitely many instantaneous observations, each taken on a small open set at its own time. The main theorem says that, once a natural “backward uniqueness” condition holds at the chosen times, the two-sided sampling observability inequality is equivalent to a weighted geometric condition on the observation regions: the sum of the kernel magnitudes $|M(t_j)|$ times the indicator functions of the regions must be positive everywhere. A companion result makes the condition sharp by showing that observability for some choice of regions holds if and only if backward uniqueness holds and at least one $M(t_j)$ is nonzero. The paper also gives a concrete recipe for choosing the sampling times from the zero sets of scalar Volterra equations, and shows through examples that the usable times depend strongly on the kernel.

What carries the argument

The load-bearing object is the asymptotic expansion (2.3), $\Phi(t)=-M(t)A^{-2}+R(t,A)(tA)^{-3}$, with $A$ the Dirichlet Laplacian and $\Phi(t)$ the solution operator of (1.1). It says that at any positive time the solution is $-M(t)A^{-2}$ applied to the initial data plus a remainder that is three powers of $A$ smoother; this is what turns spatial observation of the sample into a weighted coverage condition on the sets $\omega_j$. The second essential mechanism is the scalar reduction of backward uniqueness: writing the solution in the eigenbasis of $-A$, each coefficient obeys $x_k'(t)+\lambda_k x_k(t)+\int_0^t M(t-s)x_k(s)\,ds=0$ with $x_k(0)=1$, and a nonzero datum is invisible at $\{t_j\}$ exactly when some mode $k$ satisfies $x_k(t_j)=0$ for every $j$. The zero sets $N_k=\{t: x_k(t)=0\}$ therefore dictate which sampling instants are admissible.

What would settle it

Take $\Omega=(0,\pi)$, $A$ the Dirichlet Laplacian, and a non-analytic $C^2$ kernel such as $M(t)=e^{-1/t}$ for $t>0$ and $M(0)=0$. Compute the scalar Volterra solutions $x_k(t)$ of (5.2) on the eigenbasis and test the consequence of (2.3), namely that $t^3\lambda_k|\lambda_k^2 x_k(t)+M(t)|$ stays bounded uniformly in $k$ for fixed $t>0$; a single sequence of modes violating this bound would disprove the lemma on which Theorems 1.7 and 1.9 depend.

Watch

Extended reading notes

Core claim

The central claim, Theorem 1.7, is that for a $C^2$ memory kernel $M$, if the equation has backward uniqueness at times $t_1,\dots,t_m$ — meaning no nonzero initial state vanishes at all those times — then the geometric observation condition $\sum_{j=1}^m |M(t_j)| \chi_{\omega_j}(x)>0$ on $\Omega$ implies the two-sided inequality $C^{-1}\|y_0\|_{H^{-4}} \le \sum_{j=1}^m \|y(t_j;y_0)\|_{L^2(\omega_j)} \le C\|y_0\|_{H^{-4}}$, and this inequality in turn implies the same positivity almost everywhere. Theorem 1.9 completes the equivalence: such an inequality holds for some open observation sets if and only if backward uniqueness holds at $\{t_j\}$ and $\sum_{j=1}^m |M(t_j)|>0$. The proof rides on the asymptotic expansion $\Phi(t)=-M(t)A^{-2}+R(t,A)(tA)^{-3}$, which makes the dominant part of each sample proportional to $M(t_j)A^{-2}y_0$; the remainder is smooth enough to be absorbed. Backward uniqueness is then reduced, by separation of variables, to the zero sets of scalar Volterra equations, which is what makes the choice of sampling times depend on the kernel.

Load-bearing premise

The whole characterization rests on Lemma 2.1's asymptotic expansion (2.3), which was proved for analytic memory kernels; Remark 2.2 asserts without proof that it still holds for any $C^2$ kernel, and every main theorem uses that extension.

Editorial extensions

If this is right

  • Under the theorem's hypotheses, observing the solution on small open sets at finitely many instants recovers the initial datum in $H^{-4}$, and $H^{-4}$ is the optimal regularity scale for that recovery.
  • Any sampling instant with $M(t_j)=0$ contributes nothing to the observation; only instants with nonzero kernel value can be used, and their observation regions must jointly cover all of $\Omega$ (or all but a null set for the necessary condition).
  • Theorem 1.9 provides a design rule: choose times so that $\sum_j |M(t_j)|>0$ and no eigenmode is killed at every chosen time, then choose regions satisfying (1.4); this yields the two-sided inequality.
  • For kernels such as $M(t)=c e^{\alpha t}$, any two instants closer than $\pi/\sqrt{c}$ give backward uniqueness, so two snapshots suffice.
  • By standard duality, the same inequality yields impulse controllability: finitely many interior controls injected at times $T-t_j$ can steer the memory-heat equation to any target in $H^4$ at time $T$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • This suggests that, if the $C^2$ extension of Lemma 2.1 is valid, the observability constant can be quantified in terms of the minimum of $\sum_j |M(t_j)|\chi_{\omega_j}$ over $\Omega$ and the stability of backward uniqueness, making the result directly usable for numerical reconstruction.
  • The zero-set criterion points to a general sampling strategy for convolution memory kernels: choose a pair of instants whose separation is shorter than the smallest gap between consecutive zeros of any scalar mode, which for kernels with periodic or almost-periodic scalar solutions guarantees backward uniqueness without detailed knowledge of the domain's eigenbasis.
  • One could test the optimal regularity $H^{-4}$ numerically by reconstructing initial data from noisy samples for $M(t)=c e^{\alpha t}$ and measuring how the reconstruction error scales with noise as the target norm is varied.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper studies finite-time-sampling observability for the heat equation with memory ∂ty − ∆y + ∫0^t M(t−s)y(s)ds = 0 on a bounded domain, with observations made at finitely many instants tj on small open sets ωj. The main results are a two-sided sampling observability inequality (1.2), a sharp sufficient geometric condition (1.4) under a backward-uniqueness assumption (Theorem 1.7), and an equivalence between the existence of some observation sets and backward uniqueness plus the condition ∑_j |M(tj)| > 0 (Theorem 1.9). The proofs rest on an asymptotic expansion of the solution semigroup (Lemma 2.1), a relaxed observability inequality (Proposition 2.3), and a unique continuation property at finitely many instants (Proposition 3.1). Section 5 translates backward uniqueness into conditions on the zero sets N_k of scalar Volterra solutions and gives examples for kernels M(t) ≤ 0, M(t)=t, and M(t)=ce^{αt}.

Significance. If the main results are correct, this is the first treatment of impulsive, finite-time sampling observability for heat equations with memory, and it provides a clean geometric characterization: under backward uniqueness, observability is governed by the pointwise covering condition ∑_j |M(tj)| χ_{ωj}(x)>0. The paper also gives a constructive procedure for choosing time instants and observation regions from the kernel, together with concrete examples. The main theorems are novel relative to the existing interval-observation literature for memory heat equations. The proofs are self-contained except for the central semigroup expansion, which is imported from the authors' prior work [17] (listed as 'to appear') and extended from analytic to C^2 kernels without a supplied proof; because every main statement relies on this expansion, the current version is not yet fully verifiable.

major comments (2)
  1. [Section 2, Lemma 2.1 and Remark 2.2] The asymptotic expansion (2.3), Φ(t)=−M(t)A^{−2}+R(t,A)(tA)^{−3}, is the load-bearing tool: it is used in Proposition 2.3, Proposition 3.1, Theorem 1.7, and Theorem 1.9. However, Lemma 2.1 is quoted from [17, Corollary 2.2], and Remark 2.2 states that [17] assumed an analytic kernel and that the result 'still holds' for M∈C^2([0,∞)) 'after carefully checking its proof.' No proof, or even a sketch of the verification, is given, and [17] is listed as 'to appear.' Since all subsequent results inherit this expansion, the C^2 extension is an unverified hypothesis. Please either provide a complete proof of (2.3) under assumption (A), or restrict the main theorems to analytic kernels (with a separate argument for which parts of Section 5 survive).
  2. [Section 3, Proposition 3.1, Step 1] After obtaining Φ(tj)y0,k→Φ(tj)ŷ strongly in H^{−6} (equation (3.6)), the proof concludes from χ_{ω_j}Φ(tj)y0,k=0 that χ_{ω_j}Φ(tj)ŷ=0. This inference is not valid as written, because multiplication by a characteristic function is not a bounded operator on H^{−6}. The gap is repairable: by Lemma 2.1, Φ(tj) maps H^{−4} continuously into L^2(Ω), and the weak convergence y0,k⇀ŷ in H^{−4} implies χ_{ω_j}Φ(tj)y0,k⇀χ_{ω_j}Φ(tj)ŷ weakly in L^2(Ω); hence the limit is zero. Please revise this step accordingly.
minor comments (5)
  1. [Section 3, Step 3] Before applying Definition 1.3 to the eigenfunction e, the proof asserts e∈L^2(Ω) without justification. This can be derived from Step 2: since AV⊂V, one has A^2e∈V⊂H^{−4}, so e=A^{−2}(A^2e)∈L^2(Ω). Please state this one-line argument explicitly.
  2. [Proposition 2.3, equations (2.9)–(2.10)] For x0∈∂Ω, the normalized function |B(x0,1/k)|^{−1/2}χ_{B(x0,1/k)∩Ω} has L^2 norm tending to 2^{−1/2} rather than 1, so the equality in (2.10) is not correct for boundary points. Since (1.5) is an almost-everywhere condition, the proof may simply restrict the arbitrary point x0 to the open set Ω; please make this restriction explicit.
  3. [Theorem 1.9, Step 2] The construction of {~ω}_j=1^m from {ωhat_j}_{j∈J} is imprecise: if J is a proper subset of {1,...,m}, the phrase 'subsequence' does not specify what ~ω_j should be for j∉J. Please define ~ω_j for these indices explicitly (for instance, as arbitrary nonempty open sets, since the corresponding terms vanish in (4.9)).
  4. [Example 5.9] In (5.10), the constants α_k, β_k, φ_k and C̃_k are not defined; since the subsequent countability claim depends only on α_k<0, please state their defining relations or move the computation to a remark.
  5. [Throughout] There are minor typographical issues, including 'e quations' in the abstract and inconsistent use of R+ for (0,+∞) versus [0,+∞); please proofread and make the notation uniform.

Circularity Check

1 steps flagged · score 4.0 of 10

Central derivation has independent content, but its foundation is a load-bearing self-citation: Lemma 2.1 is imported from the authors' own [17] and extended from analytic to C^2 kernels without proof.

  1. self citation load bearing [Section 2, Lemma 2.1 and Remark 2.2 (Eq. (2.3))]
    "Lemma 2.1. ([17, Corollary 2.2]) Let M satisfy the assumption (A). Then there is an operator-valued function R ... such that Φ(t) = −M(t)A−2 + R(t, A)(tA)−3, t > 0 ... Remark 2.2. Lemma 2.1 is [17, Corollary 2.2] where M was assumed to be analytic. However, after carefully checking its proof, as well as the proof of [16, Theorem 1.1], we can see that it still holds for the case when M only satisfies the assumption (A)."

    Every main step (Proposition 2.3, Proposition 3.1, Theorem 1.7, Theorem 1.9) rests on the asymptotic expansion (2.3). That expansion is imported from [17, Corollary 2.2] and [16, Theorems 1.1–1.2], both by the same author group, and the key extension from analytic kernels to all C^2 kernels is asserted in Remark 2.2 without a supplied proof. The load-bearing input is therefore an unverified self-citation rather than an independently established result; the paper's characterization of sampling observability is forced by this imported expansion, but the expansion itself is not derived in the manuscript.

full rationale

The paper's own derivation chain—Theorem 1.7 and Theorem 1.9—does not appear to use the conclusions as premises; the geometric condition (1.4), the two-sided inequality (1.2), and backward uniqueness (1.3) are distinct statements connected by the compactness/unique-continuation argument in Proposition 3.1 and the relaxed inequality in Proposition 2.3. No step simply renames a fitted quantity as a prediction, and no uniqueness theorem is imported to forbid alternatives. The main circularity concern is concentrated in Lemma 2.1: the asymptotic expansion Φ(t) = −M(t)A^{-2} + R(t,A)(tA)^{-3} is quoted from [17, Corollary 2.2] and [16, Theorems 1.1–1.2], works by the same authors, and Remark 2.2 extends it from analytic kernels to all C^2 kernels without supplying the proof. Since every major proposition (2.3, 3.1) and both main theorems use this expansion, the foundation of the paper is a load-bearing, unverified self-citation rather than an independently established input. This raises the score to 4. The unproved C^2 extension is also a correctness risk; if Lemma 2.1 fails, the characterization collapses. However, the central characterization still has independent content and is not definitionally equivalent to the lemma, so the score is not higher. A separate analytic gap in Proposition 3.1 Step 1—passing χ_ω_j through weak H^{-6} convergence—is a correctness issue, not a circularity.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no fitted constants or invented entities. The central claim rests on the standing C^2 assumption, the imported asymptotic expansion (2.3), the backward uniqueness hypothesis, and standard unique-continuation and compactness facts. The main unverified input is the extension of Lemma 2.1 to C^2 kernels.

assumptions (5)
  • domain assumption The memory kernel M belongs to C^2([0,+∞)) (assumption (A)).
    All theorems and the imported asymptotic expansion are stated under this smoothness assumption; it is the standing hypothesis of the paper.
  • domain assumption Flow decomposition: Φ(t)=−M(t)A^{-2}+R(t,A)(tA)^{-3} with R∈L(H^s), and the associated regularity estimate (2.4), hold for M∈C^2.
    Quoted as Lemma 2.1 from [17, Corollary 2.2] and [16, Theorems 1.1-1.2]; Remark 2.2 asserts the extension from analytic M to C^2 M without proof. This is the main engine for Proposition 2.3, Proposition 3.1, and Theorem 1.7.
  • domain assumption Backward uniqueness of (1.1) at {t_j}, as defined in (1.3), holds for the selected instants.
    Explicit hypothesis in Theorem 1.7 and part of the equivalent condition in Theorem 1.9; Section 5 provides criteria for special kernels. It is not automatically true for all M.
  • standard math Eigenfunctions of −A satisfy a unique continuation property: if an eigenfunction vanishes on a nonempty open set, it is identically zero.
    Used in Proposition 3.1 Step 3 to reach a contradiction from χ_{ω_j0} e = 0; cited to reference [10].
  • standard math Standard functional analysis facts: compact embedding H^{-4}→H^{-6}, weak and strong compactness, and finite-dimensional invariant subspaces.
    Used throughout Section 3 and Section 4 to extract limits and to find an eigenvector of A restricted to a finite-dimensional subspace.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sampling Observability for Heat Equations with Memory." pith.science (2026). https://pith.science/paper/HCKV5JXY

@misc{pith2026241114382,
  author       = {Pith},
  title        = {Pith review of: Sampling Observability for Heat Equations with Memory},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HCKV5JXY}},
  note         = {Machine review of arXiv:2411.14382}
}
read the original abstract

This paper studies the sampling observability for the heat equations with memory in the lower-order term, where the observation is conducted at a finite number of time instants and on a small open subset at each time instant. We present a two-sided sampling observability inequality and give a sharp sufficient condition to ensure the aforementioned inequality. We also provide a method to select the time instants and then to design the observation regions, based on a given memory kernel, such that the above-mentioned inequality holds for these time instants and observation regions. Additionally, we demonstrate that the positions of these time instants depend significantly on the memory kernel.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages

  1. [17]

    G. Wang, Y. Zhang and E. Zuazua, Observability for heat equations with memory , Arch. Ration. Mech. Anal., to appear

    work page

  2. [1]

    Apraiz, L

    J. Apraiz, L. Escauriaza, G. Wang and C. Zhang, Observability inequalities and measurable sets, J. Eur. Math. Soc. (JEMS), 16(11):2433-2475, 2014

    work page 2014

  3. [2]

    Bardos, G

    C. Bardos, G. Lebeau and J. Rauch, Sharp sufficient conditions for the observation, control, and stabilization of waves from the boundary , SIAM J. Control Optim., 30(5):1024-1065, 1992

    work page 1992

  4. [3]

    Chaves-Silva, X

    F. Chaves-Silva, X. Zhang and E. Zuazua, Controllability of evolution equations with memory, SIAM J. Control Optim., 55(4):2437-2459, 2017

    work page 2017

  5. [4]

    Fern´ andez-Cara and E

    E. Fern´ andez-Cara and E. Zuazua, Null and approximate controllability for weakly blowing up semilinear heat equations , Ann. Inst. H. Poincar´ e C Anal. Non Lin´ eaire, 17(5):583-616, 2000

    work page 2000

  6. [5]

    Fursikov and O

    A. Fursikov and O. Imanuvilov, Controllability of evolution equations , volume 34 of Lecture Notes Series, Seoul National University, Research Inst itute of Mathematics, Global Analysis Research Center, Seoul, 1996

    work page 1996

  7. [6]

    Guerrero and O

    S. Guerrero and O. Imanuvilov, Remarks on non controllability of the heat equation with memory , ESAIM Control Optim. Calc. Var., 19(1):288-300, 2013

    work page 2013

  8. [7]

    Halanay and L

    A. Halanay and L. Pandolfi, Lack of controllability of the heat equation with memory , Systems Control Lett., 61(10):999-1002, 2012

    work page 2012

Show all 21 references
  1. [8]

    Huang and A

    S. Huang and A. Soffer, Uncertainty principle, minimal escape velocities and ob- servability inequalities for Schr¨ odinger equations, Amer. J. Math., 143(3):753-781, 2021

    2021

  2. [9]

    Lax, Functional Analysis, John Wiley & Sons, 2002

    P. Lax, Functional Analysis, John Wiley & Sons, 2002

    2002

  3. [10]

    Lin, A uniqueness theorem for parabolic equations , Comm

    F. Lin, A uniqueness theorem for parabolic equations , Comm. Pure Appl. Math., 43(1):127-136, 1990

    1990

  4. [11]

    Tucsnak and G

    M. Tucsnak and G. Weiss, Observation and Control for Operator Semigroups , Birkh¨ auser Verlag, 2009

    2009

  5. [12]

    Pazy, Semigroups of Linear Operators and Applications to Partial Differential Equations, Springer-Verlag, 1983

    A. Pazy, Semigroups of Linear Operators and Applications to Partial Differential Equations, Springer-Verlag, 1983. 20

    1983

  6. [13]

    Phung and G

    K. Phung and G. Wang, An observability estimate for parabolic equations from a measurable set in time and its applications , J. Eur. Math. Soc. (JEMS), 15(2):681- 703, 2013

    2013

  7. [14]

    Qin and G

    S. Qin and G. Wang, Controllability of impulse controlled systems of heat equa tions coupled by constant matrices , J. Differential Equations, 263(10):6456-6493, 2017

    2017

  8. [15]

    G. Wang, M. Wang and Y. Zhang, Observability and unique continuation inequalities for the Schr¨ odinger equation, J. Eur. Math. Soc. (JEMS), 21(11):3513-3572, 2019

    2019

  9. [16]

    G. Wang, Y. Zhang and E. Zuazua, Flow decomposition for heat equations with memory, J. Math. Pures Appl. (9), 158:183-215, 2022

    2022

  10. [18]

    L. Wang, C. Li, G. Yin and L. Guo, State observability and observers of linear-time- invariant systems under irregular sampling and sensor limi tations, IEEE Trans. Automat. Control, 56(11): 2639-2654, 2011

    2011

  11. [19]

    Zhang, Explicit observability inequalities for the wave equation with lower order terms by means of Carleman inequalities , SIAM J

    X. Zhang, Explicit observability inequalities for the wave equation with lower order terms by means of Carleman inequalities , SIAM J. Control Optim., 39(3):812-834, 2000

    2000

  12. [20]

    Zhang, Unique continuation estimates for the Kolmogorov equation in the whole space, C

    Y. Zhang, Unique continuation estimates for the Kolmogorov equation in the whole space, C. R. Math. Acad. Sci. Paris, 354(4):389-393, 2016

    2016

  13. [21]

    Zhou and H

    X. Zhou and H. Gao, Interior approximate and null controllability of the heat e qua- tion with memory , Comput. Math. Appl., 67(3):602-613, 2014

    2014

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.