rigid_sequence_tensor_product
Given natural numbers n and m, a natural number t, a family of types G(i) with decidable equality for each i in Fin t, and a sequence S(i) in Multiset (G(i)) for each i in Fin t, the tensor product of the sequences S is the multiset of dependent functions x : (i : Fin t) → G(i) supported on the product of the supports of S(i). For each coordinate i in Fin t, x(i) is heavy if its count in S(i) equals n - 1, and light if its count in S(i) is strictly positive, at most m - 1, and not equal to n - 1. The multiplicity of a tuple x is n - 1 if every coordinate x(i) is heavy; m - 1 if exactly one coordinate is light and all other t - 1 coordinates are heavy; and 0 otherwise.
Statement
noncomputable def rigid_sequence_tensor_product (n m : ℕ) {t : ℕ} {G : Fin t → Type*} [∀ i, DecidableEq (G i)] (S : (i : Fin t) → Multiset (G i)) : Multiset ((i : Fin t) → G i)
- Defined in
- arXiv:2610.35819 Definition 4.2
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 3
- rigid_sequence_projection_is_zero_sumLet n, m, and t be natural numbers, and for each i in Fin t let S(i) be a sequence in Multiset (G(i)) where each G(i) is an additive…
- not_rigid_sequence_product_zero_sum_freeThe statement
rigid_sequence_product_zero_sum_freeis false: The statement is false for a = 1, m = 3, n = 6, t = 1, r(0) = 1 over G =… - rigid_sequence_tensor_product_mem_coordLet n and m be natural numbers, t a natural number, and for each i in Fin t let S(i) be a sequence in Multiset (G(i)). If x is an element…
Read back from the Lean
The declaration defines rigid_sequence_tensor_product, a function taking:
- two natural numbers n and m,
- an implicit natural number t,
- an implicit family of types G : Fin t → Type* with decidable equality on each G i,
- a family of multisets S : (i : Fin t) → Multiset (G i).
It produces a multiset of tuples Multiset ((i : Fin t) → G i) defined as follows:
For each tuple x in the Cartesian product of the supports of the multisets S i (i.e. x ∈ Fintype.piFinset (fun i => (S i).toFinset)):
1. A coordinate i : Fin t is "heavy" (is_h i) if the multiplicity of x i in S i equals n - 1.
2. A coordinate i : Fin t is "light" (is_l i) if 0 < (S i).count (x i), (S i).count (x i) ≤ m - 1, and x i is not heavy in S i (i.e. its count does not equal n - 1).
3. The multiplicity mult assigned to x is:
- n - 1, if every coordinate i : Fin t is heavy (0 light coordinates and t heavy coordinates);
- m - 1, if exactly one coordinate i : Fin t is light and all other t - 1 coordinates are heavy;
- 0, if two or more coordinates are light, or if any coordinate is neither heavy nor light.
The result is the multiset sum over all such x of mult copies of x (Multiset.replicate mult x).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The tensor product of sequences S_1, ..., S_t consisting of tuples with at most one light coordinate, with multiplicity n-1 if all heavy and m-1 otherwise. -/ noncomputable def rigid_sequence_tensor_product (n m : ℕ) {t : ℕ} {G : Fin t → Type*} [∀ i, DecidableEq (G i)] (S : (i : Fin t) → Multiset (G i)) : Multiset ((i : Fin t) → G i) := open Classical in (Fintype.piFinset (fun i => (S i).toFinset)).sum fun x => let is_h (i : Fin t) := (S i).count (x i) = n - 1 let is_l (i : Fin t) := 0 < (S i).count (x i) ∧ (S i).count (x i) ≤ m - 1 ∧ ¬ is_h i let mult := if (∀ i, is_h i ∨ is_l i) then let light_coords := Finset.filter is_l Finset.univ if light_coords.card = 0 then n - 1 else if light_coords.card = 1 then m - 1 else 0 else 0 Multiset.replicate mult x