Homomorphism pfr
homomorphism_pfr
Project documentation
Let be a function, and let denote the set Then there exists a homomorphism such that
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.
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 167 research declarations. Search 10,000 more complete Mathlib declarations.
167 results
Clear filtershomomorphism_pfr
Project documentation
Let be a function, and let denote the set Then there exists a homomorphism such that
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.
I₃_eq
Plain-language statement
A symmetry identity in the -minimizer endgame. Let be independent copies of , and set , , , and . Then the conditional mutual informations agree: .
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.
InfClosed.mem_countableInfClosure_iff
Plain-language statement
If the set is inf-closed, elements of countablInfClosure can be written as countable intersections of antitone sequences of sets.
Source project: Brownian motion
Person-level attribution pending.
IsCadlag.not_accPt_largeLeftJumpSet
Plain-language statement
The set of large left jump times has no accumulation points. TODO: maybe to_dual can be extended to simplify this proof as the proof of the second part is very similar to the first part.
Source project: Brownian motion
Person-level attribution pending.
IsCompactSystem.equiv
Plain-language statement
Transport a compact system along an equivalence of types.
Source project: Brownian motion
Person-level attribution pending.
IsCompactSystem.finsetCoe
Plain-language statement
The set of Finset coercions forms a compact system.
Source project: Brownian motion
Person-level attribution pending.