Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite-tree multicast loss experiments

Definition

A finite rooted directed tree T=(V,E) has root o, with all edges directed away from o, and a nonempty receiver set R consisting of every leaf other than o. Every nonroot internal vertex has at least two children. For a vertex v, its children are the vertices joined to v by an outgoing edge; P(o,v) is the unique edge set on the path from o to v. The root may have any finite number of children.

A finite probe design is a nonempty finite family C=((Cd,Nd))d=1D, where each receiver set Cd is a nonempty subset of R and each probe count Nd is a positive integer. A singleton receiver set is a unicast scheme; a receiver set of size at least two is a multicast scheme. Its used edge set is Ed=⋃r∈CdP(o,r).

For a link-success parameter vector p=(pe)e∈E∈(0,1)E, each design d and probe j∈{1,…,Nd} has mutually independent link-success variables Xe,d,j∈{0,1} for e∈Ed, with Pr⁡p(Xe,d,j=1)=pe. The same pe applies in every design and probe (temporal homogeneity). The observed receiver indicator is

Yr,d,j=∏e∈P(o,r)Xe,d,j(r∈Cd).

For y∈{0,1}Cd let

Ωd,y={x∈{0,1}Ed:yr=∏e∈P(o,r)xe for every r∈Cd},wp,d(x)=∏e∈Edpexe(1−pe)1−xe.

The one-probe outcome law is

Pp,d(y)=∑x∈Ωd,ywp,d(x).

These probabilities sum to one because the sets Ωd,y partition the finite link-state space and ∑x∈{0,1}Edwp,d(x)=∏e∈Ed(pe+(1−pe))=1. The complete experiment observes Nd independent outcomes with law Pp,d for each design, independently across designs. If the data are summarized by counts, nd,y∈N0 is the number of probes in design d with outcome y, and ∑ynd,y=Nd.

This is a finite statistical experiment: its parameter space is (0,1)E and its sampling law is the finite product of the stated receiver-outcome laws.

Depends on

Used by

Dependency tree · two levels

5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources