Documentation

Provenance.HavingExample

Worked examples: HAVING provenance and probability on a three-occurrence group #

Two fully computed examples on a group with three occurrences.

The SUM(a) ≄ 5 collapse in š”¹[X] #

def HavingExample.t :
Fin 3 → ā„•

Attribute values of the three occurrences: a(u₁) = 3, a(uā‚‚) = a(uā‚ƒ) = 2.

Equations
Instances For
    Dependency graph

    Annotations: the distinct Boolean variables x₁, xā‚‚, xā‚ƒ of š”¹[X].

    Equations
    Instances For
      Dependency graph

      The Poisson-binomial COUNT(*) ≄ 2 example #

      Independent contributor marginals p₁ = 1/2, pā‚‚ = 1/4, pā‚ƒ = 1/3.

      Equations
      Instances For
        Dependency graph
        def HavingExample.S :
        Fin 3 → Finset (Fin 3)

        Per-contributor variable supports: contributor i depends on xįµ¢ only.

        Equations
        Instances For
          Dependency graph