Documentation

LeanPool.HardSphereNBC.HardSphereNBC

The canonical particle and edge conventions #

def HsVirial.hardSphereEdgeKey {k : ℕ} (e : Sym2 (Fin k)) :
Lex (Fin k × Fin k)

The lexicographic key given by the smaller and larger endpoints of an edge.

Equations
Instances For
    @[instance_reducible]

    Order unordered edges lexicographically by their sorted endpoints.

    Equations
    Instances For
      @[reducible, inline]

      Positions of the free particles, with the distinguished particle anchored at zero.

      Equations
      Instances For
        def HsVirial.hardSphereFreeIndex {k : ℕ} [NeZero k] (i : Fin k) (hi : i ≠ 0) :
        Fin (k - 1)

        The zero-based coordinate index of a particle other than the anchored particle.

        Equations
        Instances For

          The particle label corresponding to a free coordinate.

          Equations
          Instances For

            Recover a particle position, assigning zero to the anchored particle.

            Equations
            Instances For
              noncomputable def HsVirial.hardSphereActiveExact {k d : ℕ} [NeZero k] (r : HardSphereConfiguration k d) :
              Sym2 (Fin k) → Bool

              Record whether the two endpoint positions of an edge are less than one unit apart.

              Equations
              Instances For
                theorem HsVirial.measurable_finite_bool_comp {X : Type u_1} {E : Type u_2} {Y : Type u_3} [MeasurableSpace X] [Finite E] [MeasurableSpace Y] (active : X → E → Bool) (hactive : ∀ (e : E), Measurable fun (x : X) => active x e) (g : (E → Bool) → Y) :
                Measurable fun (x : X) => g (active x)
                noncomputable def HsVirial.hardSphereEdgeDistance {V : Type u_1} {d : ℕ} (position : V → HSPosition d) (e : Sym2 V) :

                The distance between the endpoints of an unordered edge.

                Equations
                Instances For
                  @[simp]
                  theorem HsVirial.hardSphereEdgeDistance_mk {V : Type u_1} {d : ℕ} (position : V → HSPosition d) (i j : V) :
                  hardSphereEdgeDistance position s(i, j) = ‖position i - position j‖
                  theorem HsVirial.norm_sub_le_walk_length {V : Type u_1} {d : ℕ} {G : SimpleGraph V} {position : V → HSPosition d} {u v : V} (p : G.Walk u v) (hedge : ∀ e ∈ p.edges, hardSphereEdgeDistance position e < 1) :
                  ‖position u - position v‖ ≤ ↑p.length
                  noncomputable def HsVirial.hardSphereOmega {k d : ℕ} [NeZero k] (r : HardSphereConfiguration k d) :

                  The signed Mayer graph sum evaluated at the configuration's overlap graph.

                  Equations
                  Instances For
                    noncomputable def HsVirial.hardSphereBk {k d : ℕ} [NeZero k] :

                    The hard-sphere cluster integral normalized by the factorial of the particle count.

                    Equations
                    Instances For
                      noncomputable def HsVirial.hardSphereNBCVolume {k d : ℕ} [NeZero k] (T : Finset (Sym2 (Fin k))) :

                      The volume of configurations assigned to a fixed no-broken-circuit tree.

                      Equations
                      Instances For
                        theorem HsVirial.norm_bond_le_one {V : Type u_1} [Fintype V] (x : Sym2 V → Bool) (e : Sym2 V) :
                        ‖↑(bond x e)‖ ≤ 1