Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 2,569 research declarations. Search 10,000 more complete Mathlib declarations.
2569 results
Verifier.append_coordinateWiseSpecialSound
Plain-language statement
Coordinate-wise special soundness is preserved by binary verifier append. The deterministic first-verifier output identifies the input statement of each suffix tree consumed by the second verifier's extractor.
Source project: ArkLib
Person-level attribution pending.
Verifier.append_treeSpecialSound
Plain-language statement
Generic preservation of tree-special soundness under binary verifier append.
Source project: ArkLib
Person-level attribution pending.
Verifier.id_knowledgeSoundness
Plain-language statement
The identity / trivial verifier is perfectly knowledge sound.
Source project: ArkLib
Person-level attribution pending.
Verifier.id_treeSpecialSound
Plain-language statement
n-ary base case. The identity verifier is tree-special-sound for any shape S, with input relation equal to output relation: the empty protocol !p[] has no challenge rounds, so this is the no-challenge bridge with the extractor that noncomputably picks a witness of stmtIn whenever one exists.
Source project: ArkLib
Person-level attribution pending.
Verifier.mem_of_pure_accepting
Plain-language statement
Converse of pure_accepting_of_mem: if a verifier deterministically outputs out on (stmt, tr) and its run is accepted into lang with probability one, then out ∈ lang.
Source project: ArkLib
Person-level attribution pending.
Verifier.pure_accepting_of_mem
Plain-language statement
A deterministic verifier output that lies in a language is accepted with probability one.
Source project: ArkLib
Person-level attribution pending.