instruction_seed stringlengths 120 1.22k | source stringclasses 1
value | embeddings listlengths 1.02k 1.02k | mean_positive_score float64 0.78 0.86 | mean_negative_score float64 0.76 0.83 | difference_score float64 0.02 0.04 |
|---|---|---|---|---|---|
Let \( S = k[x_1, \ldots, x_n]/I \) be a finite type \( k \)-algebra and let \( k \subset K \) be a field extension. Given a prime ideal \( \mathfrak{q} \subset S \) corresponding to a point \( x \in \mathop{\mathrm{Spec}}(S) \), if \( \dim_x X = t \) and \( \dim_{x_K} X_K = t \) holds for the extension, what can you d... | automath | [
0.04403895512223244,
0.03135120868682861,
-0.05158018693327904,
-0.03255867958068848,
0.029091155156493187,
-0.01691433973610401,
0.0001827436499297619,
0.051392562687397,
0.0471997931599617,
-0.009762844070792198,
0.013068784959614277,
0.025751924142241478,
-0.03726843371987343,
0.0080527... | 0.810312 | 0.787322 | 0.022991 |
Consider the set \( G \) of all \( 2 \times 2 \) non-zero matrices of the form
\[
\begin{pmatrix} a & b \\ b & a + b \end{pmatrix}
\]
where \( a, b \in \mathbb{Z}_3 \).
1. How many distinct matrices are there in the set \( G \)?
2. Is the group \( G \) isomorphic to the group of symmetries of a square? Justify you... | automath | [
0.032439008355140686,
0.03299267962574959,
-0.052076272666454315,
-0.031949497759342194,
0.04145475849509239,
-0.020985323935747147,
-0.014694053679704666,
0.059047456830739975,
0.0320851132273674,
-0.014285479672253132,
0.0019260152475908399,
0.011052845045924187,
-0.05510237067937851,
-0... | 0.830649 | 0.810697 | 0.019952 |
Given a regular chain defined by the polynomials \( y^2 - z \) and \( yx + z \) in the polynomial ring \( R = \mathbb{R}[x,y,z] \), apply the function `NormalizeRegularChain`. Determine the equations of the normalized regular chain that results from this operation, and specify whether this new chain is strongly normali... | automath | [
0.037760503590106964,
0.026887549087405205,
-0.01991811767220497,
-0.03699944168329239,
0.03416038304567337,
-0.030074216425418854,
-0.0020108555909246206,
0.059179387986660004,
0.016620570793747902,
-0.022969944402575493,
0.006698914337903261,
0.026452692225575447,
-0.012053042650222778,
... | 0.820577 | 0.803141 | 0.017436 |
Consider a population of rabbits where the population at each generation \(k\) is represented by a random variable \(X_k\). If the population dies out, then \(X_k = 0\) for all subsequent generations \(l \geq k\). If the sequence of probabilities of the populations dying out is defined as \(P(B_k) = \mathbb{P}(X_k = 0)... | automath | [
-0.01931818388402462,
0.04149194434285164,
-0.03670549765229225,
-0.022665133699774742,
0.014428814873099327,
-0.014917743392288685,
-0.020416967570781708,
0.07010192424058914,
0.032239556312561035,
-0.008591162040829659,
-0.00398161169141531,
0.01585756614804268,
-0.02767089009284973,
0.0... | 0.816589 | 0.800276 | 0.016314 |
Given a smooth, convex function \( f: \mathbb{R}^n \to \mathbb{R} \) and a convex constraint function \( h: \mathbb{R}^n \to \mathbb{R} \), assume that for any feasible \( x \) satisfying \( h(x) \leq \tau \), there exists a scalar \( \lambda \) such that the minimization of the regularized problem \( \min_{x} \left( f... | automath | [
-0.01006411388516426,
0.042546823620796204,
-0.043507203459739685,
-0.04027235507965088,
0.05931313708424568,
0.022497301921248436,
-0.022955765947699547,
0.09334869682788849,
0.02522534690797329,
0.004807038698345423,
-0.004760709125548601,
0.02021225355565548,
-0.026216549798846245,
-0.0... | 0.813337 | 0.789813 | 0.023524 |
Let \( X_n = \frac{1}{n} \) and \( Y_n = -\frac{1}{n} \). Define the sequences \( A_n = \frac{1}{n^2} \) and \( B_n = \frac{1}{n^2} \) such that \( A_n = o_p(X_n) \) and \( B_n = o_p(Y_n) \). Does the expression
\[
o_p(X_n) + o_p(Y_n) = o_p(|X_n - Y_n|)
\]
hold true based on this example? If not, provide a specific ... | automath | [
-0.010646741837263107,
0.028978148475289345,
-0.059657104313373566,
-0.03192933276295662,
0.02580362744629383,
-0.0027285378891974688,
-0.011481585912406445,
0.08825312554836273,
0.02986896224319935,
-0.018786616623401642,
-0.0035034155007451773,
0.017988726496696472,
-0.04116212949156761,
... | 0.837565 | 0.808306 | 0.029259 |
Let \( S \) be a finite set with \( |S| = n \), where \( n \) is a positive integer, and let \( \mathscr C \) be a collection of subsets of \( S \) satisfying the circuit axioms. If \( | \mathscr C | = m \) and the largest circuit in \( \mathscr C \) has size \( k \), determine the maximum number of elements that can b... | automath | [
0.03660072013735771,
0.034199077636003494,
-0.03390876203775406,
-0.013601050712168217,
0.029444554820656776,
-0.04234853386878967,
-0.042928509414196014,
0.0396331287920475,
0.020619014278054237,
-0.006840576883405447,
0.029288630932569504,
0.04637998342514038,
-0.016544029116630554,
-0.0... | 0.827847 | 0.805056 | 0.022791 |
Given two elements \( x, y \in \mathbb{R}^n \) represented as \( x = (x_1, x_2, \ldots, x_n) \) and \( y = (y_1, y_2, \ldots, y_n) \), what is the condition under which \( x \ge y \) according to the definition of absolute real vector strict ordering? Additionally, provide a specific example in \( \mathbb{R}^2 \) where... | automath | [
0.02475574240088463,
0.023400411009788513,
-0.027300160378217697,
-0.03440185636281967,
0.009755690582096577,
-0.012347918935120106,
-0.009565569460391998,
0.06997456401586533,
0.037826962769031525,
-0.013211417943239212,
0.00030571382376365364,
0.016208000481128693,
-0.04749161750078201,
... | 0.816936 | 0.796142 | 0.020794 |
Find a simple graph \( G \) such that the automorphism group \( \mathrm{Aut}(G) \) is isomorphic to the cyclic group \( \mathbb{Z}_n \). What properties or structures must \( G \) have to ensure that it does not have reflectional symmetries while retaining rotational symmetries? | automath | [
0.032334234565496445,
0.01582060568034649,
-0.04437132924795151,
-0.03927925229072571,
0.036893296986818314,
-0.04450332373380661,
-0.007898759096860886,
0.05114080384373665,
0.01745670661330223,
-0.033032309263944626,
0.01791105791926384,
0.003914507571607828,
-0.03107936680316925,
-0.017... | 0.814708 | 0.798417 | 0.016291 |
Given three points in the Cartesian plane, \((x_1, y_1)\), \((x_2, y_2)\), and \((x_3, y_3)\), under what conditions can you uniquely determine a parabola of the form \(y = Ax^2 + Bx + C\) that passes through these points, and what is the formula to calculate the coefficients \(A\), \(B\), and \(C\) in terms of \(x_1\)... | automath | [
0.03066755272448063,
0.03982091695070267,
-0.050727054476737976,
-0.0470871739089489,
0.042750827968120575,
-0.01580347679555416,
-0.028982412070035934,
0.08137726783752441,
0.03267894685268402,
-0.010927663184702396,
0.0023660860024392605,
0.03435499966144562,
-0.03080388903617859,
-0.021... | 0.836922 | 0.816511 | 0.020411 |
Is it true that for every positive integer \( n \), the expression \( p_1 p_2 \cdots p_n + 1 \) is either prime or has a prime factor not in the set of the first \( n \) primes, where \( p_i \) denotes the \( i \)-th prime number? Specifically, can you determine whether \( p_1 p_2 \cdots p_n + 1 \) is prime, and if not... | automath | [
0.028776979073882103,
0.03264624997973442,
-0.01763794757425785,
-0.029003344476222992,
0.020061898976564407,
-0.03811996430158615,
-0.0064817736856639385,
0.06695254147052765,
0.0356842465698719,
-0.00981065072119236,
0.003247405169531703,
0.023124637082219124,
-0.03759460896253586,
-0.03... | 0.832402 | 0.812547 | 0.019855 |
Let \( x \) and \( y \) be two distinct real numbers such that \( x^n - y^n \in \mathbb{Z} \) for all natural numbers \( n \). If it is given that \( x + y \) is rational, what can be concluded about the values of \( x \) and \( y \) if \( x \) and \( y \) are expressed as fractions in their lowest terms? Specifically,... | automath | [
0.04134330153465271,
0.033558476716279984,
-0.029653647914528847,
-0.023587480187416077,
0.04467187449336052,
-0.0013848078669980168,
0.019537530839443207,
0.04823737591505051,
0.05760830640792847,
-0.02600300870835781,
-0.0033753884490579367,
0.022550618276000023,
-0.04887600615620613,
-0... | 0.83666 | 0.813524 | 0.023135 |
Consider the following optimization problem:
Minimize the function \( f(x) = x^2 + 1 \) subject to the constraints \( g_1(x) = x - 2 \leq 0 \) and \( g_2(x) = -x \leq 0 \).
1. What is the optimal value \( f^* \) of the primal problem?
2. If \( \mu_1 \) and \( \mu_2 \) are Lagrange multipliers associated with the cons... | automath | [
0.0067915236577391624,
0.02853362448513508,
-0.04367789998650551,
-0.03171383589506149,
0.04102139174938202,
-0.009575718082487583,
-0.022043203935027122,
0.07366866618394852,
0.03044048696756363,
0.010337605141103268,
-0.014028442092239857,
0.015333171002566814,
-0.032345470041036606,
-0.... | 0.822123 | 0.80457 | 0.017554 |
Given a block matrix
$$M = \begin{bmatrix} A & B \\ C & D \end{bmatrix}$$
where $$A \in \mathbb{R}^{n \times n}$$ and $$D \in \mathbb{R}^{m \times m}$$ are both invertible, and $$B \in \mathbb{R}^{n \times m}, C \in \mathbb{R}^{m \times n}$$ are arbitrary matrices, under what conditions can we assert that all the e... | automath | [
0.01792607083916664,
0.02727814018726349,
-0.03966709226369858,
-0.04317795857787132,
0.027597716078162193,
-0.009514173492789268,
-0.0010295930551365018,
0.05099709331989288,
0.04203474894165993,
-0.029569506645202637,
-0.002762534422799945,
0.014916026964783669,
-0.04022545740008354,
-0.... | 0.8092 | 0.779901 | 0.029299 |
Let \( f(x) = \frac{x}{x} \) for \( x \in \mathbb{R} \setminus \{0\} \) and \( f(0) = 1 \). Is \( f(x) \) continuous on \( \mathbb{R} \)? If so, demonstrate this by verifying the definition of continuity at each point in its domain. Additionally, does the function \( g(x) = \frac{1}{x} \) for \( x \in \mathbb{R} \setmi... | automath | [
0.009978202171623707,
0.05142814666032791,
-0.03283705189824104,
-0.036907587200403214,
0.04450318589806557,
-0.010358472354710102,
-0.006093157455325127,
0.07778167724609375,
0.03842911496758461,
-0.015194588340818882,
-0.012701168656349182,
0.013155756518244743,
-0.006817138288170099,
-0... | 0.80264 | 0.781908 | 0.020732 |
If two polynomials \( P(x) \) and \( Q(x) \) of degree \( n \) have \( n \) identical real roots, with each root having the same multiplicity, what can you conclude about the relationship between \( P(x) \) and \( Q(x) \)? Specifically, can you express \( P(x) \) in terms of \( Q(x) \) and describe the nature of any co... | automath | [
0.02195635624229908,
0.03613491356372833,
-0.046271566301584244,
-0.04173891246318817,
-0.0029886760748922825,
-0.012606652453541756,
0.0035978402011096478,
0.03605082631111145,
0.023280078545212746,
-0.009523952379822731,
0.01562421303242445,
0.024146156385540962,
-0.03209400549530983,
-0... | 0.813362 | 0.796341 | 0.017022 |
Given the tridiagonal matrix \( T_n \) defined as:
\[
T_n = \begin{pmatrix}
2+x & 1 & 0 & 0 & \cdots \\
1 & 2+x & 1 & 0 & \cdots \\
0 & 1 & 2+x & 1 & \cdots \\
0 & 0 & 1 & 2+x & \cdots \\
\vdots & \vdots & \vdots & \vdots & \ddots
\end{pmatrix}
\]
derive an upper bound on the infinity norm \( \|T_n^{-1}\| \) and cal... | automath | [
0.013918192125856876,
0.04138784483075142,
-0.0420958437025547,
-0.013826021924614906,
0.03719879686832428,
-0.01979096233844757,
-0.03266437351703644,
0.08373068273067474,
0.024964716285467148,
0.010799435898661613,
0.006975025869905949,
0.018372690305113792,
-0.030939927324652672,
-0.020... | 0.827449 | 0.808516 | 0.018932 |
Consider a planar graph \( G \) in which every face and every vertex is incident with at least three edges. Define the weight of an edge of graph \( G \) to be the sum of the degrees of its vertices. If the minimum weight of edges \( w^{**} \), which are incident with at least two triangles, is infinite, what are the p... | automath | [
0.017492001876235008,
0.029251767322421074,
-0.01725134626030922,
-0.028490105643868446,
0.03053734265267849,
-0.013801641762256622,
-0.02396433614194393,
0.04011501744389534,
0.02816920354962349,
-0.004682137165218592,
0.04094841703772545,
0.026662752032279968,
-0.013839314691722393,
-0.0... | 0.823693 | 0.798535 | 0.025159 |
Given two complex numbers \( z_1 = a + ib \) and \( z_2 = c + id \) such that \( |z_1| = |z_2| = 1 \) and \( \mathop{\text{Re}}(z_1 \overline{z_2}) = 0 \), if we define \( w_1 = a + ic \) and \( w_2 = b + id \), which of the following statements are true?
1. \( |w_1| = 1 \)
2. \( |w_2| = 1 \)
3. \( \mathop{\text{Re}}(... | automath | [
0.038781266659498215,
0.033686280250549316,
-0.03263494372367859,
-0.0453273206949234,
0.046370793133974075,
-0.01710265316069126,
0.015241827815771103,
0.07764947414398193,
0.030146460980176926,
-0.012247768230736256,
0.008649302646517754,
0.027917543426156044,
-0.026559434831142426,
-0.0... | 0.836577 | 0.814441 | 0.022136 |
Given the context of the General Sobolev Inequality, consider a bounded open set \( U \subset \mathbb{R}^n \) with a \( C^1 \) boundary, where \( n = 4 \) and \( p = 2 \). If \( u \in W^{k,p}(U) \) for \( k = 3 \), what is the minimum value of \( q \) such that the inequality
\[
\|u\|_{L^q(U)} \le C \|u\|_{W^{k,p}(U)}... | automath | [
-0.011251339688897133,
0.03462238609790802,
-0.03207211568951607,
-0.04805092141032219,
0.03938047215342522,
0.0016712755896151066,
-0.0361165814101696,
0.05846065282821655,
0.03628959879279137,
-0.01382751390337944,
0.00516599090769887,
0.03126271069049835,
-0.013242146000266075,
-0.01306... | 0.816887 | 0.794446 | 0.022441 |
Let \( x \) be an angle in degrees such that \( \sin x = \frac{\sqrt{2}}{2} \). Determine all possible values of \( x \) within the interval \( [0, 360) \) and identify which of these values corresponds to the principal value of \( \arcsin\left(\sin x\right) \). What is the principal value of \( \arcsin\left(\sin x\rig... | automath | [
0.008366037160158157,
0.0346953347325325,
-0.033313482999801636,
-0.03194548934698105,
0.017069006338715553,
-0.005051164887845516,
-0.00890830997377634,
0.0466889813542366,
0.03293832764029503,
0.005953595042228699,
0.03204980865120888,
0.025315366685390472,
-0.04267317056655884,
-0.02265... | 0.828333 | 0.812028 | 0.016305 |
Express the following Riemann sum as a definite integral and evaluate it:
$$\lim_{n \to \infty}\sum_{k=1}^{2n}\left(\frac{1}{1+\frac{2k}{n}}\right) \left(\frac{1}{n}\right)$$
Additionally, explain the steps you took to determine the limits of integration and the corresponding function in the definite integral. | automath | [
0.01916525885462761,
0.03045033849775791,
-0.040670983493328094,
-0.036739714443683624,
0.02282906509935856,
-0.010455651208758354,
-0.01580973155796528,
0.052032470703125,
0.04533257335424423,
-0.0013984700199216604,
0.022514455020427704,
0.034520965069532394,
-0.04674926772713661,
-0.011... | 0.821702 | 0.803132 | 0.01857 |
Given a finite pointed set \( X \) with base-point \( * \), we construct a cosimplicial set where in degree \( n \geq 1 \) we have \( X^n \) and in degree \( 0 \) we have \( \{* \} \). The cofaces are defined as follows:
- \( d^0(x_1, \ldots, x_n) = (*, x_1, \ldots, x_n) \)
- \( d^i(x_1, \ldots, x_n) = (x_1, \ldots, x... | automath | [
0.03486746549606323,
0.031048478558659554,
-0.042641088366508484,
-0.03515338897705078,
0.026110926643013954,
-0.014775359071791172,
-0.004845455754548311,
0.06267432123422623,
0.03767545521259308,
-0.00952985044568777,
-0.0006085841450840235,
0.02057810127735138,
-0.030308572575449944,
-0... | 0.823036 | 0.80275 | 0.020286 |
Given the planes defined by the following equations:
1. \( P_1: x - y + 2z = 7 \)
2. \( P_2: 2x + y - z = 3 \)
3. \( P_3: x + y + z = 9 \)
a) Find the coordinates of the intersection point of these three planes.
b) Determine if the planes defined by the equations below intersect. If they do, find the intersection po... | automath | [
0.05540354177355766,
0.04337353631854057,
-0.03476060926914215,
-0.05297550559043884,
0.037476763129234314,
0.013722957111895084,
-0.011161360889673233,
0.04573929309844971,
0.0313417874276638,
-0.0038499345537275076,
0.007509609684348106,
0.025058124214410782,
-0.034510303288698196,
-0.02... | 0.81054 | 0.791053 | 0.019487 |
Is it possible to define a metric of constant positive curvature on the plane \( \mathbb{R}^2 \) such that the identity map to the standard Euclidean metric is uniformly continuous? If so, give an example, and if not, provide a justification for your answer. | automath | [
-0.0029167896136641502,
0.013569651171565056,
-0.02905510738492012,
-0.04903509467840195,
0.02348567172884941,
-0.012312685139477253,
-0.02650146372616291,
0.04797369986772537,
0.02785607799887657,
-0.02497994527220726,
0.01167794968932867,
0.013292087242007256,
-0.012049427255988121,
-0.0... | 0.814469 | 0.79821 | 0.016259 |
In a game involving \( n \) distinct 3×3 Tic-tac-toe boards, Alice and Bob play alternately with Alice going first. Each board already starts with some X's, and players can only place X's in empty cells. A player loses if they make the last move in such a way that it completes a row, column, or diagonal of three X's on... | automath | [
0.0210470799356699,
0.03286762908101082,
-0.05495438724756241,
-0.014727231115102768,
0.015327093191444874,
-0.029126429930329323,
-0.03189874440431595,
0.060036852955818176,
0.029422679916024208,
-0.015187105163931847,
0.004877922125160694,
0.017870919778943062,
-0.0411488339304924,
-0.01... | 0.811167 | 0.792394 | 0.018772 |
Consider the group of upper-triangular unipotent $5 \times 5$ matrices over a field with $p$ elements, denoted as $G := U(5,p)$. Let $P$ be the subgroup of $G$ formed by matrices where the $(12)^{th}$ entry is zero, with an order of $p^9$. If $H$ and $K$ are two isomorphic but non-conjugate Abelian subgroups of maximum... | automath | [
0.018931608647108078,
0.03528089076280594,
-0.05034021660685539,
-0.030927905812859535,
0.015996115282177925,
-0.01674320176243782,
-0.010372745804488659,
0.03709076717495918,
0.025306114926934242,
0.0069541335105896,
0.01964317448437214,
0.018199574202299118,
-0.025347214192152023,
-0.003... | 0.808825 | 0.788484 | 0.020341 |
Let \( T \) be the linear operator on \( \mathbb{R}^n \) defined by
\[
T(x_1, x_2, \ldots, x_n) = (x_1 + x_2 + \cdots + x_n, x_1 + x_2 + \cdots + x_n, \ldots, x_1 + x_2 + \cdots + x_n).
\]
Determine the eigenvalues and the corresponding eigenvectors of the operator \( T \). Specifically, provide the distinct eigenva... | automath | [
0.016316963359713554,
0.04531165957450867,
-0.05066562443971634,
-0.05914929509162903,
0.06123420596122742,
-0.015874182805418968,
-0.0024689959827810526,
0.07628816366195679,
0.042336318641901016,
-0.00011037842341465876,
0.0009252239833585918,
0.022932425141334534,
-0.053512223064899445,
... | 0.804376 | 0.787886 | 0.01649 |
For given integers \( N, K, \) and \( X \), determine the minimum possible length \( L \) of a sequence of non-negative integers \( A_1, A_2, \ldots, A_L \) such that the number of pairs of indices \( (i,j) \) (where \( 1 \leq i \leq j \leq L \)) satisfying \( A_i \oplus A_j = X \) equals \( K \). If \( L \) is less th... | automath | [
0.00884841475635767,
0.020987166091799736,
-0.03147532045841217,
-0.024015313014388084,
0.02670867182314396,
-0.01624423637986183,
-0.015496179461479187,
0.05919788032770157,
0.025698717683553696,
-0.02611781656742096,
0.014490924775600433,
0.021126406267285347,
-0.02823026105761528,
0.004... | 0.834801 | 0.817687 | 0.017114 |
Let \( X \) and \( Y \) be affine schemes defined by the coordinate rings \( \mathbb{A}^1 \) over a field \( k \). Suppose the morphism \( j: X \to Y \) is injective on points. What can be concluded about the structure of the fiber product \( X \times_Y X \)? Specifically, is \( X \times_Y X \) irreducible? Justify you... | automath | [
0.017773350700736046,
0.03837641328573227,
-0.031102769076824188,
-0.012110351584851742,
0.03308878093957901,
-0.0364360436797142,
0.0010730138747021556,
0.0774482861161232,
0.05270780622959137,
0.004271512385457754,
0.0035066145937889814,
0.031039129942655563,
-0.04200040176510811,
-0.014... | 0.816623 | 0.79923 | 0.017394 |
Consider two urns: Urn \( U_1 \) contains \( 3 \) white balls and \( 2 \) red balls, while Urn \( U_2 \) contains \( 1 \) white ball. A fair coin is tossed. If it lands heads, \( 1 \) ball is drawn at random from \( U_1 \) and placed in \( U_2 \). If it lands tails, \( 2 \) balls are drawn from \( U_1 \) and placed in ... | automath | [
-0.0015141003532335162,
0.027012785896658897,
-0.046400751918554306,
-0.01796603389084339,
0.015498416498303413,
0.010448978282511234,
-0.017027463763952255,
0.06978510320186615,
0.021176185458898544,
-0.0038846787065267563,
0.020501401275396347,
0.033960532397031784,
-0.010298722423613071,
... | 0.831723 | 0.81491 | 0.016812 |
Let \( A \) be an \( m \times n \) matrix with singular values \( \sigma_1, \sigma_2, \ldots, \sigma_r \) (with \( r = \text{rank}(A) \) and \( \sigma_1 \geq \sigma_2 \geq \cdots \geq \sigma_r > 0 \)). Consider the \( r \)-th singular value \( \sigma_r \) of \( A \). If \( A \) is a \( 3 \times 2 \) matrix, what is the... | automath | [
0.010710452683269978,
0.04092178866267204,
-0.04151793569326401,
-0.03198855742812157,
0.030556967481970787,
-0.007530045695602894,
-0.027560120448470116,
0.05801849067211151,
0.019482875242829323,
-0.01648765616118908,
-0.0007785942289046943,
0.012087712064385414,
-0.03245508298277855,
-0... | 0.813498 | 0.795275 | 0.018223 |
Let \( M = \begin{bmatrix} 0 & i & -i \\ i & 0 & 1 \\ -i & 1 & 0 \end{bmatrix} \).
1) Determine if there exists a unitary matrix \( Q \) such that \( Q^H M Q \) is an upper-triangular matrix. If such a matrix exists, find \( Q \).
2) Is there a unitary matrix \( P \) such that \( (MP)^H(MP) \) is a diagonal matrix? ... | automath | [
0.025395680218935013,
0.02660166285932064,
-0.025930209085345268,
-0.03920292854309082,
0.040494415909051895,
-0.033906206488609314,
-0.01034296303987503,
0.07115542888641357,
0.025665616616606712,
0.0003178536135237664,
0.01893814280629158,
0.003706462448462844,
-0.03161938488483429,
-0.0... | 0.827437 | 0.804827 | 0.02261 |
Two cards are drawn sequentially without replacement from a standard deck of 52 cards. Let \( A \) be the event that the two cards drawn have the same value, and let \( B \) be the event that the first card drawn is an Ace. Calculate the probabilities \( P(A) \), \( P(B) \), and \( P(A \cap B) \), and determine whether... | automath | [
0.02203679271042347,
0.028008483350276947,
-0.051392193883657455,
-0.022509992122650146,
0.02728600613772869,
-0.004981494974344969,
-0.012608952820301056,
0.0636555626988411,
0.04342382401227951,
-0.01873786188662052,
0.006001530215144157,
0.014339940622448921,
-0.02281968668103218,
0.000... | 0.8253 | 0.808024 | 0.017276 |
Let \( X \) be a smooth projective curve of genus \( g \). For a given integer \( n \), determine under what conditions there exists a coherent sheaf \( \mathcal{F} \) on \( \text{Pic}^n X \) such that \( \text{Proj}\, \text{Sym}\, (\mathcal{F}) \) is isomorphic to \( \text{Sym}^n X \). Specifically, what is the relati... | automath | [
0.006709309760481119,
0.031004395335912704,
-0.04563208669424057,
-0.028222136199474335,
0.02739837020635605,
-0.006828306708484888,
-0.018205612897872925,
0.07986856251955032,
0.03946378082036972,
-0.023842906579375267,
0.00392389390617609,
0.024517307057976723,
-0.0237186960875988,
-0.01... | 0.822879 | 0.79253 | 0.030349 |
Let \( R \) be a ring with a central idempotent \( e \) such that \( e^2 = e \) and \( e \neq 0, 1 \). Consider the subring \( eRe \) of \( R \) with identity \( e \). If \( \eta: eRe \to R \) is the inclusion map, what can be concluded about the preservation of the identity under \( \eta \)? Specifically, what is the ... | automath | [
0.03540471941232681,
0.04101032391190529,
-0.015324759297072887,
-0.017682470381259918,
0.018650848418474197,
-0.03435111045837402,
0.014906225726008415,
0.0820123478770256,
0.05099811404943466,
-0.008855903521180153,
0.018876725807785988,
0.007585261948406696,
-0.0407341830432415,
-0.0336... | 0.81514 | 0.795735 | 0.019404 |
Let \( f: [0, 1] \to \mathbb{R} \) be a continuously differentiable function such that
\[
\left| \frac{f(0) + f(1)}{2} - \int_0^1 f(x) \, dx \right| \leq \alpha \max_{x \in [0,1]} |f'(x)|.
\]
What is the minimum possible value of \( \alpha \) such that the inequality holds for all continuously differentiable functio... | automath | [
0.0005296050803735852,
0.02353682555258274,
-0.05660068243741989,
-0.021633928641676903,
0.032956838607788086,
0.01757347770035267,
-0.03425236791372299,
0.07755403220653534,
0.04649525508284569,
-0.020655877888202667,
-0.0073542967438697815,
0.023078955709934235,
-0.02114044688642025,
-0.... | 0.817102 | 0.795926 | 0.021176 |
Given two Noetherian rings \( R \) and \( S \) with a ring map \( R \to S \), and an ideal \( I \subset R \), let \( M \) be a finite \( S \)-module. If the module \( M \) satisfies the condition that \( M/I^n M \) is flat over \( R/I^n \) for all \( n \geq 1 \), what can be concluded about the relationship between \( ... | automath | [
0.044811177998781204,
0.04563068225979805,
-0.039945170283317566,
-0.034495823085308075,
0.022011034190654755,
-0.023609403520822525,
-0.0032436761539429426,
0.042299434542655945,
0.037370465695858,
-0.018773727118968964,
0.005891519133001566,
0.01567433588206768,
-0.027022505179047585,
-0... | 0.812413 | 0.791568 | 0.020844 |
Given the system of equations
\[
\begin{aligned}
a_1 x + b_1 y + c_1 z &= d_1 \\
a_2 x + b_2 y + c_2 z &= d_2 \\
a_3 x + b_3 y + c_3 z &= d_3
\end{aligned}
\]
under the condition that the coefficient matrix
\[
A = \begin{pmatrix} a_1 & b_1 & c_1 \\ a_2 & b_2 & c_2 \\ a_3 & b_3 & c_3 \end{pmatrix}
\]
is singular (... | automath | [
0.020933713763952255,
0.03524709492921829,
-0.03789999336004257,
-0.03760172426700592,
0.030921997502446175,
-0.0007928382838144898,
-0.011233319528400898,
0.07553735375404358,
0.025593670085072517,
-0.014105177484452724,
-0.006759032141417265,
0.009287755005061626,
-0.03216837719082832,
-... | 0.823708 | 0.795891 | 0.027818 |
Given a set \( S \) of \( n^2 \) points in \( \mathbb{R}^2 \), we define a bijective map \( f \) from \( S \) to the set of lattice points in \( \{ 0, \ldots, n-1 \} \times \{ 0, \ldots, n-1 \} \). If the sum of the dot products \( \sum_{p \in S} p \cdot f(p) \) is maximized, can you determine the maximum possible valu... | automath | [
0.024107707664370537,
0.021031031385064125,
-0.04314505681395531,
-0.023187102749943733,
0.03347836062312126,
-0.027084650471806526,
-0.02660304307937622,
0.043835919350385666,
0.024339444935321808,
0.005775280762463808,
0.014083392918109894,
0.04193815588951111,
-0.02198881469666958,
-0.0... | 0.822509 | 0.794743 | 0.027766 |
Consider the generalized wave equation modeled on a unit circle defined by the initial condition \( u(0, x, y) = 1 - (x^2 + y^2) \) with zero initial velocity \( v(0, x, y) = 0 \). Given that \( c = 1 \) and that all boundaries have Dirichlet conditions of \( u = 0 \), what is the maximum value of \( u(t, x, y) \) at a... | automath | [
-0.014639205299317837,
0.03658487647771835,
-0.03197290748357773,
-0.026510756462812424,
0.04563934728503227,
-0.017444854602217674,
-0.04651093855500221,
0.06911277025938034,
0.02249627187848091,
-0.007417535409331322,
0.01882927305996418,
0.018216518685221672,
-0.02562619559466839,
-0.01... | 0.811611 | 0.793513 | 0.018097 |
Given two rivers represented by infinitely long, non-parallel rectangular strips with width \( w_1 \) and \( w_2 \), and points \( A \) and \( B \) positioned such that the shortest line connecting them does not intersect either river, determine the minimum distance that must be traveled between \( A \) and \( B \) whe... | automath | [
-0.0019013513810932636,
0.036399081349372864,
-0.033821407705545425,
-0.034348707646131516,
0.03441864997148514,
-0.00657845102250576,
-0.044798389077186584,
0.06094295158982277,
0.02676495537161827,
-0.004870133008807898,
0.018699031323194504,
0.01610495150089264,
-0.004556554835289717,
-... | 0.828601 | 0.806895 | 0.021706 |
Given a cubic Bezier curve that approximates a quarter-circle arc with endpoints \((0, 1)\) and \((1, 1)\), calculate the two control points of the Bezier curve. Assume that the center of the circle is at \((0.5, 0.5)\) with a radius of \(0.5\). Also, verify the maximum error between the Bezier curve and the circular a... | automath | [
0.004197884351015091,
0.04521319270133972,
-0.039559513330459595,
-0.030062304809689522,
0.023968884721398354,
-0.022461893036961555,
-0.03347647562623024,
0.04822004586458206,
0.03431573882699013,
0.0008996007964015007,
0.011938042007386684,
0.017035432159900665,
-0.0006482438766397536,
-... | 0.817952 | 0.799244 | 0.018707 |
Given a binary search tree of intervals, where each node contains an interval defined by its start and end points as well as the maximum end point of the intervals in its subtree, how can you determine the total number of intervals in the tree that completely contain a specific interval \( I = [I_s, I_e] \) in \( O(\mi... | automath | [
0.006198100280016661,
0.02416752651333809,
-0.043115176260471344,
-0.016353292390704155,
0.021120887249708176,
-0.035345952957868576,
-0.007380422670394182,
0.06430777907371521,
0.026818187907338142,
-0.009782083332538605,
0.0264362134039402,
0.01854865625500679,
-0.025388889014720917,
0.0... | 0.817961 | 0.800539 | 0.017421 |
Consider the rational function \( R(x) = \frac{P(x)}{Q(x)} \) where \( P(x) \) is a polynomial of degree \( n \) and \( Q(x) \) is given by \( Q(x) = (x - 1)^2 (x - 2)(x^2 + 1) \). Determine the unique coefficients \( A_1, A_2, A_3, M_1, \) and \( N_1 \) in the following partial fraction decomposition:
\[
\frac{P(x)}{... | automath | [
0.022396815940737724,
0.04234694689512253,
-0.037491992115974426,
-0.04177441447973251,
0.018674513325095177,
-0.02041076123714447,
-0.0005345479003153741,
0.059762727469205856,
0.031573209911584854,
0.01120987068861723,
0.005618053954094648,
0.015313543379306793,
-0.03774677589535713,
-0.... | 0.82405 | 0.807257 | 0.016793 |
Given a \(2 \times 2\) matrix \(A = \begin{bmatrix} X_1 & X_2 \\ X_3 & X_4 \end{bmatrix}\) where \(X_1, X_2, X_3\) are uniformly distributed random variables on intervals \([0, a_1], [0, a_2], [0, a_3]\) respectively, and \(X_4\) is exponentially distributed with parameter \(\lambda\), find the probability that the mat... | automath | [
0.013046544045209885,
0.028613105416297913,
-0.022964563220739365,
-0.032408200204372406,
0.05506915971636772,
-0.01308213360607624,
-0.022344736382365227,
0.09121867269277573,
0.026877623051404953,
0.0031680262181907892,
0.005558386445045471,
0.019849693402647972,
-0.023173637688159943,
-... | 0.814734 | 0.798512 | 0.016222 |
Consider a sequence of random variables \( X_n \) that converges in probability to a random variable \( X \), and another sequence \( Y_n \) converging in probability to \( Y \). If it is known that \( \mathbb{P}(X_n \to X) = 0 \) and \( \mathbb{P}(Y_n \to Y) = 0 \), can you determine under what conditions the products... | automath | [
0.000779779686126858,
0.03146636113524437,
-0.050449248403310776,
-0.015073396265506744,
0.031436193734407425,
0.005435358267277479,
-0.020196350291371346,
0.06758318841457367,
0.02569015882909298,
-0.0055386098101735115,
-0.01225957553833723,
0.013984172604978085,
-0.017912445589900017,
-... | 0.82596 | 0.798394 | 0.027566 |
Consider a circle of radius \( r \) centered on a lattice point in the \( \mathbb{Z}^2 \) integer lattice. Let \( N(r) \) be the maximum number of lattice points that can be enclosed within or lie on the contour of the circle, depending on the position of its center. Determine the value of \( r \) such that \( N(r) \) ... | automath | [
0.027532681822776794,
0.033735260367393494,
-0.028237204998731613,
-0.006944618187844753,
0.039595555514097214,
-0.006105741020292044,
-0.025963759049773216,
0.023795118555426598,
0.019241271540522575,
-0.00253800000064075,
0.0080202491953969,
0.027061711996793747,
-0.0378166027367115,
-0.... | 0.833215 | 0.805062 | 0.028153 |
Consider the series \( \sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n} \sin(n\theta) \). Determine whether the series is absolutely convergent by finding the limit
\[
\lim_{n \to \infty} \left| \frac{\frac{(-1)^{n + 2}}{n + 1} \sin((n + 1)\theta)}{\frac{(-1)^{n + 1}}{n} \sin(n\theta)} \right|.
\]
What can you conclude abou... | automath | [
0.002303812652826309,
0.049258939921855927,
-0.03716285154223442,
-0.040100399404764175,
0.020030220970511436,
-0.013041379861533642,
-0.0023862177040427923,
0.07068925350904465,
0.027644706889986992,
0.0027415931690484285,
-0.003726289141923189,
-0.013786121271550655,
-0.03963440656661987,
... | 0.818828 | 0.794578 | 0.02425 |
Let \( A \) be an \( n \times n \) matrix and let \( \Lambda \) be an \( n \times n \) diagonal matrix with \( r \) distinct diagonal entries, where there are \( k_i \) copies of each diagonal entry \( \lambda_i \). If the total number of diagonal entries is \( n \) (that is, \( k_1 + k_2 + \cdots + k_r = n \)), what i... | automath | [
0.01100197620689869,
0.031245402991771698,
-0.030516773462295532,
-0.03804438188672066,
0.0368402898311615,
0.007019325625151396,
-0.03923053666949272,
0.051029592752456665,
0.01664533093571663,
-0.008684206753969193,
-0.0013177411165088415,
0.03438607230782509,
-0.03037121705710888,
-0.02... | 0.820727 | 0.802431 | 0.018296 |
Let \( f(x) = x \left( 1 + \sqrt{x^2 + 1} \right)^3 \). Verify if Rolle's Theorem applies to \( f(x) \) on the interval \( [0, 1] \), and if it does, find the value(s) of \( c \) in \( (0, 1) \) such that \( f'(c) = 0 \). | automath | [
0.02281823754310608,
0.02888871543109417,
-0.0415518656373024,
-0.01626870408654213,
0.03921506926417351,
-0.012706384062767029,
-0.012779336422681808,
0.08741742372512817,
0.025455014780163765,
-0.0026905036065727472,
0.016758164390921593,
0.02194640226662159,
-0.03873460367321968,
-0.039... | 0.824385 | 0.803447 | 0.020938 |
Given a set \( P \) of \( m \) distinct 2D points, each represented as \( (x_i, y_i) \) for \( i = 1, 2, \ldots, m \), describe a data structure that allows for efficient querying of the \( n \) points with the largest \( y \)-coordinates among those points satisfying \( x > x_{\text{min}} \), where \( x_{\text{min}} \... | automath | [
0.01721012406051159,
0.0245799720287323,
-0.04695678874850273,
-0.02229900099337101,
0.011210614815354347,
-0.03577292338013649,
-0.030843816697597504,
0.06742136180400848,
0.04052615538239479,
-0.008334935642778873,
0.017588000744581223,
0.0292727779597044,
-0.019524751231074333,
0.008165... | 0.809687 | 0.788998 | 0.020689 |
Given the sequence of boundaries defined by the polar equations \( r = 1 + \frac{1}{n} \sin(n^2 \theta) \), which converges to the unit circle, does the corresponding spectrum of Dirichlet eigenvalues of the regions enclosed by these boundaries converge to the spectrum of the unit circle as \( n \to \infty \)? | automath | [
-0.016982082277536392,
0.024978715926408768,
-0.026249339804053307,
-0.021339524537324905,
0.03408370912075043,
-0.01806279830634594,
-0.017576754093170166,
0.0333302766084671,
0.02585015259683132,
0.0031683528795838356,
0.007425479590892792,
0.02466459386050701,
-0.03481130674481392,
-0.0... | 0.81282 | 0.790936 | 0.021884 |
Given a weakly convergent sequence \((x_n)_{n}\) in a Banach space \(X\) such that \(x_n \rightharpoonup x\), can you find a specific example of this sequence, where the new sequence \(y_n = \|x_n\| x_n\) does not converge weakly to \(\|x\| x\)? If such a counterexample exists, please provide it and demonstrate how the... | automath | [
0.015343012288212776,
0.03703201562166214,
-0.028574232012033463,
-0.038492776453495026,
0.008674416691064835,
0.0041100699454545975,
0.004302327521145344,
0.08869519829750061,
0.027710003778338432,
-0.013733439147472382,
0.012945395894348621,
0.0016697123646736145,
-0.026936102658510208,
... | 0.806177 | 0.789371 | 0.016807 |
Given the equation \( f(x)^2 = x^2 \) for all \( x \in \mathbb{R} \), find all continuous functions \( f : \mathbb{R} \to \mathbb{R} \) that satisfy this equation. Provide a justification for why these are the only possible solutions. | automath | [
0.03146402910351753,
0.0388035923242569,
-0.04104769602417946,
-0.04370243474841118,
0.04326482489705086,
-0.04190531000494957,
0.00253548682667315,
0.07425687462091446,
0.04656592383980751,
-0.022701900452375412,
0.012415681034326553,
0.00587115716189146,
-0.01759658008813858,
-0.01733086... | 0.827998 | 0.804939 | 0.023059 |
Consider a set \( X \) with \( n \) elements, and let \( f: X \to \mathbb{R} \) be a real-valued function such that the support of \( f \), given by \( \operatorname{supp} f \), consists of \( k \) elements where \( k \leq n \). If \( S \) is the subset of \( X \) defined as the coordinates on which another function \(... | automath | [
0.027865193784236908,
0.044068593531847,
-0.06847107410430908,
-0.02543770708143711,
0.02611500769853592,
-0.007818983867764473,
-0.016277877613902092,
0.049783479422330856,
0.03820473700761795,
0.002609866438433528,
0.012361252680420876,
0.0323617048561573,
-0.030135270208120346,
-0.01437... | 0.821016 | 0.797484 | 0.023532 |
For any integer \( M > 0 \), can you construct a finite sequence of pairwise relatively prime positive integers \( (n_1, n_2, \ldots, n_k) \) such that
\[
\sum_{i=1}^{k} \frac{1}{n_i} = M
\]
and there exists no subsequence \( (n_{i_j})_{j \in J} \) of \( (n_i)_{i=1}^{k} \) for which
\[
\sum_{j \in J} \frac{1}{n_{i... | automath | [
0.02467590942978859,
0.03755490854382515,
-0.019073283299803734,
-0.028853172436356544,
0.02047855406999588,
-0.0010610688477754593,
-0.006669773254543543,
0.04845871776342392,
0.03207451477646828,
-0.024239754304289818,
0.003907309845089912,
0.012004386633634567,
-0.028506694361567497,
-0... | 0.844881 | 0.820827 | 0.024054 |
Given a two-dimensional dataset consisting of points \((x_i, y_i)\) for \(i = 1, 2, \ldots, n\), describe how to construct an interpolation function \(g(t)\) such that \(g(x_i) = y_i\) for all \(i\), and determine the conditions under which this interpolation function is unique and continuous. Additionally, compute the... | automath | [
0.01062917523086071,
0.05282844230532646,
-0.031802162528038025,
-0.04937778785824776,
0.04293295368552208,
-0.02994559332728386,
-0.025578688830137253,
0.06843680888414383,
0.01423079613596201,
-0.014129272662103176,
0.03050624579191208,
0.009766618721187115,
-0.02114402875304222,
0.01932... | 0.814748 | 0.797943 | 0.016805 |
Given a locally compact group \( G \) and a closed subgroup \( H \), consider the operator
\[
P: C_c(G) \rightarrow C_c(H \backslash G), \quad Pf(Hg) = \int_H f(hg) \, d_H h.
\]
Assume \( H \) is compact. If we define \( D: C_c(H \backslash G) \rightarrow C_c(G) \) such that \( D\phi = \frac{\phi \circ \pi}{\operato... | automath | [
0.012485504150390625,
0.04244726523756981,
-0.04996883496642113,
-0.030276739969849586,
0.047506190836429596,
-0.026509204879403114,
-0.023132875561714172,
0.05451797693967819,
0.035496827214956284,
0.010680059902369976,
0.011003478430211544,
0.02874840423464775,
-0.019014114513993263,
-0.... | 0.817926 | 0.799432 | 0.018494 |
Given the sets
\( A = \{\text{parallelograms}\} \),
\( B = \{\text{rectangles}\} \), and
\( C = \{\text{squares}\} \),
derive the following:
1. Determine the union \( A \cup B \).
2. Calculate the intersection \( B \cap C \).
3. Find the intersection \( A \cap C \).
Additionally, evaluate the following statements ... | automath | [
0.05247921496629715,
0.03896355628967285,
-0.029394706711173058,
-0.02998567931354046,
0.02388681098818779,
0.012457584962248802,
-0.02107563614845276,
0.0580008365213871,
0.04682451859116554,
-0.001830688794143498,
0.016631485894322395,
0.023832762613892555,
-0.002418441465124488,
-0.0259... | 0.825999 | 0.793025 | 0.032973 |
Given three circles aligned along a straight line segment \( PQ \), where the diameter of the largest circle is \( D = PR + RQ \), if the diameters of the two smaller circles are \( d_1 \) and \( d_2 \), and \( d_1 < d_2 < D \), express the area of the largest circle in terms of \( PR \) and \( RQ \). If \( PR = 5 \) a... | automath | [
-0.0008877684595063329,
0.034032903611660004,
-0.053492221981287,
-0.059134289622306824,
0.027409134432673454,
0.003929635975509882,
-0.02182500623166561,
0.04633890092372894,
0.016249284148216248,
-0.0009940530871972442,
0.01339184120297432,
0.03479102998971939,
-0.033603619784116745,
-0.... | 0.831281 | 0.81482 | 0.016461 |
Let \( X \) be a metric space, and \( E \) be a subset of \( X \) with a limit point \( p \). If \( f: E \to \mathbb{C} \) satisfies \( \lim_{x \to p} f(x) = L \) for some \( L \in \mathbb{C} \), what is the value of \( \lim_{x \to p} 2f(x) \) when \( c = 2 \)? | automath | [
0.007095241453498602,
0.026416806504130363,
-0.04101671651005745,
-0.024073736742138863,
0.021021397784352303,
-0.014781692065298557,
-0.021756108850240707,
0.06189237907528877,
0.0415065661072731,
-0.008251192048192024,
0.006578390020877123,
0.03970186784863472,
-0.035426005721092224,
-0.... | 0.833867 | 0.813849 | 0.020018 |
Is it possible to construct a discontinuous additive function \( f \colon \mathbb{R} \to \mathbb{R} \) without assuming the existence of a Hamel basis for \( \mathbb{R} \) over \( \mathbb{Q} \)? Specifically, can you verify whether the existence of such a function implies the need for the Axiom of Choice or Zorn's Lemm... | automath | [
0.009528621099889278,
0.025630827993154526,
-0.018379030749201775,
-0.029959512874484062,
0.022101184353232384,
0.009360271506011486,
0.006227980833500624,
0.059953052550554276,
0.028157705441117287,
-0.014797517098486423,
0.016757458448410034,
0.011577091179788113,
-0.022938523441553116,
... | 0.822634 | 0.804394 | 0.01824 |
For the set \( A = (-\infty,-2) \cup \{1/n: n \in \mathbb{N}\} \cup [1, \infty) \), determine the interior points, boundary points, and closure of the set \( A \). Specifically, find the boundary of \( A \). | automath | [
0.03607623279094696,
0.031024616211652756,
-0.03163428604602814,
-0.017619768157601357,
0.017620541155338287,
-0.013013402931392193,
-0.022260982543230057,
0.038557592779397964,
0.03298981860280037,
0.010180055163800716,
0.002156453672796488,
0.02082863450050354,
-0.0331074520945549,
-0.01... | 0.826343 | 0.809404 | 0.01694 |
Given the composition table of a group:
\[
\begin{array}{c|cccc}
* & a & b & c & d \\
\hline
a & a & a & a & a \\
b & b & a & d & c \\
c & c & d & b & a \\
d & d & c & a & b \\
\end{array}
\]
Determine which pairs of elements from \{a, b, c, d\} can generate the entire group through their repeated application. Specif... | automath | [
0.03936367854475975,
0.034482795745134354,
-0.04248438775539398,
-0.03315691277384758,
0.04329893738031387,
-0.06925344467163086,
0.013744126074016094,
0.07609906047582626,
0.04527366906404495,
-0.030004147440195084,
0.00946385134011507,
0.025645582005381584,
-0.015976281836628914,
-0.0286... | 0.824242 | 0.804256 | 0.019985 |
Given a list of 50 images, where the Euclidean distance between any two images is calculated using the function ImageDistance, determine the total minimum average distance between images for a Hamiltonian path that visits each image exactly once. Assume you have computed the weighted adjacency graph based on the distan... | automath | [
-0.01392546109855175,
0.0006227139383554459,
-0.036761004477739334,
-0.0330594964325428,
0.03972156345844269,
-0.02277841605246067,
-0.031298842281103134,
0.06766961514949799,
0.03757317736744881,
-0.03287019580602646,
0.02587759867310524,
0.00488623371347785,
-0.011585543863475323,
-0.008... | 0.829859 | 0.812969 | 0.01689 |
Consider a morphism of schemes \( f : X \to S \) where \( S \) is quasi-compact and \( f \) is both quasi-separated and quasi-compact. Define \( n(X, S, f) \) to be the maximum integer \( n \) such that for every quasi-coherent sheaf \( \mathcal{F} \) on \( X \), the higher direct images \( R^p f_*\mathcal{F} = 0 \) fo... | automath | [
0.0032922851387411356,
0.04515039175748825,
-0.0473327711224556,
-0.015373345464468002,
0.027561072260141373,
-0.01785176806151867,
-0.028003081679344177,
0.06560494005680084,
0.015610997565090656,
-0.011938861571252346,
0.01874999701976776,
0.0385063998401165,
-0.01989954151213169,
-0.010... | 0.81029 | 0.792721 | 0.017569 |
Is it true that for any sequences of real numbers \( x_1, x_2, \ldots, x_n \) and \( y_1, y_2, \ldots, y_n \), the equation \( \sum_{i=1}^n x_i y_i = \sum_{i=1}^n x_i \sum_{j=1}^n y_j \) holds? If not, provide a counterexample that demonstrates the inequality. | automath | [
0.010006174445152283,
0.03014228120446205,
-0.04562825709581375,
-0.042694296687841415,
0.027760760858654976,
-0.012828170321881771,
-0.007074452470988035,
0.09233497083187103,
0.01811816729605198,
-0.0449509397149086,
-0.003456139238551259,
0.02349972352385521,
-0.05800272524356842,
-0.01... | 0.832178 | 0.809682 | 0.022496 |
Let \( U \subset \mathbb{R}^n \) be an open bounded subset with a smooth boundary, and let \( L \) be a second order linear elliptic differential operator with uniformly bounded smooth coefficients on \( U \). If \( f \in C_c^\infty(U) \), what conditions must be satisfied for the existence of a solution \( u \) to the... | automath | [
-0.020583180710673332,
0.039690446108579636,
-0.041228655725717545,
-0.048749420791864395,
0.0299680195748806,
0.017373958602547646,
-0.0311732217669487,
0.07942402362823486,
0.03606777265667915,
-0.00728466734290123,
0.015653695911169052,
0.02180163376033306,
-0.033214449882507324,
-0.012... | 0.81104 | 0.788732 | 0.022308 |
Given three groups of voters where the sizes of the groups are denoted as \( a, b, c \) such that \( 0 < |a| < |b| < |c| \), and each time two voters from different groups meet, they switch their allegiance to the third candidate, can you find a condition under which all voters can be persuaded to vote for the same can... | automath | [
0.024231726303696632,
0.025769002735614777,
-0.048071492463350296,
-0.01971660554409027,
0.025793807581067085,
-0.034676775336265564,
-0.014333222061395645,
0.04239538311958313,
0.014562074095010757,
-0.003655135165899992,
0.011755972169339657,
0.01987466588616371,
-0.021547216922044754,
-... | 0.82517 | 0.801379 | 0.023791 |
In an r-regular graph \( G \) with \( n \) vertices, suppose \( r > 2t \) and \( t \geq \frac{14}{3} \ln(2n) \). When each vertex is included in a set \( S \) independently with probability \( p = \frac{2t}{r} \), what is the minimum value of \( n \) such that the probability that \( S \) is totally \( t \)-dominating ... | automath | [
0.0073238578625023365,
0.03790248557925224,
-0.04392894729971886,
-0.02689717710018158,
0.020308755338191986,
-0.017343057319521904,
-0.02463194914162159,
0.05174494534730911,
0.020993322134017944,
-0.019937120378017426,
0.002954870695248246,
0.023180026561021805,
0.0019905664958059788,
-0... | 0.830601 | 0.803399 | 0.027202 |
Given a metric space $(X,d)$ with the metric defined by $d(x,y) := |x-y|$ for $x, y \in \mathbb{R}_+$, determine whether the subset $M = \{ x \in \mathbb{R}_+ : x < 1 \}$ is a subspace of $(\mathbb{R}_+, d)$. If it is a subspace, explicitly state the induced metric on $M$. If not, explain why it does not qualify as a s... | automath | [
0.0025260974653065205,
0.020651530474424362,
-0.030410591512918472,
-0.05118369311094284,
0.03938892483711243,
0.0030807307921350002,
-0.012503755278885365,
0.07576441764831543,
0.05010931193828583,
0.0026111553888767958,
0.013398668728768826,
0.03274401277303696,
-0.03984881937503815,
-0.... | 0.815484 | 0.793759 | 0.021726 |
In a Dedekind domain, consider an ideal \( I \) that factors as \( I = \mathfrak{p}_1^{a_1} \mathfrak{p}_2^{a_2} \cdots \mathfrak{p}_r^{a_r} \) where \( \mathfrak{p}_i \) are the prime ideals of \( R \) and \( a_i \) are their respective positive integer exponents. If we use the Chinese Remainder Theorem to find an ele... | automath | [
0.03775571286678314,
0.03721027076244354,
-0.010316424071788788,
-0.03346669301390648,
0.031427111476659775,
-0.023898744955658913,
0.0029889168217778206,
0.06508394330739975,
0.02339441329240799,
-0.014150929637253284,
0.00023604626767337322,
0.012183316983282566,
-0.026493847370147705,
-... | 0.822713 | 0.80264 | 0.020073 |
Consider the triangle with vertices at \( O(0, 0) \), \( A(5, 2) \), and \( B(3, 4) \).
1. Calculate the perimeter of triangle \( OAB \).
2. Determine the area of triangle \( OAB \) using the formula \( \frac{1}{2}(x_1y_2 - x_2y_1) \).
3. If the triangle is translated so that vertex \( O \) remains at the origin, and... | automath | [
0.03917453810572624,
0.04498857632279396,
-0.039544206112623215,
-0.020297346636652946,
0.024270495399832726,
-0.01572236232459545,
-0.028636442497372627,
0.06589765846729279,
0.034539565443992615,
0.007540795020759106,
-0.0004463195218704641,
0.026362350210547447,
-0.0176505446434021,
-0.... | 0.815991 | 0.79289 | 0.023101 |
Given a Banach space \( X \) and a compact operator \( T : M \to M \) defined on a bounded closed convex set \( M \), if there exists a constant \( M \) such that all points \( x \in X \) satisfy the condition \( \|x\| < M \) and the equation \( x = \sigma T(x) \) for some \( \sigma \in [0,1] \), what can be concluded ... | automath | [
0.013274217955768108,
0.03800247982144356,
-0.045270055532455444,
-0.032979290932416916,
0.042384807020425797,
-0.006120828911662102,
0.004440479911863804,
0.07898466289043427,
0.050149984657764435,
-0.003488953458145261,
0.004768571816384792,
0.023659542202949524,
-0.024577677249908447,
-... | 0.81829 | 0.78853 | 0.029759 |
Given a probability density function \( g: A \to \mathbb{R}_+ \) and a function \( f: A \to \mathbb{R} \), consider the expectation defined as
\[
E[f(X)] = \int_A f(x) g(x) \, dx.
\]
Suppose \( X_1, X_2, \ldots, X_N \) are independent random variables with the same pdf \( g \).
1. If \( X_i \) are uniformly distri... | automath | [
0.0168489757925272,
0.032053183764219284,
-0.05057148262858391,
-0.0350414514541626,
0.030178774148225784,
-0.0031683389097452164,
-0.03339901566505432,
0.03709658980369568,
0.038019318133592606,
-0.0010229485342279077,
0.014254634268581867,
0.010147548280656338,
-0.023850077763199806,
-0.... | 0.811497 | 0.792456 | 0.019042 |
Given three sets \( A, B, C \) within a universal set \( U \) and a procedure \( S: \mathcal{P}(U) \rightarrow \{0, 1\} \) which returns \( 1 \) if the set is empty and \( 0 \) if the set is nonempty, how can you construct a set \( Y \subseteq U \) using only the operations \( \cup \) (union) and \( \cap \) (intersecti... | automath | [
0.03282718360424042,
0.01774340309202671,
-0.03945222496986389,
-0.01187196932733059,
0.024645686149597168,
-0.021199308335781097,
-0.015549025498330593,
0.06859683245420456,
0.029344521462917328,
-0.006397887598723173,
0.013541985303163528,
0.030852816998958588,
-0.003962474875152111,
-0.... | 0.834085 | 0.801922 | 0.032162 |
Let \( f: \mathbb{R} \to \mathbb{R} \) be a function defined by \( f(x) = ax + b \) where \( a \neq 0 \) and \( b \) are constants. Let \( S = \{1, 2\} \) and \( T = \{2, 3\} \). Evaluate whether the following statement holds:
\[
f(S \cap T) = f(S) \cap f(T).
\]
If the statement is true, provide a brief justification.... | automath | [
0.03788449242711067,
0.039497632533311844,
-0.05559801310300827,
-0.02921401336789131,
0.03851412981748581,
-0.013160107657313347,
-0.014688011258840561,
0.09261522442102432,
0.020835302770137787,
0.006473193410784006,
0.003561291377991438,
0.020741840824484825,
-0.033474959433078766,
-0.0... | 0.827012 | 0.800373 | 0.02664 |
Given a curve defined by the equation \( y = f(x) \) such that \( f'(x) \) is continuous, and the point \( A(1, 2) \) lies on the curve with a tangent at \( A \) intersecting the y-axis at point \( B \) and the normal at \( A \) intersecting the x-axis at point \( C \). If the slope of the curve at point \( A \) is \( ... | automath | [
0.025978388264775276,
0.035398032516241074,
-0.04362283647060394,
-0.04638145491480827,
0.04104435816407204,
-0.03531219810247421,
-0.03610324487090111,
0.06835123151540756,
0.04431205242872238,
-0.005476406309753656,
-0.010844607837498188,
0.02101585641503334,
-0.024418694898486137,
-0.00... | 0.820688 | 0.803778 | 0.01691 |
Given a set of 10 line segments in the plane, each defined by their endpoints, construct a matrix \( M \) where \( M_{i,j} = 1 \) if segment \( i \) intersects segment \( j \) and \( 0 \) otherwise. If the intersection graph \( G \) formed from this matrix has \( k \) connected components, and if the sizes of the conne... | automath | [
0.0289158932864666,
0.030450711026787758,
-0.04404100775718689,
-0.03773181885480881,
0.04770033806562424,
-0.01353677548468113,
-0.0380282960832119,
0.04851624369621277,
0.024821870028972626,
-0.002564928261563182,
0.028190266340970993,
0.04231613501906395,
-0.026055175811052322,
-0.01034... | 0.828692 | 0.81095 | 0.017742 |
Consider the function \( f: \mathbb{R}^2 \rightarrow \mathbb{R} \) defined by \( f(x, y) = xy \). Determine whether this function is continuous at the point \( (a, b) \) if we know that \( x_n \to a \) and \( y_n \to b \) as \( n \to \infty \). Specifically, what results can be derived regarding the limit \( f(x_n, y_n... | automath | [
0.01696147583425045,
0.047371529042720795,
-0.039404306560754776,
-0.025834662839770317,
0.009106668643653393,
-0.008851567283272743,
-0.016230570152401924,
0.07984812557697296,
0.028601542115211487,
-0.019715990871191025,
-0.003244713880121708,
0.030307503417134285,
-0.017099514603614807,
... | 0.814019 | 0.784359 | 0.02966 |
Given a non-degenerate symmetric bilinear form \( g \) on an \( n \)-dimensional vector space \( V \) and an almost complex structure \( J \) such that \( J^2 = -\text{id} \) and \( J \in \text{O}(V,g) \), determine the necessary conditions on the dimension of \( V \) for there to exist a basis \( (v_i) \) such that bo... | automath | [
0.033359214663505554,
0.0297666247934103,
-0.05698356032371521,
-0.03428933396935463,
0.03558341786265373,
-0.01596808061003685,
-0.006640625651925802,
0.06388425081968307,
0.026256725192070007,
-0.006796248257160187,
0.00034424252226017416,
0.04157702624797821,
-0.025246262550354004,
-0.0... | 0.814057 | 0.79186 | 0.022197 |
Given a tree with \( n \) vertices and \( n-1 \) edges, where the vertices are numbered from \( 1 \) to \( n \), determine the maximum number of good vertices that can be formed by assigning positive integer weights to each vertex. A vertex is defined as good if its weight is equal to the sum of the weights of its neig... | automath | [
0.02284262888133526,
0.007978939451277256,
-0.03101319633424282,
-0.023290973156690598,
0.01708146370947361,
-0.030986135825514793,
-0.011983966454863548,
0.04449126869440079,
0.017259657382965088,
-0.007845751009881496,
0.0195718165487051,
0.030604086816310883,
-0.031613923609256744,
-0.0... | 0.821833 | 0.800355 | 0.021477 |
Given the trigonometric identity
$$\frac{\sin\theta - \sin^3\theta}{\cos^2\theta} = \sin\theta,$$
determine the values of $\theta$ for which this identity holds true, and verify if the identity is valid for all values of $\theta$ in the interval $[0, 2\pi]$. | automath | [
0.020288603380322456,
0.03183918818831444,
-0.05012340471148491,
-0.03331449255347252,
0.02619262970983982,
-0.030766449868679047,
0.011935911141335964,
0.0628829300403595,
0.03711753338575363,
-0.012904191389679909,
0.02883516065776348,
-0.003996716346591711,
-0.024227511137723923,
-0.005... | 0.829204 | 0.807691 | 0.021513 |
Let \( V \) and \( W \) be vector spaces such that \( \text{dim}(V) = \text{dim}(W) \), and let \( T: V \to W \) be a linear transformation. If \( \text{ker}(T) \) has dimension \( k \) and a basis for \( V \) is given by \( \{ v_1, v_2, \ldots, v_n \} \) where \( n = \text{dim}(V) \), what must be true about the linea... | automath | [
0.022397590801119804,
0.04758409783244133,
-0.05089350417256355,
-0.04751519858837128,
0.05908418074250221,
-0.0008937787497416139,
-0.0007079301285557449,
0.06308093667030334,
0.017667541280388832,
-0.012565026059746742,
-0.007785871624946594,
0.01862146519124508,
-0.015188394114375114,
-... | 0.820346 | 0.800409 | 0.019937 |
Let \( R \) be a commutative ring with unity where the ideal generated by \( \langle a, b, c \rangle = 1 \). Determine the minimal positive integer \( n \) such that \( \langle a^{15}, b^{16}, c^{17} \rangle = 1 \) holds in the ring \( R \) when \( n \) is raised to the power of \( n \). | automath | [
0.04638314247131348,
0.0414673276245594,
-0.03745123744010925,
-0.022871416062116623,
0.04717579856514931,
-0.030031226575374603,
-0.00024762682733125985,
0.06574426591396332,
0.029284251853823662,
-0.021970234811306,
0.0022546525578945875,
0.021441273391246796,
-0.026997262611985207,
-0.0... | 0.843062 | 0.813916 | 0.029146 |
Can you provide an example of a non-abelian group \( G \) such that the derived series
\[
G \supset G' \supset G^{''} \supset \ldots \supset G^{(i)} \supset \dots
\]
satisfies \( G^{(i)} \neq G^{(i+1)} \) for all \( i \in \mathbb{N} \)? Additionally, please explain why this group exhibits this property. | automath | [
0.019361119717359543,
0.019804764539003372,
-0.022173581644892693,
-0.060518745332956314,
0.020236583426594734,
-0.05922722443938255,
0.0019753361120820045,
0.049115583300590515,
0.02640024945139885,
-0.030800264328718185,
0.016062499955296516,
-0.004141106270253658,
-0.03623877093195915,
... | 0.827859 | 0.80507 | 0.022789 |
For a given non-reduced commutative ring \( R \) with \( n \) non-unit elements, determine all possible values of \( n \) such that the size of the center of the maximal graph \( \Gamma(R) \) satisfies \( |Center(\Gamma(R))| = 1 \) or \( |Center(\Gamma(R))| = n \) for \( 1 \leq n \leq 7500 \). Specifically, for \( 2 \l... | automath | [
0.04090721160173416,
0.030185360461473465,
-0.039318766444921494,
-0.02538321353495121,
0.01501521561294794,
-0.01480922382324934,
-0.013392127119004726,
0.042807843536138535,
0.03515797480940819,
-0.02497328631579876,
0.018251731991767883,
0.032107818871736526,
-0.030489418655633926,
-0.0... | 0.832499 | 0.803377 | 0.029122 |
Let \( X \) and \( Y \) be two metric spaces, each with 5 distinct points, where the distance functions \( d_X \) and \( d_Y \) are defined such that the map \( f: X \to Y \) given by \( f(x_i) = y_i \) for \( i = 1, 2, 3, 4, 5 \) preserves the distances: \( d_Y(f(x_i), f(x_j)) = d_X(x_i, x_j) \) for all pairs \( i, j ... | automath | [
0.02993428334593773,
0.02396906167268753,
-0.04619929939508438,
-0.02134042978286743,
0.02694827876985073,
-0.00976390391588211,
-0.046982623636722565,
0.05062771588563919,
0.0388822965323925,
-0.0030753754545003176,
0.005233007948845625,
0.031714584678411484,
-0.02250005304813385,
0.01413... | 0.826838 | 0.804904 | 0.021934 |
Let \(\Gamma\) be a maximal consistent set of well-formed formulas of propositional calculus. If \(\alpha\) and \(\beta\) are two distinct propositional variables such that \(\Gamma \nvdash \alpha\) and \(\Gamma \nvdash \beta\), what can be inferred about \(\Gamma \vdash \alpha \to \beta\)? Justify your answer. | automath | [
0.0248942282050848,
0.03253232687711716,
-0.03937776759266853,
-0.027264734730124474,
0.04035736620426178,
-0.029101844877004623,
-0.01097714714705944,
0.06681410223245621,
0.06115490570664406,
-0.028166992589831352,
0.010118450038135052,
0.03599252551794052,
-0.042149972170591354,
-0.0097... | 0.822374 | 0.80544 | 0.016934 |
Given a collection \( A \) of connected sets, suppose each set \( X \in A \) has another set \( Y_X \in A \) such that the intersection \( X \cap Y_X \) is non-empty. Can we guarantee that the union of all sets in \( A \) is connected? If not, provide a counterexample. | automath | [
0.038000863045454025,
0.006406525615602732,
-0.029864240437746048,
-0.015497149899601936,
0.01701756939291954,
-0.010006338357925415,
-0.012493915855884552,
0.06041250005364418,
0.03989372029900551,
-0.010995964519679546,
0.02110213413834572,
0.029448434710502625,
-0.016011089086532593,
-0... | 0.824619 | 0.797428 | 0.027191 |
Let \( S \) be a non-empty set with a binary relation \( \mathcal{R} \) that is left-total, meaning for every \( a \in S \), there exists \( b \in S \) such that \( a \mathrel{\mathcal{R}} b \). If \( s \in S \), what is the minimum number of distinct elements in an infinite sequence \( \langle x_n \rangle_{n \in \math... | automath | [
0.034731052815914154,
0.028362778946757317,
-0.04086057096719742,
-0.019184043630957603,
0.0387246310710907,
-0.02150644361972809,
-0.022033749148249626,
0.06465037167072296,
0.03445395454764366,
-0.018227918073534966,
0.008577247150242329,
0.01762392558157444,
-0.023893175646662712,
-0.00... | 0.830157 | 0.805844 | 0.024313 |
Let \( n \) be an odd positive integer greater than or equal to 3. Consider a continuous function \( f: \mathbb{S}^n \to \mathbb{S}^n \) such that \( f(x) = f(-x) \) for all \( x \in \mathbb{S}^n \). Does \( f \) necessarily have a fixed point, and if so, how can such a fixed point be explicitly identified or construct... | automath | [
0.032307710498571396,
0.019712919369339943,
-0.05081930011510849,
-0.03492860868573189,
0.022316904738545418,
-0.01380111463367939,
-0.014773677103221416,
0.0604831762611866,
0.039639201015233994,
0.001815103110857308,
0.00941107515245676,
0.0202349741011858,
-0.030801111832261086,
-0.0155... | 0.831437 | 0.808828 | 0.022609 |
Let \( (a_n) \) be a sequence of real numbers such that the series
\[
\sum_{n=1}^{\infty} \frac{a_n}{e^n}
\]
converges, where \( e \) is Euler's number. Define
\[
S_n = \sum_{k=1}^{n} a_k.
\]
Determine whether the series
\[
\sum_{n=1}^{\infty} \frac{S_n}{e^n}
\]
is convergent, and provide a justification for y... | automath | [
0.019262652844190598,
0.05070936307311058,
-0.02587292529642582,
-0.035634130239486694,
0.02568434178829193,
-0.01885984279215336,
-0.008372748270630836,
0.06198114901781082,
0.035679928958415985,
-0.00229082559235394,
0.005859707947820425,
0.014967065304517746,
-0.03492624685168266,
-0.00... | 0.829727 | 0.805946 | 0.023782 |
Let \( x \) be a real number such that \( 0 < x < 1 \) and \( y \) be a non-negative real number such that \( x + y \leq 1 \). Define the sequence \( c_n(x, y) = [nx + y] - [(n-1)x + y] \) for \( n = 0, 1, 2, \ldots \).
1. Determine the value of \( c_n(x, 0) \) for \( n = 1 \) given that \( x = \frac{1}{4} \).
2. If ... | automath | [
0.01700139231979847,
0.05034876987338066,
-0.04534979164600372,
-0.02546168677508831,
0.035862017422914505,
0.016472484916448593,
-0.026211824268102646,
0.0845879465341568,
0.028429316356778145,
-0.010256421752274036,
0.003332321997731924,
0.03349167853593826,
-0.04783022031188011,
-0.0009... | 0.842919 | 0.819557 | 0.023362 |
In the context of short exact sequences and homomorphisms, consider the following short exact sequences:
$$\begin{matrix} 0 & \to & A & \xrightarrow{\psi} & B & \xrightarrow{\phi} & C & \to & 0 \\ \ & \ & \downarrow^{\alpha} & \ & \downarrow^{\beta} \ & \ & \downarrow^{\gamma} \\ 0 & \to & A' & \xrightarrow{\psi'} & B... | automath | [
0.04387921094894409,
0.03125278651714325,
-0.016896139830350876,
-0.00772859388962388,
0.03877144306898117,
-0.04535248130559921,
-0.0011148066259920597,
0.07524040341377258,
0.04602314159274101,
-0.044109925627708435,
-0.005272138398140669,
0.007520127110183239,
-0.01262474711984396,
-0.0... | 0.813043 | 0.788965 | 0.024078 |
Let \( R \) be a Noetherian ring, and let \( M \) be a finitely generated \( R \)-module of rank \( k \). If the Fitting ideal \(\text{Fit}_k(M)\) is generated by an ideal \( I \) such that \( M_{\mathfrak{p}} \) is free of rank \( k \) for every prime ideal \( \mathfrak{p} \not\in V(I) \), what can you conclude about ... | automath | [
0.04411540552973747,
0.04510550573468208,
-0.03071177937090397,
-0.045130059123039246,
0.03194219246506691,
-0.032785624265670776,
0.0008840499795041978,
0.05492139980196953,
0.045084986835718155,
-0.02203906513750553,
-0.0002010814641835168,
0.011616702191531658,
-0.02560613490641117,
0.0... | 0.822419 | 0.803265 | 0.019153 |
Let \( a \) and \( b \) be two integers, and let \( c \) be an integer such that \( \gcd(a, b) \) divides \( c \). Can you find an explicit integer solution \( (x, y) \) to the linear diophantine equation \( ax + by = c \) using the properties of the Euclidean algorithm? Additionally, if \( a = 12 \), \( b = 8 \), and ... | automath | [
0.016373658552765846,
0.03027811460196972,
-0.02821207419037819,
-0.04137539863586426,
0.039469387382268906,
-0.022287683561444283,
0.004788003396242857,
0.05788746476173401,
0.03271814063191414,
-0.024531183764338493,
0.01886887103319168,
0.024970151484012604,
-0.019297165796160698,
-0.03... | 0.835891 | 0.816704 | 0.019187 |
Given a quadratic field \( K = \mathbb{Q}(\sqrt{d}) \), classify the prime ideals of the ring of integers \( \mathcal{O}_K \) based on the following criteria for \( d \pmod{4} \):
1. If \( d \equiv 2, 3 \pmod{4} \), describe the structure of the prime ideals over a prime \( p \) that is ramified, split, or inert in \... | automath | [
0.03424150496721268,
0.024905536323785782,
-0.02292019873857498,
-0.038285043090581894,
0.030347660183906555,
-0.04083654284477234,
0.003857751376926899,
0.06683576107025146,
0.03721243888139725,
-0.006810098886489868,
0.023096226155757904,
-0.0009518979932181537,
-0.03621862828731537,
-0.... | 0.823859 | 0.802917 | 0.020942 |
Let $\mu$ be a probability measure on a measurable space $(X, \mathcal{A})$, and consider a family of non-negative functions $\phi_k: X \rightarrow \mathbb{R}_{\geq 0}$ such that $\sup_k \phi_k(x)$ is integrable over $X$. Suppose $\{X_n\}$ is an increasing sequence of compact sets such that $X_n \subset X$ and $X_n \to... | automath | [
0.0046457331627607346,
0.023371081799268723,
-0.033772699534893036,
-0.03835052624344826,
0.02826666459441185,
0.015134017914533615,
-0.032635267823934555,
0.055373482406139374,
0.04532945528626442,
-0.009904670529067516,
-0.00018847215687856078,
0.014440678060054779,
-0.041182924062013626,
... | 0.811659 | 0.780954 | 0.030705 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.