Skip to main content

Source-pinned research

Research proof index

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.

All topics

Showing 445 to 450 of 2,569 results.

Project-declaredLean 4.31.0

Wf εnv implies attrs wf

Cedar.Thm.wf_εnv_implies_attrs_wf

Mathematical statement

SymEnv being well-formed implies that any attribute function is well-formed

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Demo Impl writes Only

CellRefExample.demoImpl_writesOnly

Mathematical statement

The handler writes only the cells declared by demoWrites.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Append node Ok inl

ChallengeTreeShape.append_nodeOk_inl

Mathematical statement

The append node predicate at a left-embedded index reduces to the left shape's predicate.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Append node Ok inr

ChallengeTreeShape.append_nodeOk_inr

Mathematical statement

The append node predicate at a right-embedded index reduces to the right shape's predicate.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Seq Compose succ

ChallengeTreeShape.seqCompose_succ

Mathematical statement

Successor unfolding of the sequentially-composed shape. ChallengeTreeShape.seqCompose of a family over m + 1 factors is the binary append of the head shape with the sequential composition of the tail. This is the shape-level analogue of ProtocolSpec.seqCompose_succ_eq_append, and is what lets the n-ary tree-soundness induction reduce its ste...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Chang

chang

Project documentation

Chang's lemma for the large Fourier spectrum. If ff is nonzero and η>0\eta>0, there is a subset Δ\Delta of the η\eta-large spectrum such that the entire large spectrum lies in the additive span of Δ\Delta. The theorem also gives the explicit bound ΔCeL ⁣(f12/(f22G))/η2|\Delta| \le \left\lceil C e\,\left\lceil \mathcal L\!\left(\|f\|_1^2/(\|f\|_2^2|G|)\right)\right\rceil/\eta^2\right\rceil, with the project's constant CC.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record