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

1 topic

2 results

Clear filters
Project-declaredLean 4.33.0-rc1

Goursat

goursat

Project documentation

Let HH be a subgroup of G×GG \times G'. Then there exists a subgroup H0H_0 of GG, a subgroup H1H_1 of GG', and a homomorphism ϕ:GG\phi: G \to G' such that H:={(x,ϕ(x)+y):xH0,yH1}. H := \{ (x, \phi(x) + y): x \in H_0, y \in H_1 \}. In particular, H=H0H1|H| = |H_0| |H_1|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Homomorphism pfr

homomorphism_pfr

Project documentation

Let f:GGf: G \to G' be a function, and let SS denote the set S:={f(x+y)f(x)f(y):x,yG}. S := \{ f(x+y)-f(x)-f(y): x,y \in G \}. Then there exists a homomorphism ϕ:GG\phi: G \to G' such that {f(x)ϕ(x)}S10.|\{f(x) - \phi(x)\}| \leq |S|^{10}.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record