ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 8.1. Prove this for all m.

The current argument is sort of naïve. We make a choice of functions in Sym m H0(X, L)which we want to be independent. Thus, the argument works more naturally in the injective case because there is no choice needed. In that case, you have a bunch of functions and you want to show that (mr

) "m-wise" sums are independent. To do that in the case m = 2, this becomes a combinatorial game. After this, one coud ask about higher syzygies (viewing the Hilbert function as describ-ing the first term of the syzygy).

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.