Papers › The Theory of Functional Connections on Vector Spaces

The Theory of Functional Connections on Vector Spaces

20 Feb 2023arXiv:2302.10223links table onlyarchive 2025-07-28

Carl Leake

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The Theory of Functional Connections (TFC) is most often used for constraints over the field of real numbers. However, previous works have shown that it actually extends to arbitrary fields. The evidence for these claims is restricting oneself to the field of real numbers is unnecessary because all of the theorems, proofs, etc. for TFC apply as written to fields in general. Here, that notion is taken a step further, as fields themselves are unnecessarily restrictive. The theorems, proofs, etc. of TFC apply to vector spaces, not just fields. Moreover, the inputs of the functions/constraints do not even need to be restricted to vector spaces; they can quite literally be anything. In this note, the author shows the more general inputs/outputs of the various symbols that comprise TFC. Examples with accompanying, open-access Python code are included to aid the reader's understanding.

PaperPDFCode

Code

leakec/tfc-on-vector-spaces officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections