Representation Theorems in Hardy Spaces
The DOI matches its Crossref record.
Abstract
The theory of Hardy spaces has close connections to many branches of mathematics including Fourier analysis, harmonic analysis, singular integrals, potential theory and operator theory, and has found essential applications in robust control engineering. For each application, the ability to represent elements of these classes by series or integral formulas is of utmost importance. This self-contained text provides an introduction to a wide range of representation theorems and provides a complete description of the representation theorems with direct proofs for both classes of Hardy spaces: Hardy spaces of the open unit disc and Hardy spaces of the upper half plane. With over 300 exercises, many with accompanying hints, this book is ideal for those studying Advanced Complex Analysis, Function Theory or Theory of Hardy Spaces. Advanced undergraduate and graduate students will find the book easy to follow, with a logical progression from basic theory to advanced research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Mohajerin Esfahani, P., & Kuhn, D. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1172-1 · Cited by 136
Metadata
- Authors
- Mashreghi, J.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2009-03-19
- OpenAlex
- W128586474
- Cited by
- 189
- References
- 0
- FWCI
- 4.98
- Type
- book
- Language
- en
- Open access
- closed
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.
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Representation Theorems in Hardy Spaces. https://app.cochat.ai/papers/10.1017/cbo9780511814525
- The paper
- Mashreghi, J. (2009). Representation Theorems in Hardy Spaces. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511814525
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.