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 219 research declarations. Search 10,000 more complete Mathlib declarations.
219 results
Clear filtersCedar.Thm.verifyDisjoint_is_ok_and_complete
Plain-language statement
Concrete version of verifyDisjoint_is_complete.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyDisjoint_is_ok_and_sound
Plain-language statement
Concrete version of verifyDisjoint_is_sound.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEquivalent_is_ok_and_complete
Plain-language statement
Concrete version of verifyEquivalent_is_complete.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEquivalent_is_ok_and_sound
Plain-language statement
Concrete version of verifyEquivalent_is_sound.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEvaluateOpt_eqv_verifyEvaluate_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyEvaluate and verifyEvaluateOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEvaluatePair_is_ok
Plain-language statement
verifyEvaluatePair succeeds on sufficiently well-formed inputs.
Source project: Cedar Specification
Person-level attribution pending.