Particle permutations #
Spatial coordinate permutation as a linear isometry.
The finite spin labels are permuted bijectively.
Spatial coordinate permutation as a linear isometry.
Equations
Instances For
theorem
LiebThirring.permutationLinearIsometryEquiv_apply
{N : ℕ}
(σ : Equiv.Perm (Fin N))
(x : Configuration N)
:
@[simp]
theorem
LiebThirring.particlePosition_permutePositions
{N : ℕ}
(σ : Equiv.Perm (Fin N))
(x : Configuration N)
(i : Fin N)
:
The finite spin labels are permuted bijectively.
Equations
- LiebThirring.spinPermutationEquiv σ = { toFun := LiebThirring.permuteSpins σ, invFun := LiebThirring.permuteSpins (Equiv.symm σ), left_inv := ⋯, right_inv := ⋯ }
Instances For
noncomputable def
LiebThirring.spinPermutationLinearIsometryEquiv
{N q : ℕ}
(σ : Equiv.Perm (Fin N))
:
Spin-coordinate reindexing is a complex linear isometry.
Equations
Instances For
theorem
LiebThirring.norm_permutePositions_ae
{N q : ℕ}
(ψ : State N q)
(hψ : antisymmetric ψ)
(σ : Equiv.Perm (Fin N))
:
∀ᵐ (x : Configuration N), ‖↑↑ψ (permutePositions σ x)‖ = ‖↑↑ψ x‖
theorem
LiebThirring.nnnorm_permutePositions_ae
{N q : ℕ}
(ψ : State N q)
(hψ : antisymmetric ψ)
(σ : Equiv.Perm (Fin N))
:
∀ᵐ (x : Configuration N), ‖↑↑ψ (permutePositions σ x)‖₊ = ‖↑↑ψ x‖₊
The norm equality also holds in the nonnegative norm used by the density.
theorem
LiebThirring.particle_marginal_permutation
{N q : ℕ}
(ψ : State N q)
(hψ : antisymmetric ψ)
(σ : Equiv.Perm (Fin N))
(i : Fin N)
(v : Position → ENNReal)
:
∫⁻ (x : Configuration N), v (particlePosition x (σ i)) * ↑‖↑↑ψ x‖₊ ^ 2 = ∫⁻ (x : Configuration N), v (particlePosition x i) * ↑‖↑↑ψ x‖₊ ^ 2
Relabeling particles preserves every nonnegative marginal test.
theorem
LiebThirring.particle_marginals_eq
{N q : ℕ}
(ψ : State N q)
(hψ : antisymmetric ψ)
(i j : Fin N)
(v : Position → ENNReal)
:
∫⁻ (x : Configuration N), v (particlePosition x i) * ↑‖↑↑ψ x‖₊ ^ 2 = ∫⁻ (x : Configuration N), v (particlePosition x j) * ↑‖↑↑ψ x‖₊ ^ 2
All particle marginals of an antisymmetric state have the same tests.