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 423 research declarations. Search 10,000 more complete Mathlib declarations.

All topics

423 results

Clear filters
Project-declaredLean 4.31.0

Q Map total fiber disjoint

Binius.BinaryBasefold.qMap_total_fiber_disjoint

Plain-language statement

The images of qMap_total_fiber over distinct quotient points y₁ ≠ y₂ are disjoint

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

To Out Codewords Count mul ϑ eq i succ

Binius.BinaryBasefold.toOutCodewordsCount_mul_ϑ_eq_i_succ

Plain-language statement

If a new oracle is committed at round i + 1 (i.e., ϑ ∣ i + 1), then the index of this new oracle (which is the count of oracles from the previous round, i) multiplied by ϑ equals the current round number i + 1. TODO: double check why this is still correct when replacing hCR with ϑ | i + 1

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

List Block subset list Hamming

BlockRelDistance.listBlock_subset_listHamming

Plain-language statement

Claim 4.19 from [ACFY24], Part 2 As a consequence of relHammingDist_le_blockRelDistance, the list of codewords within a certain block relative distance δ is a subset of the list of codewords within the same relative Hamming distance δ.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record