OAI/Algebra/DepthFive/Bidegree.lean
15 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.Problem335.Bidegree.weightline 16Source documentation
The indicator weight of the derivative-variable side of a partition.
def weight (side : σ → Bool) (x : σ) : ℕ := if side x then 1 else 0
- def
OAI.Problem335.Bidegree.componentline 19Source documentation
Projection onto one degree in the selected variables.
def component (side : σ → Bool) (i : ℕ) : MvPolynomial σ R →ₗ[R] MvPolynomial σ R := … - theorem
OAI.Problem335.Bidegree.coeff_componentline 23 - theorem
OAI.Problem335.Bidegree.weight_add_complementline 29 - theorem
OAI.Problem335.Bidegree.weight_le_degreeline 39 - theorem
OAI.Problem335.Bidegree.component_isWeightedHomogeneousline 44 - theorem
OAI.Problem335.Bidegree.component_isHomogeneousline 49 - theorem
OAI.Problem335.Bidegree.component_complement_degreeline 57 - theorem
OAI.Problem335.Bidegree.component_eq_zero_of_ltline 68 - theorem
OAI.Problem335.Bidegree.sum_componentsline 83Source documentation
A homogeneous polynomial is the sum of its bidegree components.
theorem sum_components (side : σ → Bool) {p : MvPolynomial σ R} {n : ℕ} (hp : p.IsHomogeneous n) : (∑ i ∈ Finset.range (n + 1), component side i p) = p := by …Mentions: OAI.Problem335.Bidegree.component
- theorem
OAI.Problem335.Bidegree.component_sameline 104 - theorem
OAI.Problem335.Bidegree.component_neline 108 - theorem
OAI.Problem335.Bidegree.component_of_weightedHomogeneousline 113 - theorem
OAI.Problem335.Bidegree.prod_eq_sum_componentsline 121Source documentation
Distributing a finite product over all choices of bidegrees.
theorem prod_eq_sum_components {ι : Type*} [Fintype ι] [DecidableEq ι] (side : σ → Bool) (p : ι → MvPolynomial σ R) (e : ι → ℕ) (hp : ∀ a, (p a).IsHomogeneous (e a)) : (∏ a, p a) = ∑ f ∈ Fintype.piFinset (fun a => Finset.range (e a + 1)), ∏ a, component side (f a) (p a) := by …Mentions: OAI.Problem335.Bidegree.component
- theorem
OAI.Problem335.Bidegree.component_prodline 136Source documentation
Projection of the product keeps exactly degree assignments whose sum is
k.theorem component_prod {ι : Type*} [Fintype ι] [DecidableEq ι] (side : σ → Bool) (p : ι → MvPolynomial σ R) (e : ι → ℕ) (hp : ∀ a, (p a).IsHomogeneous (e a)) (k : ℕ) : component side k (∏ a, p a) = ∑ f ∈ Fintype.piFinset (fun a => Finset.range (e a + 1)), if (∑ a, f a) = k then ∏ a, component side (f a) (p a) else 0 := by …Mentions: OAI.Problem335.Bidegree.component