Theorems · Theorem · number theory
LinearRecurrence.sol_eq_of_eq_init
Deprecated since 2026-04-16Use LinearRecurrence.eq_iff_eqOn_range_order instead.
∀ {R : Type u_1} [inst : CommSemiring R] (E : LinearRecurrence R) (u v : ℕ → R),
E.IsSolution u → E.IsSolution v → (u = v ↔ Set.EqOn u v ↑(Finset.range E.order))Alias of LinearRecurrence.eq_iff_eqOn_range_order.
Two solutions are equal iff their initial conditions are equal.
- Defined in
- Mathlib.Algebra.LinearRecurrence
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommSemiring
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- CommSemiringstatement · cited by 10,911
- SetLike.coestatement · cited by 8,199
- Finset.rangestatement · cited by 1,341
- Set.EqOnstatement · cited by 603
- LinearRecurrencestatement · cited by 21
- LinearRecurrence.orderstatement · cited by 17
- LinearRecurrence.IsSolutionstatement · cited by 11
- LinearRecurrence.eq_iff_eqOn_range_orderproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.