Cited by 76Mathematical Analysis and Transform MethodsMathematical functions and polynomialsNumerical methods for differential equations

The discrete harmonic oscillator, Harper's equation, and the discrete fractional Fourier transform

Open access
Barker, Laurence, Candan, Çagatay, Hakioglu, Tugrul, Kutay, M Alper, Ozaktas, Haldun M·2000·Journal of Physics A: Mathematical and General

Abstract

Certain solutions to Harper's equation are discrete analogues of (and approximations to) the Hermite-Gaussian functions. They are the energy eigenfunctions of a discrete algebraic analogue of the harmonic oscillator, and they lead to a definition of a discrete fractional Fourier transform (FT). The discrete fractional FT is essentially the time-evolution operator of the discrete harmonic oscillator.

AI snapshot

Written from the paper’s full text.

TL;DR

The paper defines Harper functions as solutions to Harper’s equation that form an orthonormal basis of discrete analogues of Hermite-Gaussian functions, and uses them to define a discrete fractional Fourier transform. It shows that this transform and the associated standard discrete harmonic oscillator converge to their continuum counterparts in time evolution, with numerical evidence for small cases.

Key findings

  • The Harper functions \(h_{n,k}\) are the unique basis, up to real factors, simultaneously diagonalizing \(F_n\) and \(G_n\); they solve Harper’s equation \(h(X-1)+2\cos(2\pi X/n)h(X)+h(X+1)=\lambda h(X)\), and converge to Hermite-Gaussians \(h_k\) for suitable sequences of \(n\) (Proposition 3).
  • The discrete fractional FT \(F_n^{[t]}\) is defined by \(F_n^{[t]}h_{n,k}=e^{2\pi ikt}h_{n,k}\); for suitable sequences it converges to the continuum fractional FT \(F_\infty^{[t]}\), and \(F_n\) converges to the continuum FT \(F_\infty\) (Proposition 4). A variant \(F_n^{(t)}=e^{2\pi iK_n t}\) has the same eigenvectors and eigenvalues differing by \(o(1/n)\), and also converges to \(F_\infty^{[t]}\) (Propositions 5–6).
  • The standard discrete harmonic oscillator has Hamiltonian \(H_n=\frac{n}{2\pi}(4-G_n)=2K_n+1\), with time evolution \(S_n(t)=e^{-iH_nt}=e^{-it}F_n^{(-t/\pi)}\). Although the Hamiltonians \(H_n\) do not converge to the continuum \(H_\infty\), the time evolutions \(S_n(t)\) converge to \(S_\infty(t)\) for suitable sequences (Proposition 9).
  • Numerical comparisons show convergence “looks fairly good”: for \(n=16\), the first six Harper functions are compared with Hermite-Gaussians; for \(10\le n\le 40\) and \(0\le k\le 5\), \(L^2\)-norm differences are plotted; for \(25\le n\le 100\) and \(0\le k\le 9\), \(\eta(n,k)\) appears to converge to \(k\).

Methods

  • Finite-dimensional algebraic setting: \(L(n)\) is the space of functions \(\mathbb Z/n\to\mathbb C\); Harper’s equation is treated as the eigenproblem for the Hermitian operator \(G_n\). A tridiagonal matrix crossing-number result (Proposition 1) is used to define and order the Harper functions.
  • The discrete fractional FT is constructed by assigning eigenvalues to the common eigenvectors of \(F_n\) and \(G_n\), following Pei and Yeh; convergence to continuum operators is defined via sequences of vectors/operators from prior work.
  • Numerical section compares Harper functions with Hermite-Gaussians for \(n=16\), plots \(L^2\) differences for \(10\le n\le 40\), \(0\le k\le 5\), and plots \(\eta(n,k)\) for \(25\le n\le 100\), \(0\le k\le 9\).

Limitations

  • Stated: no closed formula for the Harper functions is known, described as a disadvantage.
  • Stated: the arguments provide no information on the accuracy of Harper functions as approximations to Hermite-Gaussians, so section 5 gives numerical information only.
  • Stated: it is unresolved whether \(F_n^{[1/4]}=F_n\); the paper conjectures an affirmative answer. Also, convergence results are for “suitable infinite sequences” of \(n\), not all \(n\). Evident: numerical evidence is limited to small \(n\) and \(k\) (e.g., \(n=16\), \(n\le 40\), \(k\le 5\), and \(n\le 100\), \(k\le 9\)) with no error bounds.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1088/0305-4470/33/11/304

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 10 cited sources checked · 0 supported · 0 flagged

  • Findingnone given

    For an integer k ≥ 0, writing μ(n,k) for the (k+1)-th largest eigenvalue of G_n, for suitable infinite sequences of positive integers n, μ(n,k) n = 4 - 2π(2j+1)/n + o(1/n).

    “Proposition 5. Given an integer k 0, and writing µ(n, k) for the k + 1th largest eigenvalue of G n , then for suitable infinite sequences of positive integers n, we have µ(n, k) n = 4 -2π(2j + 1)/n + o(1/n).”
    Quote in the paperNot a substantial claim
  • Findingreasoning

    If two Harper functions have the same eigenvalue, then either they are the same index or their indices have opposite parity.

    “If λ n,k = λ n,k , then either k = k or else k and k have opposite parity.”
    Quote in the paperNot a substantial claim
  • Findingreasoning

    Up to multiplication by real factors, the Harper functions form the unique basis of L(n) that simultaneously diagonalizes F^2 and G.

    “Proposition 2. Up to multiplication by real factors, the vectors h n,k comprise the unique basis of L(n) simultaneously diagonalizing F 2 and G.”
    Quote in the paperSubstantial claim
  • Findingreasoning

    The convergence of time evolutions for all t is equivalent to the convergence of states for all t given convergent initial states.

    “Proposition 7. Let us fix a sequence of positive integers n.Then the following two conditions are equivalent: (a) The time evolutions S n (t) converge to the time evolution S ∞ (t) for all t.(b) Given any initial states φ n (0) converging to an initial state φ ∞ (0), then φ n (t) converges to φ ∞ (t) for all t.”
    Quote in the paperSubstantial claim
  • Findingcitation

    For a real symmetric tridiagonal matrix A with positive off-diagonal entries, the eigenvector corresponding to the k-th largest eigenvalue has crossing number k.

    “Proposition 1.For the real symmetric tridiagonal matrix A as above, and an integer k with 0 k r, the eigenvector v k has crossing number k.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [33] source

      Not checked in the free run.

  • Not yet classified. 5
  • The quote only partly states this claim. 1
  • May combine two claims. 4
  • Classified as probably not a substantial claim. 5
  • Not yet classified.

    Finding

    With respect to the basis E+, the coordinates of h_{n,2j} have crossing number j; with respect to E-, the coordinates of h_{n,2j+1} have crossing number j.

    “With respect to the basis E + , the coordinates of h n,2j have crossing number j .With respect to the basis E -, the coordinates of h n,2j +1 have crossing number j .”
    Quote in the paperNot yet classified
  • Not yet classified.

    Finding

    The Hamiltonians H_n of the standard discrete harmonic oscillator do not converge to the continuum harmonic oscillator Hamiltonian H_∞.

    “The operators H n do not converge to H ∞ .”
    Quote in the paperNot yet classified
  • The quote only partly states this claim.

    Findingnone given

    Harper functions are discrete approximations to the Hermite-Gaussian functions.

    “Certain solutions to Harper's equation are discrete analogues of (and approximations to) the Hermite-Gaussian functions.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    The numerical data in section 5 indicates the accuracy of the discrete fractional Fourier transform as an approximation to the continuum fractional Fourier transform and the accuracy of the discrete harmonic oscillator as an approximation to the continuum harmonic oscillator.

    “The numerical data in section 5 may be viewed in two ways: it indicates the accuracy of the discrete fractional FT as an approximation to the continuum fractional FT; it indicates the accuracy of the discrete harmonic oscillator as an approximation to the continuum harmonic oscillator.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given

    The techniques used in the arguments provide no information on the accuracy of the Harper functions as approximations to the Hermite-Gaussians.

    “The techniques used in the arguments above appear to provide no information on the accuracy of the Harper functions as approximations to the Hermite-Gaussians.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Findingown data

    Figure 2 shows the L2 norm of the difference between Harper functions and Hermite-Gaussians for 10 ≤ n ≤ 40 and 0 ≤ k ≤ 5, and the convergence looks fairly good.

    “Figure 2 shows, for 10 n 40 and 0 k 5, the L 2 -norm h n,kh k 2 of the difference between the Harper function h n,k and the Hermite-Gaussian h k .The difference was calculated by evaluating h n at the sample points, normalizing, and comparing with the vector h n,k .Again, the convergence looks fairly good.”
    Quote in the paperNot a substantial claim
  • Not yet classified.

    Finding

    F^[t]_n and F^(t)_n are not the same, but their discrepancy diminishes quickly as n → ∞.

    “Although F [t] n and F (t) n are not the same, we shall see in section 5 that the discrepancy diminishes quickly as n → ∞.”
    Quote in the paperNot yet classified
  • May combine two claims.

    Findingreasoning

    The Harper functions h_{n,k} are eigenvectors of both F^(t)_n and F^[t]_n, and the corresponding eigenvalues are the same up to o(1/n).

    “Thus, the Harper functions h n,k are the eigenvectors of F (t) n and F [t] n ; the corresponding eigenvalues are the same up to o(1/n).”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    Empirical confirmation that η(n,k) converges to k is given by the graphs in figure 3.

    “Empirical confirmation that η(n, k) converges to k is given by the graphs, in figure 3, of (n, k) := 1η(n, k)/k against n, where 25 n 100 and 0 k 9.”
    Quote in the paperNot a substantial claim
  • Not yet classified.

    Premise

    The discrete Fourier transform F_n converges to the continuum Fourier transform F_∞.

    “Furthermore, the discrete FT F n converges to the continuum FT F ∞ .”
    Quote in the paperNot yet classified0 of 1 sources checked
    • cites [6] Ballesteros A, 1998

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The discrete fractional Fourier transform discussed in the paper performs numerical calculation of the continuum Fourier transform.

    “the discrete fractional FT we discuss does indeed perform this service; see [10].”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [10] Candan Ç, 1999

      Not checked in the free run.

  • Not yet classified.

    Interpretation

    The question of whether F^[1/4]_n equals F_n is equivalent to asking whether h_{n,k}, as an eigenvalue of F_n, always has eigenvalue i^k.

    “The question is equivalent to asking whether or not h n,k , as an eigenvalue of F n , always has eigenvalue i k .”
    Quote in the paperNot yet classified
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The eigenvalues of G_n are not always distinct.

    “The eigenvalues of G n are not always distinct; Dickinson-Steiglitz [12] conjecture that the eigenvalues are distinct save that, when 4 divides n, the eigenvalue 0 has multiplicity 2.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [12] Cohen L, 1995

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning

    The discrete fractional Fourier transform is an algebraic analogue of the continuum fractional Fourier transform and provides an algebraic analogue of the continuum harmonic oscillator.

    “At least as importantly, the discrete fractional FT is also an algebraic analogue of the continuum fractional FT, and provides an algebraic analogue of the continuum harmonic oscillator.”
    Quote in the paperSubstantial claim
14 of 14
  • The paper relies on this without support.

    The standard continuum harmonic oscillator's energy eigenfunctions satisfy H_∞ h_k = (2k+1)h_k.

    “It is well known that the solutions to the Schrödinger equation of the standard continuum harmonic oscillator are H ∞ h k = (2k + 1)h k .”
1 of 1

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • For N odd, the vector e_n with N entries defined from the eigenvector E_n with n zero crossings will, with proper normalization, contain approximations of the sample values of the Gauss-Hermite function ψ_n, and the vectors e_n converge to the vectors Ψ_n as N→∞.

    “For N odd, define the vector with N entries”

    From Computation of the fractional Fourier transform (2004) · cites this paper as [4]

    Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.

    Experimental — accuracy not yet measured
  • For N even, the vector e_n with N+1 entries defined from the eigenvector E_n with n zero crossings will, with proper normalization, contain approximations of the sample values of the Gauss-Hermite function ψ_n, and the vectors e_n converge to the vectors Ψ_n as N→∞.

    “For N even, define the vector with N +1 entries as”

    From Computation of the fractional Fourier transform (2004) · cites this paper as [4]

    Split into 2 atoms — 0 confirmed, 2 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • Explicit Hamiltonian inserts an imaginary unit into the cosine

    Minor

    The expanded action of H n uses cos(2π iX/n), whereas the stated definition H n = n(4 − G n)/2π and Harper's equation use cos(2πX/n). These are different diagonal terms.

  • Wootters citation points to Wolf in the reference list

    Minor

    The cited reference [35] is listed as a work by Wolf; the Wootters paper is listed as reference 36.

  • η(n, k) is called an eigenvector but used as a scalar eigenvalue

    Minor

    The text introduces η(n, k) as an eigenvector of K n, then equates it to a scalar approaching k and uses it in a scalar exponential.

  • Continuum time-evolution exponential has the opposite sign

    Minor

    The paper defines time evolution with a negative exponent, but later writes a positive exponent for the continuum oscillator. The latter also conflicts with the negative-exponent expression on the same line.

4 of 4

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. Atakishiyev N M, 1990, Teor. Mat. Fiz., 85
  2. Candan Ç, 1999, 3, 1713
  3. Candan Ç, IEEE Trans. Signal Process.

Cited by

Sorted by citations

Authors
Barker, L., Candan, Ç., Hakioglu, T., Kutay, M. A., & Ozaktas, H. M.
Affiliations
  • Bilkent University (TR)
  • Drexel University (US)
Venue
Journal of Physics A: Mathematical and General
Published
2000-03-10
Volume
33
Issue
11
Pages
2209-2222
ISSN
  • 0305-4470 (ISSN-L)
  • 1361-6447
OpenAlex
W2096438497
Cited by
76
References
31
Citations by year
2026: 1 · 2025: 1 · 2024: 1 · 2023: 3 · 2021: 1 · 2020: 1 · 2019: 7 · 2018: 1 · 2017: 3 · 2016: 2 · 2015: 3 · 2014: 2 · 2013: 6 · 2012: 5
FWCI
12.18
Type
journal article
Language
en
Open access
Locations
  • Journal of Physics A Mathematical and General (publishedVersion)
  • Bilkent University Institutional Repository (Bilkent University) (submittedVersion)
  • OpenMETU (Middle East Technical University) (submittedVersion, cc-by-nc-nd)
Topics
  • Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
  • Physical Sciences › Mathematics › Applied Mathematics › Mathematical functions and polynomials
  • Physical Sciences › Mathematics › Numerical Analysis › Numerical methods for differential equations
Keywords
discrete fractional Fourier transform, Hermite-Gaussian functions, energy eigenfunctions, evolution operator, quasiperiodic lattices

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-08.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-08.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review