feat: path graph transport and position observables on ℂ^d - #1665
naype888-cloud wants to merge 2 commits into
Conversation
Add `PathObservables.transport` and `PathObservables.position`, the Hermitian matrices built on `SimpleGraph.pathGraph d`, and their realisation as observables of `ℂ^d →L[ℂ] ℂ^d`. Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com> Signed-off-by: Eduardo Nava Hernandez <naype888@gmail.com>
|
Thank you for this pull-request (PR). If this is your first PR, welcome to the community! Below is what will happen next. Please read carefully if you are not familiar with the process. You may open other PRs while this one is being reviewed, and can stack PRs on top of each other, so don't let these steps slow you down.
Tip: The easiest way to get have a fast review is to submit a PR that is small and self-contained, and has clear documentation explaining why things are the way they are in your chages. If you have any problems or questions, please reach out to the community on the Zulip. |
Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com> Signed-off-by: Eduardo Nava Hernandez <naype888@gmail.com>
This PR how it works, defines T_d adyacence matrix from elemental dynamic / espectral radius 2cos(pi/(d+1)) and P_d (slash with coordenate centered in -1,1).
what the lemma does? bougth of them are hermitians then becomes in to Observable (C^d --L C^d) this is: transport.observable, position.observable.
now new theorems only defs and hermiticity.
im doing my best to finish this theoren so maybe soon i push more comits,
Tks alot , guys tks to Josehp¡