Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Full conformal marginal coverage

Statement

Let (X,X) and (Y,Y) be measurable feature and response spaces, let m≥0, and let Zi=(Xi,Yi), 1≤i≤m+1, be random elements of the product measurable space Z=(X×Y,X⊗Y). Suppose their joint law is invariant under every coordinate permutation, as in Exchangeable random elements. Suppose a measurable, permutation-equivariant full score assignment A:Zm+1→Rm+1 is used for every augmented candidate sample, as in Full conformal prediction set. Then, for 0<α<1, its nonrandomized full conformal set satisfies P{Ym+1∈C(Xm+1)}≥1−α. If the tie-randomized set uses one U with Lebesgue probability law on [0,1], independent of σ(Z1,…,Zm+1) and shared across the candidate scan, then P{Ym+1∈CU(Xm+1)}=1−α. These are marginal guarantees over the exchangeable examples and any stated tie randomization.

Facts & Assumptions

Given: The exchangeable tuple of feature-response pairs in the stated product measurable space, the measurable permutation-equivariant full score assignment, and 0<α<1; for the randomized clause, a uniform random element independent of the example tuple.

[F1]

Exchangeability is invariance of the joint law under every coordinate permutation. Exchangeable random elements

[F2]

Measurable permutation-equivariant scores of an exchangeable tuple remain exchangeable. Permutation-equivariant scores preserve exchangeability

[F3]

The full conformal set includes a candidate exactly when its upper-rank p-value exceeds α, or in the randomized version when pU>α. Full conformal prediction set

[F4]

The upper-rank p-value is superuniform under exchangeability, and the independent tie-randomized rank is uniform. Conformal rank superuniformity under exchangeability

Proof

1.1givenF1F2

By [F1], the data tuple has an exchangeable law. The full score assignment is measurable and permutation-equivariant by hypothesis, so [F2] makes the augmented score vector exchangeable.

2.1F3F4step 1.1∎

For the true candidate Ym+1, the full set membership condition in [F3] is pm+1>α. By [F4], its probability is at least 1−α; for the randomized version, pU,m+1 is uniform and P(pU,m+1>α)=1−α.

Remarks

The theorem gives marginal coverage, not coverage conditional on the test features or on a subgroup. It does not provide a distribution-shift guarantee.

Depends on

Used by

Dependency tree · two levels

16 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