Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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.

Uniform laws on finite subset families

Statement

For n≥0, let [n]:={1,…,n}, with [0]=∅. For an integer r with 0≤r≤n, let Sn,r:={I⊆[n]:∣I∣=r}. Then Sn,r is finite and nonempty, and assigning weight 1/∣Sn,r∣ to each member defines a finite probability space on Sn,r.

Facts & Assumptions

Given: Integers n≥0 and 0≤r≤n, the index set [n], and the subset family Sn,r in the statement.

[F1]

The cardinality ∣A∣ of a finite set: finiteness means being bijective with a von Neumann natural.

[F2]

The set AB of functions B→A between finite sets is finite, with ∣AB∣=∣A∣∣B∣: for finite sets A,B, the function set AB is finite with cardinality ∣A∣∣B∣. In particular, the set of maps [n]→{0,1} is finite.

[F4]

Finite probability spaces, outcome weights, events, and event probabilities: a finite outcome set with nonnegative weights summing to 1 is a finite probability space, with every subset an event.

[F5]

The cardinality ∣A∣ of a finite set: the cardinality of a finite set is the unique von Neumann natural bijective with it.

[F6]

The cardinality ∣A∣ of a finite set: a finite set has cardinality 0 exactly when it is empty.

Proof

1.1F1F2F3construct

Let B={0,1}. The shift j↦j−1 is a bijection from the conventional index set [n]={1,…,n} to the von Neumann natural n={0,…,n−1}; for n=0 both sets are empty. Thus [n] is finite by [F1]. The set B is bijective with 2, so it is finite as well. For each I∈Sn,r define its indicator function χI:[n]→B by χI(j)=1 if j∈I and 0 otherwise. The map I↦χI is injective because equal indicator functions have equal inverse images of {1}. Its image is a subset of the finite set B[n], which is finite by [F2] and [F3]. Therefore some natural k is bijective with this image; composing that bijection with I↦χI makes Sn,r bijective with k, so [F1] makes it finite.

1.2givenF1F5F6constructalgebra

If r=0, then ∅∈Sn,r. If r>0, then {1,…,r}⊆[n] because r≤n, and the shift j↦j−1 is a bijection from {1,…,r} to the von Neumann natural r; hence this subset has cardinality r by [F1, F5], so {1,…,r}∈Sn,r. Thus Sn,r is nonempty. By [F5], its cardinality M:=∣Sn,r∣ is defined; by [F6] and nonemptiness, M≥1. Give each I∈Sn,r weight q(I)=1/M. These weights are nonnegative and their finite sum is M(1/M)=1.

2.1F4step 1.1step 1.2∎

The outcome set is finite by step 1.1 and its weights satisfy the conditions in step 1.2, so [F4] makes (Sn,r,q) a finite probability space. The argument includes n=0, r=0, and r=n.

Depends on

Used by

Dependency tree · two levels

23 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