REVIEW 3 major objections 5 minor 1 cited by
The alpha-discretization map is stable only for alpha in [0.5,1], and the paper argues no single alpha removes both amplitude and phase distortion.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
The alpha-approximation has stable range [0.5, 1], admits a 'hexagonal' integration interpretation, and the paper conjectures no single alpha minimizes both amplitude and phase distortion across all frequencies.
T0 review reviewed 2026-08-05 challenge →
load-bearing objection The stability analysis and hexagonal framing are solid, but the paper's headline exclusion hypothesis is ill-posed and fails on the trivial case H(s)=1. the 3 major comments →
Comprehensive Analysis and Exclusion Hypothesis of $\alpha$-Approximation Method for Discretizing Analog Systems
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
Core claim
The authors prove that the alpha-approximation substitution s=(1/T)(z-1)/(alpha*z+1-alpha) preserves stability of a continuous-time system only when alpha>=0.5. The proof follows from setting the real part of s to be non-positive; the set of z values mapping to the left half-plane is a disk whose boundary crosses the real axis at z=1 and at a second point, and requiring that disk to stay inside the unit circle forces alpha>=0.5. The paper also re-derives the approximation as the hexagonal approximation: over one sampling interval, the error function is piecewise constant, equal to e(n-1) for the first (1-alpha)T seconds and e(n) for the remaining alpha*T seconds, so u(n)=u(n-1)+(1-alpha)*T*e
What carries the argument
The central object is the rational map s=(1/T)(z-1)/(alpha*z+1-alpha), a first-order s-to-z substitution whose endpoints are the backward-difference map and the bilinear map. The load-bearing piece of the stability argument is the circle in the z-plane: the preimage of the closed left half-plane is {z : (Re z - (1 - 1/(2 alpha)))^2 + (Im z)^2 <= (1/(2 alpha))^2}, and requiring this disk to lie inside the unit circle yields alpha>=0.5. The complementary interpretive machinery is the hexagonal approximation, which gives alpha a physical meaning as the weight on the current error sample in a one-step numerical integration of the error function.
Load-bearing premise
The exclusion hypothesis rests on an unformalized meaning of 'minimize amplitude and phase distortion simultaneously'; with that notion left undefined, the statement is not yet a precise mathematical claim, and the paper does not prove it.
What would settle it
Take a fixed stable plant and a fixed frequency, compute the amplitude error and phase error of the alpha-approximation as functions of alpha in [0,1], and find their minimizers. If the two minimizers coincide at any frequency in (0, f_nyquist), the exclusion hypothesis is false; a numerical sweep over alpha for the low-pass filter used in the paper would already test the strongest reading of the claim.
If this is right
- If the stability proof is correct, any internally stable analog system discretized with alpha in [0.5,1] retains continuous-time stability, so the safe design region is known exactly.
- The hexagonal interpretation turns alpha from a curve-fitting parameter into a physical weight on the current versus previous error sample, which can guide its choice.
- For the cases studied, amplitude error is smallest around alpha=0.7 and phase error at alpha=0.5, so a designer must decide which distortion to prioritize.
- If the exclusion hypothesis holds universally, searching over alpha alone cannot produce a discretization that is simultaneously best in amplitude and phase, pushing design toward frequency-selective or multi-objective methods.
Where Pith is reading between the lines
- The exclusion hypothesis becomes a sharp theorem only after 'minimize simultaneously' is given a concrete meaning; under a weighted integrated-error objective, a single alpha could plausibly be optimal for a particular plant, so the unrestricted statement likely needs qualification.
- Plotting the per-frequency minimizers alpha_A(f) and alpha_phi(f) would show where the two curves cross; those crossing frequencies are the natural targets for adaptive or scheduled discretization.
- Re-running the circle proof for alpha outside [0,1], as the generalized bilinear transformation allows, suggests the stable range remains alpha>=0.5, so extending the parameter range does not add stable maps.
- A direct frequency-domain test, checking whether the unit circle maps into the stable half-plane for each alpha, would verify the stability threshold more cheaply than Bode-plot examples.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the alpha-approximation discretization mapping s = (1/T)(z-1)/(alpha*z + 1 - alpha) for continuous-to-discrete conversion. It derives the mapping from a first-order Taylor truncation of z = e^{sT}, identifies it as a special case of several known transformations (Euler, Tustin, Al-Alaoui, and the generalized bilinear transformation), and gives a geometric interpretation as numerical integration of a piecewise-constant error function, which the authors call the hexagonal approximation. Section 4 presents a stability analysis concluding that the mapping is stable for alpha in [0.5, 1]. Section 5 gives qualitative Bode-plot distortion comparisons for a low-pass filter, and Section 6 proposes an 'exclusion hypothesis' claiming that no single alpha can minimize both amplitude and phase distortion simultaneously for every frequency in (0, f_Nyquist). The conclusion lists the hypothesis as a main contribution and states that machine-learning verification is pending.
Significance. If the stability proof and geometric interpretation are correct, they provide a self-contained and useful tutorial treatment of a known result, and the physical interpretation of alpha as the percentage of backward-rectangular area is a nice pedagogical contribution. The table of relationships among existing discretization methods is also helpful. However, the paper's headline new contribution, the exclusion hypothesis, is neither formally stated nor proven, and is contradicted by a trivial internally stable system. The distortion analysis is anecdotal rather than systematic. The authors are honest that the hypothesis is unverified, but this does not make the claim acceptable as a main result. The strongest elements are the parameter-free stability derivation and the explicit relationships in Table 1, which deserve credit.
major comments (3)
- [Section 6] The Exclusion Hypothesis is not a well-formed mathematical statement and is false under the natural literal reading. 'Minimize amplitude distortion and phase distortion simultaneously' is never defined as an objective (pointwise Pareto optimality, weighted sum, minimax norm, or integrated error), and the quantifier structure of 'for every frequency f ... no single parameter alpha' is ambiguous. More concretely, for the internally stable system H(s)=K with K constant (e.g., K=1), the alpha-approximation gives H_d(z)=K for every alpha, so amplitude and phase distortion are identically zero at all frequencies. Hence alpha=0.5 (indeed every alpha in [0,1]) simultaneously minimizes both, contradicting the hypothesis. The statement needs a non-triviality condition (e.g., H not constant) and a formal definition of the distortion measures and of 'minimize'.
- [Sections 5 and 6] The distortion analysis is purely qualitative. No equations define amplitude distortion or phase distortion as functions of alpha and frequency, and no systematic search over alpha or over a class of systems is reported. The exclusion hypothesis is asserted on the basis of a small set of examples (low-pass filter, PI, PR, notch) and the authors explicitly postpone verification to future machine-learning work. For a journal contribution, the hypothesis should either be proved for a well-defined class of systems or be supported by a reproducible exhaustive computational search with a stated objective. As written, this is an anecdotal conjecture rather than a demonstrated result.
- [Section 4, Eq. (30)] The real-axis crossing points of the circle in Eq. (29) are miscomputed. Completing the square gives center 1 - 1/(2alpha) and radius 1/(2alpha), so the intersections with the real axis are sigma_{z1}=1 and sigma_{z2}=1 - 1/alpha, not -1/(2alpha) as stated. The subsequent condition sigma_{z2} >= -1 still yields alpha >= 0.5, so the final conclusion is correct, but the displayed equation is wrong and should be corrected.
minor comments (5)
- [Eq. (9)] The series in the denominator uses index k with m in the expression; it should be (-1)^m (s alpha T)^m / m!. The fraction is also typeset ambiguously and should be parenthesized.
- [Abstract and Introduction] Several grammatical and typographical issues: 'the error function We defined' should be a sentence; '0alpha in [0,1]' is malformed; and the subscript notation for alpha_p in Eq. (5) is inconsistent.
- [References] Reference [2] is a paper on digital twins and does not appear to support the claim that neural ODEs use bilinear discretization to preserve gradient flow. Please check the citation or replace it with an appropriate reference.
- [Section 2.2] The stability statement in Figure 1 is asserted graphically; the rigorous proof appears in Section 4. A cross-reference to Section 4 would help the reader.
- [Section 6] The notation 'f(0, fnyquist)' should be 'f in (0, f_Nyquist)'.
Circularity Check
No significant circularity: the stability analysis is self-contained and the exclusion hypothesis is an open conjecture, not a derived result.
full rationale
The paper's positive derivation chain is self-contained. The α-approximation is introduced in Eq. (4)/(10) and derived from z=e^{sT} via first-order Taylor truncation in Eqs. (8)-(9). The stability range α∈[0.5,1] follows from a direct algebraic inequality: substituting s=σ_s+jω_s into the transform gives Eq. (26), and the condition σ_s≤0 is rearranged into the disk equation (29), whose leftmost real intercept yields α≥0.5 in Eq. (32). No fitted parameter is involved; α is swept, not estimated from data. The mathematical-interpretation section is also non-circular: the piecewise error function in Eq. (21) is integrated to produce exactly the same transform, which is an interpretation rather than a circular prediction. The distortion analysis in §5 is empirical and the §6 exclusion hypothesis is explicitly presented as a conjecture, not as a proven consequence; the paper even states work on verification is ongoing. There are no author self-citations that carry a load-bearing argument. The main weakness is that the exclusion hypothesis is not formally defined ('minimize' lacks a concrete objective) and is supported only by four qualitative examples, but this is a completeness/validity concern, not circularity. One can even construct trivial counterexamples (e.g., H(s)=1 gives zero distortion for all α), but refutation is not circularity. Accordingly, the circularity score is low.
Axiom & Free-Parameter Ledger
axioms (4)
- domain assumption z = e^{sT} is the reference mapping between s-domain and z-domain (Eq. 7, Section 2.1).
- domain assumption Truncation to first order in sT for both numerator and denominator (Eq. 9) defines the alpha-approximation; the analysis concerns this first-order method, not the exact exponential mapping.
- standard math For discrete systems, stability requires poles inside the unit circle, so the left half-plane of s must map inside the unit circle.
- ad hoc to paper The error function e(t) = du/dt and the piecewise-constant reconstruction in Eq. (21) are assumed for the geometric interpretation.
Cite this review
Pith. "Pith review of Comprehensive Analysis and Exclusion Hypothesis of $\alpha$-Approximation Method for Discretizing Analog Systems." pith.science (2026). https://pith.science/paper/24THDJN6
@misc{pith2026250902054,
author = {Pith},
title = {Pith review of: Comprehensive Analysis and Exclusion Hypothesis of $\alpha$-Approximation Method for Discretizing Analog Systems},
year = {2026},
howpublished = {\url{https://pith.science/paper/24THDJN6}},
note = {Machine review of arXiv:2509.02054}
}
read the original abstract
A popular method for designing digital models is transforming the transfer function of the corresponding analog models from continuous domain (s-domain) into discrete domain (z-domain) using the s-to-z transformation. The alpha-approximation is a generalized form of these transformations. When alpha is set to 0.5, the result is the well-known Tustin transformation or bi-linear transformation. In this paper, we provided a comprehensive analysis of the alpha-approximation method, including mathematical interpretation, stability analysis and distortion analysis. Through mathematical interpretation, we revealed that it can be derived by numerically integrating the error function We defined this as the hexagonal approximation. We demonstrated that the stable range of alpha was [0.5, 1] by doing stability analysis. Through distortion analysis, we found that minimizing amplitude and phase distortion simultaneously seemed impossible by regulating alpha alone. Finally, We proposed an exclusion hypothesis hypothesizing that there is no single parameter alpha to minimize the amplitude distortion and phase distortion simultaneously across all frequency points within the Nyquist frequency range. This paper demonstrates that designing parameter alpha involves balancing amplitude and phase distortion.
Figures
Forward citations
Cited by 1 Pith paper
-
Beyond ZOH: Advanced Discretization Strategies for Vision Mamba
Bilinear discretization improves Vision Mamba accuracy over zero-order hold on classification, segmentation, and detection benchmarks with only modest extra training cost.
Reference graph
Works this paper leans on
-
[1]
Introduction Nowadays, controllers and filters in modern digitally-controlled systems are typically designed in the continuous domain, and then transformed into the discrete domain using the S-to-Z transformation. In machine learning field, applications increas- ingly rely on discretized models for training and inference. For instance, discretized continu...
work page 2015
-
[2]
Theα-Approximation 2.1. Definition ofα-Approximation In the process of discretization of analog systems, the well- known mapping from the s-domain to the z-domain can be used by substitution. z=e sT (7) This transformation maps the left half of the s-plane into the interior of the unit circle in the z-plane. Starting from the basic transformation (7), the...
-
[3]
Mathematical Interpretation Starting from the relationship between the error function,e(t), and the original function,u(t), as illustrated below: e(t) = du(t) dt (14) In the continuous domain,u(t)is expressed as follows: u(t) = Z e(t)dt(15) In the discrete domain,u(n)is expressed as follows: u(n) = Z nT (n−1)T e(t)dt+u(n−1)(16) Figure 2 compare the mathem...
-
[4]
Stability Analysis Lets=σ s +jω s andz=Re(z) +j·Im(z), we have the following expression by substituting these into equation (4): s=σ s +jω s = 1 T [Re(z) +j·Im(z)]−1 α(Re(z) +j·Im(z)) + (1−α) = 1 T [(Re(z)−1) +j·Im(z)][(αRe(z) + 1−α)−jα·Im(z)] [αRe(z) + 1−α]2 + [α·Im(z)] 2 = 1 T [α(Re(z)−1) 2 +Re(z)−1 +α·Im(z) 2] +jα·Im(z) [αRe(z) + 1−α]2 + [α·Im(z)] 2 (2...
-
[5]
Figure 3 shows the amplitude and phase distortion of a low-pass filter (LPF) with differentα
Distortion Analysis Since theα-approximation is a first-order approximation, it will inevitably introduce distortion including amplitude and phase errors. Figure 3 shows the amplitude and phase distortion of a low-pass filter (LPF) with differentα. The sampling frequency is 10kHz, therefore the Nyquist frequency is 5kHz. The LPF’s crossing frequency is 2....
-
[6]
Exclusion Hypothesis Based on our research into several cases, including low-pass filter, the proportional-integral controller, the proportional- resonant controller, and the notch filter, we found that it was impossible to minimize the amplitude distortion and phase dis- tortion simultaneously by regulating parameterαalone. For this reason, we proposed t...
-
[7]
Conclusion We conducted a thorough analysis of theα-approximation method, including its mathematical interpretation, stability analysis and distortion analysis. The main contributions of this work can be summarized as follows: • Theα-approximation can be derived by numerically in- tegrating the error function and is defined as hexagonal approximation. • W...
-
[8]
A new accurate discretization method for high-frequency component mechatronics systems,
T.-I. Kim, J.-S. Han, T.-H. Oh, Y .-S. Kim, S.-H. Lee, and D.-I. D. Cho, “A new accurate discretization method for high-frequency component mechatronics systems,”Mechatronics, vol. 62, p. 102250, 2019
work page 2019
-
[9]
Mamba: Linear-time sequence modeling with selective state spaces,
A. Gu and T. Dao, “Mamba: Linear-time sequence modeling with selective state spaces,” inFirst Conference on Language Modeling, 2024. [Online]. Available: https://openreview.net/ forum?id=tEYskw1VY2
work page 2024
-
[10]
Digital Twins in Industrial Applications: Concepts, Mathematical Modeling, and Use Cases
A. Mohammad-Djafari, “Digital twins in industrial applications: Concepts, mathematical modeling, and use cases,” 2025. [Online]. Available: https://arxiv.org/abs/2507.12468
work page internal anchor Pith review Pith/arXiv arXiv 2025
-
[11]
showed that theα-approximation and the Al-Alaoui oper- ator are the same. In [8], an accurate discretization method is presented, for- mulated as follows: s= 1 +αp T z−1 z+α p (5) whereα p is a design parameter andα p ∈[0,1]. However, this method is also equivalent toα-approximation as explained in Section two of this paper. In [12], a generalized bilinea...
Pith/arXiv arXiv 2025
-
[12]
Accu- racy analysis of the zero-order hold model for digital pulse width modulation,
J. Ma, X. Wang, F. Blaabjerg, L. Harnefors, and W. Song, “Accu- racy analysis of the zero-order hold model for digital pulse width modulation,”IEEE Transactions on Power Electronics, vol. 33, no. 12, pp. 10 826–10 834, 2018
work page 2018
-
[13]
J. Hoja and G. Lentka, “Method using bilinear transformation for measurement of impedance parameters of a multielement two- terminal network,”IEEE Transactions on Instrumentation and Measurement, vol. 57, no. 8, pp. 1670–1677, 2008
work page 2008
-
[14]
Digital iir filter design using bilinear transformation in matlab,
B. N. Getu, “Digital iir filter design using bilinear transformation in matlab,” in2020 International Conference on Communications, Computing, Cybersecurity, and Informatics (CCCI), 2020, pp. 1– 6
work page 2020
-
[15]
Novel approach to analog-to-digital trans- forms,
M. A. Al-Alaoui, “Novel approach to analog-to-digital trans- forms,”IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 54, no. 2, pp. 338–350, 2007
work page 2007
-
[16]
Discretization of nonlinear non-affine time delay systems based on second-order hold,
Y .-L. Zhang, “Discretization of nonlinear non-affine time delay systems based on second-order hold,”International Journal of Automation and Computing, vol. 11, pp. 320–327, 2014. [Online]. Available: https://link.springer.com/article/10.1007/ s11633-014-0795-4
work page 2014
-
[17]
Al-alaoui operator and the new transformation polynomials for discretization of analogue systems,
M. Al-Alaoui, “Al-alaoui operator and the new transformation polynomials for discretization of analogue systems,”Electrical Engineering, vol. 90, pp. 455–467, 2008
work page 2008
-
[18]
Application of theα- approximation for discretization of analog systems,
T. B. ˇSekara and M. R. Stojic, “Application of theα- approximation for discretization of analog systems,”Electrical Engineering, vol. 18, no. 3, pp. 571–586, 2005
work page 2005
-
[19]
Al-alaoui operator and theα-approximation for discretization of analog systems,
M. A. Al-Alaoui, “Al-alaoui operator and theα-approximation for discretization of analog systems,”Electrical Engineering, vol. 19, no. 1, pp. 143–146, 2006. Figure 3:Amplitude and phase distortion with differentα
work page 2006
-
[20]
Digital redesign via the gener- alised bilinear transformation,
G. Zhang, X. Chen, and T. Chen, “Digital redesign via the gener- alised bilinear transformation,”International Journal of Control, vol. 82, no. 4, pp. 741–754, 2009
work page 2009
-
[21]
Generating conjectures on fundamen- tal constants with the ramanujan machine,
G. Raayoni, S. Gottlieb, Y . Karni, Y . Fest, Y . Manor, D. Goldin, T. Michaeli, and I. Lior, “Generating conjectures on fundamen- tal constants with the ramanujan machine,”Nature, vol. 590, no. 7844, pp. 67–73, 2021
work page 2021
-
[22]
Associated Quarkonium Hadroproduction at High-Energy Colliders
E. DeLaVi na, R. Larson, and V . Obregon, “Artificial intelligence and machine learning generated conjectures with txgraffiti,”arXiv preprint arXiv:1904.11928, 2019
work page internal anchor Pith review Pith/arXiv arXiv 1904
-
[23]
Hypertree proof search for neural theorem proving,
G. Lample and F. Charton, “Hypertree proof search for neural theorem proving,” inAdvances in Neural Information Processing Systems, vol. 35, 2022, pp. 27 763–27 774
work page 2022
This paper was first reviewed by deepseek-v4-flash on August 5, 2026.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.