The conceptual-discovery conjecture [ftip-00MN]
AGENTDRAFTED
Fix the lineage specification and a separately specified admissible
class \(\mathfrak V\) of contributors as in Definition [ftip-00MU]. A contributor interacts causally
from its disclosed background within charged resources, without hidden
target answers or unrevealed test inputs. Background knowledge may differ
between arms; target statements, axioms, checker and test law remain fixed.
The conjectured mechanism is making conceptual structure affordable to
discover, recognize or acquire under those endowments.
Let \(\mathcal L(B)\) contain every closed campaign admitted by
Definition [ftip-00MJ] under the chosen scalar cap and other fixed constraints.
Let \(\mathcal A_v(B)\) contain admitted contributor–recipient campaigns,
including contribution production, failed help, communication, interpretation,
validation, training and evaluation in the cap. For some specified research
family and initial lineage, conjecture thresholds
\(0\leq \tau ^-<\tau ^+\leq 1\) and a realistic cap \(B\) such that
\[
\begin {gathered}
\forall P\in \mathcal L(B),\qquad Q_{\mathrm {acq}}(P)\leq \tau ^-,\\
\exists v\in \mathfrak V,\ \exists R\in \mathcal A_v(B),\qquad
Q_{\mathrm {acq}}(R)\geq \tau ^+.
\end {gathered}
\]
This is not asserted for every task, model or budget. It allows unaided
improvements below the threshold. A discovery version uses
\(Q_{\mathrm {disc}}\); a joint claim requires the same assisted campaign
to cross both thresholds. An abstract contributor class requires a
realizable member for an unconditional existence result.
For a difficulty-indexed family and fixed \(0<\tau \leq 1\), define the
closed work threshold by
\[
B_{\mathrm {closed}}(n,\tau )=
\inf \{B:\sup _{P\in \mathcal L_n(B)}Q_{\mathrm {acq}}(P)\geq \tau \},
\qquad \inf \varnothing =+\infty .
\]
Define \(B_{\mathrm {assisted}}\) with the supremum over admissible
contributors and recipients. A stronger asymptotic conjecture asks for
positive functions \(L,U\) satisfying
\[
B_{\mathrm {closed}}(n,\tau )\geq L(n),\qquad
B_{\mathrm {assisted}}(n,\tau )\leq U(n),\qquad
\frac {U(n)}{L(n)}\longrightarrow 0.
\]
An operational crossing additionally requires an actual assisted
procedure achieving \(\tau \) at work at most \(U(n)\) and a realistic cap
\(U(n)\leq B_{\mathrm {real}}(n)<L(n)\). Suprema and infima alone need not
be attained. Both inequalities remain conjectural for the intended mechanism. The
proof-directed formulation in § [ftip-00N5] asks how developmental
experience could yield the assisted construction and the closed lower bound.