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.
AdaBoost stops at a perfect round
Example
On the two-observation sample and , let the first base classifier return and . Its weighted error is , so AdaBoost stops and returns with zero training error; no coefficient is formed.
Facts & Assumptions
Given: The stated sample, labels, and classifier outputs.
Finite-sample AdaBoost.M1 with half-log coefficients: When , the algorithm halts and returns itself as a perfect classifier without forming a coefficient.
Verification
Both predictions equal their labels, so the number of training mistakes is and for the initial uniform weights.
By [F1], the algorithm stops at this round and returns ; since both predictions match, its training error is and no logarithmic coefficient is evaluated.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · one level
1 result within one dependency step 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.