To: Author

Article Fingerprint
ReserarchID
315GC
Choose where you want to hide AI Takeaway. Your site-wide choice will be remembered in this browser.
This paper continues the study of infinite dimensional bicomplex Hilbert spaces introduced in previous articles on the topic. Besides obtaining a Best Approximation Theorem, themain purpose of this paper is to obtain a bicomplex analogue of the Riesz-Fischer Theorem. There are many statements of the Riesz-Fischer (R-F) Theorem in the literature, some are equivalent, some are consequences of the original versions. The one referred to in this paper is the R-F Theorem which establishes that the spaces is the canonical model space.
D. Rochon, Dr. K. S. Charak, Dr. R. Kumar. 1970. "Bicomplex Riesz-Fischer Theorem". Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 13 (GJSFR Volume 13 Issue F1).
Crossref Journal DOI 10.17406/GJSFR
Print ISSN 0975-5896
e-ISSN 2249-4626
v1.2
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 138
Country: Canada
Subject: Global Journal of Science Frontier Research - F: Mathematics & Decision
Authors: Dr. K. S. Charak, R. Kumar, D. Rochon (PhD/Dr. count: 1)
View Count (all-time): 233
Total Views (Real + Logic): 7655
Total Downloads (simulated): 473
Publish Date: 2013 02, Mon
Monthly Totals (Real + Logic):
We use cookies and similar technologies to improve site performance, understand traffic, and enhance your publishing experience. Cookie Policy
Choose which optional cookies Global Journals can use. Your preference applies across this platform and can be updated any time.
These cookies are required for core website functionality and security.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.